On Sat, 28 Feb 2004, Richard Jones wrote:

> Of course _I_ always recommend using assoc lists instead of Hashtbl
> with OCaml nowadays.  This has the feature that it's _always_
> O(big something) so DoS attacks are never a problem :-)

Seriously, log(N) is bounded by a not too large constant in this universe, 
and hence, balanced binary trees are good enough a data structure for 
virtually all applications. It is hard to be grossly wrong by using a 
balanced tree. (But I do have a counter-example in my pocket.)

-- 
regards,               tf@cip.physik.uni-muenchen.de              (o_
 Thomas Fischbacher -  http://www.cip.physik.uni-muenchen.de/~tf  //\
(lambda (n) ((lambda (p q r) (p p q r)) (lambda (g x y)           V_/_
(if (= x 0) y (g g (- x 1) (* x y)))) n 1))                  (Debian GNU)

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