Browse thread
[Caml-list] Map efficiency?
[
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: | 2003-11-04 (09:41) |
From: | Christian Lindig <lindig@c...> |
Subject: | Re: [Caml-list] Map efficiency? |
On Mon, Nov 03, 2003 at 11:59:24PM -0800, Dustin Sallings wrote: > Also, is there a particular reason Map is so, um, inaccessible to > beginners? Hashtbl's generic interface is much more inviting than > Map's functorial-only interface, especially to those not terribly > familiar with the module system. Map depends on keys to be ordered. This in turn requires to allow for a user-defined order: assume sets as keys that are implemented by unordered lists. Different lists can represent the same set. Hence, it must be possible to provide a user-defined order that would treat those lists as equal. The functor argument of Map contains the compare() which does just that. -- Christian ------------------- 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