409 lines
11 KiB
Java
409 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 TLongLongHashMap extends TLongHash {
|
|
protected transient long[] _values;
|
|
|
|
private static final class EqProcedure implements TLongLongProcedure {
|
|
private final TLongLongHashMap a;
|
|
|
|
EqProcedure(TLongLongHashMap tLongLongHashMap) {
|
|
this.a = tLongLongHashMap;
|
|
}
|
|
|
|
private static boolean b(long j, long j2) {
|
|
return j == j2;
|
|
}
|
|
|
|
@Override // gnu.trove.TLongLongProcedure
|
|
public final boolean a(long j, long j2) {
|
|
return this.a.index(j) >= 0 && b(j2, this.a.get(j));
|
|
}
|
|
}
|
|
|
|
private final class HashProcedure implements TLongLongProcedure {
|
|
private int a;
|
|
|
|
HashProcedure() {
|
|
}
|
|
|
|
public int a() {
|
|
return this.a;
|
|
}
|
|
|
|
@Override // gnu.trove.TLongLongProcedure
|
|
public final boolean a(long j, long j2) {
|
|
this.a += TLongLongHashMap.this._hashingStrategy.computeHashCode(j) ^ HashFunctions.a(j2);
|
|
return true;
|
|
}
|
|
}
|
|
|
|
public TLongLongHashMap() {
|
|
}
|
|
|
|
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.readLong(), objectInputStream.readLong());
|
|
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(long j, long j2) {
|
|
int index = index(j);
|
|
if (index < 0) {
|
|
return false;
|
|
}
|
|
long[] jArr = this._values;
|
|
jArr[index] = jArr[index] + j2;
|
|
return true;
|
|
}
|
|
|
|
@Override // gnu.trove.THash
|
|
public void clear() {
|
|
super.clear();
|
|
long[] jArr = this._set;
|
|
long[] jArr2 = this._values;
|
|
if (jArr2 == null) {
|
|
return;
|
|
}
|
|
byte[] bArr = this._states;
|
|
int length = jArr.length;
|
|
while (true) {
|
|
int i = length - 1;
|
|
if (length <= 0) {
|
|
return;
|
|
}
|
|
jArr[i] = 0;
|
|
jArr2[i] = 0;
|
|
bArr[i] = 0;
|
|
length = i;
|
|
}
|
|
}
|
|
|
|
@Override // gnu.trove.TLongHash, gnu.trove.TPrimitiveHash, gnu.trove.THash
|
|
public Object clone() {
|
|
TLongLongHashMap tLongLongHashMap = (TLongLongHashMap) super.clone();
|
|
long[] jArr = this._values;
|
|
tLongLongHashMap._values = jArr == null ? null : (long[]) jArr.clone();
|
|
return tLongLongHashMap;
|
|
}
|
|
|
|
public boolean containsKey(long j) {
|
|
return contains(j);
|
|
}
|
|
|
|
public boolean containsValue(long j) {
|
|
byte[] bArr = this._states;
|
|
long[] jArr = 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 && j == jArr[i]) {
|
|
return true;
|
|
}
|
|
length = i;
|
|
}
|
|
}
|
|
|
|
public boolean equals(Object obj) {
|
|
if (!(obj instanceof TLongLongHashMap)) {
|
|
return false;
|
|
}
|
|
TLongLongHashMap tLongLongHashMap = (TLongLongHashMap) obj;
|
|
if (tLongLongHashMap.size() != size()) {
|
|
return false;
|
|
}
|
|
return forEachEntry(new EqProcedure(tLongLongHashMap));
|
|
}
|
|
|
|
public boolean forEachEntry(TLongLongProcedure tLongLongProcedure) {
|
|
byte[] bArr = this._states;
|
|
long[] jArr = this._set;
|
|
long[] jArr2 = this._values;
|
|
if (bArr != null) {
|
|
int length = bArr.length;
|
|
while (true) {
|
|
int i = length - 1;
|
|
if (length <= 0) {
|
|
break;
|
|
}
|
|
if (bArr[i] == 1 && !tLongLongProcedure.a(jArr[i], jArr2[i])) {
|
|
return false;
|
|
}
|
|
length = i;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
public boolean forEachKey(TLongProcedure tLongProcedure) {
|
|
return forEach(tLongProcedure);
|
|
}
|
|
|
|
public boolean forEachValue(TLongProcedure tLongProcedure) {
|
|
byte[] bArr = this._states;
|
|
long[] jArr = this._values;
|
|
if (bArr != null) {
|
|
int length = bArr.length;
|
|
while (true) {
|
|
int i = length - 1;
|
|
if (length <= 0) {
|
|
break;
|
|
}
|
|
if (bArr[i] == 1 && !tLongProcedure.a(jArr[i])) {
|
|
return false;
|
|
}
|
|
length = i;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
public long get(long j) {
|
|
int index = index(j);
|
|
if (index < 0) {
|
|
return 0L;
|
|
}
|
|
return this._values[index];
|
|
}
|
|
|
|
public long[] getValues() {
|
|
long[] jArr = new long[size()];
|
|
long[] jArr2 = this._values;
|
|
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) {
|
|
jArr[i] = jArr2[i2];
|
|
i++;
|
|
}
|
|
length = i2;
|
|
}
|
|
}
|
|
return jArr;
|
|
}
|
|
|
|
public int hashCode() {
|
|
HashProcedure hashProcedure = new HashProcedure();
|
|
forEachEntry(hashProcedure);
|
|
return hashProcedure.a();
|
|
}
|
|
|
|
public boolean increment(long j) {
|
|
return adjustValue(j, 1L);
|
|
}
|
|
|
|
public TLongLongIterator iterator() {
|
|
return new TLongLongIterator(this);
|
|
}
|
|
|
|
public long[] keys() {
|
|
long[] jArr = new long[size()];
|
|
long[] jArr2 = 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) {
|
|
jArr[i] = jArr2[i2];
|
|
i++;
|
|
}
|
|
length = i2;
|
|
}
|
|
}
|
|
return jArr;
|
|
}
|
|
|
|
public long put(long j, long j2) {
|
|
long j3;
|
|
boolean z;
|
|
int insertionIndex = insertionIndex(j);
|
|
if (insertionIndex < 0) {
|
|
insertionIndex = (-insertionIndex) - 1;
|
|
j3 = this._values[insertionIndex];
|
|
z = false;
|
|
} else {
|
|
j3 = 0;
|
|
z = true;
|
|
}
|
|
byte[] bArr = this._states;
|
|
byte b = bArr[insertionIndex];
|
|
this._set[insertionIndex] = j;
|
|
bArr[insertionIndex] = 1;
|
|
this._values[insertionIndex] = j2;
|
|
if (z) {
|
|
postInsertHook(b == 0);
|
|
}
|
|
return j3;
|
|
}
|
|
|
|
@Override // gnu.trove.THash
|
|
protected void rehash(int i) {
|
|
int capacity = capacity();
|
|
long[] jArr = this._set;
|
|
long[] jArr2 = this._values;
|
|
byte[] bArr = this._states;
|
|
this._set = new long[i];
|
|
this._values = new long[i];
|
|
this._states = new byte[i];
|
|
while (true) {
|
|
int i2 = capacity - 1;
|
|
if (capacity <= 0) {
|
|
return;
|
|
}
|
|
if (bArr[i2] == 1) {
|
|
long j = jArr[i2];
|
|
int insertionIndex = insertionIndex(j);
|
|
this._set[insertionIndex] = j;
|
|
this._values[insertionIndex] = jArr2[i2];
|
|
this._states[insertionIndex] = 1;
|
|
}
|
|
capacity = i2;
|
|
}
|
|
}
|
|
|
|
public long remove(long j) {
|
|
int index = index(j);
|
|
if (index < 0) {
|
|
return 0L;
|
|
}
|
|
long j2 = this._values[index];
|
|
removeAt(index);
|
|
return j2;
|
|
}
|
|
|
|
@Override // gnu.trove.TLongHash, gnu.trove.TPrimitiveHash, gnu.trove.THash
|
|
protected void removeAt(int i) {
|
|
this._values[i] = 0;
|
|
super.removeAt(i);
|
|
}
|
|
|
|
public boolean retainEntries(TLongLongProcedure tLongLongProcedure) {
|
|
byte[] bArr = this._states;
|
|
long[] jArr = this._set;
|
|
long[] jArr2 = 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 || tLongLongProcedure.a(jArr[i], jArr2[i])) {
|
|
length = i;
|
|
} else {
|
|
removeAt(i);
|
|
length = i;
|
|
z = true;
|
|
}
|
|
}
|
|
}
|
|
return z;
|
|
}
|
|
|
|
@Override // gnu.trove.TLongHash, gnu.trove.TPrimitiveHash, gnu.trove.THash
|
|
protected int setUp(int i) {
|
|
int up = super.setUp(i);
|
|
this._values = i == -1 ? null : new long[up];
|
|
return up;
|
|
}
|
|
|
|
public String toString() {
|
|
final StringBuilder sb = new StringBuilder();
|
|
forEachEntry(new TLongLongProcedure(this) { // from class: gnu.trove.TLongLongHashMap.1
|
|
@Override // gnu.trove.TLongLongProcedure
|
|
public boolean a(long j, long j2) {
|
|
if (sb.length() != 0) {
|
|
StringBuilder sb2 = sb;
|
|
sb2.append(',');
|
|
sb2.append(' ');
|
|
}
|
|
sb.append(j);
|
|
sb.append('=');
|
|
sb.append(j2);
|
|
return true;
|
|
}
|
|
});
|
|
sb.append('}');
|
|
sb.insert(0, '{');
|
|
return sb.toString();
|
|
}
|
|
|
|
public void transformValues(TLongFunction tLongFunction) {
|
|
byte[] bArr = this._states;
|
|
long[] jArr = this._values;
|
|
if (bArr == null) {
|
|
return;
|
|
}
|
|
int length = bArr.length;
|
|
while (true) {
|
|
int i = length - 1;
|
|
if (length <= 0) {
|
|
return;
|
|
}
|
|
if (bArr[i] == 1) {
|
|
jArr[i] = tLongFunction.a(jArr[i]);
|
|
}
|
|
length = i;
|
|
}
|
|
}
|
|
|
|
public TLongLongHashMap(int i) {
|
|
super(i);
|
|
}
|
|
|
|
public TLongLongHashMap(int i, float f) {
|
|
super(i, f);
|
|
}
|
|
|
|
public TLongLongHashMap(TLongHashingStrategy tLongHashingStrategy) {
|
|
super(tLongHashingStrategy);
|
|
}
|
|
|
|
public TLongLongHashMap(int i, TLongHashingStrategy tLongHashingStrategy) {
|
|
super(i, tLongHashingStrategy);
|
|
}
|
|
|
|
public TLongLongHashMap(int i, float f, TLongHashingStrategy tLongHashingStrategy) {
|
|
super(i, f, tLongHashingStrategy);
|
|
}
|
|
}
|