220 lines
5.7 KiB
Java
220 lines
5.7 KiB
Java
package o;
|
|
|
|
import android.graphics.Typeface;
|
|
import java.util.ArrayList;
|
|
import java.util.Iterator;
|
|
import java.util.List;
|
|
import o.InterfaceC17394wQe;
|
|
import o.OFJ;
|
|
|
|
/* loaded from: classes.dex */
|
|
public abstract class JfG<T extends InterfaceC17394wQe<? extends Lhm>> {
|
|
public float a;
|
|
protected List<T> b;
|
|
public float c;
|
|
public float d;
|
|
public float e;
|
|
private float g;
|
|
public float h;
|
|
public float i;
|
|
private float j;
|
|
|
|
public JfG() {
|
|
this.h = -3.4028235E38f;
|
|
this.i = Float.MAX_VALUE;
|
|
this.j = -3.4028235E38f;
|
|
this.g = Float.MAX_VALUE;
|
|
this.c = -3.4028235E38f;
|
|
this.d = Float.MAX_VALUE;
|
|
this.e = -3.4028235E38f;
|
|
this.a = Float.MAX_VALUE;
|
|
this.b = new ArrayList();
|
|
}
|
|
|
|
public JfG(T... tArr) {
|
|
T t;
|
|
T t2;
|
|
this.h = -3.4028235E38f;
|
|
this.i = Float.MAX_VALUE;
|
|
this.j = -3.4028235E38f;
|
|
this.g = Float.MAX_VALUE;
|
|
this.c = -3.4028235E38f;
|
|
this.d = Float.MAX_VALUE;
|
|
this.e = -3.4028235E38f;
|
|
this.a = Float.MAX_VALUE;
|
|
ArrayList<InterfaceC17394wQe> arrayList = new ArrayList();
|
|
int length = tArr.length;
|
|
for (int i = 0; i <= 0; i++) {
|
|
arrayList.add(tArr[0]);
|
|
}
|
|
this.b = arrayList;
|
|
this.h = -3.4028235E38f;
|
|
this.i = Float.MAX_VALUE;
|
|
this.j = -3.4028235E38f;
|
|
this.g = Float.MAX_VALUE;
|
|
for (InterfaceC17394wQe interfaceC17394wQe : arrayList) {
|
|
if (this.h < interfaceC17394wQe.x()) {
|
|
this.h = interfaceC17394wQe.x();
|
|
}
|
|
if (this.i > interfaceC17394wQe.y()) {
|
|
this.i = interfaceC17394wQe.y();
|
|
}
|
|
if (this.j < interfaceC17394wQe.q()) {
|
|
this.j = interfaceC17394wQe.q();
|
|
}
|
|
if (this.g > interfaceC17394wQe.w()) {
|
|
this.g = interfaceC17394wQe.w();
|
|
}
|
|
if (interfaceC17394wQe.e() == OFJ.RVV.LEFT) {
|
|
if (this.c < interfaceC17394wQe.x()) {
|
|
this.c = interfaceC17394wQe.x();
|
|
}
|
|
if (this.d > interfaceC17394wQe.y()) {
|
|
this.d = interfaceC17394wQe.y();
|
|
}
|
|
} else {
|
|
if (this.e < interfaceC17394wQe.x()) {
|
|
this.e = interfaceC17394wQe.x();
|
|
}
|
|
if (this.a > interfaceC17394wQe.y()) {
|
|
this.a = interfaceC17394wQe.y();
|
|
}
|
|
}
|
|
}
|
|
this.c = -3.4028235E38f;
|
|
this.d = Float.MAX_VALUE;
|
|
this.e = -3.4028235E38f;
|
|
this.a = Float.MAX_VALUE;
|
|
Iterator<T> it = this.b.iterator();
|
|
while (true) {
|
|
t = null;
|
|
if (it.hasNext()) {
|
|
t2 = it.next();
|
|
if (t2.e() == OFJ.RVV.LEFT) {
|
|
break;
|
|
}
|
|
} else {
|
|
t2 = null;
|
|
break;
|
|
}
|
|
}
|
|
if (t2 != null) {
|
|
this.c = t2.x();
|
|
this.d = t2.y();
|
|
for (T t3 : this.b) {
|
|
if (t3.e() == OFJ.RVV.LEFT) {
|
|
if (t3.y() < this.d) {
|
|
this.d = t3.y();
|
|
}
|
|
if (t3.x() > this.c) {
|
|
this.c = t3.x();
|
|
}
|
|
}
|
|
}
|
|
}
|
|
Iterator<T> it2 = this.b.iterator();
|
|
while (true) {
|
|
if (!it2.hasNext()) {
|
|
break;
|
|
}
|
|
T next = it2.next();
|
|
if (next.e() == OFJ.RVV.RIGHT) {
|
|
t = next;
|
|
break;
|
|
}
|
|
}
|
|
if (t != null) {
|
|
this.e = t.x();
|
|
this.a = t.y();
|
|
for (T t4 : this.b) {
|
|
if (t4.e() == OFJ.RVV.RIGHT) {
|
|
if (t4.y() < this.a) {
|
|
this.a = t4.y();
|
|
}
|
|
if (t4.x() > this.e) {
|
|
this.e = t4.x();
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
public final int e() {
|
|
List<T> list = this.b;
|
|
if (list == null) {
|
|
return 0;
|
|
}
|
|
return list.size();
|
|
}
|
|
|
|
public T c(int i) {
|
|
List<T> list = this.b;
|
|
if (list == null || i < 0 || i >= list.size()) {
|
|
return null;
|
|
}
|
|
return this.b.get(i);
|
|
}
|
|
|
|
public final void b(vTS vts) {
|
|
Iterator<T> it = this.b.iterator();
|
|
while (it.hasNext()) {
|
|
it.next().d(vts);
|
|
}
|
|
}
|
|
|
|
public final void a() {
|
|
Iterator<T> it = this.b.iterator();
|
|
while (it.hasNext()) {
|
|
it.next().s();
|
|
}
|
|
}
|
|
|
|
public final void Gy_(Typeface typeface) {
|
|
Iterator<T> it = this.b.iterator();
|
|
while (it.hasNext()) {
|
|
it.next().GB_(typeface);
|
|
}
|
|
}
|
|
|
|
public final void j() {
|
|
Iterator<T> it = this.b.iterator();
|
|
while (it.hasNext()) {
|
|
it.next().p();
|
|
}
|
|
}
|
|
|
|
public final int c() {
|
|
Iterator<T> it = this.b.iterator();
|
|
int i = 0;
|
|
while (it.hasNext()) {
|
|
i += it.next().r();
|
|
}
|
|
return i;
|
|
}
|
|
|
|
public final T b() {
|
|
List<T> list = this.b;
|
|
if (list == null || list.isEmpty()) {
|
|
return null;
|
|
}
|
|
T t = this.b.get(0);
|
|
for (T t2 : this.b) {
|
|
if (t2.r() > t.r()) {
|
|
t = t2;
|
|
}
|
|
}
|
|
return t;
|
|
}
|
|
|
|
public Lhm a(UAQ uaq) {
|
|
if (uaq.b >= this.b.size()) {
|
|
return null;
|
|
}
|
|
return this.b.get(uaq.b).b(uaq.j, uaq.h);
|
|
}
|
|
|
|
public final List<T> d() {
|
|
return this.b;
|
|
}
|
|
}
|