Re: [Haskell-cafe] Re: OCaml list sees abysmal Language Shootoutresults

8 Oct
2004
8 Oct
'04
9:30 a.m.
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. Keean.
7531
Age (days ago)
7531
Last active (days ago)
0 comments
1 participants
participants (1)
-
MR K P SCHUPKE