Browse thread
[Caml-list] Suggestion about balanced trees in stdlib
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
| Date: | -- (:) |
| From: | Alexander V.Voinov <avv@q...> |
| Subject: | Re: [Caml-list] Suggestion about balanced trees in stdlib |
Hi From: Stefano Zacchiroli <zack@cs.unibo.it> Subject: Re: [Caml-list] Suggestion about balanced trees in stdlib Date: Sat, 11 May 2002 00:31:10 +0200 > On Fri, May 10, 2002 at 06:59:54PM +0200, Gerd Stolpmann wrote: > > Of course, Set and Map would recur to that more special module. > > > > Balanced_tree would have the representation of Map, i.e. the elements are > > pairs of keys and attached values. To emulate Set, the value () is used. > > I don't know how the compiler treat unit values wrt optimization or > such, but using an unit in each node to emulate Set seems to me > inefficient for a module of the standard library. Is 1 (integer one) better? :-) Alexander ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners