385 lines
11 KiB
Java
385 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 TObjectByteHashMap<K> extends TObjectHash<K> {
|
|
protected transient byte[] _values;
|
|
|
|
private static final class EqProcedure<K> implements TObjectByteProcedure<K> {
|
|
private final TObjectByteHashMap<K> a;
|
|
|
|
EqProcedure(TObjectByteHashMap<K> tObjectByteHashMap) {
|
|
this.a = tObjectByteHashMap;
|
|
}
|
|
|
|
private static boolean a(byte b, byte b2) {
|
|
return b == b2;
|
|
}
|
|
|
|
@Override // gnu.trove.TObjectByteProcedure
|
|
public final boolean a(K k, byte b) {
|
|
return this.a.index(k) >= 0 && a(b, this.a.get(k));
|
|
}
|
|
}
|
|
|
|
private final class HashProcedure implements TObjectByteProcedure<K> {
|
|
private int a;
|
|
|
|
HashProcedure() {
|
|
}
|
|
|
|
public int a() {
|
|
return this.a;
|
|
}
|
|
|
|
@Override // gnu.trove.TObjectByteProcedure
|
|
public boolean a(K k, byte b) {
|
|
int i = this.a;
|
|
int computeHashCode = TObjectByteHashMap.this._hashingStrategy.computeHashCode(k);
|
|
HashFunctions.a((int) b);
|
|
this.a = i + (computeHashCode ^ b);
|
|
return true;
|
|
}
|
|
}
|
|
|
|
public TObjectByteHashMap() {
|
|
}
|
|
|
|
/* JADX WARN: Multi-variable type inference failed */
|
|
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.readObject(), 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(K k, byte b) {
|
|
int index = index(k);
|
|
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();
|
|
Object[] objArr = this._set;
|
|
byte[] bArr = this._values;
|
|
int length = objArr.length;
|
|
while (true) {
|
|
int i = length - 1;
|
|
if (length <= 0) {
|
|
return;
|
|
}
|
|
objArr[i] = null;
|
|
bArr[i] = 0;
|
|
length = i;
|
|
}
|
|
}
|
|
|
|
public boolean containsKey(K k) {
|
|
return contains(k);
|
|
}
|
|
|
|
public boolean containsValue(byte b) {
|
|
Object[] objArr = this._set;
|
|
byte[] bArr = this._values;
|
|
int length = objArr.length;
|
|
while (true) {
|
|
int i = length - 1;
|
|
if (length <= 0) {
|
|
return false;
|
|
}
|
|
if (objArr[i] != null && objArr[i] != TObjectHash.REMOVED && b == bArr[i]) {
|
|
return true;
|
|
}
|
|
length = i;
|
|
}
|
|
}
|
|
|
|
public boolean equals(Object obj) {
|
|
if (!(obj instanceof TObjectByteHashMap)) {
|
|
return false;
|
|
}
|
|
TObjectByteHashMap tObjectByteHashMap = (TObjectByteHashMap) obj;
|
|
if (tObjectByteHashMap.size() != size()) {
|
|
return false;
|
|
}
|
|
return forEachEntry(new EqProcedure(tObjectByteHashMap));
|
|
}
|
|
|
|
/* JADX WARN: Multi-variable type inference failed */
|
|
public boolean forEachEntry(TObjectByteProcedure<K> tObjectByteProcedure) {
|
|
Object[] objArr = this._set;
|
|
byte[] bArr = this._values;
|
|
int length = objArr.length;
|
|
while (true) {
|
|
int i = length - 1;
|
|
if (length <= 0) {
|
|
return true;
|
|
}
|
|
if (objArr[i] != null && objArr[i] != TObjectHash.REMOVED && !tObjectByteProcedure.a(objArr[i], bArr[i])) {
|
|
return false;
|
|
}
|
|
length = i;
|
|
}
|
|
}
|
|
|
|
/* JADX WARN: Multi-variable type inference failed */
|
|
public boolean forEachKey(TObjectProcedure<K> tObjectProcedure) {
|
|
return forEach(tObjectProcedure);
|
|
}
|
|
|
|
public boolean forEachValue(TByteProcedure tByteProcedure) {
|
|
Object[] objArr = this._set;
|
|
byte[] bArr = this._values;
|
|
int length = objArr.length;
|
|
while (true) {
|
|
int i = length - 1;
|
|
if (length <= 0) {
|
|
return true;
|
|
}
|
|
if (objArr[i] != null && objArr[i] != TObjectHash.REMOVED && !tByteProcedure.a(bArr[i])) {
|
|
return false;
|
|
}
|
|
length = i;
|
|
}
|
|
}
|
|
|
|
public byte get(K k) {
|
|
int index = index(k);
|
|
if (index < 0) {
|
|
return (byte) 0;
|
|
}
|
|
return this._values[index];
|
|
}
|
|
|
|
public byte[] getValues() {
|
|
byte[] bArr = new byte[size()];
|
|
byte[] bArr2 = this._values;
|
|
Object[] objArr = this._set;
|
|
int length = objArr.length;
|
|
int i = 0;
|
|
while (true) {
|
|
int i2 = length - 1;
|
|
if (length <= 0) {
|
|
return bArr;
|
|
}
|
|
if (objArr[i2] != null && objArr[i2] != TObjectHash.REMOVED) {
|
|
bArr[i] = bArr2[i2];
|
|
i++;
|
|
}
|
|
length = i2;
|
|
}
|
|
}
|
|
|
|
public int hashCode() {
|
|
HashProcedure hashProcedure = new HashProcedure();
|
|
forEachEntry(hashProcedure);
|
|
return hashProcedure.a();
|
|
}
|
|
|
|
public boolean increment(K k) {
|
|
return adjustValue(k, (byte) 1);
|
|
}
|
|
|
|
public TObjectByteIterator<K> iterator() {
|
|
return new TObjectByteIterator<>(this);
|
|
}
|
|
|
|
public Object[] keys() {
|
|
Object[] objArr = new Object[size()];
|
|
Object[] objArr2 = this._set;
|
|
int length = objArr2.length;
|
|
int i = 0;
|
|
while (true) {
|
|
int i2 = length - 1;
|
|
if (length <= 0) {
|
|
return objArr;
|
|
}
|
|
if (objArr2[i2] != null && objArr2[i2] != TObjectHash.REMOVED) {
|
|
objArr[i] = objArr2[i2];
|
|
i++;
|
|
}
|
|
length = i2;
|
|
}
|
|
}
|
|
|
|
public byte put(K k, byte b) {
|
|
boolean z;
|
|
byte b2;
|
|
int insertionIndex = insertionIndex(k);
|
|
if (insertionIndex < 0) {
|
|
insertionIndex = (-insertionIndex) - 1;
|
|
b2 = this._values[insertionIndex];
|
|
z = false;
|
|
} else {
|
|
z = true;
|
|
b2 = 0;
|
|
}
|
|
Object[] objArr = this._set;
|
|
Object obj = objArr[insertionIndex];
|
|
objArr[insertionIndex] = k;
|
|
this._values[insertionIndex] = b;
|
|
if (z) {
|
|
postInsertHook(obj == null);
|
|
}
|
|
return b2;
|
|
}
|
|
|
|
@Override // gnu.trove.THash
|
|
protected void rehash(int i) {
|
|
int capacity = capacity();
|
|
Object[] objArr = this._set;
|
|
byte[] bArr = this._values;
|
|
this._set = new Object[i];
|
|
this._values = new byte[i];
|
|
while (true) {
|
|
int i2 = capacity - 1;
|
|
if (capacity <= 0) {
|
|
return;
|
|
}
|
|
if (objArr[i2] != null && objArr[i2] != TObjectHash.REMOVED) {
|
|
Object obj = objArr[i2];
|
|
int insertionIndex = insertionIndex(obj);
|
|
if (insertionIndex < 0) {
|
|
throwObjectContractViolation(this._set[(-insertionIndex) - 1], obj);
|
|
}
|
|
this._set[insertionIndex] = obj;
|
|
this._values[insertionIndex] = bArr[i2];
|
|
}
|
|
capacity = i2;
|
|
}
|
|
}
|
|
|
|
public byte remove(K k) {
|
|
int index = index(k);
|
|
if (index < 0) {
|
|
return (byte) 0;
|
|
}
|
|
byte b = this._values[index];
|
|
removeAt(index);
|
|
return b;
|
|
}
|
|
|
|
@Override // gnu.trove.TObjectHash, gnu.trove.THash
|
|
protected void removeAt(int i) {
|
|
this._values[i] = 0;
|
|
super.removeAt(i);
|
|
}
|
|
|
|
/* JADX WARN: Multi-variable type inference failed */
|
|
public boolean retainEntries(TObjectByteProcedure<K> tObjectByteProcedure) {
|
|
Object[] objArr = this._set;
|
|
byte[] bArr = this._values;
|
|
stopCompactingOnRemove();
|
|
boolean z = false;
|
|
try {
|
|
int length = objArr.length;
|
|
while (true) {
|
|
int i = length - 1;
|
|
if (length <= 0) {
|
|
return z;
|
|
}
|
|
if (objArr[i] != null && objArr[i] != TObjectHash.REMOVED && !tObjectByteProcedure.a(objArr[i], bArr[i])) {
|
|
removeAt(i);
|
|
z = true;
|
|
}
|
|
length = i;
|
|
}
|
|
} finally {
|
|
startCompactingOnRemove(z);
|
|
}
|
|
}
|
|
|
|
@Override // gnu.trove.TObjectHash, 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 TObjectByteProcedure<K>(this) { // from class: gnu.trove.TObjectByteHashMap.1
|
|
@Override // gnu.trove.TObjectByteProcedure
|
|
public boolean a(K k, byte b) {
|
|
if (sb.length() != 0) {
|
|
StringBuilder sb2 = sb;
|
|
sb2.append(',');
|
|
sb2.append(' ');
|
|
}
|
|
StringBuilder sb3 = sb;
|
|
if (k == this) {
|
|
k = (K) "(this Map)";
|
|
}
|
|
sb3.append(k);
|
|
sb.append('=');
|
|
sb.append((int) b);
|
|
return true;
|
|
}
|
|
});
|
|
sb.append('}');
|
|
sb.insert(0, '{');
|
|
return sb.toString();
|
|
}
|
|
|
|
public void transformValues(TByteFunction tByteFunction) {
|
|
Object[] objArr = this._set;
|
|
byte[] bArr = this._values;
|
|
int length = objArr.length;
|
|
while (true) {
|
|
int i = length - 1;
|
|
if (length <= 0) {
|
|
return;
|
|
}
|
|
if (objArr[i] != null && objArr[i] != TObjectHash.REMOVED) {
|
|
bArr[i] = tByteFunction.a(bArr[i]);
|
|
}
|
|
length = i;
|
|
}
|
|
}
|
|
|
|
public TObjectByteHashMap(int i) {
|
|
super(i);
|
|
}
|
|
|
|
public TObjectByteHashMap(int i, float f) {
|
|
super(i, f);
|
|
}
|
|
|
|
public TObjectByteHashMap(TObjectHashingStrategy<K> tObjectHashingStrategy) {
|
|
super(tObjectHashingStrategy);
|
|
}
|
|
|
|
public TObjectByteHashMap(int i, TObjectHashingStrategy<K> tObjectHashingStrategy) {
|
|
super(i, tObjectHashingStrategy);
|
|
}
|
|
|
|
public TObjectByteHashMap(int i, float f, TObjectHashingStrategy<K> tObjectHashingStrategy) {
|
|
super(i, f, tObjectHashingStrategy);
|
|
}
|
|
}
|