Archives of the Caml mailing list > Message from John Goerzen

Browse thread

[Caml-list] Should be INSIDE STANDARD-LIB: Hashtbl.keys

oliver@f...
- Richard Jones
- Martin Jambon
- Xavier Leroy
  - Jean-Baptiste Rouquier
    - Xavier Leroy
      - Jon Harrop
        
        Jon Harrop
        
        John Goerzen
        
        Florian Hars
      - John Goerzen
        
        John Goerzen
  - Richard Jones
    - skaller
      - Nicolas Cannasse
        
        skaller
      - Jean-Christophe Filliatre
  - Brian Hurt
    - Martin Jambon
    - Christoph Bauer
  - John Goerzen
    - John Goerzen
      - John Goerzen
        
        oliver@f...
- John Goerzen

Date:	-- (:)
From:	John Goerzen <jgoerzen@c...>
Subject:	Re: [Caml-list] Should be INSIDE STANDARD-LIB: Hashtbl.keys

On Fri, Apr 23, 2004 at 06:04:07PM +0200, Xavier Leroy wrote:
> > 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.

And a keys function need not necessarily avoid repetition anyway.

-- John

-------------------
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