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 (15:54)
From: Ed L Cashin <ecashin@u...>
Subject: Re: [Caml-list] Efficiency of 'a list
Ville-Pertti Keinonen <> writes:

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

I'm not going to be dragged into a linux advocacy argument.  It
suffices to say: Lists are useful data structures, but there's no
getting around the need to know what you're doing.

Enough said.  At least this is my last contribution to this thread.

--Ed L Cashin     PGP public key:

To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: