Re: [Ocaml-lib-devel] Sets, ordered and unordered

[Brian H. <bri...@ql...>]

On Mon, 24 Mar 2003, Nicolas Cannasse wrote:

> > 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 :)
> 

That was precisely my question.  And no, I don't have an answer to it 
either :-).

Brian