package androidx.compose.runtime;

import S4.w;
import androidx.compose.runtime.tooling.CompositionGroup;
import java.util.ArrayList;
import java.util.ConcurrentModificationException;
import java.util.Iterator;
import java.util.List;
import n.C2566A;
import n.C2567B;

/* JADX INFO: loaded from: classes.dex */
public final class SlotTableKt {
    private static final int Aux_Mask = 268435456;
    private static final int Aux_Shift = 28;
    private static final int ContainsMark_Mask = 67108864;
    private static final int ContainsMark_Shift = 26;
    private static final int DataAnchor_Offset = 4;
    private static final long[] EmptyLongArray = new long[0];
    private static final int GroupInfo_Offset = 1;
    private static final int Group_Fields_Size = 5;
    private static final int Key_Offset = 0;
    private static final int LIVE_EDIT_INVALID_KEY = -3;
    private static final int Mark_Mask = 134217728;
    private static final int Mark_Shift = 27;
    private static final int MinGroupGrowthSize = 32;
    private static final int MinSlotsGrowthSize = 32;
    private static final int NodeBit_Mask = 1073741824;
    private static final int NodeBit_Shift = 30;
    private static final int NodeCount_Mask = 67108863;
    private static final int ObjectKey_Mask = 536870912;
    private static final int ObjectKey_Shift = 29;
    private static final int ParentAnchor_Offset = 2;
    private static final int Size_Offset = 3;
    private static final int Slots_Shift = 28;
    private static final int parentAnchorPivot = -2;

    /* JADX INFO: Access modifiers changed from: private */
    public static final void add(C2566A c2566a, int i6, int i7) {
        C2567B c2567b = (C2567B) c2566a.b(i6);
        if (c2567b == null) {
            c2567b = new C2567B();
            c2566a.i(i6, c2567b);
        }
        c2567b.a(i7);
    }

    /* JADX INFO: Access modifiers changed from: private */
    public static final void addAux(int[] iArr, int i6) {
        int i7 = (i6 * 5) + 1;
        iArr[i7] = iArr[i7] | 268435456;
    }

    /* JADX INFO: Access modifiers changed from: private */
    public static final int auxIndex(int[] iArr, int i6) {
        int i7 = i6 * 5;
        if (i7 >= iArr.length) {
            return iArr.length;
        }
        return Integer.bitCount(iArr[i7 + 1] >> 29) + iArr[i7 + 4];
    }

    public static final CompositionGroup compositionGroupOf(SlotTable slotTable, int i6) {
        return new SlotTableGroup(slotTable, i6, slotTable.getVersion$runtime());
    }

    private static final boolean containsAnyMark(int[] iArr, int i6) {
        return (iArr[(i6 * 5) + 1] & 201326592) != 0;
    }

    private static final boolean containsMark(int[] iArr, int i6) {
        return (iArr[(i6 * 5) + 1] & ContainsMark_Mask) != 0;
    }

    private static final int countOneBits(int i6) {
        return Integer.bitCount(i6);
    }

    private static final int dataAnchor(int[] iArr, int i6) {
        return iArr[(i6 * 5) + 4];
    }

    /* JADX INFO: Access modifiers changed from: private */
    public static final List<Integer> dataAnchors(int[] iArr, int i6) {
        return slice(iArr, L4.a.i0(5, L4.a.l0(4, i6)));
    }

    public static /* synthetic */ List dataAnchors$default(int[] iArr, int i6, int i7, Object obj) {
        if ((i7 & 1) != 0) {
            i6 = iArr.length;
        }
        return dataAnchors(iArr, i6);
    }

    private static final <T> int fastIndexOf(ArrayList<T> arrayList, J4.c cVar) {
        int size = arrayList.size();
        for (int i6 = 0; i6 < size; i6++) {
            if (((Boolean) cVar.invoke(arrayList.get(i6))).booleanValue()) {
                return i6;
            }
        }
        return -1;
    }

    private static final <T> T fastLastOrNull(ArrayList<T> arrayList, J4.c cVar) {
        for (int size = arrayList.size() - 1; size >= 0; size--) {
            T t6 = arrayList.get(size);
            if (((Boolean) cVar.invoke(t6)).booleanValue()) {
                return t6;
            }
        }
        return null;
    }

    /* JADX INFO: Access modifiers changed from: private */
    public static final Anchor find(ArrayList<Anchor> arrayList, int i6, int i7) {
        int iSearch = search(arrayList, i6, i7);
        if (iSearch >= 0) {
            return arrayList.get(iSearch);
        }
        return null;
    }

    private static final int getFirstBitSet(long j4) {
        return Long.numberOfTrailingZeros(j4);
    }

    private static final Anchor getOrAdd(ArrayList<Anchor> arrayList, int i6, int i7, J4.a aVar) {
        int iSearch = search(arrayList, i6, i7);
        if (iSearch >= 0) {
            return arrayList.get(iSearch);
        }
        Anchor anchor = (Anchor) aVar.invoke();
        arrayList.add(-(iSearch + 1), anchor);
        return anchor;
    }

    private static final int groupInfo(int[] iArr, int i6) {
        return iArr[(i6 * 5) + 1];
    }

    /* JADX INFO: Access modifiers changed from: private */
    public static final int groupSize(int[] iArr, int i6) {
        return iArr[(i6 * 5) + 3];
    }

    /* JADX INFO: Access modifiers changed from: private */
    public static final List<Integer> groupSizes(int[] iArr, int i6) {
        return slice(iArr, L4.a.i0(5, L4.a.l0(3, i6)));
    }

    public static /* synthetic */ List groupSizes$default(int[] iArr, int i6, int i7, Object obj) {
        if ((i7 & 1) != 0) {
            i6 = iArr.length;
        }
        return groupSizes(iArr, i6);
    }

    private static final boolean hasAux(int[] iArr, int i6) {
        return (iArr[(i6 * 5) + 1] & 268435456) != 0;
    }

    private static final boolean hasMark(int[] iArr, int i6) {
        return (iArr[(i6 * 5) + 1] & 134217728) != 0;
    }

    private static final boolean hasObjectKey(int[] iArr, int i6) {
        return (iArr[(i6 * 5) + 1] & 536870912) != 0;
    }

    /* JADX INFO: Access modifiers changed from: private */
    public static final void initGroup(int[] iArr, int i6, int i7, boolean z6, boolean z7, boolean z8, int i8, int i9) {
        int i10 = i6 * 5;
        iArr[i10] = i7;
        iArr[i10 + 1] = ((z6 ? 1 : 0) << 30) | ((z7 ? 1 : 0) << 29) | ((z8 ? 1 : 0) << 28);
        iArr[i10 + 2] = i8;
        iArr[i10 + 3] = 0;
        iArr[i10 + 4] = i9;
    }

    private static final boolean isNode(int[] iArr, int i6) {
        return (iArr[(i6 * 5) + 1] & 1073741824) != 0;
    }

    private static final int key(int[] iArr, int i6) {
        return iArr[i6 * 5];
    }

    /* JADX INFO: Access modifiers changed from: private */
    public static final List<Integer> keys(int[] iArr, int i6) {
        return slice(iArr, L4.a.i0(5, L4.a.l0(0, i6)));
    }

    public static /* synthetic */ List keys$default(int[] iArr, int i6, int i7, Object obj) {
        if ((i7 & 1) != 0) {
            i6 = iArr.length;
        }
        return keys(iArr, i6);
    }

    /* JADX INFO: Access modifiers changed from: private */
    public static final int locationOf(ArrayList<Anchor> arrayList, int i6, int i7) {
        int iSearch = search(arrayList, i6, i7);
        return iSearch >= 0 ? iSearch : -(iSearch + 1);
    }

    private static final int nodeCount(int[] iArr, int i6) {
        return iArr[(i6 * 5) + 1] & NodeCount_Mask;
    }

    /* JADX INFO: Access modifiers changed from: private */
    public static final List<Integer> nodeCounts(int[] iArr, int i6) {
        List<Integer> listSlice = slice(iArr, L4.a.i0(5, L4.a.l0(1, i6)));
        ArrayList arrayList = new ArrayList(listSlice.size());
        int size = listSlice.size();
        for (int i7 = 0; i7 < size; i7++) {
            arrayList.add(Integer.valueOf(listSlice.get(i7).intValue() & NodeCount_Mask));
        }
        return arrayList;
    }

    public static /* synthetic */ List nodeCounts$default(int[] iArr, int i6, int i7, Object obj) {
        if ((i7 & 1) != 0) {
            i6 = iArr.length;
        }
        return nodeCounts(iArr, i6);
    }

    private static final int nodeIndex(int[] iArr, int i6) {
        return iArr[(i6 * 5) + 4];
    }

    /* JADX INFO: Access modifiers changed from: private */
    public static final int objectKeyIndex(int[] iArr, int i6) {
        int i7 = i6 * 5;
        return Integer.bitCount(iArr[i7 + 1] >> 30) + iArr[i7 + 4];
    }

    private static final int parentAnchor(int[] iArr, int i6) {
        return iArr[(i6 * 5) + 2];
    }

    /* JADX INFO: Access modifiers changed from: private */
    public static final List<Integer> parentAnchors(int[] iArr, int i6) {
        return slice(iArr, L4.a.i0(5, L4.a.l0(2, i6)));
    }

    public static /* synthetic */ List parentAnchors$default(int[] iArr, int i6, int i7, Object obj) {
        if ((i7 & 1) != 0) {
            i6 = iArr.length;
        }
        return parentAnchors(iArr, i6);
    }

    /* JADX INFO: Access modifiers changed from: private */
    public static final int search(ArrayList<Anchor> arrayList, int i6, int i7) {
        int size = arrayList.size() - 1;
        int i8 = 0;
        while (i8 <= size) {
            int i9 = (i8 + size) >>> 1;
            int location$runtime = arrayList.get(i9).getLocation$runtime();
            if (location$runtime < 0) {
                location$runtime += i7;
            }
            int i10 = kotlin.jvm.internal.o.i(location$runtime, i6);
            if (i10 < 0) {
                i8 = i9 + 1;
            } else {
                if (i10 <= 0) {
                    return i9;
                }
                size = i9 - 1;
            }
        }
        return -(i8 + 1);
    }

    private static final List<Integer> slice(int[] iArr, Iterable<Integer> iterable) {
        ArrayList arrayList = new ArrayList();
        Iterator<Integer> it = iterable.iterator();
        while (it.hasNext()) {
            arrayList.add(Integer.valueOf(iArr[it.next().intValue()]));
        }
        return arrayList;
    }

    /* JADX INFO: Access modifiers changed from: private */
    public static final int slotAnchor(int[] iArr, int i6) {
        int i7 = i6 * 5;
        return Integer.bitCount(iArr[i7 + 1] >> 28) + iArr[i7 + 4];
    }

    /* JADX INFO: Access modifiers changed from: private */
    public static final String summarize(String str, int i6) {
        String strY0 = w.y0(w.y0(w.y0(w.y0(w.y0(w.y0(w.y0(w.y0(w.y0(w.y0(str, "androidx.", "a."), "compose.", "c."), "runtime.", "r."), "internal.", "ι."), "ui.", "u."), "Modifier", "μ"), "material.", "m."), "Function", "λ"), "OpaqueKey", "κ"), "MutableState", "σ");
        String strSubstring = strY0.substring(0, Math.min(i6, strY0.length()));
        kotlin.jvm.internal.o.g(strSubstring, "substring(...)");
        return strSubstring;
    }

    public static final void throwConcurrentModificationException() {
        throw new ConcurrentModificationException();
    }

    private static final int toBit(boolean z6) {
        return z6 ? 1 : 0;
    }

    /* JADX INFO: Access modifiers changed from: private */
    public static final void updateContainsMark(int[] iArr, int i6, boolean z6) {
        int i7 = (i6 * 5) + 1;
        iArr[i7] = ((z6 ? 1 : 0) << 26) | (iArr[i7] & (-67108865));
    }

    private static final void updateDataAnchor(int[] iArr, int i6, int i7) {
        iArr[(i6 * 5) + 4] = i7;
    }

    /* JADX INFO: Access modifiers changed from: private */
    public static final void updateGroupKey(int[] iArr, int i6, int i7) {
        iArr[i6 * 5] = i7;
    }

    /* JADX INFO: Access modifiers changed from: private */
    public static final void updateGroupSize(int[] iArr, int i6, int i7) {
        iArr[(i6 * 5) + 3] = i7;
    }

    /* JADX INFO: Access modifiers changed from: private */
    public static final void updateMark(int[] iArr, int i6, boolean z6) {
        int i7 = (i6 * 5) + 1;
        iArr[i7] = ((z6 ? 1 : 0) << 27) | (iArr[i7] & (-134217729));
    }

    /* JADX INFO: Access modifiers changed from: private */
    public static final void updateNodeCount(int[] iArr, int i6, int i7) {
        if (i7 >= 0) {
        }
        int i8 = (i6 * 5) + 1;
        iArr[i8] = i7 | (iArr[i8] & (-67108864));
    }

    private static final void updateParentAnchor(int[] iArr, int i6, int i7) {
        iArr[(i6 * 5) + 2] = i7;
    }
}