[Mono-dev] faster than hashtable?
tspink at gmail.com
Wed Oct 28 04:25:53 EDT 2009
2009/10/27 psantosl at codicesoftware.com <psantosl at codicesoftware.com>:
> 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?
Presumably, though, the key can span the entire range of a long? If
it's an acceptably small range, you could use an array.
More information about the Mono-devel-list