On Thu, 28 Aug 2003 [EMAIL PROTECTED] wrote: > By the way, I find Ldfs very useful and I think it deserves a place amongst > the libraries. I have attached a modified version of Ldfs that I often use. > It is based on FiniteMap and Set, rather than arrays, because I tend to > find that my graphs do not use integer indices. Of course, this means that > my version is less efficient than the original and does not use LazyST, but > I have never yet had any problems with its performance. Provided that > Professor Launchbury agrees, would it be possible to add it to the > libraries? If some work needs to be done to bring it into line with > existing style guides, then I am happy to do this.
FWIW, in case the generalised key version is rejected, it would certainly be nice if the version distributed with the hugs sources changed Vertex from being Char to being to being something bigger. (Not sure if larger values can be put into Char's via some unicode mechanism, but I've never managed to do it; consequently I've got a personal version of Ldfs.hs which differs only in that it has Vertex being Int.) ___cheers,_dave_________________________________________________________ www.cs.bris.ac.uk/~tweed/ | `It's no good going home to practise email:[EMAIL PROTECTED] | a Special Outdoor Song which Has To Be work tel:(0117) 954-5250 | Sung In The Snow' -- Winnie the Pooh _______________________________________________ Hugs-Bugs mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/hugs-bugs
