Sat Jun 21 04:31:57 PDT 2008 [EMAIL PROTECTED]
* Added new module: Data.Graph.Inductive.PatriciaTree
This is an efficient implementation of Data.Graph.Inductive.Graph.Graph
using big-endian patricia tree (i.e. Data.IntMap).
This module provides the following specialised functions to gain
more perfornance, using GHC's RULES pragma:
* insNode
* insEdge
* gmap
* nmap
* emap
A ./Data/Graph/Inductive/PatriciaTree.hs
M ./fgl.cabal -2 +3
View patch online:
http://darcs.haskell.org/packages/fgl/_darcs/patches/20080621113157-62b54-f8f83d26606571816fb98f63d8a9ade7f9dbe61c.gz
_______________________________________________
Cvs-libraries mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/cvs-libraries
