Facebook/react-native
1
0
Fork 0
mirror of https://github.com/facebook/react-native.git synced 2025-11-01 09:14:26 +00:00
Code Issues Packages Projects Releases Wiki Activity

Format Java code in xplat/js/react-native-github

Browse Source 
Summary:
This diff formats the Java class files inside xplat/js/react-native-github. Since google-java-format was enabled in D16071401 we want to codemode the existing code so that users don't have to deal with formatter lint noise at diff-time.

```arc f --paths-cmd 'hg files -I "**/*.java"'```

drop-conflicts

Reviewed By: cpojer

Differential Revision: D16071725

fbshipit-source-id: fc6e3852e45742c109f0c5ac4065d64201c74204
This commit is contained in:
Oleksandr Melnykov
2019-07-02 04:13:35 -07:00
committed by Facebook Github Bot
parent 61e95e5cbf
commit 6c0f73b322
681 changed files with 14085 additions and 16368 deletions
Download Patch File Download Diff File Expand all files Collapse all files
ReactAndroid/src/main/java/com/facebook/react/uimanager/MatrixMathHelper.java
+249 -115
View File
@@ -1,17 +1,16 @@
/**
* Copyright (c) Facebook, Inc. and its affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
* <p>This source code is licensed under the MIT license found in the LICENSE file in the root
* directory of this source tree.
*/
package com.facebook.react.uimanager;
import com.facebook.infer.annotation.Assertions;
/**
* Provides helper methods for converting transform operations into a matrix and then into a list
* of translate, scale and rotate commands.
* Provides helper methods for converting transform operations into a matrix and then into a list of
* translate, scale and rotate commands.
*/
public class MatrixMathHelper {
@@ -24,7 +23,7 @@ public class MatrixMathHelper {
double[] translation = new double[3];
double[] rotationDegrees = new double[3];
private static void resetArray(double []arr) {
private static void resetArray(double[] arr) {
for (int i = 0; i < arr.length; i++) {
arr[i] = 0;
}
@@ -47,39 +46,58 @@ public class MatrixMathHelper {
}
public static void multiplyInto(double[] out, double[] a, double[] b) {
double a00 = a[0], a01 = a[1], a02 = a[2], a03 = a[3],
a10 = a[4], a11 = a[5], a12 = a[6], a13 = a[7],
a20 = a[8], a21 = a[9], a22 = a[10], a23 = a[11],
a30 = a[12], a31 = a[13], a32 = a[14], a33 = a[15];
double a00 = a[0],
a01 = a[1],
a02 = a[2],
a03 = a[3],
a10 = a[4],
a11 = a[5],
a12 = a[6],
a13 = a[7],
a20 = a[8],
a21 = a[9],
a22 = a[10],
a23 = a[11],
a30 = a[12],
a31 = a[13],
a32 = a[14],
a33 = a[15];
double b0 = b[0], b1 = b[1], b2 = b[2], b3 = b[3];
out[0] = b0*a00 + b1*a10 + b2*a20 + b3*a30;
out[1] = b0*a01 + b1*a11 + b2*a21 + b3*a31;
out[2] = b0*a02 + b1*a12 + b2*a22 + b3*a32;
out[3] = b0*a03 + b1*a13 + b2*a23 + b3*a33;
double b0 = b[0], b1 = b[1], b2 = b[2], b3 = b[3];
out[0] = b0 * a00 + b1 * a10 + b2 * a20 + b3 * a30;
out[1] = b0 * a01 + b1 * a11 + b2 * a21 + b3 * a31;
out[2] = b0 * a02 + b1 * a12 + b2 * a22 + b3 * a32;
out[3] = b0 * a03 + b1 * a13 + b2 * a23 + b3 * a33;
b0 = b[4]; b1 = b[5]; b2 = b[6]; b3 = b[7];
out[4] = b0*a00 + b1*a10 + b2*a20 + b3*a30;
out[5] = b0*a01 + b1*a11 + b2*a21 + b3*a31;
out[6] = b0*a02 + b1*a12 + b2*a22 + b3*a32;
out[7] = b0*a03 + b1*a13 + b2*a23 + b3*a33;
b0 = b[4];
b1 = b[5];
b2 = b[6];
b3 = b[7];
out[4] = b0 * a00 + b1 * a10 + b2 * a20 + b3 * a30;
out[5] = b0 * a01 + b1 * a11 + b2 * a21 + b3 * a31;
out[6] = b0 * a02 + b1 * a12 + b2 * a22 + b3 * a32;
out[7] = b0 * a03 + b1 * a13 + b2 * a23 + b3 * a33;
b0 = b[8]; b1 = b[9]; b2 = b[10]; b3 = b[11];
out[8] = b0*a00 + b1*a10 + b2*a20 + b3*a30;
out[9] = b0*a01 + b1*a11 + b2*a21 + b3*a31;
out[10] = b0*a02 + b1*a12 + b2*a22 + b3*a32;
out[11] = b0*a03 + b1*a13 + b2*a23 + b3*a33;
b0 = b[8];
b1 = b[9];
b2 = b[10];
b3 = b[11];
out[8] = b0 * a00 + b1 * a10 + b2 * a20 + b3 * a30;
out[9] = b0 * a01 + b1 * a11 + b2 * a21 + b3 * a31;
out[10] = b0 * a02 + b1 * a12 + b2 * a22 + b3 * a32;
out[11] = b0 * a03 + b1 * a13 + b2 * a23 + b3 * a33;
b0 = b[12]; b1 = b[13]; b2 = b[14]; b3 = b[15];
out[12] = b0*a00 + b1*a10 + b2*a20 + b3*a30;
out[13] = b0*a01 + b1*a11 + b2*a21 + b3*a31;
out[14] = b0*a02 + b1*a12 + b2*a22 + b3*a32;
out[15] = b0*a03 + b1*a13 + b2*a23 + b3*a33;
b0 = b[12];
b1 = b[13];
b2 = b[14];
b3 = b[15];
out[12] = b0 * a00 + b1 * a10 + b2 * a20 + b3 * a30;
out[13] = b0 * a01 + b1 * a11 + b2 * a21 + b3 * a31;
out[14] = b0 * a02 + b1 * a12 + b2 * a22 + b3 * a32;
out[15] = b0 * a03 + b1 * a13 + b2 * a23 + b3 * a33;
}
/**
* @param transformMatrix 16-element array of numbers representing 4x4 transform matrix
*/
/** @param transformMatrix 16-element array of numbers representing 4x4 transform matrix */
public static void decomposeMatrix(double[] transformMatrix, MatrixDecompositionContext ctx) {
Assertions.assertCondition(transformMatrix.length == 16);
@@ -115,16 +133,12 @@ public class MatrixMathHelper {
if (!isZero(matrix[0][3]) || !isZero(matrix[1][3]) || !isZero(matrix[2][3])) {
// rightHandSide is the right hand side of the equation.
// rightHandSide is a vector, or point in 3d space relative to the origin.
double[] rightHandSide = { matrix[0][3], matrix[1][3], matrix[2][3], matrix[3][3] };
double[] rightHandSide = {matrix[0][3], matrix[1][3], matrix[2][3], matrix[3][3]};
// Solve the equation by inverting perspectiveMatrix and multiplying
// rightHandSide by the inverse.
double[] inversePerspectiveMatrix = inverse(
perspectiveMatrix
);
double[] transposedInversePerspectiveMatrix = transpose(
inversePerspectiveMatrix
);
double[] inversePerspectiveMatrix = inverse(perspectiveMatrix);
double[] transposedInversePerspectiveMatrix = transpose(inversePerspectiveMatrix);
multiplyVectorByMatrix(rightHandSide, transposedInversePerspectiveMatrix, perspective);
} else {
// no perspective
@@ -192,36 +206,60 @@ public class MatrixMathHelper {
// Based on: http://nghiaho.com/?page_id=846
double conv = 180 / Math.PI;
rotationDegrees[0] = roundTo3Places(-Math.atan2(row[2][1], row[2][2]) * conv);
rotationDegrees[1] = roundTo3Places(-Math.atan2(-row[2][0], Math.sqrt(row[2][1] * row[2][1] + row[2][2] * row[2][2])) * conv);
rotationDegrees[1] =
roundTo3Places(
-Math.atan2(-row[2][0], Math.sqrt(row[2][1] * row[2][1] + row[2][2] * row[2][2]))
* conv);
rotationDegrees[2] = roundTo3Places(-Math.atan2(row[1][0], row[0][0]) * conv);
}
public static double determinant(double[] matrix) {
double m00 = matrix[0], m01 = matrix[1], m02 = matrix[2], m03 = matrix[3], m10 = matrix[4],
m11 = matrix[5], m12 = matrix[6], m13 = matrix[7], m20 = matrix[8], m21 = matrix[9],
m22 = matrix[10], m23 = matrix[11], m30 = matrix[12], m31 = matrix[13], m32 = matrix[14],
m33 = matrix[15];
return (
m03 * m12 * m21 * m30 - m02 * m13 * m21 * m30 -
m03 * m11 * m22 * m30 + m01 * m13 * m22 * m30 +
m02 * m11 * m23 * m30 - m01 * m12 * m23 * m30 -
m03 * m12 * m20 * m31 + m02 * m13 * m20 * m31 +
m03 * m10 * m22 * m31 - m00 * m13 * m22 * m31 -
m02 * m10 * m23 * m31 + m00 * m12 * m23 * m31 +
m03 * m11 * m20 * m32 - m01 * m13 * m20 * m32 -
m03 * m10 * m21 * m32 + m00 * m13 * m21 * m32 +
m01 * m10 * m23 * m32 - m00 * m11 * m23 * m32 -
m02 * m11 * m20 * m33 + m01 * m12 * m20 * m33 +
m02 * m10 * m21 * m33 - m00 * m12 * m21 * m33 -
m01 * m10 * m22 * m33 + m00 * m11 * m22 * m33
);
double m00 = matrix[0],
m01 = matrix[1],
m02 = matrix[2],
m03 = matrix[3],
m10 = matrix[4],
m11 = matrix[5],
m12 = matrix[6],
m13 = matrix[7],
m20 = matrix[8],
m21 = matrix[9],
m22 = matrix[10],
m23 = matrix[11],
m30 = matrix[12],
m31 = matrix[13],
m32 = matrix[14],
m33 = matrix[15];
return (m03 * m12 * m21 * m30
- m02 * m13 * m21 * m30
- m03 * m11 * m22 * m30
+ m01 * m13 * m22 * m30
+ m02 * m11 * m23 * m30
- m01 * m12 * m23 * m30
- m03 * m12 * m20 * m31
+ m02 * m13 * m20 * m31
+ m03 * m10 * m22 * m31
- m00 * m13 * m22 * m31
- m02 * m10 * m23 * m31
+ m00 * m12 * m23 * m31
+ m03 * m11 * m20 * m32
- m01 * m13 * m20 * m32
- m03 * m10 * m21 * m32
+ m00 * m13 * m21 * m32
+ m01 * m10 * m23 * m32
- m00 * m11 * m23 * m32
- m02 * m11 * m20 * m33
+ m01 * m12 * m20 * m33
+ m02 * m10 * m21 * m33
- m00 * m12 * m21 * m33
- m01 * m10 * m22 * m33
+ m00 * m11 * m22 * m33);
}
/**
* Inverse of a matrix. Multiplying by the inverse is used in matrix math
* instead of division.
* Inverse of a matrix. Multiplying by the inverse is used in matrix math instead of division.
*
* Formula from:
* <p>Formula from:
* http://www.euclideanspace.com/maths/algebra/matrix/functions/inverse/fourD/index.htm
*/
public static double[] inverse(double[] matrix) {
@@ -229,33 +267,139 @@ public class MatrixMathHelper {
if (isZero(det)) {
return matrix;
}
double m00 = matrix[0], m01 = matrix[1], m02 = matrix[2], m03 = matrix[3], m10 = matrix[4],
m11 = matrix[5], m12 = matrix[6], m13 = matrix[7], m20 = matrix[8], m21 = matrix[9],
m22 = matrix[10], m23 = matrix[11], m30 = matrix[12], m31 = matrix[13], m32 = matrix[14],
m33 = matrix[15];
double m00 = matrix[0],
m01 = matrix[1],
m02 = matrix[2],
m03 = matrix[3],
m10 = matrix[4],
m11 = matrix[5],
m12 = matrix[6],
m13 = matrix[7],
m20 = matrix[8],
m21 = matrix[9],
m22 = matrix[10],
m23 = matrix[11],
m30 = matrix[12],
m31 = matrix[13],
m32 = matrix[14],
m33 = matrix[15];
return new double[] {
(m12 * m23 * m31 - m13 * m22 * m31 + m13 * m21 * m32 - m11 * m23 * m32 - m12 * m21 * m33 + m11 * m22 * m33) / det,
(m03 * m22 * m31 - m02 * m23 * m31 - m03 * m21 * m32 + m01 * m23 * m32 + m02 * m21 * m33 - m01 * m22 * m33) / det,
(m02 * m13 * m31 - m03 * m12 * m31 + m03 * m11 * m32 - m01 * m13 * m32 - m02 * m11 * m33 + m01 * m12 * m33) / det,
(m03 * m12 * m21 - m02 * m13 * m21 - m03 * m11 * m22 + m01 * m13 * m22 + m02 * m11 * m23 - m01 * m12 * m23) / det,
(m13 * m22 * m30 - m12 * m23 * m30 - m13 * m20 * m32 + m10 * m23 * m32 + m12 * m20 * m33 - m10 * m22 * m33) / det,
(m02 * m23 * m30 - m03 * m22 * m30 + m03 * m20 * m32 - m00 * m23 * m32 - m02 * m20 * m33 + m00 * m22 * m33) / det,
(m03 * m12 * m30 - m02 * m13 * m30 - m03 * m10 * m32 + m00 * m13 * m32 + m02 * m10 * m33 - m00 * m12 * m33) / det,
(m02 * m13 * m20 - m03 * m12 * m20 + m03 * m10 * m22 - m00 * m13 * m22 - m02 * m10 * m23 + m00 * m12 * m23) / det,
(m11 * m23 * m30 - m13 * m21 * m30 + m13 * m20 * m31 - m10 * m23 * m31 - m11 * m20 * m33 + m10 * m21 * m33) / det,
(m03 * m21 * m30 - m01 * m23 * m30 - m03 * m20 * m31 + m00 * m23 * m31 + m01 * m20 * m33 - m00 * m21 * m33) / det,
(m01 * m13 * m30 - m03 * m11 * m30 + m03 * m10 * m31 - m00 * m13 * m31 - m01 * m10 * m33 + m00 * m11 * m33) / det,
(m03 * m11 * m20 - m01 * m13 * m20 - m03 * m10 * m21 + m00 * m13 * m21 + m01 * m10 * m23 - m00 * m11 * m23) / det,
(m12 * m21 * m30 - m11 * m22 * m30 - m12 * m20 * m31 + m10 * m22 * m31 + m11 * m20 * m32 - m10 * m21 * m32) / det,
(m01 * m22 * m30 - m02 * m21 * m30 + m02 * m20 * m31 - m00 * m22 * m31 - m01 * m20 * m32 + m00 * m21 * m32) / det,
(m02 * m11 * m30 - m01 * m12 * m30 - m02 * m10 * m31 + m00 * m12 * m31 + m01 * m10 * m32 - m00 * m11 * m32) / det,
(m01 * m12 * m20 - m02 * m11 * m20 + m02 * m10 * m21 - m00 * m12 * m21 - m01 * m10 * m22 + m00 * m11 * m22) / det
(m12 * m23 * m31
- m13 * m22 * m31
+ m13 * m21 * m32
- m11 * m23 * m32
- m12 * m21 * m33
+ m11 * m22 * m33)
/ det,
(m03 * m22 * m31
- m02 * m23 * m31
- m03 * m21 * m32
+ m01 * m23 * m32
+ m02 * m21 * m33
- m01 * m22 * m33)
/ det,
(m02 * m13 * m31
- m03 * m12 * m31
+ m03 * m11 * m32
- m01 * m13 * m32
- m02 * m11 * m33
+ m01 * m12 * m33)
/ det,
(m03 * m12 * m21
- m02 * m13 * m21
- m03 * m11 * m22
+ m01 * m13 * m22
+ m02 * m11 * m23
- m01 * m12 * m23)
/ det,
(m13 * m22 * m30
- m12 * m23 * m30
- m13 * m20 * m32
+ m10 * m23 * m32
+ m12 * m20 * m33
- m10 * m22 * m33)
/ det,
(m02 * m23 * m30
- m03 * m22 * m30
+ m03 * m20 * m32
- m00 * m23 * m32
- m02 * m20 * m33
+ m00 * m22 * m33)
/ det,
(m03 * m12 * m30
- m02 * m13 * m30
- m03 * m10 * m32
+ m00 * m13 * m32
+ m02 * m10 * m33
- m00 * m12 * m33)
/ det,
(m02 * m13 * m20
- m03 * m12 * m20
+ m03 * m10 * m22
- m00 * m13 * m22
- m02 * m10 * m23
+ m00 * m12 * m23)
/ det,
(m11 * m23 * m30
- m13 * m21 * m30
+ m13 * m20 * m31
- m10 * m23 * m31
- m11 * m20 * m33
+ m10 * m21 * m33)
/ det,
(m03 * m21 * m30
- m01 * m23 * m30
- m03 * m20 * m31
+ m00 * m23 * m31
+ m01 * m20 * m33
- m00 * m21 * m33)
/ det,
(m01 * m13 * m30
- m03 * m11 * m30
+ m03 * m10 * m31
- m00 * m13 * m31
- m01 * m10 * m33
+ m00 * m11 * m33)
/ det,
(m03 * m11 * m20
- m01 * m13 * m20
- m03 * m10 * m21
+ m00 * m13 * m21
+ m01 * m10 * m23
- m00 * m11 * m23)
/ det,
(m12 * m21 * m30
- m11 * m22 * m30
- m12 * m20 * m31
+ m10 * m22 * m31
+ m11 * m20 * m32
- m10 * m21 * m32)
/ det,
(m01 * m22 * m30
- m02 * m21 * m30
+ m02 * m20 * m31
- m00 * m22 * m31
- m01 * m20 * m32
+ m00 * m21 * m32)
/ det,
(m02 * m11 * m30
- m01 * m12 * m30
- m02 * m10 * m31
+ m00 * m12 * m31
+ m01 * m10 * m32
- m00 * m11 * m32)
/ det,
(m01 * m12 * m20
- m02 * m11 * m20
+ m02 * m10 * m21
- m00 * m12 * m21
- m01 * m10 * m22
+ m00 * m11 * m22)
/ det
};
}
/**
* Turns columns into rows and rows into columns.
*/
/** Turns columns into rows and rows into columns. */
public static double[] transpose(double[] m) {
return new double[] {
m[0], m[4], m[8], m[12],
@@ -265,9 +409,7 @@ public class MatrixMathHelper {
};
}
/**
* Based on: http://tog.acm.org/resources/GraphicsGems/gemsii/unmatrix.c
*/
/** Based on: http://tog.acm.org/resources/GraphicsGems/gemsii/unmatrix.c */
public static void multiplyVectorByMatrix(double[] v, double[] m, double[] result) {
double vx = v[0], vy = v[1], vz = v[2], vw = v[3];
result[0] = vx * m[0] + vy * m[4] + vz * m[8] + vw * m[12];
@@ -276,33 +418,23 @@ public class MatrixMathHelper {
result[3] = vx * m[3] + vy * m[7] + vz * m[11] + vw * m[15];
}
/**
* From: https://code.google.com/p/webgl-mjs/source/browse/mjs.js
*/
/** From: https://code.google.com/p/webgl-mjs/source/browse/mjs.js */
public static double v3Length(double[] a) {
return Math.sqrt(a[0]*a[0] + a[1]*a[1] + a[2]*a[2]);
return Math.sqrt(a[0] * a[0] + a[1] * a[1] + a[2] * a[2]);
}
/**
* Based on: https://code.google.com/p/webgl-mjs/source/browse/mjs.js
*/
/** Based on: https://code.google.com/p/webgl-mjs/source/browse/mjs.js */
public static double[] v3Normalize(double[] vector, double norm) {
double im = 1 / (isZero(norm) ? v3Length(vector) : norm);
return new double[] {
vector[0] * im,
vector[1] * im,
vector[2] * im
};
return new double[] {vector[0] * im, vector[1] * im, vector[2] * im};
}
/**
* The dot product of a and b, two 3-element vectors.
* From: https://code.google.com/p/webgl-mjs/source/browse/mjs.js
* The dot product of a and b, two 3-element vectors. From:
* https://code.google.com/p/webgl-mjs/source/browse/mjs.js
*/
public static double v3Dot(double[] a, double[] b) {
return a[0] * b[0] +
a[1] * b[1] +
a[2] * b[2];
return a[0] * b[0] + a[1] * b[1] + a[2] * b[2];
}
/**
@@ -310,10 +442,8 @@ public class MatrixMathHelper {
* http://www.opensource.apple.com/source/WebCore/WebCore-514/platform/graphics/transforms/TransformationMatrix.cpp
*/
public static double[] v3Combine(double[] a, double[] b, double aScale, double bScale) {
return new double[]{
aScale * a[0] + bScale * b[0],
aScale * a[1] + bScale * b[1],
aScale * a[2] + bScale * b[2]
return new double[] {
aScale * a[0] + bScale * b[0], aScale * a[1] + bScale * b[1], aScale * a[2] + bScale * b[2]
};
}
@@ -322,10 +452,8 @@ public class MatrixMathHelper {
* http://www.opensource.apple.com/source/WebCore/WebCore-514/platform/graphics/transforms/TransformationMatrix.cpp
*/
public static double[] v3Cross(double[] a, double[] b) {
return new double[]{
a[1] * b[2] - a[2] * b[1],
a[2] * b[0] - a[0] * b[2],
a[0] * b[1] - a[1] * b[0]
return new double[] {
a[1] * b[2] - a[2] * b[1], a[2] * b[0] - a[0] * b[2], a[0] * b[1] - a[1] * b[0]
};
}
@@ -344,8 +472,14 @@ public class MatrixMathHelper {
}
public static void resetIdentityMatrix(double[] matrix) {
matrix[1] = matrix[2] = matrix[3] = matrix[4] = matrix[6] = matrix[7] = matrix[8] = matrix[9] =
matrix[11] = matrix[12] = matrix[13] = matrix[14] = 0;
matrix[1] =
matrix[2] =
matrix[3] =
matrix[4] =
matrix[6] =
matrix[7] =
matrix[8] =
matrix[9] = matrix[11] = matrix[12] = matrix[13] = matrix[14] = 0;
matrix[0] = matrix[5] = matrix[10] = matrix[15] = 1;
}