jodd-core/src/main/java/jodd/util/collection/IntHashMap.java
private void rehash() {
		int oldCapacity = table.length;
		Entry[] oldMap = table;

		int newCapacity = (oldCapacity << 1) + 1;
		Entry[] newMap = new Entry[newCapacity];

		modCount++;
		threshold = (int) (newCapacity * loadFactor);
		table = newMap;

		for (int i = oldCapacity; i-- > 0; ) {
			for (Entry old = oldMap[i]; old != null; ) {
				Entry e = old;
				old = old.next;

				int index = (e.key & 0x7FFFFFFF) % newCapacity;
				e.next = newMap[index];
				newMap[index] = e;
			}
		}
	}
private void rehash() {
		int oldCapacity = table.length;
		Entry[] oldMap = table;

		int newCapacity = (oldCapacity << 1) + 1;
		Entry[] newMap = new Entry[newCapacity];

		modCount++;
		threshold = (int) (newCapacity * loadFactor);
		table = newMap;

		for (int i = oldCapacity; i-- > 0; ) {
			for (Entry old = oldMap[i]; old != null; ) {
				Entry e = old;
				old = old.next;

				int index = (e.key & 0x7FFFFFFF) % newCapacity;
				e.next = newMap[index];
				newMap[index] = e;
			}
		}
	}
private void rehash ( ) { int oldCapacity = table . length ; Entry [ ] oldMap = table ; int newCapacity = ( oldCapacity << 1 ) + 1 ; Entry [ ] newMap = new Entry [ newCapacity ] ; modCount ++ ; threshold = ( int ) ( newCapacity * loadFactor ) ; table = newMap ; for ( int i = oldCapacity ; i -- > 0 ; ) { for ( Entry old = oldMap [ i ] ; old != null ; ) { Entry e = old ; old = old . next ; int index = ( e . key & 0x7FFFFFFF ) % newCapacity ; e . next = newMap [ index ] ; newMap [ index ] = e ; } } }
Rehashes the contents of this map into a new <code>IntHashMap</code>
instance with a larger capacity. This method is called automatically when
the number of keys in this map exceeds its capacity and load factor.
Rehashes the contents of this map into a new <code > IntHashMap< / code > instance with a larger capacity . This method is called automatically when the number of keys in this map exceeds its capacity and load factor .