80 lines
2.1 KiB
Java
80 lines
2.1 KiB
Java
package c.i.a.c.e2.q;
|
|
|
|
import c.i.a.c.e2.c;
|
|
import c.i.a.c.e2.f;
|
|
import c.i.a.c.i2.f0;
|
|
import com.airbnb.lottie.parser.AnimatableValueParser;
|
|
import java.util.Collections;
|
|
import java.util.List;
|
|
/* compiled from: SsaSubtitle */
|
|
public final class d implements f {
|
|
public final List<List<c>> i;
|
|
public final List<Long> j;
|
|
|
|
public d(List<List<c>> list, List<Long> list2) {
|
|
this.i = list;
|
|
this.j = list2;
|
|
}
|
|
|
|
@Override // c.i.a.c.e2.f
|
|
public int f(long j) {
|
|
int i;
|
|
List<Long> list = this.j;
|
|
Long valueOf = Long.valueOf(j);
|
|
int i2 = f0.a;
|
|
int binarySearch = Collections.binarySearch(list, valueOf);
|
|
if (binarySearch < 0) {
|
|
i = ~binarySearch;
|
|
} else {
|
|
int size = list.size();
|
|
do {
|
|
binarySearch++;
|
|
if (binarySearch >= size) {
|
|
break;
|
|
}
|
|
} while (list.get(binarySearch).compareTo(valueOf) == 0);
|
|
i = binarySearch;
|
|
}
|
|
if (i < this.j.size()) {
|
|
return i;
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
@Override // c.i.a.c.e2.f
|
|
public long g(int i) {
|
|
boolean z2 = true;
|
|
AnimatableValueParser.k(i >= 0);
|
|
if (i >= this.j.size()) {
|
|
z2 = false;
|
|
}
|
|
AnimatableValueParser.k(z2);
|
|
return this.j.get(i).longValue();
|
|
}
|
|
|
|
@Override // c.i.a.c.e2.f
|
|
public List<c> h(long j) {
|
|
int i;
|
|
List<Long> list = this.j;
|
|
Long valueOf = Long.valueOf(j);
|
|
int i2 = f0.a;
|
|
int binarySearch = Collections.binarySearch(list, valueOf);
|
|
if (binarySearch < 0) {
|
|
i = -(binarySearch + 2);
|
|
} else {
|
|
do {
|
|
binarySearch--;
|
|
if (binarySearch < 0) {
|
|
break;
|
|
}
|
|
} while (list.get(binarySearch).compareTo(valueOf) == 0);
|
|
i = binarySearch + 1;
|
|
}
|
|
return i == -1 ? Collections.emptyList() : this.i.get(i);
|
|
}
|
|
|
|
@Override // c.i.a.c.e2.f
|
|
public int i() {
|
|
return this.j.size();
|
|
}
|
|
}
|