| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/CodeGen/PBQP/ |
| ReductionRules.h | 35 using Matrix = typename GraphT::Matrix;
44 const Matrix &ECosts = G.getEdgeCosts(EId);
79 using Matrix = typename GraphT::Matrix;
97 const Matrix *YXECosts = FlipEdge1 ?
98 new Matrix(G.getEdgeCosts(YXEId).transpose()) :
101 const Matrix *ZXECosts = FlipEdge2 ?
102 new Matrix(G.getEdgeCosts(ZXEId).transpose()) :
135 const Matrix &YZECosts = G.getEdgeCosts(YZEId)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/CodeGen/PBQP/ |
| ReductionRules.h | 35 using Matrix = typename GraphT::Matrix;
44 const Matrix &ECosts = G.getEdgeCosts(EId);
79 using Matrix = typename GraphT::Matrix;
97 const Matrix *YXECosts = FlipEdge1 ?
98 new Matrix(G.getEdgeCosts(YXEId).transpose()) :
101 const Matrix *ZXECosts = FlipEdge2 ?
102 new Matrix(G.getEdgeCosts(ZXEId).transpose()) :
135 const Matrix &YZECosts = G.getEdgeCosts(YZEId)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/CodeGen/PBQP/ |
| ReductionRules.h | 35 using Matrix = typename GraphT::Matrix;
44 const Matrix &ECosts = G.getEdgeCosts(EId);
79 using Matrix = typename GraphT::Matrix;
97 const Matrix *YXECosts = FlipEdge1 ?
98 new Matrix(G.getEdgeCosts(YXEId).transpose()) :
101 const Matrix *ZXECosts = FlipEdge2 ?
102 new Matrix(G.getEdgeCosts(ZXEId).transpose()) :
135 const Matrix &YZECosts = G.getEdgeCosts(YZEId)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/CodeGen/PBQP/ |
| ReductionRules.h | 35 using Matrix = typename GraphT::Matrix;
44 const Matrix &ECosts = G.getEdgeCosts(EId);
79 using Matrix = typename GraphT::Matrix;
97 const Matrix *YXECosts = FlipEdge1 ?
98 new Matrix(G.getEdgeCosts(YXEId).transpose()) :
101 const Matrix *ZXECosts = FlipEdge2 ?
102 new Matrix(G.getEdgeCosts(ZXEId).transpose()) :
135 const Matrix &YZECosts = G.getEdgeCosts(YZEId)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/CodeGen/PBQP/ |
| ReductionRules.h | 35 using Matrix = typename GraphT::Matrix;
44 const Matrix &ECosts = G.getEdgeCosts(EId);
79 using Matrix = typename GraphT::Matrix;
97 const Matrix *YXECosts = FlipEdge1 ?
98 new Matrix(G.getEdgeCosts(YXEId).transpose()) :
101 const Matrix *ZXECosts = FlipEdge2 ?
102 new Matrix(G.getEdgeCosts(ZXEId).transpose()) :
135 const Matrix &YZECosts = G.getEdgeCosts(YZEId)
[all...] |
| /external/eigen/bench/ |
| geometry.cpp | 19 typedef Matrix<RealScalar,Dynamic,Dynamic> A;
20 typedef Matrix</*Real*/Scalar,Dynamic,Dynamic> B;
21 typedef Matrix<Scalar,Dynamic,Dynamic> C;
22 typedef Matrix<RealScalar,Dynamic,Dynamic> M;
65 struct get_dim<Matrix<S,R,C,O,MR,MC> > { enum { Dim = R }; };
72 Matrix<typename Transformation::Scalar,get_dim<Transformation>::Dim,N> data;
99 Matrix<Scalar,3,4> mat34; mat34.setRandom();
106 Matrix<Scalar,3,3> mat33; mat33.setRandom();
118 bench("matrix 3x3", mat33);
|
| /external/eigen/doc/snippets/ |
| class_FullPivLU.cpp | 1 typedef Matrix<double, 5, 3> Matrix5x3;
2 typedef Matrix<double, 5, 5> Matrix5x5;
4 cout << "Here is the matrix m:" << endl << m << endl;
6 cout << "Here is, up to permutations, its LU decomposition matrix:"
15 cout << "Let us now reconstruct the original matrix m:" << endl;
|
| DirectionWise_hnormalized.cpp | 1 typedef Matrix<double,4,Dynamic> Matrix4Xd;
4 cout << "The matrix M is:" << endl << M << endl << endl;
|
| HouseholderQR_solve.cpp | 1 typedef Matrix<float,3,3> Matrix3x3;
4 cout << "Here is the matrix m:" << endl << m << endl;
5 cout << "Here is the matrix y:" << endl << y << endl;
|
| VectorwiseOp_homogeneous.cpp | 1 typedef Matrix<double,3,Dynamic> Matrix3Xd;
4 cout << "The matrix M is:" << endl << M << endl << endl;
|
| /external/eigen/test/ |
| jacobisvd.cpp | 65 typedef Matrix<RealScalar, Size, 1> RealVecType;
86 CALL_SUBTEST_5(( jacobisvd<Matrix<float,3,5> >() ));
87 CALL_SUBTEST_6(( jacobisvd<Matrix<double,Dynamic,2> >(Matrix<double,Dynamic,2>(10,2)) ));
101 // Test on inf/nan matrix
106 CALL_SUBTEST_13(( jacobisvd_verify_assert(Matrix<double,6,1>()) ));
107 CALL_SUBTEST_13(( jacobisvd_verify_assert(Matrix<double,1,6>()) ));
108 CALL_SUBTEST_13(( jacobisvd_verify_assert(Matrix<double,Dynamic,1>(r)) ));
109 CALL_SUBTEST_13(( jacobisvd_verify_assert(Matrix<double,1,Dynamic>(c)) ));
|
| constructor.cpp | 43 CALL_SUBTEST_1( ctor_init1(Matrix<float, 1, 1>()) );
49 Matrix<Index,1,1> a(123);
53 Matrix<Index,1,1> a(123.0);
57 Matrix<float,1,1> a(123);
|
| dontalign.cpp | 24 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
25 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> SquareMatrixType;
57 dontalign(Matrix<float, 32, 32>());
58 dontalign(Matrix<std::complex<float>, 32, 32>());
|
| smallvectors.cpp | 15 typedef Matrix<Scalar, 1, 2> V2;
16 typedef Matrix<Scalar, 3, 1> V3;
17 typedef Matrix<Scalar, 1, 4> V4;
18 typedef Matrix<Scalar, Dynamic, 1> VX;
|
| /external/eigen/unsupported/test/ |
| forward_adolc.cpp | 31 typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;
32 typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;
33 typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;
44 void operator() (const Matrix<T,InputsAtCompileTime,1>& x, Matrix<T,ValuesAtCompileTime,1>* _v) const
46 Matrix<T,ValuesAtCompileTime,1>& v = *_v;
136 Matrix<adtl::adouble,2,1> x;
138 Matrix<adtl::adouble,Dynamic,Dynamic> A(4,4);;
|
| /external/llvm/include/llvm/CodeGen/ |
| LiveRegMatrix.h | 11 // along two dimensions: Slot indexes and register units. The matrix is used by
46 // The matrix is represented as a LiveIntervalUnion per register unit.
48 LiveIntervalUnion::Array Matrix;
135 /// Query a line of the assigned virtual register matrix directly.
143 LiveIntervalUnion *getLiveUnions() { return &Matrix[0]; }
|
| /external/llvm/lib/CodeGen/ |
| AllocationOrder.cpp | 33 const LiveRegMatrix *Matrix)
38 TRI->getRegAllocationHints(VirtReg, Order, Hints, MF, &VRM, Matrix);
|
| RegAllocBase.h | 65 LiveRegMatrix *Matrix;
75 : TRI(nullptr), MRI(nullptr), VRM(nullptr), LIS(nullptr), Matrix(nullptr) {}
|
| /external/tensorflow/tensorflow/contrib/rnn/kernels/ |
| lstm_ops_gpu.cu.cc | 56 // 1) 'icfo' is a matrix such that,
183 typename TTypes<T>::Matrix xh, typename TTypes<T>::Matrix i,
184 typename TTypes<T>::Matrix cs, typename TTypes<T>::Matrix f,
185 typename TTypes<T>::Matrix o, typename TTypes<T>::Matrix ci,
186 typename TTypes<T>::Matrix co, typename TTypes<T>::Matrix icfo,
187 typename TTypes<T>::Matrix h, int batch_size, int cell_size
[all...] |
| /external/tensorflow/tensorflow/core/kernels/ |
| concat_lib.h | 27 // matrix) and concatenate it along the axis 1 ("putting them next to each
39 // {1, Numelements} and reshape the result matrix to have shape
48 typename TTypes<T, 2>::Matrix* output);
65 typename TTypes<T, 2>::Matrix* output);
|
| matrix_solve_ls_op_impl.h | 41 using Matrix = typename Base::Matrix;
75 const ConstMatrixMap& matrix = inputs[0]; variable
86 const int64 rows = matrix.rows();
87 const int64 cols = matrix.cols();
89 // The result is the empty matrix.
93 // The fast branch assumes that matrix is not rank deficient and
96 // 1 / cond(matrix) > sqrt(std::numeric_limits<Scalar>::epsilon()).
99 if (matrix.rows() >= matrix.cols())
[all...] |
| xent_op_gpu.cu.cc | 36 typename TTypes<T>::Matrix scratch,
38 typename TTypes<T>::Matrix backprop) {
|
| /frameworks/base/services/core/java/com/android/server/wm/utils/ |
| CoordinateTransforms.java | 25 import android.graphics.Matrix;
34 * Sets a matrix such that given a rotation, it transforms physical display
37 * @param rotation the rotation to which the matrix should transform
38 * @param out the matrix to be set
41 @Dimension int physicalWidth, @Dimension int physicalHeight, Matrix out) {
|
| /packages/apps/Launcher3/quickstep/src/com/android/quickstep/ |
| TaskOverlayFactory.java | 20 import android.graphics.Matrix;
51 public void setTaskInfo(Task task, ThumbnailData thumbnail, Matrix matrix) { }
|
| /cts/tests/openglperf2/test/ |
| Android.mk | 19 LOCAL_SRC_FILES += ../jni/graphics/Matrix.cpp
|
