package com.mbridge.msdk.foundation.tools;

import androidx.work.WorkInfo;
import com.mbridge.msdk.foundation.tools.FastKV;
import java.util.LinkedHashSet;
import java.util.Set;

/* loaded from: classes4.dex */
final class ao implements FastKV.a<Set<String>> {
    static final ao a = new ao();

    @Override // com.mbridge.msdk.foundation.tools.FastKV.a
    public final String a() {
        return "StringSet";
    }

    @Override // com.mbridge.msdk.foundation.tools.FastKV.a
    public final /* synthetic */ byte[] a(Set<String> set) {
        Set<String> set2 = set;
        if (set2.isEmpty()) {
            return new byte[0];
        }
        int size = set2.size();
        int[] iArr = new int[size];
        String[] strArr = new String[size];
        int i = 0;
        int i2 = 0;
        for (String str : set2) {
            if (str == null) {
                i += 5;
                iArr[i2] = -1;
            } else {
                int a2 = q.a(str);
                strArr[i2] = str;
                iArr[i2] = a2;
                i += ((a2 >> 7) == 0 ? 1 : (a2 >> 14) == 0 ? 2 : (a2 >> 21) == 0 ? 3 : (a2 >> 28) == 0 ? 4 : 5) + a2;
            }
            i2++;
        }
        q qVar = new q(i);
        for (int i3 = 0; i3 < size; i3++) {
            int i4 = iArr[i3];
            int i5 = qVar.b;
            int i6 = i4;
            while ((i6 & WorkInfo.STOP_REASON_FOREGROUND_SERVICE_TIMEOUT) != 0) {
                qVar.a[i5] = (byte) ((i6 & 127) | 128);
                i6 >>>= 7;
                i5++;
            }
            qVar.a[i5] = (byte) i6;
            qVar.b = i5 + 1;
            if (i4 >= 0) {
                qVar.b(strArr[i3]);
            }
        }
        return qVar.a;
    }

    private ao() {
    }

    @Override // com.mbridge.msdk.foundation.tools.FastKV.a
    public final /* synthetic */ Set<String> a(byte[] bArr, int i, int i2) {
        int i3;
        LinkedHashSet linkedHashSet = new LinkedHashSet();
        if (i2 > 0) {
            q qVar = new q(bArr, i);
            int i4 = i + i2;
            while (true) {
                i3 = qVar.b;
                if (i3 >= i4) {
                    break;
                }
                byte[] bArr2 = qVar.a;
                int i5 = i3 + 1;
                qVar.b = i5;
                int i6 = bArr2[i3];
                if ((i6 >> 7) != 0) {
                    int i7 = i3 + 2;
                    qVar.b = i7;
                    i6 = (i6 & 127) | (bArr2[i5] << 7);
                    if ((i6 >> 14) != 0) {
                        int i8 = i6 & 16383;
                        int i9 = i3 + 3;
                        qVar.b = i9;
                        int i10 = i8 | (bArr2[i7] << 14);
                        if ((i10 >> 21) == 0) {
                            i6 = i10;
                        } else {
                            int i11 = i3 + 4;
                            qVar.b = i11;
                            i6 = (bArr2[i9] << 21) | (i10 & 2097151);
                            if ((i6 >> 28) != 0) {
                                qVar.b = i3 + 5;
                                i6 = (268435455 & i6) | (bArr2[i11] << 28);
                            }
                        }
                    }
                }
                linkedHashSet.add(qVar.a(i6));
            }
            if (i3 != i4) {
                throw new IllegalArgumentException("Invalid String set");
            }
        }
        return linkedHashSet;
    }
}