/external/eigen/doc/snippets/ |
H A D | Tutorial_commainit_02.cpp | 1 int rows=5, cols=5; variable 2 MatrixXf m(rows,cols); 5 MatrixXf::Zero(rows-3,3), 6 MatrixXf::Identity(rows-3,cols-3);
|
/external/eigen/doc/examples/ |
H A D | class_Block.cpp | 8 topLeftCorner(MatrixBase<Derived>& m, int rows, int cols) argument 10 return Eigen::Block<Derived>(m.derived(), 0, 0, rows, cols); 15 topLeftCorner(const MatrixBase<Derived>& m, int rows, int cols) argument 17 return Eigen::Block<const Derived>(m.derived(), 0, 0, rows, cols);
|
/external/eigen/failtest/ |
H A D | map_nonconst_ctor_on_const_ptr_2.cpp | 11 void foo(CV_QUALIFIER float *ptr, DenseIndex rows, DenseIndex cols){ argument 12 Map<MatrixXf> m(ptr, rows, cols);
|
H A D | map_nonconst_ctor_on_const_ptr_3.cpp | 11 void foo(CV_QUALIFIER float *ptr, DenseIndex rows, DenseIndex cols){ argument 12 Map<MatrixXf, Aligned, InnerStride<2> > m(ptr, rows, cols, InnerStride<2>());
|
H A D | map_nonconst_ctor_on_const_ptr_4.cpp | 11 void foo(const float *ptr, DenseIndex rows, DenseIndex cols){ argument 12 Map<CV_QUALIFIER MatrixXf, Unaligned, OuterStride<> > m(ptr, rows, cols, OuterStride<>(2));
|
/external/ceres-solver/include/ceres/ |
H A D | crs_matrix.h | 49 // rows, cols and values. 51 // rows is a num_rows + 1 sized array that points into the cols and 54 // cols[rows[i]] ... cols[rows[i + 1] - 1] are the indices of the 57 // values[rows[i]] .. values[rows[i + 1] - 1] are the values of the 73 // rows = [ 0, 2, 5, 7] 78 vector<int> rows; member in struct:ceres::CRSMatrix
|
/external/eigen/doc/ |
H A D | tutorial.cpp | 27 int rows = 3, cols = 3; local
|
/external/eigen/test/eigen2/ |
H A D | eigen2_qr.cpp | 18 int rows = m.rows(); local 25 MatrixType a = MatrixType::Random(rows,cols); 28 VERIFY_IS_NOT_APPROX(a+MatrixType::Identity(rows, cols), qrOfA.matrixQ() * qrOfA.matrixR());
|
/external/eigen/test/ |
H A D | selfadjoint.cpp | 20 Index rows = m.rows(); local 23 MatrixType m1 = MatrixType::Random(rows, cols), 24 m3(rows, cols);
|
H A D | upperbidiagonalization.cpp | 15 const typename MatrixType::Index rows = m.rows(); local 21 MatrixType a = MatrixType::Random(rows,cols); 23 RealMatrixType b(rows, cols);
|
H A D | bandmatrix.cpp | 19 Index rows = _m.rows(); local 24 MatrixType m(rows,cols,supers,subs); 26 DenseMatrixType dm1(rows,cols); 49 Index d = (std::min)(rows,cols); 51 Index b = std::max<Index>(0,rows-d-subs); 52 if(a>0) dm1.block(0,d+supers,rows,a).setZero(); 54 dm1.block(subs+1,0,rows-subs-1-b,rows-subs-1-b).template triangularView<Lower>().setZero(); 68 Index rows local [all...] |
H A D | conservative_resize.cpp | 40 const Index rows = internal::random<Index>(1,50); local 43 m.conservativeResize(rows,cols); 44 VERIFY_IS_APPROX(m, n.block(0,0,rows,cols)); 50 const Index rows = 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) ); 77 m.conservativeResize(m.rows(), [all...] |
H A D | corners.cpp | 19 Index rows = m.rows(); local 22 Index r = internal::random<Index>(1,rows); 25 MatrixType matrix = MatrixType::Random(rows,cols); 26 const MatrixType const_matrix = MatrixType::Random(rows,cols); 30 COMPARE_CORNER(bottomLeftCorner(r,c), block(rows-r,0,r,c)); 31 COMPARE_CORNER(bottomRightCorner(r,c), block(rows-r,cols-c,r,c)); 33 Index sr = internal::random<Index>(1,rows) - 1; 34 Index nr = internal::random<Index>(1,rows-sr); 40 COMPARE_CORNER(bottomRows(r), block(rows 52 rows = MatrixType::RowsAtCompileTime, enumerator in enum:__anon21033 [all...] |
/external/ceres-solver/internal/ceres/ |
H A D | compressed_col_sparse_matrix_utils.h | 71 const IntegerType* rows, 78 const IntegerType r = rows[idx]; 92 const IntegerType* rows, 98 const IntegerType r = rows[idx]; 118 const IntegerType* rows, 128 const IntegerType r = rows[idx]; 136 SolveUpperTriangularInPlace(num_cols, rows, cols, values, solution); 70 SolveUpperTriangularInPlace(IntegerType num_cols, const IntegerType* rows, const IntegerType* cols, const double* values, double* rhs_and_solution) argument 91 SolveUpperTriangularTransposeInPlace(IntegerType num_cols, const IntegerType* rows, const IntegerType* cols, const double* values, double* rhs_and_solution) argument 117 SolveRTRWithSparseRHS(IntegerType num_cols, const IntegerType* rows, const IntegerType* cols, const double* values, const int rhs_nonzero_index, double* solution) argument
|
H A D | incomplete_lq_factorization_test.cc | 48 EXPECT_EQ(expected.rows()[i], actual.rows()[i]); 84 int* rows = matrix.mutable_rows(); local 90 rows[i] = idx; 100 rows[10] = idx; 148 for (int idx = matrix.rows()[1]; idx < matrix.rows()[2]; ++idx) { 149 EXPECT_EQ(matrix.cols()[idx], idx - matrix.rows()[1]); 150 EXPECT_EQ(matrix.values()[idx], dense_vector(idx - matrix.rows()[1])); 159 EXPECT_EQ(matrix.cols()[matrix.rows()[ [all...] |
/external/chromium_org/third_party/WebKit/Source/core/html/ |
H A D | HTMLTableSectionElement.cpp | 59 RefPtrWillBeRawPtr<HTMLCollection> children = rows(); 76 RefPtrWillBeRawPtr<HTMLCollection> children = rows(); 96 PassRefPtrWillBeRawPtr<HTMLCollection> HTMLTableSectionElement::rows() function in class:blink::HTMLTableSectionElement
|
/external/chromium_org/third_party/WebKit/Source/modules/webdatabase/ |
H A D | SQLResultSet.cpp | 55 // If the query didn't result in any rows being added, raise an InvalidAccessError exception 59 exceptionState.throwDOMException(InvalidAccessError, "The query didn't result in any rows being added."); 68 SQLResultSetRowList* SQLResultSet::rows() const function in class:blink::SQLResultSet
|
/external/chromium_org/third_party/angle/tests/compiler_tests/ |
H A D | VariablePacker_test.cpp | 150 int rows = gl::VariableRowCount(type); local 152 int squareSize = std::max(rows, cols);
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/ |
H A D | debugmodes.c | 16 void vp8_print_modes_and_motion_vectors(MODE_INFO *mi, int rows, int cols, int frame) argument 28 for (mb_row = 0; mb_row < rows; mb_row++) 47 for (mb_row = 0; mb_row < rows; mb_row++) 67 for (mb_row = 0; mb_row < rows; mb_row++) 89 for (b_row = 0; b_row < 4 * rows; b_row++) 115 for (mb_row = 0; mb_row < rows; mb_row++) 137 for (b_row = 0; b_row < 4 * rows; b_row++)
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/decoder/ |
H A D | vp9_dthread.h | 41 int rows; member in struct:VP9LfSyncData 45 void vp9_loop_filter_alloc(VP9LfSync *lf_sync, VP9_COMMON *cm, int rows,
|
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
H A D | u_linear.h | 63 unsigned rows; member in struct:pipe_tile_info 94 if (t->tile.size != t->block.size * t->cols * t->rows) 100 if (t->size < t->stride * t->rows * t->tiles_y)
|
/external/chromium_org/third_party/mesa/src/src/glsl/tests/ |
H A D | copy_constant_to_storage_tests.cpp | 40 void int_test(unsigned rows); 41 void uint_test(unsigned rows); 42 void bool_test(unsigned rows); 44 void float_test(unsigned columns, unsigned rows); 67 copy_constant_to_storage::int_test(unsigned rows) argument 70 generate_data(mem_ctx, GLSL_TYPE_INT, 1, rows, val); 86 copy_constant_to_storage::uint_test(unsigned rows) argument 89 generate_data(mem_ctx, GLSL_TYPE_UINT, 1, rows, val); 105 copy_constant_to_storage::float_test(unsigned columns, unsigned rows) argument 108 generate_data(mem_ctx, GLSL_TYPE_FLOAT, columns, rows, va 124 bool_test(unsigned rows) argument [all...] |
/external/eigen/bench/ |
H A D | basicbenchmark.h | 43 const int rows = mat.rows(); local 46 MatrixType I(rows,cols); 47 MatrixType m(rows,cols);
|
H A D | sparse_transpose.cpp | 38 int rows = SIZE; local 42 EigenSparseMatrix sm1(rows,cols), sm3(rows,cols); 47 fillMatrix(density, rows, cols, sm1); 52 DenseMatrix m1(rows,cols), m3(rows,cols); 59 std::cout << "Non zeros: " << sm1.nonZeros()/float(sm1.rows()*sm1.cols())*100 << "%\n"; 81 GmmDynSparse gmmT3(rows,cols); 82 GmmSparse m1(rows,cols), m3(rows,col [all...] |
/external/eigen/blas/ |
H A D | GeneralRank1Update.h | 22 static void run(Index rows, Index cols, Scalar* mat, Index stride, const Scalar* u, const Scalar* v, Scalar alpha) argument 29 Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i,rows) += alpha * cj(v[i]) * ConjRhsType(OtherMap(u,rows)); 36 static void run(Index rows, Index cols, Scalar* mat, Index stride, const Scalar* u, const Scalar* v, Scalar alpha) argument 38 general_rank1_update<Scalar,Index,ColMajor,ConjRhs,ConjRhs>::run(rows,cols,mat,stride,u,v,alpha);
|