How bad is the lookup compared to normal?
On Sat, Aug 8, 2009 at 9:02 PM, Thomas DuBuisson<thomas.dubuis...@gmail.com> wrote: > On Sat, Aug 8, 2009 at 5:30 PM, Felipe Lessa<felipe.le...@gmail.com> wrote: >> On Sat, Aug 08, 2009 at 04:14:15PM -0700, Thomas DuBuisson wrote: >>> There exists a small but measurable performance hit for at least one >>> test case (using Int as keys, obviously). Perhaps the bias would be >>> the other way if we were comparing EnumMap to an IntMap wrapped with >>> to/from Enum. >> >> Perhaps some SPECIALIZE pragmas would help here. >> > > Actually I tried that by adding SPECIALIZE to insert, insertN and > lookup. it seemed to make the insert benchmark competitive but not > lookup. > > Thomas > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe@haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe > _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
