/external/eigen/test/ |
H A D | visitor.cpp | 17 Index rows = p.rows(); local 22 m = MatrixType::Random(rows, cols); 31 for(Index i = 0; i < rows; i++)
|
/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
H A D | ConstrainedConjGrad.h | 59 Index rows = C.rows(), cols = C.cols(); local 61 TmpVec d(rows), e(rows), l(cols), p(rows), q(rows), r(rows); 66 for (Index i = 0; i < rows; ++i) 119 std::vector<bool> satured(C.rows()); 124 SparseMatrix<Scalar,RowMajor> CINV(C.rows(), [all...] |
H A D | IncompleteLU.h | 34 Index rows() const { return m_lu.rows(); } function in class:Eigen::IncompleteLU 84 eigen_assert(cols()==b.rows() 85 && "IncompleteLU::solve(): invalid number of rows of the right hand side matrix b");
|
/external/eigen/unsupported/Eigen/src/SparseExtra/ |
H A D | BlockOfDynamicSparseMatrix.h | 101 EIGEN_STRONG_INLINE Index rows() const { return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); } function in class:Eigen::SparseInnerVectorSet
|
/external/eigen/unsupported/test/ |
H A D | matrix_exponential.cpp | 110 typename MatrixType::Index rows = m.rows(); local 112 MatrixType m1(rows, cols), m2(rows, cols), m3(rows, cols), 113 identity = MatrixType::Identity(rows, rows); 118 m1 = MatrixType::Random(rows, cols);
|
H A D | sparse_extra.cpp | 54 const Index rows = ref.rows(); local 59 double density = (std::max)(8./(rows*cols), 0.01); 64 SparseMatrixType m(rows, cols); 65 DenseMatrix refMat = DenseMatrix::Zero(rows, cols); 66 DenseVector vec1 = DenseVector::Random(rows); 119 SparseMatrixType m1(rows,cols), m2(rows,cols); 120 DenseMatrix refM1 = DenseMatrix::Zero(rows, rows); [all...] |
/external/mesa3d/src/glsl/tests/ |
H A D | set_uniform_initializer_tests.cpp | 165 unsigned columns, unsigned rows) 168 glsl_type::get_instance(base_type, rows, columns); 174 generate_data(mem_ctx, base_type, columns, rows, val); 312 unsigned columns, unsigned rows, unsigned array_size, 316 glsl_type::get_instance(base_type, rows, columns); 329 generate_array_data(mem_ctx, base_type, columns, rows, 162 non_array_test(void *mem_ctx, struct gl_shader_program *prog, unsigned actual_index, const char *name, enum glsl_base_type base_type, unsigned columns, unsigned rows) argument 309 array_test(void *mem_ctx, struct gl_shader_program *prog, unsigned actual_index, const char *name, enum glsl_base_type base_type, unsigned columns, unsigned rows, unsigned array_size, unsigned excess_data_size) argument
|
H A D | uniform_initializer_utils.cpp | 133 unsigned columns, unsigned rows, 139 glsl_type::get_instance(base_type, rows, columns); 147 unsigned columns, unsigned rows, unsigned array_size, 153 glsl_type::get_instance(base_type, rows, columns); 132 generate_data(void *mem_ctx, enum glsl_base_type base_type, unsigned columns, unsigned rows, ir_constant *&val) argument 146 generate_array_data(void *mem_ctx, enum glsl_base_type base_type, unsigned columns, unsigned rows, unsigned array_size, ir_constant *&val) argument
|
/external/opencv/cv/src/ |
H A D | cvadapthresh.cpp | 53 int i, j, rows, cols; local 66 rows = src->rows; 72 CV_CALL( mean = cvCreateMat( rows, cols, CV_8UC1 )); 86 for( i = 0; i < rows; i++ )
|
/external/openssl/crypto/bio/ |
H A D | b_dump.c | 82 int i,j,rows,trc; local 103 rows=(len/dump_width); 104 if ((rows*dump_width)<len) 105 rows++; 106 for(i=0;i<rows;i++)
|
/external/qemu/distrib/sdl-1.2.15/src/video/ |
H A D | SDL_yuv_mmx.c | 83 int rows, int cols, int mod ) 88 unsigned char* y = lum +cols*rows; // Pointer to the end 244 int rows, int cols, int mod ) 249 unsigned char* y = lum +cols*rows; /* Pointer to the end */ 80 ColorRGBDitherYV12MMX1X( int *colortab, Uint32 *rgb_2_pix, unsigned char *lum, unsigned char *cr, unsigned char *cb, unsigned char *out, int rows, int cols, int mod ) argument 241 Color565DitherYV12MMX1X( int *colortab, Uint32 *rgb_2_pix, unsigned char *lum, unsigned char *cr, unsigned char *cb, unsigned char *out, int rows, int cols, int mod ) argument
|
/external/skia/src/utils/ |
H A D | SkBoundaryPatch.cpp | 44 bool SkBoundaryPatch::evalPatch(SkPoint verts[], int rows, int cols) { argument 45 if (rows < 2 || cols < 2) { 49 const SkScalar invR = SkScalarInvert(SkIntToScalar(rows - 1)); 54 for (int x = 0; x < rows; x++) {
|
/external/ceres-solver/internal/ceres/ |
H A D | compressed_col_sparse_matrix_utils_test.cc | 91 int* rows, 106 rows[offset] = row_pos + r; 134 int* rows = tsm.mutable_rows(); local 142 rows + offset, cols + offset); 200 rows.resize(7); 204 rows[0] = 0; 208 rows[1] = 1; 212 rows[2] = 1; 214 rows[3] = 2; 218 rows[ 87 FillBlock(const vector<int>& row_blocks, const vector<int>& col_blocks, const int row_block_id, const int col_block_id, int* rows, int* cols) argument 229 vector<int> rows; member in class:ceres::internal::SolveUpperTriangularTest [all...] |
H A D | compressed_row_jacobian_writer.cc | 76 int* rows = jacobian->mutable_rows(); local 79 rows[0] = 0; 108 rows[row_pos + j + 1] = rows[row_pos + j] + num_derivatives; 123 const int column_block_begin = rows[row_pos + r] + col_pos; 133 CHECK_EQ(num_jacobian_nonzeros, rows[total_num_residuals]); 163 const int* jacobian_rows = jacobian->rows();
|
H A D | compressed_row_sparse_matrix_test.cc | 164 EXPECT_EQ(crsm->num_rows() + 1, crs_matrix.rows.size()); 169 EXPECT_EQ(crsm->rows()[i], crs_matrix.rows[i]); 224 int* rows = matrix_->mutable_rows(); local 228 rows[0] = 0; 232 rows[1] = 1; 236 rows[2] = 2; 242 rows[3] = 4; 250 rows[4] = 7; 283 int* rows local [all...] |
H A D | linear_least_squares_problems.cc | 192 int* rows = A->mutable_rows(); local 200 rows[nnz] = 0; 204 rows[nnz] = 0; 211 rows[nnz] = 1; 215 rows[nnz] = 1; 222 rows[nnz] = 2; 226 rows[nnz] = 2; 233 rows[nnz] = 3; 237 rows[nnz] = 3; 244 rows[nn [all...] |
/external/chromium/chrome/browser/importer/ |
H A D | external_process_importer_bridge.cc | 53 const std::vector<history::URLRow>& rows, 55 profile_import_thread_->NotifyHistoryImportReady(rows, visit_source); 52 SetHistoryItems( const std::vector<history::URLRow>& rows, history::VisitSource visit_source) argument
|
H A D | in_process_importer_bridge.cc | 58 const std::vector<history::URLRow> &rows, 63 rows, visit_source)); 57 SetHistoryItems( const std::vector<history::URLRow> &rows, history::VisitSource visit_source) argument
|
/external/chromium/chrome/browser/ |
H A D | plugin_exceptions_table_model.cc | 29 bool PluginExceptionsTableModel::CanRemoveRows(const Rows& rows) const { 30 return !rows.empty(); 33 void PluginExceptionsTableModel::RemoveRows(const Rows& rows) { argument 36 // Iterate over the rows starting with the highest ones so we can delete 38 for (Rows::const_reverse_iterator it = rows.rbegin(); 39 it != rows.rend(); ++it) {
|
H A D | plugin_exceptions_table_model_unittest.cc | 165 RemoveRowsTableModel::Rows rows; local 166 rows.insert(1); 167 table_model_->RemoveRows(rows); 179 RemoveRowsTableModel::Rows rows; local 180 rows.insert(0); 181 table_model_->RemoveRows(rows); 197 rows.clear(); 198 rows.insert(0); 199 rows.insert(2); 200 table_model_->RemoveRows(rows); [all...] |
/external/chromium_org/chrome/browser/extensions/api/braille_display_private/ |
H A D | brlapi_connection.cc | 168 unsigned int columns, rows; local 170 handle_.get(), &columns, &rows) < 0) { 174 *size = columns * rows;
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/style/ |
H A D | GridCoordinate.h | 41 // A span in a single direction (either rows or columns). Note that |initialPositionIndex| 117 // This represents a grid area that spans in both rows' and columns' direction. 122 , rows(0, 0) 128 , rows(r) 134 return columns == o.columns && rows == o.rows; 143 GridSpan rows; member in struct:WebCore::GridCoordinate
|
/external/chromium_org/third_party/freetype/src/sfnt/ |
H A D | pngshim.c | 196 png_byte* *rows; local 200 y_offset < 0 || y_offset + metrics->height > map->rows || 310 if ( FT_NEW_ARRAY( rows, imgHeight ) ) 317 rows[i] = map->buffer + ( y_offset + i ) * map->pitch + x_offset * 4; 319 png_read_image( png, rows ); 321 FT_FREE( rows );
|
/external/chromium_org/third_party/mesa/src/src/gallium/winsys/sw/fbdev/ |
H A D | fbdev_sw_winsys.c | 59 unsigned rows; member in struct:fbdev_sw_winsys 94 if (dst->y + dst->height > fbdev->rows) { 96 if (dst->y >= fbdev->rows) 99 height = fbdev->rows - dst->y; 224 fbdev->rows = fbdev->finfo.smem_len / fbdev->finfo.line_length;
|
/external/eigen/Eigen/src/Core/ |
H A D | CwiseUnaryView.h | 71 EIGEN_STRONG_INLINE Index rows() const { return m_matrix.rows(); } function in class:Eigen::CwiseUnaryView
|