package androidx.constraintlayout.solver; import com.ijm.dataencryption.de.DataDecryptTool; /* loaded from: classes.dex */ public class Cache { Pools$Pool a; Pools$Pool b; SolverVariable[] c; public Cache() { final int i = DataDecryptTool.DECRYPT_ALL_FILE; this.a = new Pools$Pool(i) { // from class: androidx.constraintlayout.solver.Pools$SimplePool private final Object[] a; private int b; { if (i <= 0) { throw new IllegalArgumentException("The max pool size must be > 0"); } this.a = new Object[i]; } @Override // androidx.constraintlayout.solver.Pools$Pool public T a() { int i2 = this.b; if (i2 <= 0) { return null; } int i3 = i2 - 1; Object[] objArr = this.a; T t = (T) objArr[i3]; objArr[i3] = null; this.b = i2 - 1; return t; } @Override // androidx.constraintlayout.solver.Pools$Pool public boolean a(T t) { int i2 = this.b; Object[] objArr = this.a; if (i2 >= objArr.length) { return false; } objArr[i2] = t; this.b = i2 + 1; return true; } @Override // androidx.constraintlayout.solver.Pools$Pool public void a(T[] tArr, int i2) { if (i2 > tArr.length) { i2 = tArr.length; } for (int i3 = 0; i3 < i2; i3++) { T t = tArr[i3]; int i4 = this.b; Object[] objArr = this.a; if (i4 < objArr.length) { objArr[i4] = t; this.b = i4 + 1; } } } }; this.b = new Pools$Pool(i) { // from class: androidx.constraintlayout.solver.Pools$SimplePool private final Object[] a; private int b; { if (i <= 0) { throw new IllegalArgumentException("The max pool size must be > 0"); } this.a = new Object[i]; } @Override // androidx.constraintlayout.solver.Pools$Pool public T a() { int i2 = this.b; if (i2 <= 0) { return null; } int i3 = i2 - 1; Object[] objArr = this.a; T t = (T) objArr[i3]; objArr[i3] = null; this.b = i2 - 1; return t; } @Override // androidx.constraintlayout.solver.Pools$Pool public boolean a(T t) { int i2 = this.b; Object[] objArr = this.a; if (i2 >= objArr.length) { return false; } objArr[i2] = t; this.b = i2 + 1; return true; } @Override // androidx.constraintlayout.solver.Pools$Pool public void a(T[] tArr, int i2) { if (i2 > tArr.length) { i2 = tArr.length; } for (int i3 = 0; i3 < i2; i3++) { T t = tArr[i3]; int i4 = this.b; Object[] objArr = this.a; if (i4 < objArr.length) { objArr[i4] = t; this.b = i4 + 1; } } } }; this.c = new SolverVariable[32]; } }