117 lines
2.6 KiB
Java
117 lines
2.6 KiB
Java
|
package o;
|
||
|
|
|
||
|
|
import com.airbnb.deeplinkdispatch.UrlTreeKt;
|
||
|
|
import java.util.ArrayList;
|
||
|
|
import java.util.Iterator;
|
||
|
|
import java.util.List;
|
||
|
|
|
||
|
|
/* loaded from: classes.dex */
|
||
|
|
public class KMk implements rZk {
|
||
|
|
int c;
|
||
|
|
Bgk g;
|
||
|
|
public int l;
|
||
|
|
public rZk n = null;
|
||
|
|
public boolean a = false;
|
||
|
|
public boolean f = false;
|
||
|
|
LWm h = LWm.UNKNOWN;
|
||
|
|
int e = 1;
|
||
|
|
FgJ b = null;
|
||
|
|
public boolean j = false;
|
||
|
|
List<rZk> d = new ArrayList();
|
||
|
|
List<KMk> i = new ArrayList();
|
||
|
|
|
||
|
|
/* loaded from: classes.dex */
|
||
|
|
enum LWm {
|
||
|
|
UNKNOWN,
|
||
|
|
HORIZONTAL_DIMENSION,
|
||
|
|
VERTICAL_DIMENSION,
|
||
|
|
LEFT,
|
||
|
|
RIGHT,
|
||
|
|
TOP,
|
||
|
|
BOTTOM,
|
||
|
|
BASELINE
|
||
|
|
}
|
||
|
|
|
||
|
|
public KMk(Bgk bgk) {
|
||
|
|
this.g = bgk;
|
||
|
|
}
|
||
|
|
|
||
|
|
public String toString() {
|
||
|
|
StringBuilder sb = new StringBuilder();
|
||
|
|
sb.append(this.g.l.r);
|
||
|
|
sb.append(":");
|
||
|
|
sb.append(this.h);
|
||
|
|
sb.append("(");
|
||
|
|
sb.append(this.j ? Integer.valueOf(this.l) : "unresolved");
|
||
|
|
sb.append(") <t=");
|
||
|
|
sb.append(this.i.size());
|
||
|
|
sb.append(":d=");
|
||
|
|
sb.append(this.d.size());
|
||
|
|
sb.append(UrlTreeKt.configurablePathSegmentSuffix);
|
||
|
|
return sb.toString();
|
||
|
|
}
|
||
|
|
|
||
|
|
public void d(int i) {
|
||
|
|
if (this.j) {
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
this.j = true;
|
||
|
|
this.l = i;
|
||
|
|
Iterator<rZk> it = this.d.iterator();
|
||
|
|
while (it.hasNext()) {
|
||
|
|
it.next().g();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
@Override // o.rZk
|
||
|
|
public final void g() {
|
||
|
|
Iterator<KMk> it = this.i.iterator();
|
||
|
|
while (it.hasNext()) {
|
||
|
|
if (!it.next().j) {
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
this.f = true;
|
||
|
|
rZk rzk = this.n;
|
||
|
|
if (rzk != null) {
|
||
|
|
rzk.g();
|
||
|
|
}
|
||
|
|
if (this.a) {
|
||
|
|
this.g.g();
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
KMk kMk = null;
|
||
|
|
int i = 0;
|
||
|
|
for (KMk kMk2 : this.i) {
|
||
|
|
if (!(kMk2 instanceof FgJ)) {
|
||
|
|
i++;
|
||
|
|
kMk = kMk2;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if (kMk != null && i == 1 && kMk.j) {
|
||
|
|
FgJ fgJ = this.b;
|
||
|
|
if (fgJ != null) {
|
||
|
|
if (!fgJ.j) {
|
||
|
|
return;
|
||
|
|
} else {
|
||
|
|
this.c = this.e * fgJ.l;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
d(kMk.l + this.c);
|
||
|
|
}
|
||
|
|
rZk rzk2 = this.n;
|
||
|
|
if (rzk2 != null) {
|
||
|
|
rzk2.g();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
public final void e() {
|
||
|
|
this.i.clear();
|
||
|
|
this.d.clear();
|
||
|
|
this.j = false;
|
||
|
|
this.l = 0;
|
||
|
|
this.f = false;
|
||
|
|
this.a = false;
|
||
|
|
}
|
||
|
|
}
|