HomeSort by relevance Sort by last modified time
    Searched refs:m1 (Results 51 - 75 of 372) sorted by null

1 23 4 5 6 7 8 91011>>

  /external/eigen/test/
swap.cpp 35 MatrixType m1 = MatrixType::Random(rows,cols); local
39 MatrixType m1_copy = m1;
44 m1.swap(m2);
45 VERIFY_IS_APPROX(m1,m2_copy);
47 m1 = m1_copy;
51 m1.swap(m3);
52 VERIFY_IS_APPROX(m1,m3_copy);
54 m1 = m1_copy;
58 m1.swap(m2.block(0,0,rows,cols));
59 VERIFY_IS_APPROX(m1,m2_copy)
    [all...]
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);
133 MatrixType m1 = MatrixType::Random(rows, cols), local
    [all...]
diagonal.cpp 23 MatrixType m1 = MatrixType::Random(rows, cols), local
27 VERIFY_IS_APPROX(m1.diagonal(), m1.transpose().diagonal());
28 m2.diagonal() = 2 * m1.diagonal();
39 if(m1.template diagonal<N1>().RowsAtCompileTime!=Dynamic)
41 VERIFY(m1.template diagonal<N1>().RowsAtCompileTime == m1.diagonal(N1).size());
43 if(m1.template diagonal<N2>().RowsAtCompileTime!=Dynamic)
45 VERIFY(m1.template diagonal<N2>().RowsAtCompileTime == m1.diagonal(N2).size())
    [all...]
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.template triangularView<Eigen::UnitUpper>() * v1, largerEps))
    [all...]
selfadjoint.cpp 24 MatrixType m1 = MatrixType::Random(rows, cols), local
27 m1.diagonal() = m1.diagonal().real().template cast<Scalar>();
30 m3 = m1.template selfadjointView<Upper>();
31 VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Upper>()), MatrixType(m1.template triangularView<Upper>()));
35 m3 = m1.template selfadjointView<Lower>();
36 VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Lower>()), MatrixType(m1.template triangularView<Lower>()));
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.determinant())
    [all...]
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...]
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));
59 VERIFY_IS_APPROX( m1, m1);
60 VERIFY_IS_NOT_APPROX( m1, 2*m1);
61 VERIFY_IS_MUCH_SMALLER_THAN( mzero, m1);
    [all...]
  /external/eigen/test/eigen2/
eigen2_nomalloc.cpp 33 MatrixType m1 = MatrixType::Random(rows, cols), local
50 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2);
51 VERIFY_IS_APPROX((m1+m2)(r,c), (m1(r,c))+(m2(r,c)));
52 VERIFY_IS_APPROX(m1.cwise() * m1.block(0,0,rows,cols), m1.cwise() * m1);
53 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2))
    [all...]
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.determinant())
    [all...]
eigen2_submatrices.cpp 19 CheckMinor(MatrixType& m1, int r1, int c1)
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 = MatrixType::Random(rows, cols) local
    [all...]
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...]
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.cols() + m1image.cols())
64 sidebyside << m1, m1image; local
    [all...]
  /ndk/tests/build/issue22336-ICE-emit-rtl/jni/
issue22336-ICE-emit-rtl.cpp 10 __attribute__((always_inline)) inline Matrix43 operator*(const Matrix43& m1, const Matrix43& m2) {
12 rr.row0 = vmulq_n_f32( m2.row0, vgetq_lane_f32(m1.row0, 0));
13 rr.row0 = vmlaq_n_f32(rr.row0, m2.row1, vgetq_lane_f32(m1.row0, 1));
14 rr.row0 = vmlaq_n_f32(rr.row0, m2.row2, vgetq_lane_f32(m1.row0, 2));
16 rr.row1 = vmulq_n_f32( m2.row0, vgetq_lane_f32(m1.row1, 0));
17 rr.row1 = vmlaq_n_f32(rr.row1, m2.row1, vgetq_lane_f32(m1.row1, 1));
18 rr.row1 = vmlaq_n_f32(rr.row1, m2.row2, vgetq_lane_f32(m1.row1, 2));
20 rr.row2 = vmulq_n_f32( m2.row0, vgetq_lane_f32(m1.row2, 0));
21 rr.row2 = vmlaq_n_f32(rr.row2, m2.row1, vgetq_lane_f32(m1.row2, 1));
22 rr.row2 = vmlaq_n_f32(rr.row2, m2.row2, vgetq_lane_f32(m1.row2, 2))
    [all...]
  /external/icu4c/test/perf/ubrkperf/
UBrkPerf_r.pl 29 my $m1 = "-- -m char";
39 $m = $m1;
72 "TestForwardChar", ["$p1 $m1 TestICUForward", "$p2 $m1 TestICUForward"],
77 "TestIsBoundChar", ["$p1 $m1 TestICUIsBound", "$p2 $m1 TestICUIsBound"],
UBrkPerf.pl 30 my $m1 = "-- -m char";
40 $m = $m1;
80 "TestForwardChar", ["$p1 $m1 TestICUForward", "$p2 $m1 TestICUForward", "$p3 $m1 TestICUForward"],
85 "TestIsBoundChar", ["$p1 $m1 TestICUIsBound", "$p2 $m1 TestICUIsBound", "$p3 $m1 TestICUIsBound"],
  /ndk/sources/cxx-stl/llvm-libc++/test/support/
hexfloat.h 27 hexfloat(long long m1, unsigned long long m0, int exp)
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/
default-constructor-for-members.cpp 19 M m1; local
  /external/clang/test/Lexer/
constants.c 29 int m1 = '\\\''; // expected-warning {{multi-character character constant}} variable
  /ndk/sources/cxx-stl/llvm-libc++/test/diagnostics/syserr/syserr.errcat/syserr.errcat.derived/
message.pass.cpp 26 std::string m1 = e_cat1.message(5); local
29 assert(!m1.empty());
32 assert(m1 == m2);
33 assert(m1 != m3);
  /bionic/libc/bionic/
memswap.c 30 void memswap(void *m1, void *m2, size_t n)
32 char* p = m1;
  /ndk/sources/cxx-stl/llvm-libc++/test/thread/thread.mutex/thread.lock/thread.lock.guard/
assign.fail.cpp 21 std::mutex m1; local
23 std::lock_guard<std::mutex> lg(m1);
  /external/valgrind/main/none/tests/s390x/
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/
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(rows,cols), m3(rows,cols)
    [all...]
  /external/eigen/doc/examples/
class_CwiseUnaryOp.cpp 16 Matrix4d m1 = Matrix4d::Random(); local
17 cout << m1 << endl << "becomes: " << endl << m1.unaryExpr(CwiseClampOp<double>(-0.5,0.5)) << endl;

Completed in 314 milliseconds

1 23 4 5 6 7 8 91011>>