203 lines
6.8 KiB
Java
203 lines
6.8 KiB
Java
package c.a.r;
|
|
|
|
import com.discord.rtcconnection.EncodeQuality;
|
|
import d0.t.n0;
|
|
import d0.t.u;
|
|
import d0.z.d.m;
|
|
import java.util.ArrayList;
|
|
import java.util.LinkedHashMap;
|
|
import java.util.List;
|
|
import java.util.ListIterator;
|
|
import java.util.Map;
|
|
import java.util.Set;
|
|
import kotlin.jvm.internal.DefaultConstructorMarker;
|
|
/* compiled from: MediaSinkWantsLadder.kt */
|
|
public final class d {
|
|
public static final b a = new b(null);
|
|
public final int b;
|
|
|
|
/* renamed from: c reason: collision with root package name */
|
|
public final Map<EncodeQuality, m> f200c;
|
|
public final List<c> d;
|
|
public final f0 e;
|
|
|
|
/* compiled from: MediaSinkWantsLadder.kt */
|
|
public static final class a {
|
|
public final int a;
|
|
public final int b;
|
|
|
|
/* renamed from: c reason: collision with root package name */
|
|
public final double f201c;
|
|
public final int d;
|
|
|
|
public a(int i, int i2, double d, int i3) {
|
|
this.a = i;
|
|
this.b = i2;
|
|
this.f201c = d;
|
|
this.d = i3;
|
|
}
|
|
|
|
public boolean equals(Object obj) {
|
|
if (this == obj) {
|
|
return true;
|
|
}
|
|
if (!(obj instanceof a)) {
|
|
return false;
|
|
}
|
|
a aVar = (a) obj;
|
|
return this.a == aVar.a && this.b == aVar.b && Double.compare(this.f201c, aVar.f201c) == 0 && this.d == aVar.d;
|
|
}
|
|
|
|
public int hashCode() {
|
|
return ((a0.a.a.a.a(this.f201c) + (((this.a * 31) + this.b) * 31)) * 31) + this.d;
|
|
}
|
|
|
|
public String toString() {
|
|
StringBuilder L = c.d.b.a.a.L("CandidateResolution(width=");
|
|
L.append(this.a);
|
|
L.append(", height=");
|
|
L.append(this.b);
|
|
L.append(", budgetPortion=");
|
|
L.append(this.f201c);
|
|
L.append(", pixelCount=");
|
|
return c.d.b.a.a.z(L, this.d, ")");
|
|
}
|
|
}
|
|
|
|
/* compiled from: MediaSinkWantsLadder.kt */
|
|
public static final class b {
|
|
public b(DefaultConstructorMarker defaultConstructorMarker) {
|
|
}
|
|
}
|
|
|
|
/* compiled from: MediaSinkWantsLadder.kt */
|
|
public static final class c {
|
|
public final m a;
|
|
public final int b;
|
|
|
|
/* renamed from: c reason: collision with root package name */
|
|
public final EncodeQuality f202c;
|
|
|
|
public c(m mVar, int i, EncodeQuality encodeQuality) {
|
|
m.checkNotNullParameter(mVar, "budget");
|
|
m.checkNotNullParameter(encodeQuality, "wantValue");
|
|
this.a = mVar;
|
|
this.b = i;
|
|
this.f202c = encodeQuality;
|
|
}
|
|
|
|
public boolean equals(Object obj) {
|
|
if (this == obj) {
|
|
return true;
|
|
}
|
|
if (!(obj instanceof c)) {
|
|
return false;
|
|
}
|
|
c cVar = (c) obj;
|
|
return m.areEqual(this.a, cVar.a) && this.b == cVar.b && m.areEqual(this.f202c, cVar.f202c);
|
|
}
|
|
|
|
public int hashCode() {
|
|
m mVar = this.a;
|
|
int i = 0;
|
|
int hashCode = (((mVar != null ? mVar.hashCode() : 0) * 31) + this.b) * 31;
|
|
EncodeQuality encodeQuality = this.f202c;
|
|
if (encodeQuality != null) {
|
|
i = encodeQuality.hashCode();
|
|
}
|
|
return hashCode + i;
|
|
}
|
|
|
|
public String toString() {
|
|
StringBuilder L = c.d.b.a.a.L("OrderedLadder(budget=");
|
|
L.append(this.a);
|
|
L.append(", pixelCount=");
|
|
L.append(this.b);
|
|
L.append(", wantValue=");
|
|
L.append(this.f202c);
|
|
L.append(")");
|
|
return L.toString();
|
|
}
|
|
}
|
|
|
|
public d(f0 f0Var, int i) {
|
|
m mVar;
|
|
Object obj;
|
|
int i2;
|
|
EncodeQuality encodeQuality;
|
|
boolean z2;
|
|
f0 f0Var2 = (i & 1) != 0 ? e.a : null;
|
|
m.checkNotNullParameter(f0Var2, "options");
|
|
this.e = f0Var2;
|
|
b bVar = f0Var2.a;
|
|
int i3 = bVar.a * bVar.b;
|
|
this.b = i3;
|
|
Set of = n0.setOf((Object[]) new Double[]{Double.valueOf(0.0d), Double.valueOf(4.0d), Double.valueOf(8.0d), Double.valueOf(10.0d)});
|
|
ArrayList arrayList = new ArrayList();
|
|
for (int i4 = 1; i4 < 4096; i4++) {
|
|
double d = (double) i4;
|
|
double d2 = (d * 16.0d) / 9.0d;
|
|
if (of.contains(Double.valueOf(d2 % 16.0d)) && of.contains(Double.valueOf(d % 16.0d))) {
|
|
double d3 = d * d2;
|
|
arrayList.add(new a((int) d2, i4, d3 / ((double) i3), (int) d3));
|
|
}
|
|
}
|
|
LinkedHashMap linkedHashMap = new LinkedHashMap();
|
|
EncodeQuality encodeQuality2 = EncodeQuality.Hundred;
|
|
int i5 = 1;
|
|
int i6 = 0;
|
|
while (i5 <= 25) {
|
|
ListIterator listIterator = arrayList.listIterator(arrayList.size());
|
|
while (true) {
|
|
if (!listIterator.hasPrevious()) {
|
|
obj = null;
|
|
break;
|
|
}
|
|
obj = listIterator.previous();
|
|
if (((a) obj).d * i5 <= i3) {
|
|
z2 = true;
|
|
continue;
|
|
} else {
|
|
z2 = false;
|
|
continue;
|
|
}
|
|
if (z2) {
|
|
break;
|
|
}
|
|
}
|
|
a aVar = (a) obj;
|
|
aVar = aVar == null ? (a) u.first((List<? extends Object>) arrayList) : aVar;
|
|
if (i6 != aVar.a) {
|
|
i2 = i3;
|
|
linkedHashMap.put(encodeQuality2, new m(aVar.a, aVar.b, aVar.f201c, encodeQuality2.compareTo(EncodeQuality.Twenty) <= 0 ? 12 : 20, 30));
|
|
EncodeQuality[] values = EncodeQuality.values();
|
|
int i7 = 10;
|
|
while (true) {
|
|
if (i7 < 0) {
|
|
encodeQuality = null;
|
|
break;
|
|
}
|
|
encodeQuality = values[i7];
|
|
if (encodeQuality.getValue() < encodeQuality2.getValue()) {
|
|
break;
|
|
}
|
|
i7--;
|
|
}
|
|
encodeQuality2 = encodeQuality == null ? EncodeQuality.Zero : encodeQuality;
|
|
i6 = aVar.a;
|
|
} else {
|
|
i2 = i3;
|
|
}
|
|
i5++;
|
|
i3 = i2;
|
|
}
|
|
this.f200c = linkedHashMap;
|
|
EncodeQuality[] values2 = EncodeQuality.values();
|
|
ArrayList arrayList2 = new ArrayList(11);
|
|
for (int i8 = 0; i8 < 11; i8++) {
|
|
EncodeQuality encodeQuality3 = values2[i8];
|
|
arrayList2.add((encodeQuality3 == EncodeQuality.Zero || (mVar = (m) linkedHashMap.get(encodeQuality3)) == null) ? null : new c(mVar, mVar.b * mVar.a, encodeQuality3));
|
|
}
|
|
this.d = u.filterNotNull(arrayList2);
|
|
}
|
|
}
|