Andrew Bromage wrote
> On Mon, Jul 29, 2002 at 02:50:55PM -0700, Hal Daume III wrote:
>
> > I need a data structure which is a map from Ints to Doubles; the
> > distribution of the Ints is in the range say 0-2 and a map will
> > contain somewhere around 100-200 elements. I need to be able to
G'day all.
On Mon, Jul 29, 2002 at 02:50:55PM -0700, Hal Daume III wrote:
> I need a data structure which is a map from Ints to Doubles; the
> distribution of the Ints is in the range say 0-2 and a map will
> contain somewhere around 100-200 elements. I need to be able to query
> *very* qui
Not really Haskell-specific, but...
I need a data structure which is a map from Ints to Doubles; the
distribution of the Ints is in the range say 0-2 and a map will
contain somewhere around 100-200 elements. I need to be able to query
*very* quickly, insert *quite* quickly, and iterate throu
perhaps you can modify 'gperf' (the gnu perfect hash function generator) to
output haskell rather than c. i actually looked into this before, it
should not be too tough as gperf always generates a generic polynomial
and just the coefficients are different for diffirente input, it would
be pretty e
i need an associative data structure (like finitemap) which will map data
elements to Doubles. i don't need to be able to remove elements and don't
even need to insert elements once i've built the structure; all i really
care about is fast lookup. i have reasonable instances of Eq and Ord and
pr
