> Actually, what I'd like to see is the stdlib Set to give up pretending to
> maybe be unordered, and declare itself ordered. And to implement a true
> unordered set built on hash tables (sometimes, checking for membership in
> O(1) instead of O(log n) is usefull). With both modules inheriting from a
> common Set module.
[..]
This starts a good thread about relationship of datastructures, and functor
usage.
Actually we can say that a data structure can be defined by :
- its add/remove/find complexities
- its order properties ( no-order, order on keys, order on items )
- the way you're using it ( mainly : with or without keys )
I'm not realy sure if we should simply follow the current ocaml library
style, or build a whole new architecture, but perhaps that was already your
question, Brian :)
Nicolas Cannasse
-------------------------------------------------------
This SF.net email is sponsored by:Crypto Challenge is now open!
Get cracking and register here for some mind boggling fun and
the chance of winning an Apple iPod:
http://ads.sourceforge.net/cgi-bin/redirect.pl?thaw0031en
|
