412 lines
11 KiB
Java
412 lines
11 KiB
Java
package gnu.trove;
|
|
|
|
import java.io.IOException;
|
|
import java.io.ObjectInputStream;
|
|
import java.io.ObjectOutputStream;
|
|
|
|
/* loaded from: classes2.dex */
|
|
public class TIntByteHashMap extends TIntHash {
|
|
protected transient byte[] _values;
|
|
|
|
private static final class EqProcedure implements TIntByteProcedure {
|
|
private final TIntByteHashMap a;
|
|
|
|
EqProcedure(TIntByteHashMap tIntByteHashMap) {
|
|
this.a = tIntByteHashMap;
|
|
}
|
|
|
|
private static boolean a(byte b, byte b2) {
|
|
return b == b2;
|
|
}
|
|
|
|
@Override // gnu.trove.TIntByteProcedure
|
|
public final boolean a(int i, byte b) {
|
|
return this.a.index(i) >= 0 && a(b, this.a.get(i));
|
|
}
|
|
}
|
|
|
|
private final class HashProcedure implements TIntByteProcedure {
|
|
private int a;
|
|
|
|
HashProcedure() {
|
|
}
|
|
|
|
public int a() {
|
|
return this.a;
|
|
}
|
|
|
|
@Override // gnu.trove.TIntByteProcedure
|
|
public final boolean a(int i, byte b) {
|
|
int i2 = this.a;
|
|
int computeHashCode = TIntByteHashMap.this._hashingStrategy.computeHashCode(i);
|
|
HashFunctions.a((int) b);
|
|
this.a = i2 + (computeHashCode ^ b);
|
|
return true;
|
|
}
|
|
}
|
|
|
|
public TIntByteHashMap() {
|
|
}
|
|
|
|
private void readObject(ObjectInputStream objectInputStream) throws IOException, ClassNotFoundException {
|
|
objectInputStream.defaultReadObject();
|
|
int readInt = objectInputStream.readInt();
|
|
setUp(readInt);
|
|
while (true) {
|
|
int i = readInt - 1;
|
|
if (readInt <= 0) {
|
|
return;
|
|
}
|
|
put(objectInputStream.readInt(), objectInputStream.readByte());
|
|
readInt = i;
|
|
}
|
|
}
|
|
|
|
private void writeObject(ObjectOutputStream objectOutputStream) throws IOException {
|
|
objectOutputStream.defaultWriteObject();
|
|
objectOutputStream.writeInt(this._size);
|
|
SerializationProcedure serializationProcedure = new SerializationProcedure(objectOutputStream);
|
|
if (!forEachEntry(serializationProcedure)) {
|
|
throw serializationProcedure.b;
|
|
}
|
|
}
|
|
|
|
public boolean adjustValue(int i, byte b) {
|
|
int index = index(i);
|
|
if (index < 0) {
|
|
return false;
|
|
}
|
|
byte[] bArr = this._values;
|
|
bArr[index] = (byte) (bArr[index] + b);
|
|
return true;
|
|
}
|
|
|
|
@Override // gnu.trove.THash
|
|
public void clear() {
|
|
super.clear();
|
|
int[] iArr = this._set;
|
|
byte[] bArr = this._values;
|
|
if (bArr == null) {
|
|
return;
|
|
}
|
|
byte[] bArr2 = this._states;
|
|
int length = iArr.length;
|
|
while (true) {
|
|
int i = length - 1;
|
|
if (length <= 0) {
|
|
return;
|
|
}
|
|
iArr[i] = 0;
|
|
bArr[i] = 0;
|
|
bArr2[i] = 0;
|
|
length = i;
|
|
}
|
|
}
|
|
|
|
@Override // gnu.trove.TIntHash, gnu.trove.TPrimitiveHash, gnu.trove.THash
|
|
public Object clone() {
|
|
TIntByteHashMap tIntByteHashMap = (TIntByteHashMap) super.clone();
|
|
byte[] bArr = this._values;
|
|
tIntByteHashMap._values = bArr == null ? null : (byte[]) bArr.clone();
|
|
return tIntByteHashMap;
|
|
}
|
|
|
|
public boolean containsKey(int i) {
|
|
return contains(i);
|
|
}
|
|
|
|
public boolean containsValue(byte b) {
|
|
byte[] bArr = this._states;
|
|
byte[] bArr2 = this._values;
|
|
if (bArr == null) {
|
|
return false;
|
|
}
|
|
int length = bArr.length;
|
|
while (true) {
|
|
int i = length - 1;
|
|
if (length <= 0) {
|
|
return false;
|
|
}
|
|
if (bArr[i] == 1 && b == bArr2[i]) {
|
|
return true;
|
|
}
|
|
length = i;
|
|
}
|
|
}
|
|
|
|
public boolean equals(Object obj) {
|
|
if (!(obj instanceof TIntByteHashMap)) {
|
|
return false;
|
|
}
|
|
TIntByteHashMap tIntByteHashMap = (TIntByteHashMap) obj;
|
|
if (tIntByteHashMap.size() != size()) {
|
|
return false;
|
|
}
|
|
return forEachEntry(new EqProcedure(tIntByteHashMap));
|
|
}
|
|
|
|
public boolean forEachEntry(TIntByteProcedure tIntByteProcedure) {
|
|
byte[] bArr = this._states;
|
|
int[] iArr = this._set;
|
|
byte[] bArr2 = this._values;
|
|
if (bArr != null) {
|
|
int length = bArr.length;
|
|
while (true) {
|
|
int i = length - 1;
|
|
if (length <= 0) {
|
|
break;
|
|
}
|
|
if (bArr[i] == 1 && !tIntByteProcedure.a(iArr[i], bArr2[i])) {
|
|
return false;
|
|
}
|
|
length = i;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
public boolean forEachKey(TIntProcedure tIntProcedure) {
|
|
return forEach(tIntProcedure);
|
|
}
|
|
|
|
public boolean forEachValue(TByteProcedure tByteProcedure) {
|
|
byte[] bArr = this._states;
|
|
byte[] bArr2 = this._values;
|
|
if (bArr != null) {
|
|
int length = bArr.length;
|
|
while (true) {
|
|
int i = length - 1;
|
|
if (length <= 0) {
|
|
break;
|
|
}
|
|
if (bArr[i] == 1 && !tByteProcedure.a(bArr2[i])) {
|
|
return false;
|
|
}
|
|
length = i;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
public byte get(int i) {
|
|
int index = index(i);
|
|
if (index < 0) {
|
|
return (byte) 0;
|
|
}
|
|
return this._values[index];
|
|
}
|
|
|
|
public byte[] getValues() {
|
|
byte[] bArr = new byte[size()];
|
|
byte[] bArr2 = this._values;
|
|
byte[] bArr3 = this._states;
|
|
if (bArr3 != null) {
|
|
int length = bArr3.length;
|
|
int i = 0;
|
|
while (true) {
|
|
int i2 = length - 1;
|
|
if (length <= 0) {
|
|
break;
|
|
}
|
|
if (bArr3[i2] == 1) {
|
|
bArr[i] = bArr2[i2];
|
|
i++;
|
|
}
|
|
length = i2;
|
|
}
|
|
}
|
|
return bArr;
|
|
}
|
|
|
|
public int hashCode() {
|
|
HashProcedure hashProcedure = new HashProcedure();
|
|
forEachEntry(hashProcedure);
|
|
return hashProcedure.a();
|
|
}
|
|
|
|
public boolean increment(int i) {
|
|
return adjustValue(i, (byte) 1);
|
|
}
|
|
|
|
public TIntByteIterator iterator() {
|
|
return new TIntByteIterator(this);
|
|
}
|
|
|
|
public int[] keys() {
|
|
int[] iArr = new int[size()];
|
|
int[] iArr2 = this._set;
|
|
byte[] bArr = this._states;
|
|
if (bArr != null) {
|
|
int length = bArr.length;
|
|
int i = 0;
|
|
while (true) {
|
|
int i2 = length - 1;
|
|
if (length <= 0) {
|
|
break;
|
|
}
|
|
if (bArr[i2] == 1) {
|
|
iArr[i] = iArr2[i2];
|
|
i++;
|
|
}
|
|
length = i2;
|
|
}
|
|
}
|
|
return iArr;
|
|
}
|
|
|
|
public byte put(int i, byte b) {
|
|
boolean z;
|
|
byte b2;
|
|
int insertionIndex = insertionIndex(i);
|
|
if (insertionIndex < 0) {
|
|
insertionIndex = (-insertionIndex) - 1;
|
|
b2 = this._values[insertionIndex];
|
|
z = false;
|
|
} else {
|
|
z = true;
|
|
b2 = 0;
|
|
}
|
|
byte[] bArr = this._states;
|
|
byte b3 = bArr[insertionIndex];
|
|
this._set[insertionIndex] = i;
|
|
bArr[insertionIndex] = 1;
|
|
this._values[insertionIndex] = b;
|
|
if (z) {
|
|
postInsertHook(b3 == 0);
|
|
}
|
|
return b2;
|
|
}
|
|
|
|
@Override // gnu.trove.THash
|
|
protected void rehash(int i) {
|
|
int capacity = capacity();
|
|
int[] iArr = this._set;
|
|
byte[] bArr = this._values;
|
|
byte[] bArr2 = this._states;
|
|
this._set = new int[i];
|
|
this._values = new byte[i];
|
|
this._states = new byte[i];
|
|
while (true) {
|
|
int i2 = capacity - 1;
|
|
if (capacity <= 0) {
|
|
return;
|
|
}
|
|
if (bArr2[i2] == 1) {
|
|
int i3 = iArr[i2];
|
|
int insertionIndex = insertionIndex(i3);
|
|
this._set[insertionIndex] = i3;
|
|
this._values[insertionIndex] = bArr[i2];
|
|
this._states[insertionIndex] = 1;
|
|
}
|
|
capacity = i2;
|
|
}
|
|
}
|
|
|
|
public byte remove(int i) {
|
|
int index = index(i);
|
|
if (index < 0) {
|
|
return (byte) 0;
|
|
}
|
|
byte b = this._values[index];
|
|
removeAt(index);
|
|
return b;
|
|
}
|
|
|
|
@Override // gnu.trove.TIntHash, gnu.trove.TPrimitiveHash, gnu.trove.THash
|
|
protected void removeAt(int i) {
|
|
this._values[i] = 0;
|
|
super.removeAt(i);
|
|
}
|
|
|
|
public boolean retainEntries(TIntByteProcedure tIntByteProcedure) {
|
|
byte[] bArr = this._states;
|
|
int[] iArr = this._set;
|
|
byte[] bArr2 = this._values;
|
|
boolean z = false;
|
|
if (bArr != null) {
|
|
int length = bArr.length;
|
|
while (true) {
|
|
int i = length - 1;
|
|
if (length <= 0) {
|
|
break;
|
|
}
|
|
if (bArr[i] != 1 || tIntByteProcedure.a(iArr[i], bArr2[i])) {
|
|
length = i;
|
|
} else {
|
|
removeAt(i);
|
|
length = i;
|
|
z = true;
|
|
}
|
|
}
|
|
}
|
|
return z;
|
|
}
|
|
|
|
@Override // gnu.trove.TIntHash, gnu.trove.TPrimitiveHash, gnu.trove.THash
|
|
protected int setUp(int i) {
|
|
int up = super.setUp(i);
|
|
this._values = i == -1 ? null : new byte[up];
|
|
return up;
|
|
}
|
|
|
|
public String toString() {
|
|
final StringBuilder sb = new StringBuilder();
|
|
forEachEntry(new TIntByteProcedure(this) { // from class: gnu.trove.TIntByteHashMap.1
|
|
@Override // gnu.trove.TIntByteProcedure
|
|
public boolean a(int i, byte b) {
|
|
if (sb.length() != 0) {
|
|
StringBuilder sb2 = sb;
|
|
sb2.append(',');
|
|
sb2.append(' ');
|
|
}
|
|
sb.append(i);
|
|
sb.append('=');
|
|
sb.append((int) b);
|
|
return true;
|
|
}
|
|
});
|
|
sb.append('}');
|
|
sb.insert(0, '{');
|
|
return sb.toString();
|
|
}
|
|
|
|
public void transformValues(TByteFunction tByteFunction) {
|
|
byte[] bArr = this._states;
|
|
byte[] bArr2 = this._values;
|
|
if (bArr == null) {
|
|
return;
|
|
}
|
|
int length = bArr.length;
|
|
while (true) {
|
|
int i = length - 1;
|
|
if (length <= 0) {
|
|
return;
|
|
}
|
|
if (bArr[i] == 1) {
|
|
bArr2[i] = tByteFunction.a(bArr2[i]);
|
|
}
|
|
length = i;
|
|
}
|
|
}
|
|
|
|
public TIntByteHashMap(int i) {
|
|
super(i);
|
|
}
|
|
|
|
public TIntByteHashMap(int i, float f) {
|
|
super(i, f);
|
|
}
|
|
|
|
public TIntByteHashMap(TIntHashingStrategy tIntHashingStrategy) {
|
|
super(tIntHashingStrategy);
|
|
}
|
|
|
|
public TIntByteHashMap(int i, TIntHashingStrategy tIntHashingStrategy) {
|
|
super(i, tIntHashingStrategy);
|
|
}
|
|
|
|
public TIntByteHashMap(int i, float f, TIntHashingStrategy tIntHashingStrategy) {
|
|
super(i, f, tIntHashingStrategy);
|
|
}
|
|
}
|