Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] Should be INSIDE STANDARD-LIB: Hashtbl.keys
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ 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 Archives:
Bug reports: FAQ:
Beginner's list: