| /external/eigen/doc/snippets/ |
| Tutorial_commainit_02.cpp | 1 int rows=5, cols=5; variable
2 MatrixXf m(rows,cols);
4 MatrixXf::Zero(3,cols-3),
6 MatrixXf::Identity(rows-3,cols-3);
|
| Matrix_resize_int.cpp | 5 cout << "v: " << v.rows() << " rows, " << v.cols() << " cols" << endl;
6 cout << "w: " << w.rows() << " rows, " << w.cols() << " cols" << endl;
|
| Matrix_resize_NoChange_int.cpp | 3 cout << "m: " << m.rows() << " rows, " << m.cols() << " cols" << endl;
|
| Matrix_resize_int_NoChange.cpp | 3 cout << "m: " << m.rows() << " rows, " << m.cols() << " cols" << endl;
|
| tut_matrix_assignment_resizing.cpp | 2 std::cout << "a is of size " << a.rows() << "x" << a.cols() << std::endl;
5 std::cout << "a is now of size " << a.rows() << "x" << a.cols() << std::endl;
|
| /external/eigen/test/ |
| resize.cpp | 12 template<DenseIndex rows, DenseIndex cols>
15 MatrixXf A(rows, cols);
17 Matrix<double, rows, cols> C;
20 VERIFY(B.rows() == rows && B.cols() == cols);
25 VERIFY(y.rows() == 1 && y.cols() == rows);
27 y.resize(cols);
29 VERIFY(x.rows() == cols && x.cols() == 1);
|
| bandmatrix.cpp | 20 Index cols = _m.cols(); local
24 MatrixType m(rows,cols,supers,subs);
26 DenseMatrixType dm1(rows,cols);
44 for (int i=0; i<cols; ++i)
49 Index d = (std::min)(rows,cols);
50 Index a = std::max<Index>(0,cols-d-supers);
53 dm1.block(0,supers+1,cols-supers-1-a,cols-supers-1-a).template triangularView<Upper>().setZero();
55 if(b>0) dm1.block(d+subs,0,b,cols).setZero()
69 Index cols = internal::random<Index>(1,10); local
[all...] |
| /libcore/luni/src/test/java/tests/support/ |
| MockCallback.java | 24 public void columns(String cols[]) {
26 for (int i = 0; i <= cols.length; i++) {
27 System.out.println("<TD>" + cols[i] + "</TD>");
32 public boolean newrow(String cols[]) {
34 for (int i = 0; i <= cols.length; i++) {
35 System.out.println("<TD>" + cols[i] + "</TD>");
|
| /external/eigen/failtest/ |
| map_nonconst_ctor_on_const_ptr_2.cpp | 11 void foo(CV_QUALIFIER float *ptr, DenseIndex rows, DenseIndex cols){
12 Map<MatrixXf> m(ptr, rows, cols);
|
| map_nonconst_ctor_on_const_ptr_3.cpp | 11 void foo(CV_QUALIFIER float *ptr, DenseIndex rows, DenseIndex cols){
12 Map<MatrixXf, Aligned, InnerStride<2> > m(ptr, rows, cols, InnerStride<2>());
|
| map_nonconst_ctor_on_const_ptr_4.cpp | 11 void foo(const float *ptr, DenseIndex rows, DenseIndex cols){
12 Map<CV_QUALIFIER MatrixXf, Unaligned, OuterStride<> > m(ptr, rows, cols, OuterStride<>(2));
|
| /external/chromium-trace/catapult/third_party/typ/typ/ |
| printer.py | 18 def __init__(self, print_, should_overwrite, cols):
21 self.cols = cols
31 if elide and self.cols and msg_len > self.cols - 5:
32 new_len = int((self.cols - 5) / 2)
|
| /external/opencv3/modules/cudev/include/opencv2/cudev/grid/ |
| integral.hpp | 63 const int cols = getCols(src); local
65 dst.create(rows, cols);
67 integral_detail::integral(shrinkPtr(src), shrinkPtr(dst), rows, cols, StreamAccessor::getStream(stream)); local
|
| pyramids.hpp | 65 const int cols = getCols(src); local
67 dst.create(divUp(rows, 2), divUp(cols, 2));
69 pyramids_detail::pyrDown<Brd>(shrinkPtr(src), shrinkPtr(dst), rows, cols, dst.rows, dst.cols, StreamAccessor::getStream(stream)); local
82 const int cols = getCols(src); local
84 dst.create(rows * 2, cols * 2);
86 pyramids_detail::pyrUp(shrinkPtr(src), shrinkPtr(dst), rows, cols, dst.rows, dst.cols, StreamAccessor::getStream(stream)); local
|
| split_merge.hpp | 69 const int cols = getCols(src); local
71 CV_Assert( getRows(mask) == rows && getCols(mask) == cols );
73 dst.create(rows, cols);
78 rows, cols, local
88 const int cols = getCols(src); local
90 CV_Assert( getRows(dst) == rows && getCols(dst) == cols );
91 CV_Assert( getRows(mask) == rows && getCols(mask) == cols );
96 rows, cols, local
106 const int cols = getCols(src); local
108 dst.create(rows, cols);
113 rows, cols, local
123 const int cols = getCols(src); local
130 rows, cols, local
140 const int cols = getCols(src); local
150 rows, cols, local
160 const int cols = getCols(src); local
170 rows, cols, local
180 const int cols = getCols(src); local
189 rows, cols, local
199 const int cols = getCols(src); local
217 const int cols = getCols(src); local
225 rows, cols, local
235 const int cols = getCols(src); local
243 rows, cols, local
253 const int cols = getCols(src); local
264 rows, cols, local
274 const int cols = getCols(src); local
285 rows, cols, local
295 const int cols = getCols(src); local
305 rows, cols, local
315 const int cols = getCols(src); local
334 const int cols = getCols(src); local
343 rows, cols, local
353 const int cols = getCols(src); local
362 rows, cols, local
372 const int cols = getCols(src); local
384 rows, cols, local
394 const int cols = getCols(src); local
406 rows, cols, local
416 const int cols = getCols(src); local
427 rows, cols, local
437 const int cols = getCols(src); local
457 const int cols = getCols(src); local
467 rows, cols, local
477 const int cols = getCols(src); local
487 rows, cols, local
[all...] |
| /external/opencv3/modules/stitching/test/ |
| test_blenders.cpp | 51 ASSERT_EQ(image1.rows, image2.rows); ASSERT_EQ(image1.cols, image2.cols);
58 mask1(Rect(0, 0, mask1.cols/2, mask1.rows)).setTo(255);
59 mask1(Rect(mask1.cols/2, 0, mask1.cols - mask1.cols/2, mask1.rows)).setTo(0);
62 mask2(Rect(0, 0, mask2.cols/2, mask2.rows)).setTo(0);
63 mask2(Rect(mask2.cols/2, 0, mask2.cols - mask2.cols/2, mask2.rows)).setTo(255)
[all...] |
| /external/eigen/doc/examples/ |
| class_Block.cpp | 8 topLeftCorner(MatrixBase<Derived>& m, int rows, int cols)
10 return Eigen::Block<Derived>(m.derived(), 0, 0, rows, cols);
15 topLeftCorner(const MatrixBase<Derived>& m, int rows, int cols)
17 return Eigen::Block<const Derived>(m.derived(), 0, 0, rows, cols);
|
| /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...] |
| dense_sparse_matrix.cc | 69 const int *cols = m.cols(); local
73 m_(rows[i], cols[i]) += values[i];
112 m_.resize(m_.rows() + m_.cols(), m_.cols());
114 m_.block(0, 0, tmp.rows(), tmp.cols()) = tmp;
118 m_.bottomLeftCorner(m_.cols(), m_.cols()) =
119 ConstVectorRef(d, m_.cols()).asDiagonal();
131 return m_.rows() - m_.cols();
[all...] |
| block_jacobi_preconditioner.cc | 49 for (int c = 0; c < block_structure_.cols.size(); ++c) {
50 int size = block_structure_.cols[c].size;
55 blocks_.resize(block_structure_.cols.size());
60 for (int c = 0; c < block_structure_.cols.size(); ++c) {
61 int size = block_structure_.cols[c].size;
80 const int col_block_size = bs->cols[cells[c].block_id].size;
105 for (int c = 0; c < bs->cols.size(); ++c) {
106 const int size = block_structure_.cols[c].size;
107 const int position = block_structure_.cols[c].position;
124 for (int c = 0; c < block_structure_.cols.size(); ++c)
[all...] |
| /external/eigen/Eigen/src/Eigen2Support/ |
| QR.h | 37 MatrixType ret = MatrixType::Identity(this->rows(), this->cols());
49 int cols = this->cols(); local
50 return MatrixRBlockType(this->matrixQR(), 0, 0, cols, cols).template triangularView<UpperTriangular>();
|
| /external/libavc/common/ |
| ih264_chroma_intra_pred_filters.c | 314 WORD32 rows, cols; /* loop variables*/ local
320 for(cols = 0; cols < 16; cols += 2)
322 *(pu1_dst + rows * dst_strd + cols) = *pu1_left;
324 *(pu1_dst + rows * dst_strd + cols + 1) = *(pu1_left + 1);
438 WORD32 rows, cols; /* loop variables*/ local
450 for(cols = 0; cols < 4; cols++
[all...] |
| /external/opencv3/modules/flann/include/opencv2/flann/ |
| matrix.h | 52 size_t cols; member in class:cvflann::Matrix
56 Matrix() : rows(0), cols(0), stride(0), data(NULL)
61 rows(rows_), cols(cols_), stride(stride_), data(data_)
63 if (stride==0) stride = cols;
91 size_t cols; member in class:cvflann::UntypedMatrix
96 rows(rows_), cols(cols_), data(data_)
108 return Matrix<T>((T*)data, rows, cols);
|
| sampling.h | 42 Matrix<T> newSet(new T[size * srcMatrix.cols], size,srcMatrix.cols);
49 std::copy(src, src+srcMatrix.cols, dest);
53 std::copy(src, src+srcMatrix.cols, dest);
66 Matrix<T> newSet(new T[size * srcMatrix.cols], size,srcMatrix.cols);
73 std::copy(src, src+srcMatrix.cols, dest);
|
| /external/eigen/bench/ |
| sparse_transpose.cpp | 39 int cols = 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,cols);
[all...] |
