/external/libcxx/test/containers/associative/multimap/multimap.special/ |
H A D | non_member_swap.pass.cpp | 36 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); 38 M m1_save = m1; 40 swap(m1, m2); 41 assert(m1 == m2_save); 59 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); 61 M m1_save = m1; 63 swap(m1, m2); 64 assert(m1 == m2_save); 78 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); 80 M m1_save = m1; [all...] |
/external/eigen/test/eigen2/ |
H A D | eigen2_determinant.cpp | 21 MatrixType m1(size, size), m2(size, size); 22 m1.setRandom(); 27 VERIFY_IS_APPROX((m1*m2).determinant(), m1.determinant() * m2.determinant()); 34 m2 = m1; 36 VERIFY_IS_APPROX(m2.determinant(), -m1.determinant()); 37 m2 = m1; 39 VERIFY_IS_APPROX(m2.determinant(), -m1.determinant()); 42 m2 = m1; 44 VERIFY_IS_APPROX(m2.determinant(), m1 [all...] |
H A D | eigen2_submatrices.cpp | 19 CheckMinor(MatrixType& m1, int r1, int c1) argument 21 int rows = m1.rows(); 22 int cols = m1.cols(); 24 Matrix<Scalar, Dynamic, Dynamic> mi = m1.minor(0,0).eval(); 25 VERIFY_IS_APPROX(mi, m1.block(1,1,rows-1,cols-1)); 26 mi = m1.minor(r1,c1); 27 VERIFY_IS_APPROX(mi.transpose(), m1.transpose().minor(c1,r1)); 29 m1.minor(r1,c1)(0,0) = m1.minor(0,0)(0,0); 51 MatrixType m1 local [all...] |
H A D | eigen2_basicstuff.cpp | 22 MatrixType m1 = MatrixType::Random(rows, cols), local 38 m1.coeffRef(r,c) = x; 39 VERIFY_IS_APPROX(x, m1.coeff(r,c)); 40 m1(r,c) = x; 41 VERIFY_IS_APPROX(x, m1(r,c)); 56 VERIFY_IS_APPROX( m1, m1); 57 VERIFY_IS_NOT_APPROX( m1, 2*m1); 58 VERIFY_IS_MUCH_SMALLER_THAN( mzero, m1); [all...] |
H A D | eigen2_lu.cpp | 44 MatrixType m1(rows, cols), m2(cols, cols2), m3(rows, cols2), k(1,1); 45 m1 = MatrixType::Random(rows,cols); 47 for(int i = rank; i < rows; i++) m1.row(i).setZero(); 49 for(int i = rank; i < cols; i++) m1.col(i).setZero(); 50 doSomeRankPreservingOperations(m1); 52 LU<MatrixType> lu(m1); 61 VERIFY((m1 * m1kernel).isMuchSmallerThan(m1)); 63 MatrixType sidebyside(m1.rows(), m1 64 sidebyside << m1, m1image; local [all...] |
/external/libcxx/test/support/ |
H A D | hexfloat.h | 27 hexfloat(long long m1, unsigned long long m0, int exp) argument 30 int s = m1 < 0 ? -1 : 1; 31 value_ = std::ldexp(m1 + s * std::ldexp(T(m0), -static_cast<int>(n -
|
/external/clang/test/CodeGenCXX/ |
H A D | default-constructor-for-members.cpp | 18 M m1; local
|
/external/libcxx/test/diagnostics/syserr/syserr.errcat/syserr.errcat.derived/ |
H A D | message.pass.cpp | 26 std::string m1 = e_cat1.message(5); local 29 assert(!m1.empty()); 32 assert(m1 == m2); 33 assert(m1 != m3);
|
/external/libcxx/test/thread/thread.mutex/thread.mutex.requirements/thread.sharedtimedmutex.requirements/thread.sharedtimedmutex.class/ |
H A D | copy.fail.cpp | 22 std::shared_timed_mutex m1(m0);
|
/external/eigen/test/ |
H A D | triangular.cpp | 25 MatrixType m1 = MatrixType::Random(rows, cols), local 33 MatrixType m1up = m1.template triangularView<Upper>(); 43 // VERIFY_IS_APPROX(m1up.transpose() * m2, m1.upper().transpose().lower() * m2); 48 r1.template triangularView<Upper>() += m1; 53 m1.setZero(); 54 m1.template triangularView<Upper>() = m2.transpose() + m2; 56 VERIFY_IS_APPROX(m3.template triangularView<Lower>().transpose().toDenseMatrix(), m1); 59 m1.setZero(); 60 m1.template triangularView<Lower>() = m2.transpose() + m2; 61 VERIFY_IS_APPROX(m3.template triangularView<Lower>().toDenseMatrix(), m1); 130 MatrixType m1 = MatrixType::Random(rows, cols), local [all...] |
H A D | product_trmv.cpp | 24 MatrixType m1 = MatrixType::Random(rows, cols), local 30 m1 = MatrixType::Random(rows, cols); 33 m3 = m1.template triangularView<Eigen::Lower>(); 34 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Lower>() * v1, largerEps)); 35 m3 = m1.template triangularView<Eigen::Upper>(); 36 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Upper>() * v1, largerEps)); 37 m3 = m1.template triangularView<Eigen::UnitLower>(); 38 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::UnitLower>() * v1, largerEps)); 39 m3 = m1.template triangularView<Eigen::UnitUpper>(); 40 VERIFY((m3 * v1).isApprox(m1 [all...] |
H A D | block.cpp | 15 block_real_only(const MatrixType &m1, Index r1, Index r2, Index c1, Index c2, const Scalar& s1) { argument 17 VERIFY_IS_APPROX(m1.row(r1).cwiseMax(s1), m1.cwiseMax(s1).row(r1)); 18 VERIFY_IS_APPROX(m1.col(c1).cwiseMin(s1), m1.cwiseMin(s1).col(c1)); 20 VERIFY_IS_APPROX(m1.block(r1,c1,r2-r1+1,c2-c1+1).cwiseMin(s1), m1.cwiseMin(s1).block(r1,c1,r2-r1+1,c2-c1+1)); 21 VERIFY_IS_APPROX(m1.block(r1,c1,r2-r1+1,c2-c1+1).cwiseMax(s1), m1.cwiseMax(s1).block(r1,c1,r2-r1+1,c2-c1+1)); 46 MatrixType m1 local 225 MatrixType m1 = MatrixType::Random(rows, cols); local [all...] |
H A D | selfadjoint.cpp | 23 MatrixType m1 = MatrixType::Random(rows, cols), local 26 m1.diagonal() = m1.diagonal().real().template cast<Scalar>(); 29 m3 = m1.template selfadjointView<Upper>(); 30 VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Upper>()), MatrixType(m1.template triangularView<Upper>())); 34 m3 = m1.template selfadjointView<Lower>(); 35 VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Lower>()), MatrixType(m1.template triangularView<Lower>()));
|
H A D | determinant.cpp | 22 MatrixType m1(size, size), m2(size, size); 23 m1.setRandom(); 28 VERIFY_IS_APPROX((m1*m2).eval().determinant(), m1.determinant() * m2.determinant()); 35 m2 = m1; 37 VERIFY_IS_APPROX(m2.determinant(), -m1.determinant()); 38 m2 = m1; 40 VERIFY_IS_APPROX(m2.determinant(), -m1.determinant()); 43 m2 = m1; 45 VERIFY_IS_APPROX(m2.determinant(), m1 [all...] |
H A D | diagonalmatrices.cpp | 26 MatrixType m1 = MatrixType::Random(rows, cols), local 58 VERIFY_IS_APPROX( ((ldm1 * m1)(i,j)) , ldm1.diagonal()(i) * m1(i,j) ); 59 VERIFY_IS_APPROX( ((ldm1 * (m1+m2))(i,j)) , ldm1.diagonal()(i) * (m1+m2)(i,j) ); 60 VERIFY_IS_APPROX( ((m1 * rdm1)(i,j)) , rdm1.diagonal()(j) * m1(i,j) ); 61 VERIFY_IS_APPROX( ((v1.asDiagonal() * m1)(i,j)) , v1(i) * m1(i,j) ); 62 VERIFY_IS_APPROX( ((m1 * rv [all...] |
H A D | product_notemporary.cpp | 44 ColMajorMatrixType m1 = MatrixType::Random(rows, cols), local 60 VERIFY_EVALUATION_COUNT( m3 = (m1 * m2.adjoint()), 1); 61 VERIFY_EVALUATION_COUNT( m3.noalias() = m1 * m2.adjoint(), 0); 63 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * (m1 * m2.transpose()), 0); 65 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * m2.adjoint(), 0); 66 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * (m1*s3+m2*s2).adjoint(), 1); 67 VERIFY_EVALUATION_COUNT( m3.noalias() = (s1 * m1).adjoint() * s2 * m2, 0); 68 VERIFY_EVALUATION_COUNT( m3.noalias() += s1 * (-m1*s3).adjoint() * (s2 * m2 * s3), 0); 69 VERIFY_EVALUATION_COUNT( m3.noalias() -= s1 * (m1 [all...] |
H A D | array_reverse.cpp | 27 MatrixType m1 = MatrixType::Random(rows, cols); local 30 MatrixType m1_r = m1.reverse(); 34 VERIFY_IS_APPROX(m1_r(i, j), m1(rows - 1 - i, cols - 1 - j)); 38 Reverse<MatrixType> m1_rd(m1); 42 VERIFY_IS_APPROX(m1_rd(i, j), m1(rows - 1 - i, cols - 1 - j)); 46 Reverse<MatrixType, BothDirections> m1_rb(m1); 50 VERIFY_IS_APPROX(m1_rb(i, j), m1(rows - 1 - i, cols - 1 - j)); 54 Reverse<MatrixType, Vertical> m1_rv(m1); 58 VERIFY_IS_APPROX(m1_rv(i, j), m1(rows - 1 - i, j)); 62 Reverse<MatrixType, Horizontal> m1_rh(m1); [all...] |
H A D | basicstuff.cpp | 26 MatrixType m1 = MatrixType::Random(rows, cols), local 41 m1.coeffRef(r,c) = x; 42 VERIFY_IS_APPROX(x, m1.coeff(r,c)); 43 m1(r,c) = x; 44 VERIFY_IS_APPROX(x, m1(r,c)); 58 VERIFY_IS_APPROX( m1, m1); 59 VERIFY_IS_NOT_APPROX( m1, 2*m1); 60 VERIFY_IS_MUCH_SMALLER_THAN( mzero, m1); [all...] |
H A D | product_syrk.cpp | 24 MatrixType m1 = MatrixType::Random(rows, cols), local 77 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(m1.col(c),s1)._expression()), 78 ((s1 * m1.col(c) * m1.col(c).adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); 81 VERIFY_IS_APPROX((m2.template selfadjointView<Upper>().rankUpdate(m1.col(c),s1)._expression()), 82 ((s1 * m1.col(c) * m1.col(c).adjoint()).eval().template triangularView<Upper>().toDenseMatrix())); 84 VERIFY_IS_APPROX((rm2.template selfadjointView<Upper>().rankUpdate(m1.col(c),s1)._expression()), 85 ((s1 * m1.col(c) * m1 [all...] |
/external/libcxx/test/thread/thread.mutex/thread.lock/thread.lock.guard/ |
H A D | assign.fail.cpp | 21 std::mutex m1; local 23 std::lock_guard<std::mutex> lg(m1);
|
/external/libcxx/test/thread/thread.mutex/thread.lock/thread.lock.shared/thread.lock.shared.cons/ |
H A D | copy_assign.fail.cpp | 21 std::shared_timed_mutex m1; variable 29 std::shared_lock<std::shared_timed_mutex> lk1(m1);
|
/external/valgrind/main/none/tests/s390x/ |
H A D | mul.h | 3 #define MUL_REG_MEM(insn, m1, m2) \ 5 unsigned long tmp1 = m1; \ 6 unsigned long tmp2 = m1; \ 15 printf(#insn " %16.16lX * %16.16lX = %16.16lX%16.16lX\n", m1, m2, tmp1, tmp2); \ 18 #define MUL_REG_REG(insn, m1, m2) \ 20 unsigned long tmp1 = m1; \ 21 unsigned long tmp2 = m1; \ 30 printf(#insn " %16.16lX * %16.16lX = %16.16lX%16.16lX\n", m1, m2, tmp1, tmp2); \ 33 #define MUL_REG_IMM(insn, m1, m2) \ 35 unsigned long tmp1 = m1; \ [all...] |
/external/eigen/bench/ |
H A D | sparse_transpose.cpp | 52 DenseMatrix m1(rows,cols), m3(rows,cols); 53 eiToDense(sm1, m1); 54 BENCH(for (int k=0; k<REPEAT; ++k) m3 = m1.transpose();) 70 cs *m1, *m3; local 71 eiToCSparse(sm1, m1); 73 BENCH(for (int k=0; k<REPEAT; ++k) { m3 = cs_transpose(m1,1); cs_spfree(m3);}) 82 GmmSparse m1(rows,cols), m3(rows,cols); 83 eiToGmm(sm1, m1); 84 BENCH(for (int k=0; k<REPEAT; ++k) gmm::copy(gmm::transposed(m1),m3);) 92 MtlSparse m1(row [all...] |
/external/eigen/doc/examples/ |
H A D | class_CwiseUnaryOp.cpp | 16 Matrix4d m1 = Matrix4d::Random(); local 17 cout << m1 << endl << "becomes: " << endl << m1.unaryExpr(CwiseClampOp<double>(-0.5,0.5)) << endl;
|
/external/chromium_org/third_party/icu/source/test/perf/ubrkperf/ |
H A D | UBrkPerf_r.pl | 29 my $m1 = "-- -m char"; 39 $m = $m1; 82 "TestForwardChar", ["$p1,$m1,TestICUForward", "$p2,$m1,TestICUForward"], 87 "TestIsBoundChar", ["$p1,$m1,TestICUIsBound", "$p2,$m1,TestICUIsBound"],
|