package androidx.compose.runtime.external.kotlinx.collections.immutable.implementations.immutableSet;

import J4.c;
import androidx.compose.runtime.external.kotlinx.collections.immutable.internal.CommonFunctionsKt;
import x4.AbstractC3250p;

/* JADX INFO: loaded from: classes.dex */
public final class TrieNodeKt {
    public static final int LOG_MAX_BRANCHING_FACTOR = 5;
    public static final int MAX_BRANCHING_FACTOR = 32;
    public static final int MAX_BRANCHING_FACTOR_MINUS_ONE = 31;
    public static final int MAX_SHIFT = 30;

    /* JADX INFO: Access modifiers changed from: private */
    public static final <E> Object[] addElementAtIndex(Object[] objArr, int i6, E e6) {
        Object[] objArr2 = new Object[objArr.length + 1];
        AbstractC3250p.E(objArr, 0, objArr2, i6, 6);
        AbstractC3250p.B(objArr, i6 + 1, objArr2, i6, objArr.length);
        objArr2[i6] = e6;
        return objArr2;
    }

    private static final int filterTo(Object[] objArr, Object[] objArr2, int i6, c cVar) {
        int i7 = 0;
        int i8 = 0;
        while (i7 < objArr.length) {
            CommonFunctionsKt.m197assert(i8 <= i7);
            if (((Boolean) cVar.invoke(objArr[i7])).booleanValue()) {
                objArr2[i6 + i8] = objArr[i7];
                i8++;
                CommonFunctionsKt.m197assert(i6 + i8 <= objArr2.length);
            }
            i7++;
        }
        return i8;
    }

    public static /* synthetic */ int filterTo$default(Object[] objArr, Object[] objArr2, int i6, c cVar, int i7, Object obj) {
        if ((i7 & 2) != 0) {
            i6 = 0;
        }
        if ((i7 & 4) != 0) {
            cVar = new c() { // from class: androidx.compose.runtime.external.kotlinx.collections.immutable.implementations.immutableSet.TrieNodeKt.filterTo.1
                @Override // J4.c
                public final Boolean invoke(Object obj2) {
                    return Boolean.valueOf(obj2 != TrieNode.Companion.getEMPTY$runtime());
                }
            };
        }
        int i8 = 0;
        int i9 = 0;
        while (i8 < objArr.length) {
            CommonFunctionsKt.m197assert(i9 <= i8);
            if (((Boolean) cVar.invoke(objArr[i8])).booleanValue()) {
                objArr2[i6 + i9] = objArr[i8];
                i9++;
                CommonFunctionsKt.m197assert(i6 + i9 <= objArr2.length);
            }
            i8++;
        }
        return i9;
    }

    public static final int indexSegment(int i6, int i7) {
        return (i6 >> i7) & 31;
    }

    /* JADX INFO: Access modifiers changed from: private */
    public static final Object[] removeCellAtIndex(Object[] objArr, int i6) {
        Object[] objArr2 = new Object[objArr.length - 1];
        AbstractC3250p.E(objArr, 0, objArr2, i6, 6);
        AbstractC3250p.B(objArr, i6, objArr2, i6 + 1, objArr.length);
        return objArr2;
    }
}