echelon/i2p.i2p
1
0
Fork 0
forked from I2P_Developers/i2p.i2p
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Crypto: SparseArray mods

Browse Source 
Remove AOSP dependencies
Remove unneeded code
Javadoc fixes
This commit is contained in:
zzz
2019-10-24 13:50:29 +00:00
parent 7389216560
commit 8c498069d8
4 changed files with 27 additions and 871 deletions
Download Patch File Download Diff File Expand all files Collapse all files

736
router/java/src/net/i2p/router/crypto/ratchet/ArrayUtils.java
View File

@ -14,750 +14,26 @@
* limitations under the License. * limitations under the License.
*/ */
package com.android.internal.util; package net.i2p.router.crypto.ratchet;
import android.annotation.NonNull;
import android.annotation.Nullable;
import android.annotation.UnsupportedAppUsage;
import android.util.ArraySet;
import dalvik.system.VMRuntime;
import libcore.util.EmptyArray;
import java.io.File;
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.List;
import java.util.Map;
import java.util.Objects;
import java.util.function.IntFunction;
/** /**
* ArrayUtils contains some methods that you can call to find out * ArrayUtils contains some methods that you can call to find out
* the most efficient increments by which to grow arrays. * the most efficient increments by which to grow arrays.
*/ */
public class ArrayUtils { class ArrayUtils {
private static final int CACHE_SIZE = 73;
private static Object[] sCache = new Object[CACHE_SIZE];
public static final File[] EMPTY_FILE = new File[0];
private ArrayUtils() { /* cannot be instantiated */ } private ArrayUtils() { /* cannot be instantiated */ }
public static byte[] newUnpaddedByteArray(int minLen) {
return (byte[])VMRuntime.getRuntime().newUnpaddedArray(byte.class, minLen);
}
public static char[] newUnpaddedCharArray(int minLen) {
return (char[])VMRuntime.getRuntime().newUnpaddedArray(char.class, minLen);
}
@UnsupportedAppUsage
public static int[] newUnpaddedIntArray(int minLen) { public static int[] newUnpaddedIntArray(int minLen) {
return (int[])VMRuntime.getRuntime().newUnpaddedArray(int.class, minLen); return new int[minLen];
}
public static boolean[] newUnpaddedBooleanArray(int minLen) {
return (boolean[])VMRuntime.getRuntime().newUnpaddedArray(boolean.class, minLen);
}
public static long[] newUnpaddedLongArray(int minLen) {
return (long[])VMRuntime.getRuntime().newUnpaddedArray(long.class, minLen);
}
public static float[] newUnpaddedFloatArray(int minLen) {
return (float[])VMRuntime.getRuntime().newUnpaddedArray(float.class, minLen);
} }
public static Object[] newUnpaddedObjectArray(int minLen) { public static Object[] newUnpaddedObjectArray(int minLen) {
return (Object[])VMRuntime.getRuntime().newUnpaddedArray(Object.class, minLen); return new Object[minLen];
}
@UnsupportedAppUsage
@SuppressWarnings("unchecked")
public static <T> T[] newUnpaddedArray(Class<T> clazz, int minLen) {
return (T[])VMRuntime.getRuntime().newUnpaddedArray(clazz, minLen);
}
/**
* Checks if the beginnings of two byte arrays are equal.
*
* @param array1 the first byte array
* @param array2 the second byte array
* @param length the number of bytes to check
* @return true if they're equal, false otherwise
*/
public static boolean equals(byte[] array1, byte[] array2, int length) {
if (length < 0) {
throw new IllegalArgumentException();
}
if (array1 == array2) {
return true;
}
if (array1 == null || array2 == null || array1.length < length || array2.length < length) {
return false;
}
for (int i = 0; i < length; i++) {
if (array1[i] != array2[i]) {
return false;
}
}
return true;
}
/**
* Returns an empty array of the specified type. The intent is that
* it will return the same empty array every time to avoid reallocation,
* although this is not guaranteed.
*/
@UnsupportedAppUsage
@SuppressWarnings("unchecked")
public static <T> T[] emptyArray(Class<T> kind) {
if (kind == Object.class) {
return (T[]) EmptyArray.OBJECT;
}
int bucket = (kind.hashCode() & 0x7FFFFFFF) % CACHE_SIZE;
Object cache = sCache[bucket];
if (cache == null || cache.getClass().getComponentType() != kind) {
cache = Array.newInstance(kind, 0);
sCache[bucket] = cache;
// Log.e("cache", "new empty " + kind.getName() + " at " + bucket);
}
return (T[]) cache;
}
/**
* Checks if given array is null or has zero elements.
*/
public static boolean isEmpty(@Nullable Collection<?> array) {
return array == null || array.isEmpty();
}
/**
* Checks if given map is null or has zero elements.
*/
public static boolean isEmpty(@Nullable Map<?, ?> map) {
return map == null || map.isEmpty();
}
/**
* Checks if given array is null or has zero elements.
*/
@UnsupportedAppUsage
public static <T> boolean isEmpty(@Nullable T[] array) {
return array == null || array.length == 0;
}
/**
* Checks if given array is null or has zero elements.
*/
public static boolean isEmpty(@Nullable int[] array) {
return array == null || array.length == 0;
}
/**
* Checks if given array is null or has zero elements.
*/
public static boolean isEmpty(@Nullable long[] array) {
return array == null || array.length == 0;
}
/**
* Checks if given array is null or has zero elements.
*/
public static boolean isEmpty(@Nullable byte[] array) {
return array == null || array.length == 0;
}
/**
* Checks if given array is null or has zero elements.
*/
public static boolean isEmpty(@Nullable boolean[] array) {
return array == null || array.length == 0;
}
/**
* Length of the given array or 0 if it's null.
*/
public static int size(@Nullable Object[] array) {
return array == null ? 0 : array.length;
}
/**
* Length of the given collection or 0 if it's null.
*/
public static int size(@Nullable Collection<?> collection) {
return collection == null ? 0 : collection.size();
}
/**
* Checks that value is present as at least one of the elements of the array.
* @param array the array to check in
* @param value the value to check for
* @return true if the value is present in the array
*/
@UnsupportedAppUsage
public static <T> boolean contains(@Nullable T[] array, T value) {
return indexOf(array, value) != -1;
}
/**
* Return first index of {@code value} in {@code array}, or {@code -1} if
* not found.
*/
@UnsupportedAppUsage
public static <T> int indexOf(@Nullable T[] array, T value) {
if (array == null) return -1;
for (int i = 0; i < array.length; i++) {
if (Objects.equals(array[i], value)) return i;
}
return -1;
}
/**
* Test if all {@code check} items are contained in {@code array}.
*/
public static <T> boolean containsAll(@Nullable T[] array, T[] check) {
if (check == null) return true;
for (T checkItem : check) {
if (!contains(array, checkItem)) {
return false;
}
}
return true;
}
/**
* Test if any {@code check} items are contained in {@code array}.
*/
public static <T> boolean containsAny(@Nullable T[] array, T[] check) {
if (check == null) return false;
for (T checkItem : check) {
if (contains(array, checkItem)) {
return true;
}
}
return false;
}
@UnsupportedAppUsage
public static boolean contains(@Nullable int[] array, int value) {
if (array == null) return false;
for (int element : array) {
if (element == value) {
return true;
}
}
return false;
}
public static boolean contains(@Nullable long[] array, long value) {
if (array == null) return false;
for (long element : array) {
if (element == value) {
return true;
}
}
return false;
}
public static boolean contains(@Nullable char[] array, char value) {
if (array == null) return false;
for (char element : array) {
if (element == value) {
return true;
}
}
return false;
}
/**
* Test if all {@code check} items are contained in {@code array}.
*/
public static <T> boolean containsAll(@Nullable char[] array, char[] check) {
if (check == null) return true;
for (char checkItem : check) {
if (!contains(array, checkItem)) {
return false;
}
}
return true;
}
public static long total(@Nullable long[] array) {
long total = 0;
if (array != null) {
for (long value : array) {
total += value;
}
}
return total;
}
public static int[] convertToIntArray(List<Integer> list) {
int[] array = new int[list.size()];
for (int i = 0; i < list.size(); i++) {
array[i] = list.get(i);
}
return array;
}
public static @Nullable long[] convertToLongArray(@Nullable int[] intArray) {
if (intArray == null) return null;
long[] array = new long[intArray.length];
for (int i = 0; i < intArray.length; i++) {
array[i] = (long) intArray[i];
}
return array;
} }
@SuppressWarnings("unchecked") @SuppressWarnings("unchecked")
public static @NonNull <T> T[] concatElements(Class<T> kind, @Nullable T[] a, @Nullable T[] b) { public static <T> T[] newUnpaddedArray(Class<T> clazz, int minLen) {
final int an = (a != null) ? a.length : 0; return (T[]) new Object[minLen];
final int bn = (b != null) ? b.length : 0;
if (an == 0 && bn == 0) {
if (kind == String.class) {
return (T[]) EmptyArray.STRING;
} else if (kind == Object.class) {
return (T[]) EmptyArray.OBJECT;
}
}
final T[] res = (T[]) Array.newInstance(kind, an + bn);
if (an > 0) System.arraycopy(a, 0, res, 0, an);
if (bn > 0) System.arraycopy(b, 0, res, an, bn);
return res;
}
/**
* Adds value to given array if not already present, providing set-like
* behavior.
*/
@UnsupportedAppUsage
@SuppressWarnings("unchecked")
public static @NonNull <T> T[] appendElement(Class<T> kind, @Nullable T[] array, T element) {
return appendElement(kind, array, element, false);
}
/**
* Adds value to given array.
*/
@SuppressWarnings("unchecked")
public static @NonNull <T> T[] appendElement(Class<T> kind, @Nullable T[] array, T element,
boolean allowDuplicates) {
final T[] result;
final int end;
if (array != null) {
if (!allowDuplicates && contains(array, element)) return array;
end = array.length;
result = (T[])Array.newInstance(kind, end + 1);
System.arraycopy(array, 0, result, 0, end);
} else {
end = 0;
result = (T[])Array.newInstance(kind, 1);
}
result[end] = element;
return result;
}
/**
* Removes value from given array if present, providing set-like behavior.
*/
@UnsupportedAppUsage
@SuppressWarnings("unchecked")
public static @Nullable <T> T[] removeElement(Class<T> kind, @Nullable T[] array, T element) {
if (array != null) {
if (!contains(array, element)) return array;
final int length = array.length;
for (int i = 0; i < length; i++) {
if (Objects.equals(array[i], element)) {
if (length == 1) {
return null;
}
T[] result = (T[])Array.newInstance(kind, length - 1);
System.arraycopy(array, 0, result, 0, i);
System.arraycopy(array, i + 1, result, i, length - i - 1);
return result;
}
}
}
return array;
}
/**
* Adds value to given array.
*/
public static @NonNull int[] appendInt(@Nullable int[] cur, int val,
boolean allowDuplicates) {
if (cur == null) {
return new int[] { val };
}
final int N = cur.length;
if (!allowDuplicates) {
for (int i = 0; i < N; i++) {
if (cur[i] == val) {
return cur;
}
}
}
int[] ret = new int[N + 1];
System.arraycopy(cur, 0, ret, 0, N);
ret[N] = val;
return ret;
}
/**
* Adds value to given array if not already present, providing set-like
* behavior.
*/
@UnsupportedAppUsage
public static @NonNull int[] appendInt(@Nullable int[] cur, int val) {
return appendInt(cur, val, false);
}
/**
* Removes value from given array if present, providing set-like behavior.
*/
public static @Nullable int[] removeInt(@Nullable int[] cur, int val) {
if (cur == null) {
return null;
}
final int N = cur.length;
for (int i = 0; i < N; i++) {
if (cur[i] == val) {
int[] ret = new int[N - 1];
if (i > 0) {
System.arraycopy(cur, 0, ret, 0, i);
}
if (i < (N - 1)) {
System.arraycopy(cur, i + 1, ret, i, N - i - 1);
}
return ret;
}
}
return cur;
}
/**
* Removes value from given array if present, providing set-like behavior.
*/
public static @Nullable String[] removeString(@Nullable String[] cur, String val) {
if (cur == null) {
return null;
}
final int N = cur.length;
for (int i = 0; i < N; i++) {
if (Objects.equals(cur[i], val)) {
String[] ret = new String[N - 1];
if (i > 0) {
System.arraycopy(cur, 0, ret, 0, i);
}
if (i < (N - 1)) {
System.arraycopy(cur, i + 1, ret, i, N - i - 1);
}
return ret;
}
}
return cur;
}
/**
* Adds value to given array if not already present, providing set-like
* behavior.
*/
public static @NonNull long[] appendLong(@Nullable long[] cur, long val,
boolean allowDuplicates) {
if (cur == null) {
return new long[] { val };
}
final int N = cur.length;
if (!allowDuplicates) {
for (int i = 0; i < N; i++) {
if (cur[i] == val) {
return cur;
}
}
}
long[] ret = new long[N + 1];
System.arraycopy(cur, 0, ret, 0, N);
ret[N] = val;
return ret;
}
/**
* Adds value to given array if not already present, providing set-like
* behavior.
*/
public static @NonNull long[] appendLong(@Nullable long[] cur, long val) {
return appendLong(cur, val, false);
}
/**
* Removes value from given array if present, providing set-like behavior.
*/
public static @Nullable long[] removeLong(@Nullable long[] cur, long val) {
if (cur == null) {
return null;
}
final int N = cur.length;
for (int i = 0; i < N; i++) {
if (cur[i] == val) {
long[] ret = new long[N - 1];
if (i > 0) {
System.arraycopy(cur, 0, ret, 0, i);
}
if (i < (N - 1)) {
System.arraycopy(cur, i + 1, ret, i, N - i - 1);
}
return ret;
}
}
return cur;
}
public static @Nullable long[] cloneOrNull(@Nullable long[] array) {
return (array != null) ? array.clone() : null;
}
/**
* Clones an array or returns null if the array is null.
*/
public static @Nullable <T> T[] cloneOrNull(@Nullable T[] array) {
return (array != null) ? array.clone() : null;
}
public static @Nullable <T> ArraySet<T> cloneOrNull(@Nullable ArraySet<T> array) {
return (array != null) ? new ArraySet<T>(array) : null;
}
public static @NonNull <T> ArraySet<T> add(@Nullable ArraySet<T> cur, T val) {
if (cur == null) {
cur = new ArraySet<>();
}
cur.add(val);
return cur;
}
public static @Nullable <T> ArraySet<T> remove(@Nullable ArraySet<T> cur, T val) {
if (cur == null) {
return null;
}
cur.remove(val);
if (cur.isEmpty()) {
return null;
} else {
return cur;
}
}
public static @NonNull <T> ArrayList<T> add(@Nullable ArrayList<T> cur, T val) {
if (cur == null) {
cur = new ArrayList<>();
}
cur.add(val);
return cur;
}
public static @Nullable <T> ArrayList<T> remove(@Nullable ArrayList<T> cur, T val) {
if (cur == null) {
return null;
}
cur.remove(val);
if (cur.isEmpty()) {
return null;
} else {
return cur;
}
}
public static <T> boolean contains(@Nullable Collection<T> cur, T val) {
return (cur != null) ? cur.contains(val) : false;
}
public static @Nullable <T> T[] trimToSize(@Nullable T[] array, int size) {
if (array == null || size == 0) {
return null;
} else if (array.length == size) {
return array;
} else {
return Arrays.copyOf(array, size);
}
}
/**
* Returns true if the two ArrayLists are equal with respect to the objects they contain.
* The objects must be in the same order and be reference equal (== not .equals()).
*/
public static <T> boolean referenceEquals(ArrayList<T> a, ArrayList<T> b) {
if (a == b) {
return true;
}
final int sizeA = a.size();
final int sizeB = b.size();
if (a == null || b == null || sizeA != sizeB) {
return false;
}
boolean diff = false;
for (int i = 0; i < sizeA && !diff; i++) {
diff |= a.get(i) != b.get(i);
}
return !diff;
}
/**
* Removes elements that match the predicate in an efficient way that alters the order of
* elements in the collection. This should only be used if order is not important.
* @param collection The ArrayList from which to remove elements.
* @param predicate The predicate that each element is tested against.
* @return the number of elements removed.
*/
public static <T> int unstableRemoveIf(@Nullable ArrayList<T> collection,
@NonNull java.util.function.Predicate<T> predicate) {
if (collection == null) {
return 0;
}
final int size = collection.size();
int leftIdx = 0;
int rightIdx = size - 1;
while (leftIdx <= rightIdx) {
// Find the next element to remove moving left to right.
while (leftIdx < size && !predicate.test(collection.get(leftIdx))) {
leftIdx++;
}
// Find the next element to keep moving right to left.
while (rightIdx > leftIdx && predicate.test(collection.get(rightIdx))) {
rightIdx--;
}
if (leftIdx >= rightIdx) {
// Done.
break;
}
Collections.swap(collection, leftIdx, rightIdx);
leftIdx++;
rightIdx--;
}
// leftIdx is now at the end.
for (int i = size - 1; i >= leftIdx; i--) {
collection.remove(i);
}
return size - leftIdx;
}
public static @NonNull int[] defeatNullable(@Nullable int[] val) {
return (val != null) ? val : EmptyArray.INT;
}
public static @NonNull String[] defeatNullable(@Nullable String[] val) {
return (val != null) ? val : EmptyArray.STRING;
}
public static @NonNull File[] defeatNullable(@Nullable File[] val) {
return (val != null) ? val : EMPTY_FILE;
}
/**
* Throws {@link ArrayIndexOutOfBoundsException} if the index is out of bounds.
*
* @param len length of the array. Must be non-negative
* @param index the index to check
* @throws ArrayIndexOutOfBoundsException if the {@code index} is out of bounds of the array
*/
public static void checkBounds(int len, int index) {
if (index < 0 || len <= index) {
throw new ArrayIndexOutOfBoundsException("length=" + len + "; index=" + index);
}
}
/**
* Returns an array with values from {@code val} minus {@code null} values
*
* @param arrayConstructor typically {@code T[]::new} e.g. {@code String[]::new}
*/
public static <T> T[] filterNotNull(T[] val, IntFunction<T[]> arrayConstructor) {
int nullCount = 0;
int size = size(val);
for (int i = 0; i < size; i++) {
if (val[i] == null) {
nullCount++;
}
}
if (nullCount == 0) {
return val;
}
T[] result = arrayConstructor.apply(size - nullCount);
int outIdx = 0;
for (int i = 0; i < size; i++) {
if (val[i] != null) {
result[outIdx++] = val[i];
}
}
return result;
}
public static boolean startsWith(byte[] cur, byte[] val) {
if (cur == null || val == null) return false;
if (cur.length < val.length) return false;
for (int i = 0; i < val.length; i++) {
if (cur[i] != val[i]) return false;
}
return true;
}
/**
* Returns the first element from the array for which
* condition {@code predicate} is true, or null if there is no such element
*/
public static @Nullable <T> T find(@Nullable T[] items,
@NonNull java.util.function.Predicate<T> predicate) {
if (isEmpty(items)) return null;
for (final T item : items) {
if (predicate.test(item)) return item;
}
return null;
}
public static String deepToString(Object value) {
if (value != null && value.getClass().isArray()) {
if (value.getClass() == boolean[].class) {
return Arrays.toString((boolean[]) value);
} else if (value.getClass() == byte[].class) {
return Arrays.toString((byte[]) value);
} else if (value.getClass() == char[].class) {
return Arrays.toString((char[]) value);
} else if (value.getClass() == double[].class) {
return Arrays.toString((double[]) value);
} else if (value.getClass() == float[].class) {
return Arrays.toString((float[]) value);
} else if (value.getClass() == int[].class) {
return Arrays.toString((int[]) value);
} else if (value.getClass() == long[].class) {
return Arrays.toString((long[]) value);
} else if (value.getClass() == short[].class) {
return Arrays.toString((short[]) value);
} else {
return Arrays.deepToString((Object[]) value);
}
} else {
return String.valueOf(value);
}
}
public static @Nullable <T> T firstOrNull(T[] items) {
return items.length > 0 ? items[0] : null;
} }
} }

21
router/java/src/net/i2p/router/crypto/ratchet/ContainerHelpers.java
View File

@ -14,7 +14,7 @@
* limitations under the License. * limitations under the License.
*/ */
package android.util; package net.i2p.router.crypto.ratchet;
class ContainerHelpers { class ContainerHelpers {
@ -37,23 +37,4 @@ class ContainerHelpers {
} }
return ~lo; // value not present return ~lo; // value not present
} }
static int binarySearch(long[] array, int size, long value) {
int lo = 0;
int hi = size - 1;
while (lo <= hi) {
final int mid = (lo + hi) >>> 1;
final long midVal = array[mid];
if (midVal < value) {
lo = mid + 1;
} else if (midVal > value) {
hi = mid - 1;
} else {
return mid; // value found
}
}
return ~lo; // value not present
}
} }

90
router/java/src/net/i2p/router/crypto/ratchet/GrowingArrayUtils.java
View File

@ -16,8 +16,6 @@
package net.i2p.router.crypto.ratchet; package net.i2p.router.crypto.ratchet;
import android.annotation.UnsupportedAppUsage;
/** /**
* A helper class that aims to provide comparable growth performance to ArrayList, but on primitive * A helper class that aims to provide comparable growth performance to ArrayList, but on primitive
* arrays. Common array operations are implemented for efficient use in dynamic containers. * arrays. Common array operations are implemented for efficient use in dynamic containers.
@ -26,9 +24,8 @@ import android.annotation.UnsupportedAppUsage;
* NOT the number of elements in the array. The current size of the array is always passed in as a * NOT the number of elements in the array. The current size of the array is always passed in as a
* parameter. * parameter.
* *
* @hide
*/ */
public final class GrowingArrayUtils { final class GrowingArrayUtils {
/** /**
* Appends an element to the end of the array, growing the array if there is no more room. * Appends an element to the end of the array, growing the array if there is no more room.
@ -39,7 +36,6 @@ public final class GrowingArrayUtils {
* @return the array to which the element was appended. This may be different than the given * @return the array to which the element was appended. This may be different than the given
* array. * array.
*/ */
@UnsupportedAppUsage
public static <T> T[] append(T[] array, int currentSize, T element) { public static <T> T[] append(T[] array, int currentSize, T element) {
assert currentSize <= array.length; assert currentSize <= array.length;
@ -57,7 +53,6 @@ public final class GrowingArrayUtils {
/** /**
* Primitive int version of {@link #append(Object[], int, Object)}. * Primitive int version of {@link #append(Object[], int, Object)}.
*/ */
@UnsupportedAppUsage
public static int[] append(int[] array, int currentSize, int element) { public static int[] append(int[] array, int currentSize, int element) {
assert currentSize <= array.length; assert currentSize <= array.length;
@ -70,51 +65,6 @@ public final class GrowingArrayUtils {
return array; return array;
} }
/**
* Primitive long version of {@link #append(Object[], int, Object)}.
*/
public static long[] append(long[] array, int currentSize, long element) {
assert currentSize <= array.length;
if (currentSize + 1 > array.length) {
long[] newArray = ArrayUtils.newUnpaddedLongArray(growSize(currentSize));
System.arraycopy(array, 0, newArray, 0, currentSize);
array = newArray;
}
array[currentSize] = element;
return array;
}
/**
* Primitive boolean version of {@link #append(Object[], int, Object)}.
*/
public static boolean[] append(boolean[] array, int currentSize, boolean element) {
assert currentSize <= array.length;
if (currentSize + 1 > array.length) {
boolean[] newArray = ArrayUtils.newUnpaddedBooleanArray(growSize(currentSize));
System.arraycopy(array, 0, newArray, 0, currentSize);
array = newArray;
}
array[currentSize] = element;
return array;
}
/**
* Primitive float version of {@link #append(Object[], int, Object)}.
*/
public static float[] append(float[] array, int currentSize, float element) {
assert currentSize <= array.length;
if (currentSize + 1 > array.length) {
float[] newArray = ArrayUtils.newUnpaddedFloatArray(growSize(currentSize));
System.arraycopy(array, 0, newArray, 0, currentSize);
array = newArray;
}
array[currentSize] = element;
return array;
}
/** /**
* Inserts an element into the array at the specified index, growing the array if there is no * Inserts an element into the array at the specified index, growing the array if there is no
* more room. * more room.
@ -163,44 +113,6 @@ public final class GrowingArrayUtils {
return newArray; return newArray;
} }
/**
* Primitive long version of {@link #insert(Object[], int, int, Object)}.
*/
public static long[] insert(long[] array, int currentSize, int index, long element) {
assert currentSize <= array.length;
if (currentSize + 1 <= array.length) {
System.arraycopy(array, index, array, index + 1, currentSize - index);
array[index] = element;
return array;
}
long[] newArray = ArrayUtils.newUnpaddedLongArray(growSize(currentSize));
System.arraycopy(array, 0, newArray, 0, index);
newArray[index] = element;
System.arraycopy(array, index, newArray, index + 1, array.length - index);
return newArray;
}
/**
* Primitive boolean version of {@link #insert(Object[], int, int, Object)}.
*/
public static boolean[] insert(boolean[] array, int currentSize, int index, boolean element) {
assert currentSize <= array.length;
if (currentSize + 1 <= array.length) {
System.arraycopy(array, index, array, index + 1, currentSize - index);
array[index] = element;
return array;
}
boolean[] newArray = ArrayUtils.newUnpaddedBooleanArray(growSize(currentSize));
System.arraycopy(array, 0, newArray, 0, index);
newArray[index] = element;
System.arraycopy(array, index, newArray, index + 1, array.length - index);
return newArray;
}
/** /**
* Given the current size of an array, returns an ideal size to which the array should grow. * Given the current size of an array, returns an ideal size to which the array should grow.
* This is typically double the given size, but should not be relied upon to do so in the * This is typically double the given size, but should not be relied upon to do so in the

53
router/java/src/net/i2p/router/crypto/ratchet/SparseArray.java
View File

@ -14,14 +14,7 @@
* limitations under the License. * limitations under the License.
*/ */
package android.util; package net.i2p.router.crypto.ratchet;
import android.annotation.UnsupportedAppUsage;
import com.android.internal.util.ArrayUtils;
import com.android.internal.util.GrowingArrayUtils;
import libcore.util.EmptyArray;
/** /**
* <code>SparseArray</code> maps integers to Objects and, unlike a normal array of Objects, * <code>SparseArray</code> maps integers to Objects and, unlike a normal array of Objects,
@ -53,15 +46,14 @@ import libcore.util.EmptyArray;
* keys in ascending order. In the case of <code>valueAt(int)</code>, the * keys in ascending order. In the case of <code>valueAt(int)</code>, the
* values corresponding to the keys are returned in ascending order. * values corresponding to the keys are returned in ascending order.
*/ */
public class SparseArray<E> implements Cloneable { class SparseArray<E> implements Cloneable {
private static final int[] EMPTY_INTS = new int[0];
private static final Object[] EMPTY_OBJECTS = new Object[0];
private static final Object DELETED = new Object(); private static final Object DELETED = new Object();
private boolean mGarbage = false; private boolean mGarbage = false;
@UnsupportedAppUsage(maxTargetSdk = 28) // Use keyAt(int)
private int[] mKeys; private int[] mKeys;
@UnsupportedAppUsage(maxTargetSdk = 28) // Use valueAt(int), setValueAt(int, E)
private Object[] mValues; private Object[] mValues;
@UnsupportedAppUsage(maxTargetSdk = 28) // Use size()
private int mSize; private int mSize;
/** /**
@ -80,8 +72,8 @@ public class SparseArray<E> implements Cloneable {
*/ */
public SparseArray(int initialCapacity) { public SparseArray(int initialCapacity) {
if (initialCapacity == 0) { if (initialCapacity == 0) {
mKeys = EmptyArray.INT; mKeys = EMPTY_INTS;
mValues = EmptyArray.OBJECT; mValues = EMPTY_OBJECTS;
} else { } else {
mValues = ArrayUtils.newUnpaddedObjectArray(initialCapacity); mValues = ArrayUtils.newUnpaddedObjectArray(initialCapacity);
mKeys = new int[mValues.length]; mKeys = new int[mValues.length];
@ -141,9 +133,9 @@ public class SparseArray<E> implements Cloneable {
} }
/** /**
* @hide
* Removes the mapping from the specified key, if there was any, returning the old value. * Removes the mapping from the specified key, if there was any, returning the old value.
*/ */
@SuppressWarnings("unchecked")
public E removeReturnOld(int key) { public E removeReturnOld(int key) {
int i = ContainerHelpers.binarySearch(mKeys, mSize, key); int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
@ -169,12 +161,11 @@ public class SparseArray<E> implements Cloneable {
* Removes the mapping at the specified index. * Removes the mapping at the specified index.
* *
* <p>For indices outside of the range <code>0...size()-1</code>, * <p>For indices outside of the range <code>0...size()-1</code>,
* the behavior is undefined for apps targeting {@link android.os.Build.VERSION_CODES#P} and * a {@link ArrayIndexOutOfBoundsException} is thrown.
* earlier, and an {@link ArrayIndexOutOfBoundsException} is thrown for apps targeting * </p>
* {@link android.os.Build.VERSION_CODES#Q} and later.</p>
*/ */
public void removeAt(int index) { public void removeAt(int index) {
if (index >= mSize && UtilConfig.sThrowExceptionForUpperArrayOutOfBounds) { if (index >= mSize) {
// The array might be slightly bigger than mSize, in which case, indexing won't fail. // The array might be slightly bigger than mSize, in which case, indexing won't fail.
// Check if exception should be thrown outside of the critical path. // Check if exception should be thrown outside of the critical path.
throw new ArrayIndexOutOfBoundsException(index); throw new ArrayIndexOutOfBoundsException(index);
@ -284,12 +275,11 @@ public class SparseArray<E> implements Cloneable {
* key.</p> * key.</p>
* *
* <p>For indices outside of the range <code>0...size()-1</code>, * <p>For indices outside of the range <code>0...size()-1</code>,
* the behavior is undefined for apps targeting {@link android.os.Build.VERSION_CODES#P} and * a {@link ArrayIndexOutOfBoundsException} is thrown.
* earlier, and an {@link ArrayIndexOutOfBoundsException} is thrown for apps targeting * </p>
* {@link android.os.Build.VERSION_CODES#Q} and later.</p>
*/ */
public int keyAt(int index) { public int keyAt(int index) {
if (index >= mSize && UtilConfig.sThrowExceptionForUpperArrayOutOfBounds) { if (index >= mSize) {
// The array might be slightly bigger than mSize, in which case, indexing won't fail. // The array might be slightly bigger than mSize, in which case, indexing won't fail.
// Check if exception should be thrown outside of the critical path. // Check if exception should be thrown outside of the critical path.
throw new ArrayIndexOutOfBoundsException(index); throw new ArrayIndexOutOfBoundsException(index);
@ -313,13 +303,12 @@ public class SparseArray<E> implements Cloneable {
* associated with the largest key.</p> * associated with the largest key.</p>
* *
* <p>For indices outside of the range <code>0...size()-1</code>, * <p>For indices outside of the range <code>0...size()-1</code>,
* the behavior is undefined for apps targeting {@link android.os.Build.VERSION_CODES#P} and * a {@link ArrayIndexOutOfBoundsException} is thrown.
* earlier, and an {@link ArrayIndexOutOfBoundsException} is thrown for apps targeting * </p>
* {@link android.os.Build.VERSION_CODES#Q} and later.</p>
*/ */
@SuppressWarnings("unchecked") @SuppressWarnings("unchecked")
public E valueAt(int index) { public E valueAt(int index) {
if (index >= mSize && UtilConfig.sThrowExceptionForUpperArrayOutOfBounds) { if (index >= mSize) {
// The array might be slightly bigger than mSize, in which case, indexing won't fail. // The array might be slightly bigger than mSize, in which case, indexing won't fail.
// Check if exception should be thrown outside of the critical path. // Check if exception should be thrown outside of the critical path.
throw new ArrayIndexOutOfBoundsException(index); throw new ArrayIndexOutOfBoundsException(index);
@ -336,13 +325,12 @@ public class SparseArray<E> implements Cloneable {
* value for the <code>index</code>th key-value mapping that this * value for the <code>index</code>th key-value mapping that this
* SparseArray stores. * SparseArray stores.
* *
* <p>For indices outside of the range <code>0...size()-1</code>, the behavior is undefined for * <p>For indices outside of the range <code>0...size()-1</code>,
* apps targeting {@link android.os.Build.VERSION_CODES#P} and earlier, and an * a {@link ArrayIndexOutOfBoundsException} is thrown.
* {@link ArrayIndexOutOfBoundsException} is thrown for apps targeting * </p>
* {@link android.os.Build.VERSION_CODES#Q} and later.</p>
*/ */
public void setValueAt(int index, E value) { public void setValueAt(int index, E value) {
if (index >= mSize && UtilConfig.sThrowExceptionForUpperArrayOutOfBounds) { if (index >= mSize) {
// The array might be slightly bigger than mSize, in which case, indexing won't fail. // The array might be slightly bigger than mSize, in which case, indexing won't fail.
// Check if exception should be thrown outside of the critical path. // Check if exception should be thrown outside of the critical path.
throw new ArrayIndexOutOfBoundsException(index); throw new ArrayIndexOutOfBoundsException(index);
@ -399,7 +387,6 @@ public class SparseArray<E> implements Cloneable {
* and that multiple keys can map to the same value and this will * and that multiple keys can map to the same value and this will
* find only one of them. * find only one of them.
* <p>Note also that this method uses {@code equals} unlike {@code indexOfValue}. * <p>Note also that this method uses {@code equals} unlike {@code indexOfValue}.
* @hide
*/ */
public int indexOfValueByValue(E value) { public int indexOfValueByValue(E value) {
if (mGarbage) { if (mGarbage) {