On Wed, 10 Oct 2007, Yitzchak Gale wrote: > I wrote: > >>> Perhaps Data.HashTable is what you are looking > >>> for then? > > Jerzy Karczmarczuk wrote: > > extract from Data.Hash what you need... > > why not try tries? > > apfelmus wrote: > > There's always Data.Map > > Those are log n. I would personally use those for > almost every application, but Mike says he wants > constant time, for a compiler.
However, I'm guessing he can use key comparison rather than value comparison - that changes things somewhat. -- [EMAIL PROTECTED] "My religion says so" explains your beliefs. But it doesn't explain why I should hold them as well, let alone be restricted by them. _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
