NetMirror.apk
Download file
package l;
import java.lang.reflect.Array;
import java.util.Collection;
import java.util.Iterator;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Set;
/* JADX INFO: loaded from: classes.dex */
abstract class f {
/* JADX INFO: renamed from: a, reason: collision with root package name */
b f9638a;
/* JADX INFO: renamed from: b, reason: collision with root package name */
c f9639b;
/* JADX INFO: renamed from: c, reason: collision with root package name */
e f9640c;
final class a implements Iterator {
/* JADX INFO: renamed from: b, reason: collision with root package name */
final int f9641b;
/* JADX INFO: renamed from: c, reason: collision with root package name */
int f9642c;
/* JADX INFO: renamed from: d, reason: collision with root package name */
int f9643d;
/* JADX INFO: renamed from: e, reason: collision with root package name */
boolean f9644e = false;
a(int i3) {
this.f9641b = i3;
this.f9642c = f.this.d();
}
@Override // java.util.Iterator
public boolean hasNext() {
return this.f9643d < this.f9642c;
}
@Override // java.util.Iterator
public Object next() {
if (!hasNext()) {
throw new NoSuchElementException();
}
Object objB = f.this.b(this.f9643d, this.f9641b);
this.f9643d++;
this.f9644e = true;
return objB;
}
@Override // java.util.Iterator
public void remove() {
if (!this.f9644e) {
throw new IllegalStateException();
}
int i3 = this.f9643d - 1;
this.f9643d = i3;
this.f9642c--;
this.f9644e = false;
f.this.h(i3);
}
}
final class b implements Set {
b() {
}
@Override // java.util.Set, java.util.Collection
/* JADX INFO: renamed from: a, reason: merged with bridge method [inline-methods] */
public boolean add(Map.Entry entry) {
throw new UnsupportedOperationException();
}
@Override // java.util.Set, java.util.Collection
public boolean addAll(Collection collection) {
int iD = f.this.d();
Iterator it = collection.iterator();
while (it.hasNext()) {
Map.Entry entry = (Map.Entry) it.next();
f.this.g(entry.getKey(), entry.getValue());
}
return iD != f.this.d();
}
@Override // java.util.Set, java.util.Collection
public void clear() {
f.this.a();
}
@Override // java.util.Set, java.util.Collection
public boolean contains(Object obj) {
if (!(obj instanceof Map.Entry)) {
return false;
}
Map.Entry entry = (Map.Entry) obj;
int iE = f.this.e(entry.getKey());
if (iE < 0) {
return false;
}
return l.c.c(f.this.b(iE, 1), entry.getValue());
}
@Override // java.util.Set, java.util.Collection
public boolean containsAll(Collection collection) {
Iterator it = collection.iterator();
while (it.hasNext()) {
if (!contains(it.next())) {
return false;
}
}
return true;
}
@Override // java.util.Set, java.util.Collection
public boolean equals(Object obj) {
return f.k(this, obj);
}
@Override // java.util.Set, java.util.Collection
public int hashCode() {
int iHashCode = 0;
for (int iD = f.this.d() - 1; iD >= 0; iD--) {
Object objB = f.this.b(iD, 0);
Object objB2 = f.this.b(iD, 1);
iHashCode += (objB == null ? 0 : objB.hashCode()) ^ (objB2 == null ? 0 : objB2.hashCode());
}
return iHashCode;
}
@Override // java.util.Set, java.util.Collection
public boolean isEmpty() {
return f.this.d() == 0;
}
@Override // java.util.Set, java.util.Collection, java.lang.Iterable
public Iterator iterator() {
return f.this.new d();
}
@Override // java.util.Set, java.util.Collection
public boolean remove(Object obj) {
throw new UnsupportedOperationException();
}
@Override // java.util.Set, java.util.Collection
public boolean removeAll(Collection collection) {
throw new UnsupportedOperationException();
}
@Override // java.util.Set, java.util.Collection
public boolean retainAll(Collection collection) {
throw new UnsupportedOperationException();
}
@Override // java.util.Set, java.util.Collection
public int size() {
return f.this.d();
}
@Override // java.util.Set, java.util.Collection
public Object[] toArray() {
throw new UnsupportedOperationException();
}
@Override // java.util.Set, java.util.Collection
public Object[] toArray(Object[] objArr) {
throw new UnsupportedOperationException();
}
}
final class c implements Set {
c() {
}
@Override // java.util.Set, java.util.Collection
public boolean add(Object obj) {
throw new UnsupportedOperationException();
}
@Override // java.util.Set, java.util.Collection
public boolean addAll(Collection collection) {
throw new UnsupportedOperationException();
}
@Override // java.util.Set, java.util.Collection
public void clear() {
f.this.a();
}
@Override // java.util.Set, java.util.Collection
public boolean contains(Object obj) {
return f.this.e(obj) >= 0;
}
@Override // java.util.Set, java.util.Collection
public boolean containsAll(Collection collection) {
return f.j(f.this.c(), collection);
}
@Override // java.util.Set, java.util.Collection
public boolean equals(Object obj) {
return f.k(this, obj);
}
@Override // java.util.Set, java.util.Collection
public int hashCode() {
int iHashCode = 0;
for (int iD = f.this.d() - 1; iD >= 0; iD--) {
Object objB = f.this.b(iD, 0);
iHashCode += objB == null ? 0 : objB.hashCode();
}
return iHashCode;
}
@Override // java.util.Set, java.util.Collection
public boolean isEmpty() {
return f.this.d() == 0;
}
@Override // java.util.Set, java.util.Collection, java.lang.Iterable
public Iterator iterator() {
return f.this.new a(0);
}
@Override // java.util.Set, java.util.Collection
public boolean remove(Object obj) {
int iE = f.this.e(obj);
if (iE < 0) {
return false;
}
f.this.h(iE);
return true;
}
@Override // java.util.Set, java.util.Collection
public boolean removeAll(Collection collection) {
return f.o(f.this.c(), collection);
}
@Override // java.util.Set, java.util.Collection
public boolean retainAll(Collection collection) {
return f.p(f.this.c(), collection);
}
@Override // java.util.Set, java.util.Collection
public int size() {
return f.this.d();
}
@Override // java.util.Set, java.util.Collection
public Object[] toArray() {
return f.this.q(0);
}
@Override // java.util.Set, java.util.Collection
public Object[] toArray(Object[] objArr) {
return f.this.r(objArr, 0);
}
}
final class d implements Iterator, Map.Entry {
/* JADX INFO: renamed from: b, reason: collision with root package name */
int f9648b;
/* JADX INFO: renamed from: d, reason: collision with root package name */
boolean f9650d = false;
/* JADX INFO: renamed from: c, reason: collision with root package name */
int f9649c = -1;
d() {
this.f9648b = f.this.d() - 1;
}
@Override // java.util.Iterator
/* JADX INFO: renamed from: a, reason: merged with bridge method [inline-methods] */
public Map.Entry next() {
if (!hasNext()) {
throw new NoSuchElementException();
}
this.f9649c++;
this.f9650d = true;
return this;
}
@Override // java.util.Map.Entry
public boolean equals(Object obj) {
if (!this.f9650d) {
throw new IllegalStateException("This container does not support retaining Map.Entry objects");
}
if (!(obj instanceof Map.Entry)) {
return false;
}
Map.Entry entry = (Map.Entry) obj;
return l.c.c(entry.getKey(), f.this.b(this.f9649c, 0)) && l.c.c(entry.getValue(), f.this.b(this.f9649c, 1));
}
@Override // java.util.Map.Entry
public Object getKey() {
if (this.f9650d) {
return f.this.b(this.f9649c, 0);
}
throw new IllegalStateException("This container does not support retaining Map.Entry objects");
}
@Override // java.util.Map.Entry
public Object getValue() {
if (this.f9650d) {
return f.this.b(this.f9649c, 1);
}
throw new IllegalStateException("This container does not support retaining Map.Entry objects");
}
@Override // java.util.Iterator
public boolean hasNext() {
return this.f9649c < this.f9648b;
}
@Override // java.util.Map.Entry
public int hashCode() {
if (!this.f9650d) {
throw new IllegalStateException("This container does not support retaining Map.Entry objects");
}
Object objB = f.this.b(this.f9649c, 0);
Object objB2 = f.this.b(this.f9649c, 1);
return (objB == null ? 0 : objB.hashCode()) ^ (objB2 != null ? objB2.hashCode() : 0);
}
@Override // java.util.Iterator
public void remove() {
if (!this.f9650d) {
throw new IllegalStateException();
}
f.this.h(this.f9649c);
this.f9649c--;
this.f9648b--;
this.f9650d = false;
}
@Override // java.util.Map.Entry
public Object setValue(Object obj) {
if (this.f9650d) {
return f.this.i(this.f9649c, obj);
}
throw new IllegalStateException("This container does not support retaining Map.Entry objects");
}
public String toString() {
return getKey() + "=" + getValue();
}
}
final class e implements Collection {
e() {
}
@Override // java.util.Collection
public boolean add(Object obj) {
throw new UnsupportedOperationException();
}
@Override // java.util.Collection
public boolean addAll(Collection collection) {
throw new UnsupportedOperationException();
}
@Override // java.util.Collection
public void clear() {
f.this.a();
}
@Override // java.util.Collection
public boolean contains(Object obj) {
return f.this.f(obj) >= 0;
}
@Override // java.util.Collection
public boolean containsAll(Collection collection) {
Iterator it = collection.iterator();
while (it.hasNext()) {
if (!contains(it.next())) {
return false;
}
}
return true;
}
@Override // java.util.Collection
public boolean isEmpty() {
return f.this.d() == 0;
}
@Override // java.util.Collection, java.lang.Iterable
public Iterator iterator() {
return f.this.new a(1);
}
@Override // java.util.Collection
public boolean remove(Object obj) {
int iF = f.this.f(obj);
if (iF < 0) {
return false;
}
f.this.h(iF);
return true;
}
@Override // java.util.Collection
public boolean removeAll(Collection collection) {
int iD = f.this.d();
int i3 = 0;
boolean z3 = false;
while (i3 < iD) {
if (collection.contains(f.this.b(i3, 1))) {
f.this.h(i3);
i3--;
iD--;
z3 = true;
}
i3++;
}
return z3;
}
@Override // java.util.Collection
public boolean retainAll(Collection collection) {
int iD = f.this.d();
int i3 = 0;
boolean z3 = false;
while (i3 < iD) {
if (!collection.contains(f.this.b(i3, 1))) {
f.this.h(i3);
i3--;
iD--;
z3 = true;
}
i3++;
}
return z3;
}
@Override // java.util.Collection
public int size() {
return f.this.d();
}
@Override // java.util.Collection
public Object[] toArray() {
return f.this.q(1);
}
@Override // java.util.Collection
public Object[] toArray(Object[] objArr) {
return f.this.r(objArr, 1);
}
}
f() {
}
public static boolean j(Map map, Collection collection) {
Iterator it = collection.iterator();
while (it.hasNext()) {
if (!map.containsKey(it.next())) {
return false;
}
}
return true;
}
public static boolean k(Set set, Object obj) {
if (set == obj) {
return true;
}
if (obj instanceof Set) {
Set set2 = (Set) obj;
try {
if (set.size() == set2.size()) {
if (set.containsAll(set2)) {
return true;
}
}
return false;
} catch (ClassCastException | NullPointerException unused) {
}
}
return false;
}
public static boolean o(Map map, Collection collection) {
int size = map.size();
Iterator it = collection.iterator();
while (it.hasNext()) {
map.remove(it.next());
}
return size != map.size();
}
public static boolean p(Map map, Collection collection) {
int size = map.size();
Iterator it = map.keySet().iterator();
while (it.hasNext()) {
if (!collection.contains(it.next())) {
it.remove();
}
}
return size != map.size();
}
protected abstract void a();
protected abstract Object b(int i3, int i4);
protected abstract Map c();
protected abstract int d();
protected abstract int e(Object obj);
protected abstract int f(Object obj);
protected abstract void g(Object obj, Object obj2);
protected abstract void h(int i3);
protected abstract Object i(int i3, Object obj);
public Set l() {
if (this.f9638a == null) {
this.f9638a = new b();
}
return this.f9638a;
}
public Set m() {
if (this.f9639b == null) {
this.f9639b = new c();
}
return this.f9639b;
}
public Collection n() {
if (this.f9640c == null) {
this.f9640c = new e();
}
return this.f9640c;
}
public Object[] q(int i3) {
int iD = d();
Object[] objArr = new Object[iD];
for (int i4 = 0; i4 < iD; i4++) {
objArr[i4] = b(i4, i3);
}
return objArr;
}
public Object[] r(Object[] objArr, int i3) {
int iD = d();
if (objArr.length < iD) {
objArr = (Object[]) Array.newInstance(objArr.getClass().getComponentType(), iD);
}
for (int i4 = 0; i4 < iD; i4++) {
objArr[i4] = b(i4, i3);
}
if (objArr.length > iD) {
objArr[iD] = null;
}
return objArr;
}
}
⚠️ This content was hidden by an advertisement filtering extension in your browser. Please disable it and reload the page to access the decompiled content.
We only display one small text ad to keep this service free. Here's what it looks like:
Read the Docs for Business: You write the docs. We do the rest.
Try it today!Ad by EthicalAds
Download file