packages feed

comfort-graph 0.0.3.2 → 0.0.3.3

raw patch · 2 files changed

+14/−8 lines, 2 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

Makefile view
@@ -5,4 +5,4 @@ 	runhaskell Setup test comfort-graph-test --show-details=streaming  update-test:-	doctest-extract -i src/ -o test/ --executable-main=Main.hs Data.Graph.Comfort+	doctest-extract-0.1 -i src/ -o test/ --executable-main=Main.hs Data.Graph.Comfort
comfort-graph.cabal view
@@ -1,5 +1,5 @@ Name:                comfort-graph-Version:             0.0.3.2+Version:             0.0.3.3 Synopsis:            Graph structure with type parameters for nodes and edges Description:   This graph structure is based on "Data.Map"@@ -8,9 +8,12 @@   There is no need to map nodes to integer numbers.   This makes handling in applications much more comfortable,   thus the package name.-  .-  Currently the package does not contain any advanced algorithm,-  just the data structure and some manipulation functions.+  This is especially useful for applications+  where there is no simple mapping of your node identifiers to integers+  or where the set of nodes is extended or reduced frequently.+  However, this flexibility comes with some costs.+  Since the structure is based on 'Data.Map.Map's,+  for efficient computing the node type should support fast comparison.   .   The edge type can be freely chosen.   This allows great flexibility@@ -26,7 +29,7 @@   * You may define an edge type with an additional identifier     in order to support multiple edges between the same pair of nodes.   .-  * Using type functions on the node type+  * Using type functions with the node type as parameter     you may even define an edge type for nodes from a Cartesian product,     where only \"horizontal\" and \"vertical\" edges are allowed.   .@@ -34,6 +37,9 @@   The @ResistorCube@ test demonstrates non-integer node types   and the @Tree@ test demonstrates multigraphs.   .+  Currently the package does not contain any advanced algorithm,+  just the data structure and some manipulation functions.+  .   The package is plain Haskell 98.   .   Related packages:@@ -53,7 +59,7 @@   Makefile  Source-Repository this-  Tag:         0.0.3.2+  Tag:         0.0.3.3   Type:        darcs   Location:    https://hub.darcs.net/thielema/comfort-graph @@ -71,7 +77,7 @@   Build-Depends:     QuickCheck >=2.5 && <3,     containers >=0.4 && <0.7,-    transformers >=0.5 && <0.6,+    transformers >=0.5 && <0.7,     semigroups >=0.1 && <1.0,     utility-ht >=0.0.10 && <0.1,     base >=4.5 && <5