[Mono-list] Application performance question
michal.moskal at gmail.com
Fri Jan 13 16:26:45 EST 2006
On 1/13/06, Chad Robinson <crj at lucubration.com> wrote:
> I'm confused. My understanding is that Dictionary is supposed to be much more
> efficient here because it doesn't box and unbox. But, when I run the generic
> version, it takes 4.18s to run on average, while the Hashtable version takes
> 2.54s to run. Despite the boxing, the Hashtable runs MUCH faster. This is
> running with --optimize=all (doesn't seem to change anything either way).
Using custom IEqualityComparer helps a bit (see attached testecase).
Otherwise it is probably Dictionary implementation that is not as
optimized as the Hashtable.
-------------- next part --------------
A non-text attachment was scrubbed...
Size: 2738 bytes
Desc: not available
Url : http://lists.ximian.com/pipermail/mono-list/attachments/20060113/3ae93d32/foo.obj
More information about the Mono-list