public Entry getOrPut(Object key1, Object key2, Object key3) { int h = hash (31*(31*key1.hashCode()+key2.hashCode())+key3.hashCode()); final int index = h & (table.length - 1); ComplexKeyHashMap.Entry e = table [index]; for (; e != null; e = e.next) if (e.hash == h && checkEquals((Entry) e, key1, key2, key3)) return (Entry) e; Entry entry = createEntry (); entry.next = table [index]; entry.hash = h; entry.key1 = key1; entry.key2 = key2; entry.key3 = key3; table [index] = entry; if ( ++size == threshold ) resize(2*table.length); return entry; }
public Entry getOrPut(Object key1, Object key2, Object key3) { int h = hash (31*(31*key1.hashCode()+key2.hashCode())+key3.hashCode()); final int index = h & (table.length - 1); ComplexKeyHashMap.Entry e = table [index]; for (; e != null; e = e.next) if (e.hash == h && checkEquals((Entry) e, key1, key2, key3)) return (Entry) e; Entry entry = createEntry (); entry.next = table [index]; entry.hash = h; entry.key1 = key1; entry.key2 = key2; entry.key3 = key3; table [index] = entry; if ( ++size == threshold ) resize(2*table.length); return entry; }
public Entry getOrPut(Object key1, Object key2, Object key3) { int h = hash (31*(31*key1.hashCode()+key2.hashCode())+key3.hashCode()); final int index = h & (table.length - 1); ComplexKeyHashMap.Entry e = table [index]; for (; e != null; e = e.next) if (e.hash == h && checkEquals((Entry) e, key1, key2, key3)) return (Entry) e; Entry entry = createEntry (); entry.next = table [index]; entry.hash = h; entry.key1 = key1; entry.key2 = key2; entry.key3 = key3; table [index] = entry; if ( ++size == threshold ) resize(2*table.length); return entry; }
public Entry getOrPut(Object key1, Object key2, Object key3) { int h = hash (31*(31*key1.hashCode()+key2.hashCode())+key3.hashCode()); final int index = h & (table.length - 1); ComplexKeyHashMap.Entry e = table [index]; for (; e != null; e = e.next) if (e.hash == h && checkEquals((Entry) e, key1, key2, key3)) return (Entry) e; Entry entry = createEntry (); entry.next = table [index]; entry.hash = h; entry.key1 = key1; entry.key2 = key2; entry.key3 = key3; table [index] = entry; if ( ++size == threshold ) resize(2*table.length); return entry; }