Browse thread
[oliver: Re: [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: | Jon Harrop <jdh30@c...> |
| Subject: | Re: [oliver: Re: [Caml-list] Should be INSIDE STANDARD-LIB: Hashtbl.keys] |
On Saturday 24 April 2004 4:00 am, skaller wrote: > On Sat, 2004-04-24 at 06:09, Oliver Bandel wrote: > > Because there is no Hashtbl.size in the standard lib, > > which sux because O(n) is a high price to pay > for an integer the Hashtbl could keep track of > easily. I don't want the overhead of hash tables carrying around and updating an int. I was miffed when they put an O(1) criterion on length() in the STL "list" in C++... Cheers, Jon. ------------------- 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