Browse thread
[Caml-list] Should be INSIDE STANDARD-LIB: Hashtbl.keys
[
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: | Xavier Leroy <xavier.leroy@i...> |
| Subject: | Re: [Caml-list] Should be INSIDE STANDARD-LIB: Hashtbl.keys |
> Perhaps I'm all wrong, but when I have to get rid of repetitions in a > list, I first sort it in O(n log n), then remove the repetitions in O(n). > Jean-Baptiste. OK, fair enough :-) The point I was trying to make (not very well, I agree) is that "list without repetition" or "sorted list without repetition" is often not the best data structure for the job. - Xavier Leroy ------------------- 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