Well, the implementation note is what confusing me. Can we ignore it and implement our own IdentityHashMap instead of open-addressed + linear probed + joint key/values array?
On Mon, Apr 21, 2008 at 8:50 AM, Alexey Varlamov <[EMAIL PROTECTED]> wrote: > Implementation note: This is a simple linear-probe hash table, as > described for example in texts by Sedgewick and Knuth. The array > alternates holding keys and values. (This has better locality for > large tables than does using separate arrays.) For many JRE > implementations and operation mixes, this class will yield better > performance than HashMap (which uses chaining rather than > linear-probing)." Thanks, Aleksey.
