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: | Vitaly Lugovsky <vsl@o...> |
| Subject: | RE: [Caml-list] Efficiency of 'a list |
On Sat, 3 May 2003, Mattias Waldau wrote: > I think more conventional languages like Java and Ocaml could > learn from > this and introduce more advanced data structures as > primitives, for > example replace lists by sets, and let arrays take arbitrary > data types > as index. This would automatically improve the O-behavior of > the > programs, ie. make them more scalable. OCaml already have Hashtbl implementation. ------------------- 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