/** * Rehashes the content of the table into a bigger table. * This method is called automatically when the hashtable's * size exceeds the threshold. */ private void rehash() { IntegerCache newHashtable = new IntegerCache(this.keyTable.length * 2); for (int i = this.keyTable.length; --i >= 0;) { int key = this.keyTable[i]; int value = this.valueTable[i]; if ((key != 0) || ((key == 0) && (value != 0))) { newHashtable.put(key, value); } } this.keyTable = newHashtable.keyTable; this.valueTable = newHashtable.valueTable; this.threshold = newHashtable.threshold; } /**
/** * Rehashes the content of the table into a bigger table. * This method is called automatically when the hashtable's * size exceeds the threshold. */ private void rehash() { IntegerCache newHashtable = new IntegerCache(this.keyTable.length * 2); for (int i = this.keyTable.length; --i >= 0;) { int key = this.keyTable[i]; int value = this.valueTable[i]; if ((key != 0) || ((key == 0) && (value != 0))) { newHashtable.put(key, value); } } this.keyTable = newHashtable.keyTable; this.valueTable = newHashtable.valueTable; this.threshold = newHashtable.threshold; } /**
/** * Rehashes the content of the table into a bigger table. * This method is called automatically when the hashtable's * size exceeds the threshold. */ private void rehash() { IntegerCache newHashtable = new IntegerCache(this.keyTable.length * 2); for (int i = this.keyTable.length; --i >= 0;) { int key = this.keyTable[i]; int value = this.valueTable[i]; if ((key != 0) || ((key == 0) && (value != 0))) { newHashtable.put(key, value); } } this.keyTable = newHashtable.keyTable; this.valueTable = newHashtable.valueTable; this.threshold = newHashtable.threshold; } /**
/** * Rehashes the content of the table into a bigger table. * This method is called automatically when the hashtable's * size exceeds the threshold. */ private void rehash() { IntegerCache newHashtable = new IntegerCache(this.keyTable.length * 2); for (int i = this.keyTable.length; --i >= 0;) { int key = this.keyTable[i]; int value = this.valueTable[i]; if ((key != 0) || ((key == 0) && (value != 0))) { newHashtable.put(key, value); } } this.keyTable = newHashtable.keyTable; this.valueTable = newHashtable.valueTable; this.threshold = newHashtable.threshold; } /**
/** * Rehashes the content of the table into a bigger table. * This method is called automatically when the hashtable's * size exceeds the threshold. */ private void rehash() { IntegerCache newHashtable = new IntegerCache(this.keyTable.length * 2); for (int i = this.keyTable.length; --i >= 0;) { int key = this.keyTable[i]; int value = this.valueTable[i]; if ((key != 0) || ((key == 0) && (value != 0))) { newHashtable.put(key, value); } } this.keyTable = newHashtable.keyTable; this.valueTable = newHashtable.valueTable; this.threshold = newHashtable.threshold; } /**
/** * Rehashes the content of the table into a bigger table. * This method is called automatically when the hashtable's * size exceeds the threshold. */ private void rehash() { IntegerCache newHashtable = new IntegerCache(this.keyTable.length * 2); for (int i = this.keyTable.length; --i >= 0;) { int key = this.keyTable[i]; int value = this.valueTable[i]; if ((key != 0) || ((key == 0) && (value != 0))) { newHashtable.put(key, value); } } this.keyTable = newHashtable.keyTable; this.valueTable = newHashtable.valueTable; this.threshold = newHashtable.threshold; } /**
/** * Rehashes the content of the table into a bigger table. * This method is called automatically when the hashtable's * size exceeds the threshold. */ private void rehash() { IntegerCache newHashtable = new IntegerCache(this.keyTable.length * 2); for (int i = this.keyTable.length; --i >= 0;) { int key = this.keyTable[i]; int value = this.valueTable[i]; if ((key != 0) || ((key == 0) && (value != 0))) { newHashtable.put(key, value); } } this.keyTable = newHashtable.keyTable; this.valueTable = newHashtable.valueTable; this.threshold = newHashtable.threshold; } /**
/** * Rehashes the content of the table into a bigger table. * This method is called automatically when the hashtable's * size exceeds the threshold. */ private void rehash() { IntegerCache newHashtable = new IntegerCache(this.keyTable.length * 2); for (int i = this.keyTable.length; --i >= 0;) { int key = this.keyTable[i]; int value = this.valueTable[i]; if ((key != 0) || ((key == 0) && (value != 0))) { newHashtable.put(key, value); } } this.keyTable = newHashtable.keyTable; this.valueTable = newHashtable.valueTable; this.threshold = newHashtable.threshold; } /**
/** * Rehashes the content of the table into a bigger table. * This method is called automatically when the hashtable's * size exceeds the threshold. */ private void rehash() { IntegerCache newHashtable = new IntegerCache(this.keyTable.length * 2); for (int i = this.keyTable.length; --i >= 0;) { int key = this.keyTable[i]; int value = this.valueTable[i]; if ((key != 0) || ((key == 0) && (value != 0))) { newHashtable.put(key, value); } } this.keyTable = newHashtable.keyTable; this.valueTable = newHashtable.valueTable; this.threshold = newHashtable.threshold; } /**
/** * Rehashes the content of the table into a bigger table. * This method is called automatically when the hashtable's * size exceeds the threshold. */ private void rehash() { IntegerCache newHashtable = new IntegerCache(this.keyTable.length * 2); for (int i = this.keyTable.length; --i >= 0;) { int key = this.keyTable[i]; int value = this.valueTable[i]; if ((key != 0) || ((key == 0) && (value != 0))) { newHashtable.put(key, value); } } this.keyTable = newHashtable.keyTable; this.valueTable = newHashtable.valueTable; this.threshold = newHashtable.threshold; } /**
/** * Rehashes the content of the table into a bigger table. * This method is called automatically when the hashtable's * size exceeds the threshold. */ private void rehash() { IntegerCache newHashtable = new IntegerCache(this.keyTable.length * 2); for (int i = this.keyTable.length; --i >= 0;) { int key = this.keyTable[i]; int value = this.valueTable[i]; if ((key != 0) || ((key == 0) && (value != 0))) { newHashtable.put(key, value); } } this.keyTable = newHashtable.keyTable; this.valueTable = newHashtable.valueTable; this.threshold = newHashtable.threshold; } /**
this.intCache = new IntegerCache(INT_INITIAL_SIZE);
this.intCache = new IntegerCache(INT_INITIAL_SIZE);
this.intCache = new IntegerCache(INT_INITIAL_SIZE);
this.intCache = new IntegerCache(INT_INITIAL_SIZE);
this.intCache = new IntegerCache(INT_INITIAL_SIZE);
this.intCache = new IntegerCache(INT_INITIAL_SIZE);
this.intCache = new IntegerCache(INT_INITIAL_SIZE);
this.intCache = new IntegerCache(INT_INITIAL_SIZE);
this.intCache = new IntegerCache(INT_INITIAL_SIZE);