HomeSort by relevance Sort by last modified time
    Searched full:cols (Results 76 - 100 of 825) sorted by null

1 2 34 5 6 7 8 91011>>

  /external/eigen/test/eigen2/
eigen2_lu.cpp 17 for(int a = 0; a < 3*(m.rows()+m.cols()); a++)
27 i = Eigen::ei_random<int>(0,m.cols()-1); // i is a random column number
29 j = Eigen::ei_random<int>(0,m.cols()-1);
41 int rows = ei_random<int>(20,200), cols = ei_random<int>(20,200), cols2 = ei_random<int>(20,200); local
42 int rank = ei_random<int>(1, std::min(rows, cols)-1);
44 MatrixType m1(rows, cols), m2(cols, cols2), m3(rows, cols2), k(1,1);
45 m1 = MatrixType::Random(rows,cols);
46 if(rows <= cols)
49 for(int i = rank; i < cols; i++) m1.col(i).setZero()
    [all...]
eigen2_qr.cpp 19 int cols = m.cols(); local
25 MatrixType a = MatrixType::Random(rows,cols);
28 VERIFY_IS_NOT_APPROX(a+MatrixType::Identity(rows, cols), qrOfA.matrixQ() * qrOfA.matrixR());
41 b = SquareMatrixType::Random(cols,cols);
eigen2_cholesky.cpp 25 int cols = m.cols(); local
32 MatrixType a0 = MatrixType::Random(rows,cols);
34 MatrixType matB = MatrixType::Random(rows,cols), matX(rows,cols);
37 MatrixType a1 = MatrixType::Random(rows,cols);
93 SquareMatrixType symm = a0.block(0,0,rows,cols-4) * a0.block(0,0,rows,cols-4).adjoint();
  /external/eigen/test/
product_extra.cpp 23 Index cols = m.cols(); local
25 MatrixType m1 = MatrixType::Random(rows, cols),
26 m2 = MatrixType::Random(rows, cols),
27 m3(rows, cols),
28 mzero = MatrixType::Zero(rows, cols),
32 square2 = MatrixType::Random(cols, cols),
33 res2 = MatrixType::Random(cols, cols);
    [all...]
conservative_resize.cpp 41 const Index cols = internal::random<Index>(1,50); local
43 m.conservativeResize(rows,cols);
44 VERIFY_IS_APPROX(m, n.block(0,0,rows,cols));
51 const Index cols = internal::random<Index>(50,75); local
53 m.conservativeResizeLike(MatrixType::Zero(rows,cols));
54 VERIFY_IS_APPROX(m.block(0,0,n.rows(),n.cols()), n);
55 VERIFY( rows<=50 || m.block(50,0,rows-50,cols).sum() == Scalar(0) );
56 VERIFY( cols<=50 || m.block(0,50,rows,cols-50).sum() == Scalar(0) );
product_selfadjoint.cpp 23 Index cols = m.cols(); local
25 MatrixType m1 = MatrixType::Random(rows, cols),
26 m2 = MatrixType::Random(rows, cols),
57 m2.block(1,1,rows-1,cols-1).template selfadjointView<Lower>().rankUpdate(v1.tail(rows-1),v2.head(cols-1));
59 m3.block(1,1,rows-1,cols-1) += v1.tail(rows-1) * v2.head(cols-1).adjoint()+ v2.head(cols-1) * v1.tail(rows-1).adjoint();
vectorwiseop.cpp 23 Index cols = m.cols(); local
25 c = internal::random<Index>(0, cols-1);
27 ArrayType m1 = ArrayType::Random(rows, cols),
28 m2(rows, cols),
29 m3(rows, cols);
32 RowVectorType rowvec = RowVectorType::Random(cols);
116 Index cols = m.cols(); local
118 c = internal::random<Index>(0, cols-1)
    [all...]
eigen2support.cpp 20 Index cols = m.cols(); local
22 MatrixType m1 = MatrixType::Random(rows, cols),
23 m3(rows, cols);
30 VERIFY_IS_APPROX(m1.cwise() + s1, MatrixType::Constant(rows,cols,s1) + m1);
31 VERIFY_IS_APPROX((m1*Scalar(2)).cwise() - s2, (m1+m1) - MatrixType::Constant(rows,cols,s2) );
integer_types.cpp 28 Index cols = m.cols(); local
30 MatrixType m1(rows, cols),
31 m2 = MatrixType::Random(rows, cols),
32 mzero = MatrixType::Zero(rows, cols);
35 m1 = MatrixType::Random(rows, cols);
62 Index cols = m.cols(); local
66 MatrixType m1(rows, cols),
67 m2 = MatrixType::Random(rows, cols),
    [all...]
eigensolver_complex.cpp 23 VERIFY(vec1.cols() == 1);
24 VERIFY(vec2.cols() == 1);
40 Index cols = m.cols(); local
48 MatrixType a = MatrixType::Random(rows,cols);
67 MatrixType z = MatrixType::Zero(rows,cols);
71 MatrixType id = MatrixType::Identity(rows, cols);
89 MatrixType a = MatrixType::Random(m.rows(),m.cols());
sparse_solvers.cpp 17 Matrix<Scalar,Dynamic,Dynamic> aux(refMat.rows(),refMat.cols());
26 for (int j=0 ; j<sparseMat.cols(); ++j)
33 template<typename Scalar> void sparse_solvers(int rows, int cols)
35 double density = (std::max)(8./(rows*cols), 0.01);
48 SparseMatrix<Scalar> m2(rows, cols);
49 DenseMatrix refMat2 = DenseMatrix::Zero(rows, cols);
64 //Index rows, Index cols, Index nnz, Index* outerIndexPtr, Index* innerIndexPtr, Scalar* valuePtr
65 MappedSparseMatrix<Scalar> mm2(rows, cols, cm2.nonZeros(), cm2.outerIndexPtr(), cm2.innerIndexPtr(), cm2.valuePtr());
  /external/eigen/doc/
AsciiQuickReference.txt 7 Matrix<double, 3, 3> A; // Fixed rows and cols. Same as Matrix3d.
8 Matrix<double, 3, Dynamic> B; // Fixed rows, dynamic cols.
20 C.cols() // size(C)(2) // number of columns
27 B.resize(3, 9); // Ok; only dynamic cols changed.
30 4, 5, 6, // matrices, which are stacked along cols
48 P.block(i, j, rows, cols) // P(i+1 : i+rows, j+1 : j+cols)
49 P.block<rows, cols>(i, j) // P(i+1 : i+rows, j+1 : j+cols)
50 P.topLeftCorner(rows, cols) // P(1:rows, 1:cols
    [all...]
  /external/libvpx/libvpx/vp8/common/
debugmodes.c 16 void vp8_print_modes_and_motion_vectors(MODE_INFO *mi, int rows, int cols, int frame)
30 for (mb_col = 0; mb_col < cols; mb_col++)
49 for (mb_col = 0; mb_col < cols; mb_col++)
69 for (mb_col = 0; mb_col < cols; mb_col++)
94 for (b_col = 0; b_col < 4 * cols; b_col++)
96 mb_index = (b_row >> 2) * (cols + 1) + (b_col >> 2);
117 for (mb_col = 0; mb_col < cols; mb_col++)
142 for (b_col = 0; b_col < 4 * cols; b_col++)
144 mb_index = (b_row >> 2) * (cols + 1) + (b_col >> 2);
  /external/ceres-solver/internal/ceres/
compressed_col_sparse_matrix_utils.h 72 const IntegerType* cols,
76 rhs_and_solution[c] /= values[cols[c + 1] - 1];
77 for (IntegerType idx = cols[c]; idx < cols[c + 1] - 1; ++idx) {
93 const IntegerType* cols,
97 for (IntegerType idx = cols[c]; idx < cols[c + 1] - 1; ++idx) {
102 rhs_and_solution[c] = rhs_and_solution[c] / values[cols[c + 1] - 1];
119 const IntegerType* cols,
124 solution[rhs_nonzero_index] = 1.0 / values[cols[rhs_nonzero_index + 1] - 1]
    [all...]
compressed_col_sparse_matrix_utils_test.cc 92 int* cols) {
107 cols[offset] = col_pos + c;
135 int* cols = tsm.mutable_cols(); local
142 rows + offset, cols + offset);
199 cols.resize(5);
203 cols[0] = 0;
207 cols[1] = 1;
211 cols[2] = 2;
217 cols[3] = 4;
225 cols[4] = 7
228 vector<int> cols; member in class:ceres::internal::SolveUpperTriangularTest
    [all...]
  /external/eigen/bench/
BenchSparseUtil.h 27 void fillMatrix(float density, int rows, int cols, EigenSparseMatrix& dst)
29 dst.reserve(double(rows)*cols*density);
30 for(int j = 0; j < cols; j++)
42 void fillMatrix2(int nnzPerCol, int rows, int cols, EigenSparseMatrix& dst)
44 // std::cout << "alloc " << nnzPerCol*cols << "\n";
45 dst.reserve(nnzPerCol*cols);
46 for(int j = 0; j < cols; j++)
65 for (int j=0; j<src.cols(); ++j)
76 GmmDynSparse tmp(src.rows(), src.cols());
77 for (int j=0; j<src.cols(); ++j
    [all...]
BenchUtil.h 24 mat.setRandom();// = MatrixType::random(mat.rows(), mat.cols());
51 dst.resize(src.rows(),src.cols());
52 for (int j=0; j<src.cols(); ++j)
66 for (int j=0; j<src.cols(); ++j)
78 dst.resize(src.rows(),src.cols());
79 for (int j=0; j<src.cols(); ++j)
bench_reverse.cpp 21 int cols = m.cols(); local
25 MatrixType a = MatrixType::Random(rows,cols);
26 MatrixType b = MatrixType::Random(rows,cols);
32 int c = internal::random<int>(0,cols-1);
50 std::cout << rows << " x " << cols << " \t"
  /external/eigen/Eigen/src/misc/
Kernel.h 27 // is the number of cols of the original matrix
47 m_cols(m_rank==dec.cols() ? 1 : dec.cols() - m_rank)
50 inline Index rows() const { return m_dec.cols(); }
51 inline Index cols() const { return m_cols; } function in struct:Eigen::internal::kernel_retval_base
76 using Base::cols; \
Solve.h 44 inline Index rows() const { return m_dec.cols(); }
45 inline Index cols() const { return m_rhs.cols(); } function in struct:Eigen::internal::solve_retval_base
70 using Base::cols; \
  /external/javasqlite/src/main/java/SQLite/
Callback.java 10 * public void columns(String cols[]) {
12 * for (int i = 0; i &lt; cols.length; i++) {
13 * System.out.println("&lt;TD&gt;" + cols[i] + "&lt;/TD&gt;");
17 * public boolean newrow(String cols[]) {
19 * for (int i = 0; i &lt; cols.length; i++) {
20 * System.out.println("&lt;TD&gt;" + cols[i] + "&lt;/TD&gt;");
  /external/libvpx/libvpx/vp9/common/
vp9_tile_common.h 22 // 'cm->log2_tile_(rows|cols)' & 'cm->mi_(rows|cols)'
  /external/chromium_org/third_party/WebKit/ManualTests/
context-click-unfocused-frame.html 1 <frameset cols="*">
  /external/chromium_org/third_party/WebKit/ManualTests/resources/
textarea-form-back-on-submit.html 8 <textarea name="text" rows="3" cols="10" id="textarea">123</textarea><br />
  /external/chromium_org/third_party/skia/src/utils/
SkBoundaryPatch.cpp 44 bool SkBoundaryPatch::evalPatch(SkPoint verts[], int rows, int cols) {
45 if (rows < 2 || cols < 2) {
50 const SkScalar invC = SkScalarInvert(SkIntToScalar(cols - 1));
52 for (int y = 0; y < cols; y++) {

Completed in 858 milliseconds

1 2 34 5 6 7 8 91011>>