/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/ |
ReductionRules.h | 33 typedef typename GraphT::Matrix Matrix; 42 const Matrix &ECosts = G.getEdgeCosts(EId); 77 typedef typename GraphT::Matrix Matrix; 95 const Matrix *YXECosts = FlipEdge1 ? 96 new Matrix(G.getEdgeCosts(YXEId).transpose()) : 99 const Matrix *ZXECosts = FlipEdge2 ? 100 new Matrix(G.getEdgeCosts(ZXEId).transpose()) : 133 const Matrix &YZECosts = G.getEdgeCosts(YZEId) [all...] |
/prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/ |
ReductionRules.h | 33 typedef typename GraphT::Matrix Matrix; 42 const Matrix &ECosts = G.getEdgeCosts(EId); 77 typedef typename GraphT::Matrix Matrix; 95 const Matrix *YXECosts = FlipEdge1 ? 96 new Matrix(G.getEdgeCosts(YXEId).transpose()) : 99 const Matrix *ZXECosts = FlipEdge2 ? 100 new Matrix(G.getEdgeCosts(ZXEId).transpose()) : 133 const Matrix &YZECosts = G.getEdgeCosts(YZEId) [all...] |
/prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/ |
ReductionRules.h | 33 typedef typename GraphT::Matrix Matrix; 42 const Matrix &ECosts = G.getEdgeCosts(EId); 77 typedef typename GraphT::Matrix Matrix; 95 const Matrix *YXECosts = FlipEdge1 ? 96 new Matrix(G.getEdgeCosts(YXEId).transpose()) : 99 const Matrix *ZXECosts = FlipEdge2 ? 100 new Matrix(G.getEdgeCosts(ZXEId).transpose()) : 133 const Matrix &YZECosts = G.getEdgeCosts(YZEId) [all...] |
/prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/ |
ReductionRules.h | 33 typedef typename GraphT::Matrix Matrix; 42 const Matrix &ECosts = G.getEdgeCosts(EId); 77 typedef typename GraphT::Matrix Matrix; 95 const Matrix *YXECosts = FlipEdge1 ? 96 new Matrix(G.getEdgeCosts(YXEId).transpose()) : 99 const Matrix *ZXECosts = FlipEdge2 ? 100 new Matrix(G.getEdgeCosts(ZXEId).transpose()) : 133 const Matrix &YZECosts = G.getEdgeCosts(YZEId) [all...] |
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/ |
ReductionRules.h | 33 typedef typename GraphT::Matrix Matrix; 42 const Matrix &ECosts = G.getEdgeCosts(EId); 77 typedef typename GraphT::Matrix Matrix; 95 const Matrix *YXECosts = FlipEdge1 ? 96 new Matrix(G.getEdgeCosts(YXEId).transpose()) : 99 const Matrix *ZXECosts = FlipEdge2 ? 100 new Matrix(G.getEdgeCosts(ZXEId).transpose()) : 133 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/eigen/unsupported/doc/examples/ |
PolynomialSolver1.cpp | 10 typedef Matrix<double,5,1> Vector5d; 14 Eigen::Matrix<double,6,1> polynomial; 28 Eigen::Matrix<float,7,1> hardCase_polynomial; 34 Eigen::Matrix<float,6,1> evals;
|
/external/swiftshader/src/Renderer/ |
Plane.cpp | 17 #include "Matrix.hpp" 41 Plane operator*(const Plane &p, const Matrix &T) 43 Matrix M = !T; 51 Plane operator*(const Matrix &T, const Plane &p) 53 Matrix M = !T;
|
Point.hpp | 21 struct Matrix; 59 friend Point operator*(const Matrix &M, const Point& P); 60 friend Point operator*(const Point &P, const Matrix &M); 61 friend Point &operator*=(Point &P, const Matrix &M);
|
/external/webrtc/webrtc/modules/audio_processing/beamformer/ |
complex_matrix.h | 18 #include "webrtc/modules/audio_processing/beamformer/matrix.h" 24 // An extension of Matrix for operations that only work on a complex type. 26 class ComplexMatrix : public Matrix<complex<T> > { 28 ComplexMatrix() : Matrix<complex<T> >() {} 31 : Matrix<complex<T> >(num_rows, num_columns) {} 34 : Matrix<complex<T> >(data, num_rows, num_columns) {} 36 // Complex Matrix operations.
|
/cts/tests/tests/graphics/src/android/graphics/cts/ |
RadialGradientTest.java | 23 import android.graphics.Matrix; 44 Matrix m = new Matrix();
|
/development/samples/ApiDemos/src/com/example/android/apis/graphics/spritetext/ |
Projector.java | 19 import android.opengl.Matrix; 43 Matrix.multiplyMM(mMVP, 0, mGrabber.mProjection, 0, mGrabber.mModelView, 0); 47 Matrix.multiplyMV(mV, 0, mMVP, 0, obj, objOffset); 57 * Get the current projection matrix. Has the side-effect of 58 * setting current matrix mode to GL_PROJECTION 67 * Get the current model view matrix. Has the side-effect of 68 * setting current matrix mode to GL_MODELVIEW
|
/development/samples/devbytes/animation/ToonGame/src/com/example/android/toongame/ |
SkewableTextView.java | 21 import android.graphics.Matrix; 75 Matrix matrix = new Matrix(); local 76 matrix.setSkew(-mSkewX, 0); 78 matrix.mapRect(mTempRect);
|