HomeSort by relevance Sort by last modified time
    Searched refs:transpose (Results 1 - 25 of 644) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/eigen/doc/snippets/
DenseBase_LinSpaced.cpp 1 cout << VectorXi::LinSpaced(4,7,10).transpose() << endl;
2 cout << VectorXd::LinSpaced(5,0.0,1.0).transpose() << endl;
DenseBase_LinSpaced_seq.cpp 1 cout << VectorXi::LinSpaced(Sequential,4,7,10).transpose() << endl;
2 cout << VectorXd::LinSpaced(Sequential,5,0.0,1.0).transpose() << endl;
MatrixBase_diagonal_int.cpp 4 << m.diagonal(1).transpose() << endl
5 << m.diagonal(-2).transpose() << endl;
MatrixBase_diagonal_template_int.cpp 4 << m.diagonal<1>().transpose() << endl
5 << m.diagonal<-2>().transpose() << endl;
GeneralizedEigenSolver.cpp 5 cout << "The (complex) numerators of the generalzied eigenvalues are: " << ges.alphas().transpose() << endl;
6 cout << "The (real) denominatore of the generalzied eigenvalues are: " << ges.betas().transpose() << endl;
7 cout << "The (complex) generalzied eigenvalues are (alphas./beta): " << ges.eigenvalues().transpose() << endl;
MatrixBase_transpose.cpp 3 cout << "Here is the transpose of m:" << endl << m.transpose() << endl;
4 cout << "Here is the coefficient (1,0) in the transpose of m:" << endl
5 << m.transpose()(1,0) << endl;
7 m.transpose()(1,0) = 0;
SelfAdjointEigenSolver_SelfAdjointEigenSolver.cpp 3 Matrix4f A = X + X.transpose();
5 cout << "The eigenvalues of A are: " << es.eigenvalues().transpose() << endl;
7 cout << "The eigenvalues of A+I are: " << es.eigenvalues().transpose() << endl;
SelfAdjointEigenSolver_compute_MatrixType.cpp 3 MatrixXf A = X + X.transpose();
5 cout << "The eigenvalues of A are: " << es.eigenvalues().transpose() << endl;
7 cout << "The eigenvalues of A+I are: " << es.eigenvalues().transpose() << endl;
tut_arithmetic_transpose_aliasing.cpp 4 a = a.transpose(); // !!! do NOT do this !!!
EigenSolver_compute.cpp 4 cout << "The eigenvalues of A are: " << es.eigenvalues().transpose() << endl;
6 cout << "The eigenvalues of A+I are: " << es.eigenvalues().transpose() << endl;
tut_arithmetic_transpose_conjugate.cpp 4 cout << "Here is the matrix a^T\n" << a.transpose() << endl;
SelfAdjointEigenSolver_compute_MatrixType2.cpp 2 MatrixXd A = X * X.transpose();
4 MatrixXd B = X * X.transpose();
  /external/guava/guava-tests/test/com/google/common/collect/
TransposedTableTest.java 22 * Test cases for {@link Tables#transpose}.
32 Table<String, Integer, Character> table = Tables.transpose(original);
40 assertSame(original, Tables.transpose(Tables.transpose(original)));
45 Table<String, Integer, Character> transpose = Tables.transpose(original); local
47 assertEquals((Character) 'a', transpose.get("foo", 1));
52 Table<String, Integer, Character> transpose = Tables.transpose(original); local
53 transpose.put("foo", 1, 'a')
59 Table<String, Integer, Character> transpose = Tables.transpose(original); local
    [all...]
  /external/eigen/test/eigen2/
eigen2_bug_132.cpp 17 VectorXd y = A.transpose() * (b-c); // bug 132: infinite recursion in coeffRef
18 VectorXd z = (b-c).transpose() * A; // bug 132: infinite recursion in coeffRef
24 VectorXd z = (b-c).transpose() * A.transpose();
eigen2_sparse_product.cpp 36 VERIFY_IS_APPROX(m4=m2.transpose()*m3, refMat4=refMat2.transpose()*refMat3);
37 VERIFY_IS_APPROX(m4=m2.transpose()*m3.transpose(), refMat4=refMat2.transpose()*refMat3.transpose());
38 VERIFY_IS_APPROX(m4=m2*m3.transpose(), refMat4=refMat2*refMat3.transpose());
42 VERIFY_IS_APPROX(dm4=m2*refMat3.transpose(), refMat4=refMat2*refMat3.transpose());
    [all...]
product.h 61 // (we use Transpose.h but this doesn't count as a test for it)
63 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2));
65 m3 *= m1.transpose() * m2;
66 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2));
67 VERIFY_IS_APPROX(m3, m1.lazy() * (m1.transpose()*m2));
82 VERIFY_IS_APPROX(v1.transpose(), v1.transpose() * identity);
93 VERIFY(areNotApprox(m1.transpose()*m2,m2.transpose()*m1))
    [all...]
  /external/eigen/test/
nesting_ops.cpp 21 VERIFY_IS_APPROX( (m.transpose() * m).diagonal().sum(), (m.transpose() * m).diagonal().sum() );
22 VERIFY_IS_APPROX( (m.transpose() * m).diagonal().array().abs().sum(), (m.transpose() * m).diagonal().array().abs().sum() );
24 VERIFY_IS_APPROX( (m.transpose() * m).array().abs().sum(), (m.transpose() * m).array().abs().sum() );
product.h 60 // (we use Transpose.h but this doesn't count as a test for it)
61 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2));
63 m3 *= m1.transpose() * m2;
64 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2));
65 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2));
77 VERIFY_IS_APPROX(v1.transpose(), v1.transpose() * identity);
88 VERIFY(areNotApprox(m1.transpose()*m2,m2.transpose()*m1))
    [all...]
product_small.cpp 21 matAstatic.cwiseProduct(matBstatic.transpose()).sum() );
28 matAdynamic.cwiseProduct(matBdynamic.transpose()).sum() );
47 VERIFY_IS_APPROX( (v * v.transpose()) * v, (v * v.transpose()).eval() * v);
  /external/ceres-solver/internal/ceres/
blas.cc 52 bool transpose,
60 char trans = transpose ? 'T' : 'N';
61 int n = transpose ? num_cols : num_rows;
62 int k = transpose ? num_rows : num_cols;
blas.h 41 // transpose = true : c = alpha * a'a + beta * c;
42 // transpose = false : c = alpha * aa' + beta * c;
48 bool transpose,
  /external/eigen/failtest/
const_qualified_transpose_method_retval.cpp 12 Transpose<Matrix3d> b(m.transpose());
ref_4.cpp 11 call_ref(A.transpose());
  /external/eigen/doc/examples/
tut_arithmetic_matrix_mul.cpp 13 std::cout << "Here is u^T*mat:\n" << u.transpose()*mat << std::endl;
14 std::cout << "Here is u^T*v:\n" << u.transpose()*v << std::endl;
15 std::cout << "Here is u*v^T:\n" << u*v.transpose() << std::endl;
  /packages/apps/Launcher3/tests/src/com/android/launcher3/util/
FocusLogicTest.java 63 int[][] map = transpose(new int[][] {
75 int[][] map = transpose(new int[][] {
88 int[][] map = transpose(new int[][] {
99 map = transpose(new int[][] {
113 int[][] map = transpose(new int[][] {
125 map = transpose(new int[][] {
137 map = transpose(new int[][] {
149 map = transpose(new int[][] {
160 map = transpose(new int[][] {
170 map = transpose(new int[][]
248 private int[][] transpose(int[][] m) { method in class:FocusLogicTest
    [all...]

Completed in 290 milliseconds

1 2 3 4 5 6 7 8 91011>>