Browse thread
[Caml-list] Efficiency of 'a list
-
Eray Ozkural
- Mattias Waldau
- Lauri Alanko
[
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: | Oleg Trott <oleg_trott@c...> |
| Subject: | [Caml-list] Data Structure Libraries (was: Two types of efficiency) |
On Monday 05 May 2003 12:38 pm, Diego Olivier Fernandez Pons wrote: > The Map and the Set modules of the standard library in Caml are a good > starting point : they may not be as complete as you would have liked, > of course but they will improve with time. > > Keep in mind that designing a data structure library is a hard work : > Chris Okasaki, Ralf Hinze and a lot of others have failed ; In what sense? Perhaps you have a very inclusive definition of failure :) > Baire has > not even been released after 1 year of work, I understand that you are not designing new algorithms, but coding up ones that are well-known. If so, what is the limiting factor in your work: trying to anticipate what features users might and might not need? Regards Oleg ------------------- 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