/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*
* THIS FILE WAS MODIFIED BY SUN MICROSYSTEMS, INC.
*/
}
}
protected int _index;
// Total character count of Map
protected int _totalCharacterCount;
super(initialCapacity, loadFactor);
}
this(initialCapacity, DEFAULT_LOAD_FACTOR);
}
public StringIntMap() {
}
public void clear() {
}
_size = 0;
_totalCharacterCount = 0;
}
if (!(readOnlyMap instanceof StringIntMap)) {
}
}
if (_readOnlyMap != null) {
if (clear) {
clear();
}
} else {
_readOnlyMapSize = 0;
}
}
public final int getNextIndex() {
return _index++;
}
public final int getIndex() {
return _index;
}
if (_readOnlyMap != null) {
if (index != -1) {
return index;
}
}
return e._value;
}
}
return NOT_PRESENT;
}
}
return _lastEntry._value;
}
public final int getTotalCharacterCount() {
return _totalCharacterCount;
}
if (_readOnlyMap != null) {
if (i != -1) {
return i;
}
}
_lastEntry = e;
return e._value;
}
}
return NOT_PRESENT;
}
if (_size++ >= _threshold) {
}
}
if (oldCapacity == MAXIMUM_CAPACITY) {
return;
}
}
if (e != null) {
do {
newTable[i] = e;
e = next;
} while (e != null);
}
}
}
return x == y || x.equals(y);
}
}