package n;

import java.util.Collection;
import java.util.Iterator;
import java.util.Set;

/* JADX INFO: loaded from: classes.dex */
public final class M implements K4.f, Set, K4.a {

    /* JADX INFO: renamed from: a, reason: collision with root package name */
    public final K f21354a;

    /* JADX INFO: renamed from: b, reason: collision with root package name */
    public final K f21355b;

    public M(K parent) {
        kotlin.jvm.internal.o.h(parent, "parent");
        this.f21354a = parent;
        this.f21355b = parent;
    }

    @Override // java.util.Set, java.util.Collection
    public final boolean add(Object obj) {
        return this.f21355b.a(obj);
    }

    @Override // java.util.Set, java.util.Collection
    public final boolean addAll(Collection elements) {
        kotlin.jvm.internal.o.h(elements, "elements");
        K k6 = this.f21355b;
        k6.getClass();
        int i6 = k6.f21344g;
        for (Object obj : elements) {
            int iD = k6.d(obj);
            k6.f21339b[iD] = obj;
            long[] jArr = k6.f21340c;
            int i7 = k6.f21341d;
            jArr[iD] = (((long) i7) & 2147483647L) | 4611686016279904256L;
            if (i7 != Integer.MAX_VALUE) {
                jArr[i7] = ((((long) iD) & 2147483647L) << 31) | (jArr[i7] & (-4611686016279904257L));
            }
            k6.f21341d = iD;
            if (k6.f21342e == Integer.MAX_VALUE) {
                k6.f21342e = iD;
            }
        }
        return i6 != k6.f21344g;
    }

    @Override // java.util.Set, java.util.Collection
    public final void clear() {
        this.f21355b.b();
    }

    @Override // java.util.Set, java.util.Collection
    public final boolean contains(Object obj) {
        return this.f21354a.c(obj);
    }

    @Override // java.util.Set, java.util.Collection
    public final boolean containsAll(Collection elements) {
        kotlin.jvm.internal.o.h(elements, "elements");
        Iterator it = elements.iterator();
        while (it.hasNext()) {
            if (!this.f21354a.c(it.next())) {
                return false;
            }
        }
        return true;
    }

    @Override // java.util.Set, java.util.Collection
    public final boolean equals(Object obj) {
        if (this == obj) {
            return true;
        }
        if (obj == null || M.class != obj.getClass()) {
            return false;
        }
        return kotlin.jvm.internal.o.c(this.f21354a, ((M) obj).f21354a);
    }

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

    @Override // java.util.Set, java.util.Collection
    public final boolean isEmpty() {
        return this.f21354a.f21344g == 0;
    }

    @Override // java.util.Set, java.util.Collection, java.lang.Iterable
    public final Iterator iterator() {
        return new R4.i(this);
    }

    @Override // java.util.Set, java.util.Collection
    public final boolean remove(Object obj) {
        return this.f21355b.g(obj);
    }

    /* JADX WARN: Code restructure failed: missing block: B:18:0x0093, code lost:
    
        if (((r5 & ((~r5) << 6)) & r12) == 0) goto L22;
     */
    /* JADX WARN: Code restructure failed: missing block: B:19:0x0095, code lost:
    
        r14 = -1;
     */
    @Override // java.util.Set, java.util.Collection
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public final boolean removeAll(Collection elements) {
        int iNumberOfTrailingZeros;
        kotlin.jvm.internal.o.h(elements, "elements");
        K k6 = this.f21355b;
        k6.getClass();
        int i6 = k6.f21344g;
        Iterator it = elements.iterator();
        while (true) {
            int i7 = 1;
            int i8 = 0;
            if (!it.hasNext()) {
                break;
            }
            Object next = it.next();
            int iHashCode = (next != null ? next.hashCode() : 0) * (-862048943);
            int i9 = iHashCode ^ (iHashCode << 16);
            int i10 = i9 & 127;
            int i11 = k6.f21343f;
            int i12 = (i9 >>> 7) & i11;
            while (true) {
                long[] jArr = k6.f21338a;
                int i13 = i12 >> 3;
                int i14 = (i12 & 7) << 3;
                int i15 = i7;
                int i16 = i8;
                long j4 = (((-i14) >> 63) & (jArr[i13 + i7] << (64 - i14))) | (jArr[i13] >>> i14);
                long j6 = (((long) i10) * 72340172838076673L) ^ j4;
                long j7 = -9187201950435737472L;
                long j8 = (~j6) & (j6 - 72340172838076673L) & (-9187201950435737472L);
                while (true) {
                    if (j8 == 0) {
                        break;
                    }
                    iNumberOfTrailingZeros = ((Long.numberOfTrailingZeros(j8) >> 3) + i12) & i11;
                    long j9 = j7;
                    if (kotlin.jvm.internal.o.c(k6.f21339b[iNumberOfTrailingZeros], next)) {
                        break;
                    }
                    j8 &= j8 - 1;
                    j7 = j9;
                }
                i8 = i16 + 8;
                i12 = (i12 + i8) & i11;
                i7 = i15;
            }
            if (iNumberOfTrailingZeros >= 0) {
                k6.h(iNumberOfTrailingZeros);
            }
        }
        return i6 != k6.f21344g;
    }

    @Override // java.util.Set, java.util.Collection
    public final boolean retainAll(Collection elements) {
        kotlin.jvm.internal.o.h(elements, "elements");
        return this.f21355b.i(elements);
    }

    @Override // java.util.Set, java.util.Collection
    public final int size() {
        return this.f21354a.f21344g;
    }

    @Override // java.util.Set, java.util.Collection
    public final Object[] toArray() {
        return kotlin.jvm.internal.n.a(this);
    }

    public final String toString() {
        return this.f21354a.toString();
    }

    @Override // java.util.Set, java.util.Collection
    public final Object[] toArray(Object[] array) {
        kotlin.jvm.internal.o.h(array, "array");
        return kotlin.jvm.internal.n.b(this, array);
    }
}
