diff options
author | Damien Doligez <damien.doligez-inria.fr> | 2000-01-13 19:04:16 +0000 |
---|---|---|
committer | Damien Doligez <damien.doligez-inria.fr> | 2000-01-13 19:04:16 +0000 |
commit | a3ee3353a62353be9836e3a6a04af1f20e686982 (patch) | |
tree | 78f393a96cc316de3298c870810499cca84b739e | |
parent | 350db08843cc2cd6abcf0ca314c02606c7fa4990 (diff) |
amelioration doc create
git-svn-id: http://caml.inria.fr/svn/ocaml/trunk@2759 f963ae5c-01c2-4b8c-9fe0-0dff7051ff02
-rw-r--r-- | stdlib/hashtbl.mli | 7 |
1 files changed, 4 insertions, 3 deletions
diff --git a/stdlib/hashtbl.mli b/stdlib/hashtbl.mli index c89a8b12a..ad8e6b9e1 100644 --- a/stdlib/hashtbl.mli +++ b/stdlib/hashtbl.mli @@ -23,9 +23,10 @@ type ('a, 'b) t val create : int -> ('a,'b) t (* [Hashtbl.create n] creates a new, empty hash table, with - initial size [n]. The table grows as needed, so [n] is - just an initial guess. Better results are said to be - achieved when [n] is a prime number. *) + initial size [n]. For best results, [n] should be on the + order of the expected number of elements that will be in + the table. The table grows as needed, so [n] is just an + initial guess. *) val clear : ('a, 'b) t -> unit (* Empty a hash table. *) |