40 lines
1.1 KiB
Java
40 lines
1.1 KiB
Java
|
package o;
|
||
|
|
|
||
|
|
import java.util.Arrays;
|
||
|
|
|
||
|
|
/* loaded from: classes.dex */
|
||
|
|
public final class hUG {
|
||
|
|
DBy a;
|
||
|
|
String c;
|
||
|
|
double[] d;
|
||
|
|
int j;
|
||
|
|
float[] g = new float[0];
|
||
|
|
double[] f = new double[0];
|
||
|
|
double b = 6.283185307179586d;
|
||
|
|
boolean e = false;
|
||
|
|
|
||
|
|
public final String toString() {
|
||
|
|
StringBuilder sb = new StringBuilder("pos =");
|
||
|
|
sb.append(Arrays.toString(this.f));
|
||
|
|
sb.append(" period=");
|
||
|
|
sb.append(Arrays.toString(this.g));
|
||
|
|
return sb.toString();
|
||
|
|
}
|
||
|
|
|
||
|
|
public final void d(double d, float f) {
|
||
|
|
int length = this.g.length + 1;
|
||
|
|
int binarySearch = Arrays.binarySearch(this.f, d);
|
||
|
|
if (binarySearch < 0) {
|
||
|
|
binarySearch = (-binarySearch) - 1;
|
||
|
|
}
|
||
|
|
this.f = Arrays.copyOf(this.f, length);
|
||
|
|
this.g = Arrays.copyOf(this.g, length);
|
||
|
|
this.d = new double[length];
|
||
|
|
double[] dArr = this.f;
|
||
|
|
System.arraycopy(dArr, binarySearch, dArr, binarySearch + 1, (length - binarySearch) - 1);
|
||
|
|
this.f[binarySearch] = d;
|
||
|
|
this.g[binarySearch] = f;
|
||
|
|
this.e = false;
|
||
|
|
}
|
||
|
|
}
|