39 lines
1.6 KiB
Java
39 lines
1.6 KiB
Java
package o;
|
|
|
|
import com.google.common.primitives.UnsignedBytes;
|
|
import com.huawei.hms.framework.common.ContainerUtils;
|
|
import org.bouncycastle.pqc.math.linearalgebra.Matrix;
|
|
|
|
/* renamed from: o.fQj, reason: case insensitive filesystem */
|
|
/* loaded from: classes5.dex */
|
|
public final class C13096fQj {
|
|
public static String d(byte[] bArr) {
|
|
char[] cArr = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', Matrix.MATRIX_TYPE_RANDOM_LT, 'M', 'N', 'O', 'P', 'Q', Matrix.MATRIX_TYPE_RANDOM_REGULAR, 'S', 'T', Matrix.MATRIX_TYPE_RANDOM_UT, 'V', 'W', 'X', 'Y', Matrix.MATRIX_TYPE_ZERO, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '+', '/'};
|
|
StringBuilder sb = new StringBuilder();
|
|
int i = 0;
|
|
for (int i2 = 0; i2 < bArr.length; i2 += 3) {
|
|
int i3 = ((bArr[i2] & UnsignedBytes.MAX_VALUE) << 16) & 16777215;
|
|
int i4 = i2 + 1;
|
|
if (i4 < bArr.length) {
|
|
i3 |= (bArr[i4] & UnsignedBytes.MAX_VALUE) << 8;
|
|
} else {
|
|
i++;
|
|
}
|
|
int i5 = i2 + 2;
|
|
if (i5 < bArr.length) {
|
|
i3 |= bArr[i5] & UnsignedBytes.MAX_VALUE;
|
|
} else {
|
|
i++;
|
|
}
|
|
for (int i6 = 0; i6 < 4 - i; i6++) {
|
|
sb.append(cArr[(16515072 & i3) >> 18]);
|
|
i3 <<= 6;
|
|
}
|
|
}
|
|
for (int i7 = 0; i7 < i; i7++) {
|
|
sb.append(ContainerUtils.KEY_VALUE_DELIMITER);
|
|
}
|
|
return sb.toString();
|
|
}
|
|
}
|