| /external/eigen/test/ |
| integer_types.cpp | 28 Index cols = m.cols(); local
30 MatrixType m1(rows, cols),
31 m2 = MatrixType::Random(rows, cols),
32 mzero = MatrixType::Zero(rows, cols);
35 m1 = MatrixType::Random(rows, cols);
62 Index cols = m.cols(); local
66 MatrixType m1(rows, cols),
67 m2 = MatrixType::Random(rows, cols),
[all...] |
| block.cpp | 44 Index cols = m.cols(); local
46 MatrixType m1 = MatrixType::Random(rows, cols),
48 m2 = MatrixType::Random(rows, cols),
49 m3(rows, cols),
50 ones = MatrixType::Ones(rows, cols);
57 Index c1 = internal::random<Index>(0,cols-1);
58 Index c2 = internal::random<Index>(c1,cols-1);
81 RowVectorType br1(m1.block(r1,0,1,cols));
94 if (rows>=5 && cols>=8
205 Index cols = m.cols(); local
239 Index cols = m.cols(); local
[all...] |
| diagonal.cpp | 18 Index cols = m.cols(); local
20 MatrixType m1 = MatrixType::Random(rows, cols),
21 m2 = MatrixType::Random(rows, cols);
73 Index cols = m.cols(); local
75 MatrixType m1 = MatrixType::Random(rows, cols);
77 if (rows>=2 && cols>=2)
|
| constructor.cpp | 27 Index cols = m.cols(); local
29 MatrixType m0 = MatrixType::Random(rows,cols);
33 VERIFY_EVALUATION_COUNT( MatrixType m2(m0.block(0,0,rows,cols)) , 1);
|
| diagonalmatrices.cpp | 16 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
18 typedef Matrix<Scalar, 1, Cols> RowVectorType;
22 typedef DiagonalMatrix<Scalar, Cols> RightDiagonalMatrix;
23 typedef Matrix<Scalar, Rows==Dynamic?Dynamic:2*Rows, Cols==Dynamic?Dynamic:2*Cols> BigMatrix;
25 Index cols = m.cols(); local
27 MatrixType m1 = MatrixType::Random(rows, cols),
28 m2 = MatrixType::Random(rows, cols);
31 RowVectorType rv1 = RowVectorType::Random(cols),
[all...] |
| linearstructure.cpp | 27 Index cols = m.cols(); local
31 MatrixType m1 = MatrixType::Random(rows, cols),
32 m2 = MatrixType::Random(rows, cols),
33 m3(rows, cols);
39 c = internal::random<Index>(0, cols-1);
70 VERIFY_IS_APPROX(m1+m1.block(0,0,rows,cols), m1+m1);
71 VERIFY_IS_APPROX(m1.cwiseProduct(m1.block(0,0,rows,cols)), m1.cwiseProduct(m1));
72 VERIFY_IS_APPROX(m1 - m1.block(0,0,rows,cols), m1 - m1);
73 VERIFY_IS_APPROX(m1.block(0,0,rows,cols) * s1, m1 * s1)
[all...] |
| /external/libvpx/libvpx/vpx_dsp/ |
| deblock.c | 44 int dst_pixels_per_line, int cols,
53 assert(cols >= 8);
60 for (col = 0; col < cols; col++) {
85 p_src[cols] = p_src[cols + 1] = p_src[cols - 1];
87 for (col = 0; col < cols; col++) {
117 int cols, int flimit) {
132 for (i = 0; i < 17; i++) s[i + cols] = s[cols - 1]
[all...] |
| /external/eigen/Eigen/src/SVD/ |
| UpperBidiagonalization.h | 57 : m_householder(matrix.rows(), matrix.cols()),
58 m_bidiagonal(matrix.cols(), matrix.cols()),
80 .setLength(m_householder.cols()-1)
101 Index cols = mat.cols(); local
111 for (Index k = 0; /* breaks at k==cols-1 below */ ; ++k)
114 Index remainingCols = cols - k - 1;
123 if(k == cols-1) break;
144 * and the \a blockSize x \c cols horizontal panel [A00 A01] of the matrix \a A. The bottom-right block A1
292 Index cols = A.cols(); local
362 Index cols = matrix.cols(); local
384 Index cols = matrix.cols(); local
[all...] |
| /external/eigen/Eigen/src/Core/ |
| ArrayWrapper.h | 66 inline Index cols() const { return m_expression.cols(); } function in class:Eigen::ArrayWrapper
107 void resize(Index rows, Index cols) { m_expression.resize(rows,cols); }
164 inline Index cols() const { return m_expression.cols(); } function in class:Eigen::MatrixWrapper
201 void resize(Index rows, Index cols) { m_expression.resize(rows,cols); }
|
| Select.h | 67 eigen_assert(m_condition.cols() == m_then.cols() && m_condition.cols() == m_else.cols());
71 inline EIGEN_DEVICE_FUNC Index cols() const { return m_condition.cols(); } function in class:Eigen::Select
142 derived(), thenMatrix.derived(), ThenDerived::Constant(rows(),cols(),elseScalar));
157 derived(), ElseDerived::Constant(rows(),cols(),thenScalar), elseMatrix.derived());
|
| CwiseNullaryOp.h | 68 CwiseNullaryOp(Index rows, Index cols, const NullaryOp& func = NullaryOp())
69 : m_rows(rows), m_cols(cols), m_functor(func)
73 && cols >= 0
74 && (ColsAtCompileTime == Dynamic || ColsAtCompileTime == cols));
80 EIGEN_STRONG_INLINE Index cols() const { return m_cols.value(); } function in class:Eigen::CwiseNullaryOp
95 * The parameters \a rows and \a cols are the number of rows and of columns of
99 * it is redundant to pass \a rows and \a cols as arguments, so Zero() should be used
109 DenseBase<Derived>::NullaryExpr(Index rows, Index cols, const CustomNullaryOp& func)
111 return CwiseNullaryOp<CustomNullaryOp, PlainObject>(rows, cols, func);
161 * The parameters \a rows and \a cols are the number of rows and of columns o
[all...] |
| EigenBase.h | 57 /** \returns the number of rows. \sa cols(), RowsAtCompileTime */
62 inline Index cols() const { return derived().cols(); } function in struct:Eigen::EigenBase
63 /** \returns the number of coefficients, which is rows()*cols().
64 * \sa rows(), cols(), SizeAtCompileTime. */
66 inline Index size() const { return rows() * cols(); }
81 typename Dest::PlainObject res(rows(),cols());
93 typename Dest::PlainObject res(rows(),cols());
|
| /external/gemmlowp/internal/ |
| block_params.h | 46 void Init(int rows, int cols, int depth, int num_threads,
48 FindL2BlockSizes<KernelFormat>(rows, cols, depth, num_threads,
57 static void FindL2BlockSizes(int rows, int cols, int depth, int num_threads,
75 std::max(1, CeilQuotient(cols, max_cache_friendly_l2_cols));
77 RoundUp<KernelFormat::kCols>(CeilQuotient(cols, min_l2_cols_blocks));
101 static void FindL1BlockSizes(int rows, int cols, int depth,
110 assert(cols % KernelFormat::kCols == 0);
115 l1_cols = cols;
|
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_ethread.h | 53 const int cols);
57 const int cols);
|
| /external/syslinux/com32/lib/sys/ |
| ansicon_write.c | 83 ti.cols = 80;
89 firmware->o_ops->get_mode(&ti.cols, &ti.rows);
98 fp->o.cols = ti.cols;
172 uint8_t rows, cols, attribute; local
174 cols = ti.cols - 1;
178 firmware->o_ops->scroll_up(cols, rows, attribute);
|
| /external/compiler-rt/lib/sanitizer_common/scripts/ |
| gen_dynamic_list.py | 55 cols = line.split(' ')
56 if len(cols) == 3 and cols[1] in func_symbols :
57 functions.append(cols[2])
|
| /external/replicaisland/src/com/replica/replicaisland/ |
| TiledWorld.java | 35 public TiledWorld(int cols, int rows) {
37 mTilesArray = new int[cols][rows];
39 mColCount = cols;
41 for (int x = 0; x < cols; x++) {
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/linux/ |
| virtio_console.h | 46 __u16 cols; member in struct:virtio_console_config
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseRedux.h | 19 eigen_assert(rows()>0 && cols()>0 && "you are using a non initialized matrix");
32 eigen_assert(rows()>0 && cols()>0 && "you are using a non initialized matrix");
43 eigen_assert(rows()>0 && cols()>0 && "you are using a non initialized matrix");
|
| /external/eigen/demos/mix_eigen_and_c/ |
| binary_library.h | 27 struct C_MatrixXd* MatrixXd_new(int rows, int cols);
31 void MatrixXd_resize (struct C_MatrixXd *m, int rows, int cols);
50 struct C_Map_MatrixXd* Map_MatrixXd_new(double *array, int rows, int cols);
|
| /external/libvpx/libvpx/test/ |
| active_map_test.cc | 55 map.cols = (kWidth + 15) / 16;
57 ASSERT_EQ(map.cols, 13u);
63 map.cols = (kWidth + 15) / 16;
|
| /external/webrtc/webrtc/system_wrappers/include/ |
| aligned_array.h | 23 AlignedArray(size_t rows, size_t cols, size_t alignment)
25 cols_(cols) {
74 size_t cols() const { function in class:webrtc::AlignedArray
|
| /packages/apps/Launcher3/tests/src/com/android/launcher3/util/ |
| GridOccupancyTest.java | 50 int cols = cells.length / rows; local
52 GridOccupancy grid = new GridOccupancy(cols, rows);
54 for (int x = 0; x < cols; x++) {
|
| /external/opencv/cv/src/ |
| cvkdtree.cpp | 90 assert(d->cols == tr->dims());
93 assert(results->cols == k);
94 assert(dist->cols == k);
120 int rn = results->rows * results->cols;
146 (&tmp[0], &tmp[0] + tmp.size(), mat->cols,
174 assert(bounds_min->rows * bounds_min->cols == dims());
175 assert(bounds_max->rows * bounds_max->cols == dims());
216 if (desc->cols != dims)
218 if (results->rows != desc->rows && results->cols != k)
220 if (dist->rows != desc->rows && dist->cols != k
[all...] |
| /external/eigen/bench/ |
| BenchUtil.h | 24 mat.setRandom();// = MatrixType::random(mat.rows(), mat.cols());
51 dst.resize(src.rows(),src.cols());
52 for (int j=0; j<src.cols(); ++j)
66 for (int j=0; j<src.cols(); ++j)
78 dst.resize(src.rows(),src.cols());
79 for (int j=0; j<src.cols(); ++j)
|
