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] Efficiency of 'a list
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2003-05-04 (08:07)
From: Ville-Pertti Keinonen <will@e...>
Subject: Re: [Caml-list] Efficiency of 'a list
> 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 

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 Archives:
Bug reports: FAQ:
Beginner's list: