Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] How to secure an OCaml server
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2004-02-28 (20:38)
From: Thomas Fischbacher <Thomas.Fischbacher@P...>
Subject: Re: [Caml-list] How to secure an OCaml server

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,                   (o_
 Thomas Fischbacher -  //\
(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 Archives:
Bug reports: FAQ:
Beginner's list: