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-05 (01:09) |
From: | Nicolas Cannasse <warplayer@f...> |
Subject: | Re: [Caml-list] Map efficiency? |
> > 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. > > The order function could just as easily be passed as a parameter to all > functions working on the map. There is no reason not to have a > polymorphic version of the Map module in the standard library. Am I > wrong in believing that someone out there wrote such a module already? > > Alex There is one : module PMap , which is part of the ExtLib CVS : http://sourceforge.net/projects/ocaml-lib Since it's been added recently, there is no mli yet. Nicolas Cannasse ------------------- 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