/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/syslinux/com32/lib/sys/ |
screensize.c | 5 int getscreensize(int fd, int *rows, int *cols) 15 *cols = fp->o.cols; 17 if (!*rows || !*cols) {
|
/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 | 19 Index cols = _m.cols(); local 23 MatrixType m(rows,cols,supers,subs); 25 DenseMatrixType dm1(rows,cols); 43 for (int i=0; i<cols; ++i) 48 Index d = (std::min)(rows,cols); 49 Index a = std::max<Index>(0,cols-d-supers); 52 dm1.block(0,supers+1,cols-supers-1-a,cols-supers-1-a).template triangularView<Upper>().setZero(); 54 if(b>0) dm1.block(d+subs,0,b,cols).setZero() 66 Index cols = internal::random<Index>(1,10); local [all...] |
ctorleak.cpp | 42 Index rows = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE), cols = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE); local 43 Foo::object_limit = internal::random<Index>(0, rows*cols - 2); 49 std::cout << "\nMatrixX m(" << rows << ", " << cols << ");\n"; local 50 MatrixX m(rows, cols); 59 Foo::object_limit = (rows+1)*(cols+1); 60 MatrixX A(rows, cols); 61 VERIFY_IS_EQUAL(Foo::object_count, rows*cols); 63 VERIFY_IS_EQUAL(Foo::object_count, (rows+1)*cols); 65 VERIFY_IS_EQUAL(Foo::object_count, rows*(cols+1));
|
array_replicate.cpp | 24 Index cols = m.cols(); local 26 MatrixType m1 = MatrixType::Random(rows, cols), 27 m2 = MatrixType::Random(rows, cols); 37 x1.resize(rows*f1,cols*f2); 40 x1.block(i*rows,j*cols,rows,cols) = m1; 43 x2.resize(2*rows,3*cols); 48 x2.resize(rows,3*cols); 52 vx1.resize(3*rows,cols); [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/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/ |
Math.h | 116 Matrix(unsigned rows, unsigned cols) : 117 rows(rows), cols(cols), data(new PBQPNum[rows * cols]) { 122 Matrix(unsigned rows, unsigned cols, PBQPNum initVal) : 123 rows(rows), cols(cols), data(new PBQPNum[rows * cols]) { 124 std::fill(data, data + (rows * cols), initVal); 129 rows(m.rows), cols(m.cols), data(new PBQPNum[rows * cols]) [all...] |
/external/libvpx/libvpx/test/ |
pp_filter_test.cc | 26 int dst_pixels_per_line, int cols, unsigned char *flimit, int size); 29 int rows, int cols, int flimit); 32 int cols, int flimit); 167 void SetCols(unsigned char *s, int rows, int cols, int src_width) { 169 for (int c = 0; c < cols; c++) { 177 int rows, int cols, int src_pitch) { 179 for (int c = 0; c < cols; c++) { 187 void RunFilterLevel(unsigned char *s, int rows, int cols, int src_width, 190 GetParam()(s, src_width, rows, cols, filter_level)); 191 RunComparison(expected_output, s, rows, cols, src_width) 197 const int cols = 16; local 212 const int cols = 16; local 228 const int cols = 16; local 249 const int cols = 16; local 305 const int cols = 16; local 340 const int cols = 16; local 370 const int cols = 16; local 389 const int cols = 16; local [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);
|
tut_matrix_resize_fixed_size.cpp | 11 << m.rows() << "x" << m.cols() << std::endl;
|
/external/trappy/trappy/plotter/ |
PlotLayout.py | 27 :param cols: The number of columns to draw 28 :type cols: int 35 and :math:`N_{cols}` such that: 39 N_{rows} = \\frac{N_{cols}}{N_{plots}} 42 def __init__(self, cols, num_plots, **kwargs): 44 self.cols = cols 51 if self.num_plots < self.cols: 52 self.cols = self.num_plots 53 self.rows = (self.num_plots / self.cols) [all...] |
/external/eigen/Eigen/src/Core/ |
CommaInitializer.h | 42 : m_xpr(xpr), m_row(0), m_col(other.cols()), m_currentBlockRows(other.rows()) 44 m_xpr.block(0, 0, other.rows(), other.cols()) = other; 55 const_cast<CommaInitializer&>(o).m_col = m_xpr.cols(); 63 if (m_col==m_xpr.cols()) 71 eigen_assert(m_col<m_xpr.cols() 83 if (m_col==m_xpr.cols() && (other.cols()!=0 || other.rows()!=m_currentBlockRows)) 91 eigen_assert((m_col + other.cols() <= m_xpr.cols()) 95 (m_row, m_col, other.rows(), other.cols()) = other [all...] |
/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/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...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/linux/ |
virtio_console.h | 14 __u16 cols; member in struct:virtio_console_config
|
/art/tools/ahat/src/ |
SizeTable.java | 45 List<Column> cols = new ArrayList<Column>(); local 46 cols.add(left); 47 cols.add(new Column("Java Size", Column.Align.RIGHT)); 48 cols.add(new Column("?", Column.Align.RIGHT, showDiff)); 49 cols.add(new Column("Registered Native Size", Column.Align.RIGHT)); 50 cols.add(new Column("?", Column.Align.RIGHT, showDiff)); 51 cols.add(new Column("Total Size", Column.Align.RIGHT)); 52 cols.add(new Column("?", Column.Align.RIGHT, showDiff)); 53 cols.addAll(Arrays.asList(columns)); 54 doc.table(cols.toArray(new Column[cols.size()])) [all...] |
/external/eigen/Eigen/src/QR/ |
CompleteOrthogonalDecomposition.h | 93 CompleteOrthogonalDecomposition(Index rows, Index cols) 94 : m_cpqr(rows, cols), m_zCoeffs((std::min)(rows, cols)), m_temp(cols) {} 105 * matrix.cols()); 114 : m_cpqr(matrix.rows(), matrix.cols()), 115 m_zCoeffs((std::min)(matrix.rows(), matrix.cols())), 116 m_temp(matrix.cols()) 130 m_zCoeffs((std::min)(matrix.rows(), matrix.cols())), 131 m_temp(matrix.cols()) 282 inline Index cols() const { return m_cpqr.cols(); } function in class:Eigen::CompleteOrthogonalDecomposition 418 const Index cols = m_cpqr.cols(); local 471 const Index cols = this->cols(); local 515 const Index cols = this->cols(); local [all...] |