I just discovered that stdlib's hash table size is doubled when the average list length reach some threshold, but are never sized down. So if one uses a long lived hashtable which number of elements vary with time the underlying array will only grow. I suppose it's on purpose but need help to find a reason for this.
-- Caml-list mailing list. Subscription management and archives: https://sympa-roc.inria.fr/wws/info/caml-list Beginner's list: http://groups.yahoo.com/group/ocaml_beginners Bug reports: http://caml.inria.fr/bin/caml-bugs
