/external/libcxx/test/std/utilities/time/time.duration/time.duration.arithmetic/ |
H A D | op_-.pass.cpp | 23 std::chrono::minutes m2 = -m; local 24 assert(m2.count() == -m.count()); 29 constexpr std::chrono::minutes m2 = -m; local 30 static_assert(m2.count() == -m.count(), "");
|
/external/libcxx/test/std/thread/thread.mutex/thread.lock/thread.lock.guard/ |
H A D | variadic_mutex.pass.cpp | 76 TestMutex m1, m2; 78 LG lg(m1, m2); 79 assert(m1.locked && m2.locked); 81 assert(!m1.locked && !m2.locked); 85 TestMutex m1, m2, m3; 87 LG lg(m1, m2, m3); 88 assert(m1.locked && m2.locked && m3.locked); 90 assert(!m1.locked && !m2.locked && !m3.locked); 96 MT m1, m2; 99 LG lg(m1, m2); [all...] |
H A D | variadic_adopt_lock.pass.cpp | 43 TestMutex m1, m2; local 45 m1.lock(); m2.lock(); 47 LG lg(m1, m2, std::adopt_lock); 48 assert(m1.locked && m2.locked); 50 assert(!m1.locked && !m2.locked); 53 TestMutex m1, m2, m3; local 55 m1.lock(); m2.lock(); m3.lock(); 57 LG lg(m1, m2, m3, std::adopt_lock); 58 assert(m1.locked && m2.locked && m3.locked); 60 assert(!m1.locked && !m2 [all...] |
/external/libvpx/libvpx/vpx_dsp/x86/ |
H A D | highbd_sad4d_sse2.asm | 29 mova m2, m0 31 psubusw m2, m5 35 por m5, m2 39 mova m2, m0 41 psubusw m2, m7 45 por m7, m2 49 movu m2, [ref1q+%3*2] 51 movhps m2, [ref1q+%5*2] 53 psubusw m3, m2 54 psubusw m2, m [all...] |
/external/valgrind/helgrind/tests/ |
H A D | hg02_deadlock.c | 5 static pthread_mutex_t m2 = PTHREAD_MUTEX_INITIALIZER; variable 10 pthread_mutex_lock(&m2); 12 pthread_mutex_unlock(&m2); 19 pthread_mutex_lock(&m2); 22 pthread_mutex_unlock(&m2);
|
/external/eigen/test/ |
H A D | vectorwiseop.cpp | 29 m2(rows, cols), 37 m2 = m1; 38 m2.colwise() += colvec; 39 VERIFY_IS_APPROX(m2, m1.colwise() + colvec); 40 VERIFY_IS_APPROX(m2.col(c), m1.col(c) + colvec); 42 VERIFY_RAISES_ASSERT(m2.colwise() += colvec.transpose()); 45 m2 = m1; 46 m2.rowwise() += rowvec; 47 VERIFY_IS_APPROX(m2, m1.rowwise() + rowvec); 48 VERIFY_IS_APPROX(m2 [all...] |
H A D | diagonal.cpp | 21 m2 = MatrixType::Random(rows, cols); local 27 m2.diagonal() = 2 * m1.diagonal(); 28 m2.diagonal()[0] *= 3; 44 m2.template diagonal<N1>() = 2 * m1.template diagonal<N1>(); 45 VERIFY_IS_APPROX(m2.template diagonal<N1>(), static_cast<Scalar>(2) * m1.diagonal(N1)); 46 m2.template diagonal<N1>()[0] *= 3; 47 VERIFY_IS_APPROX(m2.template diagonal<N1>()[0], static_cast<Scalar>(6) * m1.template diagonal<N1>()[0]); 50 m2.template diagonal<N2>() = 2 * m1.template diagonal<N2>(); 51 m2.template diagonal<N2>()[0] *= 3; 52 VERIFY_IS_APPROX(m2 [all...] |
H A D | triangular.cpp | 26 m2 = MatrixType::Random(rows, cols), local 34 MatrixType m2up = m2.template triangularView<Upper>(); 40 VERIFY(!m2.isLowerTriangular()); 43 // VERIFY_IS_APPROX(m1up.transpose() * m2, m1.upper().transpose().lower() * m2); 54 m1.template triangularView<Upper>() = m2.transpose() + m2; 55 m3 = m2.transpose() + m2; 60 m1.template triangularView<Lower>() = m2 146 m2 = MatrixType::Random(rows, cols), local [all...] |
H A D | integer_types.cpp | 31 m2 = MatrixType::Random(rows, cols), local 36 } while(m1 == mzero || m1 == m2); 46 VERIFY_IS_EQUAL(-m2+m1+m2, m1); 47 VERIFY_IS_EQUAL((-m1+m2)*s1, -s1*m1+s1*m2); 67 m2 = MatrixType::Random(rows, cols), local 80 } while(m1 == mzero || m1 == m2); 103 VERIFY(m1!=m2); 104 VERIFY(!(m1==m2)); [all...] |
H A D | product_symm.cpp | 25 m2 = MatrixType::Random(rows, cols), m3; local 36 m2 = m1.template triangularView<Lower>(); 37 m3 = m2.template selfadjointView<Lower>(); 39 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs1), 42 VERIFY_IS_APPROX(rhs12 = (s1*m2).transpose().template selfadjointView<Upper>() * (s2*rhs1), 45 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>().transpose() * (s2*rhs1), 48 VERIFY_IS_APPROX(rhs12 = (s1*m2).conjugate().template selfadjointView<Lower>() * (s2*rhs1), 51 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>().conjugate() * (s2*rhs1), 54 VERIFY_IS_APPROX(rhs12 = (s1*m2).adjoint().template selfadjointView<Upper>() * (s2*rhs1), 57 VERIFY_IS_APPROX(rhs12 = (s1*m2) [all...] |
H A D | nomalloc.cpp | 34 m2 = MatrixType::Random(rows, cols), local 42 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2); 43 VERIFY_IS_APPROX((m1+m2)(r,c), (m1(r,c))+(m2(r,c))); 45 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2)); 47 m2.col(0).noalias() = m1 * m1.col(0); 48 m2.col(0).noalias() -= m1.adjoint() * m1.col(0); 49 m2 [all...] |
H A D | product_syrk.cpp | 25 m2 = MatrixType::Random(rows, cols), local 37 m2.setZero(); 38 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()), 40 m2.setZero(); 41 VERIFY_IS_APPROX(((m2.template triangularView<Lower>() += s1 * rhs2 * rhs22.adjoint()).nestedExpression()), 45 m2.setZero(); 46 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs2,s1)._expression(), 48 m2.setZero(); 49 VERIFY_IS_APPROX((m2.template triangularView<Upper>() += s1 * rhs22 * rhs2.adjoint()).nestedExpression(), 53 m2 [all...] |
H A D | linearstructure.cpp | 32 m2 = MatrixType::Random(rows, cols), local 43 VERIFY_IS_APPROX(m1+m2-m1, m2); 44 VERIFY_IS_APPROX(-m2+m1+m2, m1); 46 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2); 47 VERIFY_IS_APPROX((-m1+m2)*s1, -s1*m1+s1*m2); 48 m3 = m2; m 139 Matrix4d m2, m3; local [all...] |
H A D | sparse_basic.cpp | 71 SparseMatrixType m2(rows,cols); 77 m2.reserve(VectorXi::Constant(m2.outerSize(), int(nnz))); 79 m2.reserve(m2.outerSize() * nnz); 88 m2.insert(i,j) = m1(i,j) = internal::random<Scalar>(); 97 m2.finalize(); 98 VERIFY_IS_APPROX(m2,m1); 105 SparseMatrixType m2(rows,cols); 107 m2 [all...] |
/external/libcxx/test/std/containers/associative/multiset/multiset.special/ |
H A D | non_member_swap.pass.cpp | 28 M m2; local 30 M m2_save = m2; 31 swap(m1, m2); 33 assert(m2 == m1_save); 48 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 50 M m2_save = m2; 51 swap(m1, m2); 53 assert(m2 == m1_save); 64 M m2; local 66 M m2_save = m2; [all...] |
/external/libcxx/test/std/containers/associative/set/set.special/ |
H A D | non_member_swap.pass.cpp | 28 M m2; local 30 M m2_save = m2; 31 swap(m1, m2); 33 assert(m2 == m1_save); 48 M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0])); 50 M m2_save = m2; 51 swap(m1, m2); 53 assert(m2 == m1_save); 64 M m2; local 66 M m2_save = m2; [all...] |
/external/eigen/unsupported/test/ |
H A D | cxx11_tensor_forced_eval.cpp | 21 MatrixXf m2(3,3); 23 m2.setRandom(); 26 TensorMap<Tensor<float, 2> > mat2(m2.data(), 3,3); 37 VERIFY_IS_APPROX(mat3(0, 0), (m1*m2).eval()(0,0)); 38 VERIFY_IS_APPROX(mat3(0, 1), (m1*m2).eval()(0,1)); 39 VERIFY_IS_APPROX(mat3(0, 2), (m1*m2).eval()(0,2)); 40 VERIFY_IS_APPROX(mat3(1, 0), (m1*m2).eval()(1,0)); 41 VERIFY_IS_APPROX(mat3(1, 1), (m1*m2).eval()(1,1)); 42 VERIFY_IS_APPROX(mat3(1, 2), (m1*m2).eval()(1,2)); 43 VERIFY_IS_APPROX(mat3(2, 0), (m1*m2) [all...] |
/external/eigen/doc/examples/ |
H A D | TemplateKeyword_flexible.cpp | 16 MatrixXi m2 = MatrixXi::Random(4,4); local 17 std::cout << "m2 before copy:" << std::endl; 18 std::cout << m2 << std::endl << std::endl; 19 copyUpperTriangularPart(m2, m1.topLeftCorner(4,4)); 20 std::cout << "m2 after copy:" << std::endl; 21 std::cout << m2 << std::endl << std::endl;
|
H A D | TemplateKeyword_simple.cpp | 14 MatrixXf m2 = MatrixXf::Random(4,4); local 15 std::cout << "m2 before copy:" << std::endl; 16 std::cout << m2 << std::endl << std::endl; 17 copyUpperTriangularPart(m2, m1); 18 std::cout << "m2 after copy:" << std::endl; 19 std::cout << m2 << std::endl << std::endl;
|
/external/webrtc/webrtc/base/ |
H A D | optional.h | 86 friend void swap(Optional& m1, Optional& m2) { argument 88 swap(m1.value_, m2.value_); 89 swap(m1.has_value_, m2.has_value_); 121 friend bool operator==(const Optional& m1, const Optional& m2) { argument 122 return m1.has_value_ && m2.has_value_ ? m1.value_ == m2.value_ 123 : m1.has_value_ == m2.has_value_; 125 friend bool operator!=(const Optional& m1, const Optional& m2) { argument 126 return m1.has_value_ && m2.has_value_ ? m1.value_ != m2 [all...] |
/external/syslinux/com32/lib/ |
H A D | memswap.c | 10 void memswap(void *m1, void *m2, size_t n) argument 13 char *q = m2;
|
/external/libcxx/test/std/experimental/memory/memory.resource.adaptor/memory.resource.adaptor.mem/ |
H A D | do_is_equal.pass.cpp | 49 ex::memory_resource const & m2 = r2; member in class:ex 51 assert(m1.is_equal(m2)); 52 assert(m2.is_equal(m1)); 64 ex::memory_resource const & m2 = r2; member in class:ex 66 assert(!m1.is_equal(m2)); 67 assert(!m2.is_equal(m1)); 78 ex::memory_resource const & m2 = r2; member in class:ex 80 assert(!m1.is_equal(m2)); 81 assert(!m2.is_equal(m1));
|
/external/libcxx/test/std/diagnostics/syserr/syserr.errcat/syserr.errcat.derived/ |
H A D | message.pass.cpp | 27 std::string m2 = e_cat2.message(5); local 30 assert(!m2.empty()); 32 assert(m1 == m2);
|
/external/clang/test/Analysis/diagnostics/ |
H A D | report-issues-within-main-file.cpp | 35 int m2 = 0; local 36 m2 = in/m2; 37 m2++; 1694 // CHECK-NEXT: <string>'m2' initialized to 0</string> 1696 // CHECK-NEXT: <string>'m2' initialized to 0</string>
|
/external/testng/src/test/java/test/dependent/ |
H A D | ClassWide2Test.java | 10 public void m2() { method in class:ClassWide2Test
|