/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.submatch/re.submatch.op/ |
compare.pass.cpp | 225 sub_match sm1; local 226 sm1.first = x.begin(); 227 sm1.second = x.end(); 228 sm1.matched = true; 233 assert((sm1 == sm2) == (x == y)); 234 assert((sm1 != sm2) == (x != y)); 235 assert((sm1 < sm2) == (x < y)); 236 assert((sm1 > sm2) == (x > y)); 237 assert((sm1 <= sm2) == (x <= y)); 238 assert((sm1 >= sm2) == (x >= y)) [all...] |
/external/eigen/bench/ |
sparse_randomsetter.cpp | 45 void dostuff(const char* name, EigenSparseMatrix& sm1) 47 int rows = sm1.rows(); 48 int cols = sm1.cols(); 49 sm1.setZero(); 51 SetterType* set1 = new SetterType(sm1); 71 EigenSparseMatrix sm1(rows,cols), sm2(rows,cols); 88 dostuff<RandomSetter<EigenSparseMatrix,StdMapTraits,Bits> >("std::map ", sm1); 89 dostuff<RandomSetter<EigenSparseMatrix,GnuHashMapTraits,Bits> >("gnu::hash_map", sm1); 90 dostuff<RandomSetter<EigenSparseMatrix,GoogleDenseHashMapTraits,Bits> >("google::dense", sm1); 91 dostuff<RandomSetter<EigenSparseMatrix,GoogleSparseHashMapTraits,Bits> >("google::sparse", sm1); [all...] |
sparse_transpose.cpp | 42 EigenSparseMatrix sm1(rows,cols), sm3(rows,cols); 47 fillMatrix(density, rows, cols, sm1); 53 eiToDense(sm1, m1); 59 std::cout << "Non zeros: " << sm1.nonZeros()/float(sm1.rows()*sm1.cols())*100 << "%\n"; 63 BENCH(for (int k=0; k<REPEAT; ++k) sm3 = sm1.transpose();) 71 eiToCSparse(sm1, m1); 83 eiToGmm(sm1, m1); 93 eiToMtl(sm1, m1) [all...] |
sparse_lu.cpp | 46 void doEigen(const char* name, const EigenSparseMatrix& sm1, const VectorX& b, VectorX& x, int flags = 0) 50 SparseLU<EigenSparseMatrix,Backend> lu(sm1, flags); 87 EigenSparseMatrix sm1(rows, cols); 88 fillMatrix(density, rows, cols, sm1); 97 eiToDense(sm1, m1); 117 doEigen<Eigen::UmfPack>("Eigen/UmfPack (auto)", sm1, b, x, 0); 122 doEigen<Eigen::SuperLU>("Eigen/SuperLU (nat)", sm1, b, x, Eigen::NaturalOrdering); 123 // doEigen<Eigen::SuperLU>("Eigen/SuperLU (MD AT+A)", sm1, b, x, Eigen::MinimumDegree_AT_PLUS_A); 124 // doEigen<Eigen::SuperLU>("Eigen/SuperLU (MD ATA)", sm1, b, x, Eigen::MinimumDegree_ATA); 125 doEigen<Eigen::SuperLU>("Eigen/SuperLU (COLAMD)", sm1, b, x, Eigen::ColApproxMinimumDegree) [all...] |
sparse_product.cpp | 104 EigenSparseMatrix sm1(rows,cols), sm2(rows,cols), sm3(rows,cols), sm4(rows,cols); 109 sm1.setZero(); 111 fillMatrix2(nnzPerCol, rows, cols, sm1); 120 eiToDense(sm1, m1); 155 std::cout << "Eigen sparse\t" << sm1.nonZeros()/(float(sm1.rows())*float(sm1.cols()))*100 << "% * " 158 BENCH(sm3 = sm1 * sm2; ) 161 // BENCH(sm3 = sm1.transpose() * sm2; ) 164 // BENCH(sm3 = sm1.transpose() * sm2.transpose(); [all...] |
sparse_cholesky.cpp | 64 void doEigen(const char* name, const EigenSparseSelfAdjointMatrix& sm1, int flags = 0) 69 SparseLLT<EigenSparseSelfAdjointMatrix,Backend> chol(sm1, flags); 73 std::cout << " nnz: " << sm1.nonZeros() << " => " << chol.matrixL().nonZeros() << "\n"; 92 EigenSparseSelfAdjointMatrix sm1(rows, cols); 94 fillSpdMatrix(density, rows, cols, sm1); 104 eiToDense(sm1, m1); 127 doEigen<Eigen::DefaultBackend>("Eigen/Sparse", sm1, Eigen::IncompleteFactorization); 130 doEigen<Eigen::Cholmod>("Eigen/Cholmod", sm1, Eigen::IncompleteFactorization); 134 doEigen<Eigen::Taucs>("Eigen/Taucs", sm1, Eigen::IncompleteFactorization); 140 taucs_ccs_matrix A = sm1.asTaucsMatrix() [all...] |
sparse_dense_product.cpp | 58 EigenSparseMatrix sm1(rows,cols); 65 //fillMatrix(density, rows, cols, sm1); 66 fillMatrix2(7, rows, cols, sm1); 73 eiToDense(sm1, m1); 93 std::cout << "Eigen sparse\t" << sm1.nonZeros()/float(sm1.rows()*sm1.cols())*100 << "%\n"; 95 BENCH(asm("#myc"); v2 = sm1 * v1; asm("#myd");) 99 BENCH( { asm("#mya"); v2 = sm1.transpose() * v1; asm("#myb"); }) 105 // DynamicSparseMatrix<Scalar> m1(sm1); [all...] |
sparse_trisolver.cpp | 63 EigenSparseTriMatrix sm1(rows,cols); 72 EigenSparseTriMatrix sm1(rows, cols); 73 fillMatrix(density, rows, cols, sm1); 83 eiToDense(sm1, m1); 99 EigenSparseTriMatrixRow sm2 = sm1; 101 BENCH(x = sm1.solveTriangular(b);) 110 // BENCH(sm1.inverseProductInPlace(x);) 127 eiToCSparse(sm1, m1); 140 eiToGmm(sm1, m1); 165 eiToMtl(sm1, m1) [all...] |
/external/eigen/test/ |
basicstuff.cpp | 33 SquareMatrixType sm1 = SquareMatrixType::Random(rows,rows), sm2(rows,rows); local 113 sm2.col(i) = sm1.row(i); 114 VERIFY_IS_APPROX(sm2,sm1.transpose()); 118 sm2.col(i).noalias() = sm1.row(i); 119 VERIFY_IS_APPROX(sm2,sm1.transpose()); 123 sm2.col(i).noalias() += sm1.row(i); 124 VERIFY_IS_APPROX(sm2,sm1.transpose()); 128 sm2.col(i).noalias() -= sm1.row(i); 129 VERIFY_IS_APPROX(sm2,-sm1.transpose());
|
sparse_product.cpp | 177 SparseMatrixType sm1(3,2); 179 sm1.setZero(); 182 DenseMatrixType m3 = sm1*m2;
|
/external/libvpx/libvpx/vp9/common/mips/dspr2/ |
vp9_loopfilter_filters_dspr2.c | 33 uint8_t *sm1, *s0, *s1, *s2, *s3, *s4, *s5, *s6; local 58 sm1 = s - (pitch << 2); 59 s0 = sm1 + pitch; 81 "lw %[pm1], (%[sm1]) \n\t" 88 : [sm1] "r" (sm1), [s0] "r" (s0), [s5] "r" (s5), [s6] "r" (s6)
|
/frameworks/base/core/tests/coretests/src/com/android/internal/util/ |
StateMachineTest.java | 616 StateMachine1 sm1 = new StateMachine1("sm1"); local 617 sm1.start(); 618 if (sm1.isDbg()) tlog("testStateMachine1 E"); 620 synchronized (sm1) { 622 sm1.sendMessage(TEST_CMD_1); 623 sm1.sendMessage(TEST_CMD_2); 627 sm1.wait(); 633 assertEquals(2, sm1.mEnterCount); 634 assertEquals(2, sm1.mExitCount) [all...] |
/external/libvpx/libvpx/vp8/common/mips/dspr2/ |
loopfilter_filters_dspr2.c | 356 unsigned char *sm1, *s0, *s1, *s2, *s3, *s4, *s5, *s6; local 372 sm1 = s - (p << 2); 395 pm1 = *((uint32_t *)(sm1)); 417 sm1 += 4; 440 pm1 = *((uint32_t *)(sm1)); 462 sm1 += 4; 485 pm1 = *((uint32_t *)(sm1)); 507 sm1 += 4; 530 pm1 = *((uint32_t *)(sm1)); 566 unsigned char *sm1, *s0, *s1, *s2, *s3, *s4, *s5, *s6 local 1644 unsigned char *sm1, *s0, *s1, *s2, *s3, *s4, *s5, *s6; local 1789 unsigned char *sm1, *s0, *s1, *s2, *s3, *s4, *s5, *s6; local [all...] |