package C3;

import d5.AbstractC0844a;
import java.util.Arrays;
import java.util.Collection;
import java.util.Objects;
import java.util.Set;
import java.util.SortedSet;
import v0.AbstractC1664c;

/* JADX INFO: loaded from: classes.dex */
public abstract class J extends B implements Set {

    /* JADX INFO: renamed from: s, reason: collision with root package name */
    public static final /* synthetic */ int f1201s = 0;

    /* JADX INFO: renamed from: r, reason: collision with root package name */
    public transient G f1202r;

    public static int i(int i) {
        int iMax = Math.max(i, 2);
        if (iMax >= 751619276) {
            AbstractC1664c.e("collection too large", iMax < 1073741824);
            return 1073741824;
        }
        int iHighestOneBit = Integer.highestOneBit(iMax - 1) << 1;
        while (((double) iHighestOneBit) * 0.7d < iMax) {
            iHighestOneBit <<= 1;
        }
        return iHighestOneBit;
    }

    public static J j(int i, Object... objArr) {
        if (i == 0) {
            return c0.f1255z;
        }
        if (i == 1) {
            Object obj = objArr[0];
            Objects.requireNonNull(obj);
            return new i0(obj);
        }
        int i5 = i(i);
        Object[] objArr2 = new Object[i5];
        int i8 = i5 - 1;
        int i9 = 0;
        int i10 = 0;
        for (int i11 = 0; i11 < i; i11++) {
            Object obj2 = objArr[i11];
            if (obj2 == null) {
                throw new NullPointerException(AbstractC0844a.j("at index ", i11));
            }
            int iHashCode = obj2.hashCode();
            int iN = AbstractC0055q.n(iHashCode);
            while (true) {
                int i12 = iN & i8;
                Object obj3 = objArr2[i12];
                if (obj3 == null) {
                    objArr[i10] = obj2;
                    objArr2[i12] = obj2;
                    i9 += iHashCode;
                    i10++;
                    break;
                }
                if (obj3.equals(obj2)) {
                    break;
                }
                iN++;
            }
        }
        Arrays.fill(objArr, i10, i, (Object) null);
        if (i10 == 1) {
            Object obj4 = objArr[0];
            Objects.requireNonNull(obj4);
            return new i0(obj4);
        }
        if (i(i10) < i5 / 2) {
            return j(i10, objArr);
        }
        int length = objArr.length;
        if (i10 < (length >> 1) + (length >> 2)) {
            objArr = Arrays.copyOf(objArr, i10);
        }
        return new c0(i9, i8, i10, objArr, objArr2);
    }

    public static J k(Collection collection) {
        if ((collection instanceof J) && !(collection instanceof SortedSet)) {
            J j8 = (J) collection;
            if (!j8.h()) {
                return j8;
            }
        }
        Object[] array = collection.toArray();
        return j(array.length, array);
    }

    @Override // C3.B
    public G a() {
        G g8 = this.f1202r;
        if (g8 != null) {
            return g8;
        }
        G gL = l();
        this.f1202r = gL;
        return gL;
    }

    @Override // java.util.Collection, java.util.Set
    public final boolean equals(Object obj) {
        if (obj == this) {
            return true;
        }
        if ((obj instanceof J) && (this instanceof c0)) {
            J j8 = (J) obj;
            j8.getClass();
            if ((j8 instanceof c0) && hashCode() != obj.hashCode()) {
                return false;
            }
        }
        return AbstractC0055q.f(this, obj);
    }

    @Override // java.util.Collection, java.util.Set
    public int hashCode() {
        return AbstractC0055q.i(this);
    }

    public G l() {
        Object[] array = toArray(B.f1188q);
        E e8 = G.f1197r;
        return G.i(array.length, array);
    }

    @Override // java.util.AbstractCollection, java.util.Collection, java.lang.Iterable, java.util.Set
    /* JADX INFO: renamed from: n, reason: merged with bridge method [inline-methods] */
    public abstract k0 iterator();
}