19 Jun
2007
19 Jun
'07
7:35 p.m.
Andrew Coppin writes:
However, Haskell only has 1 type of collection: linked lists. (And only single-linked at that.)
Woah there, what about: Data.Map -- lookup tables Data.Array -- lookup tables with enumerated keys. Mutable interfaces are also available. Data.Sequence -- two-ended sequence type supporting a fast variety of operations quicker than lists Data.Graph -- graph type Data.Set -- unordered collection Data.Tree -- rose tree type And those are just the ones distributed with GHC. -- -David House, dmhouse@gmail.com