List of utility methods to do Array Invert
boolean[] | invert(boolean[] binary) Invert binary array (apply a negation to each value). final boolean[] inverted = new boolean[binary.length]; for (int i = 0; i < inverted.length; i++) { inverted[i] = !binary[i]; return inverted; |
boolean[] | invert(boolean[] result) invert for (int i = 0; i < result.length; i++) result[i] = !result[i]; return result; |
byte[] | invert(byte abyte0[]) invert if (abyte0 == null || abyte0.length == 0) return abyte0; byte abyte1[] = new byte[abyte0.length]; for (int i = 0; i < abyte0.length; i++) abyte1[i] = abyte0[abyte0.length - i - 1]; return abyte1; |
byte[] | invert(byte[] array) invert byte[] newArray = new byte[array.length]; for (int i = 0; i < array.length; ++i) newArray[newArray.length - i - 1] = array[i]; return newArray; |
byte[] | invert(byte[] bytes) Invert the provided byte array. byte[] invertedBytes = new byte[bytes.length]; for (int i = 0; i < bytes.length; i++) { invertedBytes[i] = (byte) (~bytes[i]); return invertedBytes; |
byte[] | invert(byte[] key) invert byte[] inverted = Arrays.copyOf(key, key.length); for (int i = 0; i < inverted.length; i++) { inverted[i] = (byte) (inverted[i] & 0xFF); return inverted; |
byte[] | invert(byte[] v) Flips all the bits in the byte array return invert(v, 0, v.length);
|
double[] | invert(double[] ary) invert if (ary == null) return null; for (int i = 0; i < ary.length; i++) ary[i] = 1. / ary[i]; return ary; |
float[] | invert(float[] a) invert if (a == null) { throw new IllegalArgumentException("Argument cannot be null"); float[] c = new float[a.length]; for (int i = 0; i < a.length; i++) { c[i] = 1.0f / a[i]; return c; ... |
boolean | invert(float[] m, float[] invOut) invert float[] inv = new float[16]; float det; int i; inv[0] = m[5] * m[10] * m[15] - m[5] * m[11] * m[14] - m[9] * m[6] * m[15] + m[9] * m[7] * m[14] + m[13] * m[6] * m[11] - m[13] * m[7] * m[10]; inv[4] = -m[4] * m[10] * m[15] + m[4] * m[11] * m[14] + m[8] * m[6] * m[15] - m[8] * m[7] * m[14] - m[12] * m[6] * m[11] + m[12] * m[7] * m[10]; inv[8] = m[4] * m[9] * m[15] - m[4] * m[11] * m[13] - m[8] * m[5] * m[15] + m[8] * m[7] * m[13] ... |