Searched defs:rows (Results 151 - 175 of 469) sorted by relevance

1234567891011>>

/external/eigen/test/
H A Dsparse_permutations.cpp16 const Index rows = ref.rows(); local
24 double density = (std::max)(8./(rows*cols), 0.01);
26 SparseMatrixType mat(rows, cols), up(rows,cols), lo(rows,cols);
28 DenseMatrix mat_d = DenseMatrix::Zero(rows, cols), up_sym_d, lo_sym_d, res_d;
H A Dsparse_vector.cpp12 template<typename Scalar,typename Index> void sparse_vector(int rows, int cols) argument
14 double densityMat = (std::max)(8./(rows*cols), 0.01);
15 double densityVec = (std::max)(8./float(rows), 0.1);
22 SparseMatrixType m1(rows,rows);
23 SparseVectorType v1(rows), v2(rows), v3(rows);
24 DenseMatrix refM1 = DenseMatrix::Zero(rows, rows);
[all...]
H A Dsparseqr.cpp17 int rows = internal::random<int>(1,maxRows); local
19 double density = (std::max)(8./(rows*cols), 0.01);
21 A.resize(rows,cols);
22 dA.resize(rows,cols);
35 // if(rows<cols) {
38 // dA.bottomRows(cols-rows).setZero();
41 return rows;
88 idM.resize(Q.rows(), Q.rows()); idM.setIdentity();
H A Dstable_norm.cpp55 Index rows = m.rows(); local
69 MatrixType vzero = MatrixType::Zero(rows, cols),
70 vrand = MatrixType::Random(rows, cols),
71 vbig(rows, cols),
72 vsmall(rows,cols);
H A Dtriangular.cpp22 typename MatrixType::Index rows = m.rows(); local
25 MatrixType m1 = MatrixType::Random(rows, cols),
26 m2 = MatrixType::Random(rows, cols),
27 m3(rows, cols),
28 m4(rows, cols),
29 r1(rows, cols),
30 r2(rows, cols);
31 VectorType v2 = VectorType::Random(rows);
36 if (rows*col
127 Index rows = m.rows(); local
[all...]
H A Dvectorwiseop.cpp21 Index rows = m.rows(); local
23 Index r = internal::random<Index>(0, rows-1),
26 ArrayType m1 = ArrayType::Random(rows, cols),
27 m2(rows, cols),
28 m3(rows, cols);
30 ColVectorType colvec = ColVectorType::Random(rows);
126 Index rows = m.rows(); local
128 Index r = internal::random<Index>(0, rows
[all...]
/external/eigen/unsupported/Eigen/src/IterativeSolvers/
H A DIncompleteLU.h34 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/test/
H A Dmatrix_exponential.cpp103 typename MatrixType::Index rows = m.rows(); local
105 MatrixType m1(rows, cols), m2(rows, cols), identity = MatrixType::Identity(rows, cols);
110 m1 = MatrixType::Random(rows, cols);
H A Dsparse_extra.cpp53 const Index rows = ref.rows(); local
58 double density = (std::max)(8./(rows*cols), 0.01);
63 SparseMatrixType m(rows, cols);
64 DenseMatrix refMat = DenseMatrix::Zero(rows, cols);
65 DenseVector vec1 = DenseVector::Random(rows);
118 SparseMatrixType m1(rows,cols), m2(rows,cols);
119 DenseMatrix refM1 = DenseMatrix::Zero(rows, rows);
[all...]
/external/kernel-headers/original/uapi/linux/
H A Dvirtio_console.h48 /* rows of the screens */
49 __u16 rows; member in struct:virtio_console_config
/external/mesa3d/src/glsl/tests/
H A Dset_uniform_initializer_tests.cpp165 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 Duniform_initializer_utils.cpp133 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 Dcvadapthresh.cpp53 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 Db_dump.c82 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 DSDL_yuv_mmx.c83 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 DSkBoundaryPatch.cpp44 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 Dcompressed_col_sparse_matrix_utils_test.cc91 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 Dcompressed_row_jacobian_writer.cc114 int* rows = jacobian->mutable_rows(); local
117 rows[0] = 0;
146 rows[row_pos + j + 1] = rows[row_pos + j] + num_derivatives;
161 const int column_block_begin = rows[row_pos + r] + col_pos;
171 CHECK_EQ(num_jacobian_nonzeros, rows[total_num_residuals]);
186 const int* jacobian_rows = jacobian->rows();
H A Ddynamic_compressed_row_sparse_matrix_test.cc52 // should have no effect on the number of rows, columns or nonzeros.
85 std::vector<int> rows, cols; local
90 rows.push_back(r);
100 std::copy(rows.begin(), rows.end(), tsm->mutable_rows());
133 EXPECT_EQ(dense_from_dcrsm.rows(), num_rows);
147 ConstIntVectorRef crsm_rows(crsm->rows(), crsm->num_rows() + 1);
148 ConstIntVectorRef dcrsm_rows(dcrsm->rows(), dcrsm->num_rows() + 1);
H A Dlinear_least_squares_problems.cc192 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...]
H A Dprogram_test.cc272 int* rows = expected_block_sparse_jacobian.mutable_rows(); local
275 rows[0] = 0;
278 rows[1] = 2;
280 rows[2] = 0;
283 rows[3] = 2;
285 rows[4] = 1;
288 rows[5] = 2;
290 rows[6] = 1;
293 rows[7] = 0;
295 rows[
369 int* rows = expected_block_sparse_jacobian.mutable_rows(); local
[all...]
/external/chromium_org/chrome/browser/extensions/api/braille_display_private/
H A Dbrlapi_connection.cc171 unsigned int columns, rows; local
173 handle_.get(), &columns, &rows) < 0) {
177 *size = columns * rows;
/external/chromium_org/components/history/core/browser/
H A Durl_database_unittest.cc300 // We should get 2 rows for |keyword|.
301 std::vector<KeywordSearchTermRow> rows; local
302 ASSERT_TRUE(GetKeywordSearchTermRows(keyword, &rows));
303 ASSERT_EQ(2u, rows.size());
304 if (rows[0].url_id == url_id1) {
305 EXPECT_EQ(keyword, rows[0].term);
306 EXPECT_EQ(keyword, rows[1].term);
307 EXPECT_EQ(url_id2, rows[1].url_id);
309 EXPECT_EQ(keyword, rows[0].term);
310 EXPECT_EQ(url_id1, rows[
[all...]
/external/chromium_org/third_party/WebKit/Source/core/rendering/style/
H A DGridCoordinate.h41 // A span in a single direction (either rows or columns). Note that |resolvedInitialPosition|
138 // This represents a grid area that spans in both rows' and columns' direction.
143 , rows(0, 0)
149 , rows(r)
155 return columns == o.columns && rows == o.rows;
171 return rows.resolvedInitialPosition;
173 return rows.resolvedFinalPosition;
180 GridSpan rows; member in struct:blink::GridCoordinate
/external/chromium_org/third_party/freetype/src/sfnt/
H A Dpngshim.c196 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 );

Completed in 321 milliseconds

1234567891011>>