[Haskell-cafe] Re: OCaml list sees abysmal
MR K P SCHUPKE
k.schupke at imperial.ac.uk
Fri Oct 8 09:30:57 EDT 2004
>lists doubly-linked and circular.
Erm, this just increases overhead, and file access is linear
anyway. Singly linked is good enough. What would make a difference
is if each 'node' in the listwas allowed to be larger that '1'
item. For example reading a file with 4k buffers, would work much better
if the list were represented by 4k chunks in a liked list.
More information about the Haskell-Cafe