> Witness the linux kernel, which uses lists when lists are the most
> natrural, efficient data structure for the task at hand.

Or not.  Witness the long-lived O(n) scheduler...  And I hope you don't 
include pre-1.0 versions, which were algorithmically...shocking beyond 
belief.

And this despite the fact that based on his rants, Linus apparently 
hates all cache-trashing pointer chasing (and Lisp, and garbage 
collection etc.).

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