[Mono-dev] faster than hashtable?
alan.mcgovern at gmail.com
Wed Oct 28 11:07:41 EDT 2009
Really what you need to do is benchmark all of the different options using
your expected workload. It's near useless us telling you X is faster or Y is
better without knowing the workload involved.
On Wed, Oct 28, 2009 at 2:40 PM, pablosantosluac at terra.es <
pablosantosluac at terra.es> wrote:
> Excellent. Is there a wrapper for C#? Is it worth?
> Felipe Lessa wrote:
> > On Tue, Oct 27, 2009 at 11:58:31PM +0100, psantosl at codicesoftware.comwrote:
> >> If you need to store key/value pairs, where the key will be ALWAYS a
> >> unique long (no collisions), is there anything better than a Hashtable?
> > There are always Judy arrays, see http://judy.sourceforge.net/.
> > --
> > Felipe.
> > _______________________________________________
> > Mono-devel-list mailing list
> > Mono-devel-list at lists.ximian.com
> > http://lists.ximian.com/mailman/listinfo/mono-devel-list
> Mono-devel-list mailing list
> Mono-devel-list at lists.ximian.com
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Mono-devel-list