| /external/eigen/test/ |
| sparse_basic.cpp | 22 const Index rows = ref.rows(); local
31 double density = (std::max)(8./(rows*cols), 0.01);
38 SparseMatrixType m(rows, cols);
39 DenseMatrix refMat = DenseMatrix::Zero(rows, cols);
40 DenseVector vec1 = DenseVector::Random(rows);
69 DenseMatrix m1(rows,cols);
71 SparseMatrixType m2(rows,cols);
73 Index nnz = internal::random<int>(1,int(rows)/2);
86 Index i = internal::random<Index>(0,rows-1)
[all...] |
| eigen2support.cpp | 19 Index rows = m.rows(); local
22 MatrixType m1 = MatrixType::Random(rows, cols),
23 m3(rows, cols);
30 VERIFY_IS_APPROX(m1.cwise() + s1, MatrixType::Constant(rows,cols,s1) + m1);
31 VERIFY_IS_APPROX((m1*Scalar(2)).cwise() - s2, (m1+m1) - MatrixType::Constant(rows,cols,s2) );
43 VERIFY_IS_EQUAL((m1.col(0).end(1)), (m1.col(0).segment(rows-1,1)));
44 VERIFY_IS_EQUAL((m1.col(0).template end<1>()), (m1.col(0).segment(rows-1,1)));
|
| zerosized.cpp | 34 VERIFY(t1.rows() == 0);
42 VERIFY(t2.rows() == 0);
52 Index rows = MatrixType::RowsAtCompileTime==Dynamic ? internal::random<Index>(1,10) : Index(MatrixType::RowsAtCompileTime); local
54 MatrixType m(rows,cols);
56 zeroReduction(m.template block<MatrixType::RowsAtCompileTime,0>(0,0,rows,0));
59 Matrix<Scalar,Dynamic,Dynamic> prod = m.template block<MatrixType::RowsAtCompileTime,0>(0,0,rows,0) * m.template block<0,MatrixType::ColsAtCompileTime>(0,0,0,cols);
60 VERIFY(prod.rows()==rows && prod.cols()==cols);
|
| array.cpp | 20 Index rows = m.rows(); local
23 ArrayType m1 = ArrayType::Random(rows, cols),
24 m2 = ArrayType::Random(rows, cols),
25 m3(rows, cols);
29 ColVectorType cv1 = ColVectorType::Random(rows);
37 VERIFY_IS_APPROX(m1 + s1, ArrayType::Constant(rows,cols,s1) + m1);
39 VERIFY_IS_APPROX(m1 - s1, m1 - ArrayType::Constant(rows,cols,s1));
40 VERIFY_IS_APPROX(s1 - m1, ArrayType::Constant(rows,cols,s1) - m1);
41 VERIFY_IS_APPROX((m1*Scalar(2)) - s2, (m1+m1) - ArrayType::Constant(rows,cols,s2) )
137 Index rows = m.rows(); local
215 Index rows = m.rows(); local
[all...] |
| /external/autotest/frontend/client/src/autotest/common/table/ |
| TableRenderer.java | 23 public void renderRowsAndAppend(HTMLTable tableObject, CellInfo[][] rows,
27 for (int rowIndex = startRow; rowIndex < startRow + maxRows && rowIndex < rows.length;
29 CellInfo[] row = rows[rowIndex];
72 public void renderRows(HTMLTable tableObject, CellInfo[][] rows, boolean renderNull) {
74 renderRowsAndAppend(tableObject, rows, 0, rows.length, renderNull);
77 public void renderRows(HTMLTable tableObject, CellInfo[][] rows) {
78 renderRows(tableObject, rows, true);
|
| /external/eigen/bench/ |
| sparse_randomsetter.cpp | 47 int rows = sm1.rows(); local
54 (*set1)(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
67 int rows = SIZE; local
71 EigenSparseMatrix sm1(rows,cols), sm2(rows,cols);
74 nentries = rows*cols*density;
81 dummy = internal::random<int>(0,rows-1) + internal::random<int>(0,cols-1);
97 // set1(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
106 // set1(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1
[all...] |
| spmv.cpp | 28 // mkl_scscmm(&n, lhs.rows(), rhs.cols(), lhs.cols(), &alpha, matdescra,
31 // // mkl_somatcopy('C', 'T', lhs.rows(), lhs.cols(), 1,
32 // // lhs._valuePtr(), lhs.rows(), DST, dst_stride);
40 int rows = size; local
51 rows = atoi(argv[i]+1);
76 std::cout << argv[0] << " r<nb rows> c<nb columns> n<non zeros per column> t<nb tries> p<nb repeats>\n";
80 std::cout << "SpMV " << rows << " x " << cols << " with " << nnzPerCol << " non zeros per column. (" << repeats << " repeats, and " << tries << " tries)\n\n";
82 EigenSparseMatrix sm(rows,cols);
83 DenseVector dv(cols), res(rows);
91 fillMatrix2(nnzPerCol, rows, cols, sm)
[all...] |
| benchCholesky.cpp | 31 int rows = m.rows(); local
35 for (int j=0; j<rows; ++j)
37 int r = std::max(rows - j -1,0);
41 int repeats = (REPEAT*1000)/(rows*rows);
46 MatrixType a = MatrixType::Random(rows,cols);
52 int r = internal::random<int>(0,covMat.rows()-1);
80 std::cout << covMat.rows() << " \t"
92 gsl_matrix* gslCovMat = gsl_matrix_alloc(covMat.rows(),covMat.cols())
[all...] |
| /external/eigen/doc/examples/ |
| Tutorial_simple_example_dynamic_size.cpp | 12 for (int i=0; i<m.rows(); ++i) // loop over rows
13 m(i,j) = i+j*m.rows(); // to access matrix coefficients,
|
| /external/eigen/doc/snippets/ |
| Tutorial_SlicingCol.cpp | 3 Map<MatrixXf,0,OuterStride<> > M2(M1.data(), M1.rows(), (M1.cols()+2)/3, OuterStride<>(M1.outerStride()*3));
9 Map<RowMajorMatrixXf,0,Stride<Dynamic,3> > M4(M3.data(), M3.rows(), (M3.cols()+2)/3,
|
| /external/libvpx/libvpx/vp9/common/ |
| vp9_thread_common.h | 35 int rows; member in struct:VP9LfSyncData
43 void vp9_loop_filter_alloc(VP9LfSync *lf_sync, struct VP9Common *cm, int rows,
|
| /external/markdown/markdown/extensions/ |
| tables.py | 25 rows = block.split('\n')
26 return (len(rows) > 2 and '|' in rows[0] and
27 '|' in rows[1] and '-' in rows[1] and
28 rows[1][0] in ['|', ':', '-'])
34 rows = block[2:]
55 for row in rows:
|
| /external/python/cpython3/Modules/_decimal/libmpdec/ |
| transpose.c | 51 std_trans(mpd_uint_t dest[], mpd_uint_t src[], mpd_size_t rows, mpd_size_t cols)
56 for (r = 0; r < rows; r++) {
62 idest += rows;
68 * Swap half-rows of 2^n * (2*2^n) matrix.
73 swap_halfrows_pow2(mpd_uint_t *matrix, mpd_size_t rows, mpd_size_t cols, int dir)
86 assert(cols == mul_size_t(2, rows));
89 r = rows;
99 hmax = rows; /* cycles start at odd halfrows */
245 transpose_pow2(mpd_uint_t *matrix, mpd_size_t rows, mpd_size_t cols)
247 mpd_size_t size = mul_size_t(rows, cols)
[all...] |
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/extensions/compactnotation/ |
| CompactConstructorErrorsTest.java | 97 List<Row> rows = table.getRows(); local
98 assertEquals(1, rows.size());
99 assertFalse("Row should not be created.", rows.get(0) instanceof Row);
100 Map<String, String> map = (Map<String, String>) rows.get(0);
111 List<Row> rows = table.getRows(); local
112 assertEquals(1, rows.size());
113 assertFalse("Row should not be created.", rows.get(0) instanceof Row);
114 Map<String, String> map = (Map<String, String>) rows.get(0);
|
| /packages/apps/DocumentsUI/tests/common/com/android/documentsui/bots/ |
| InspectorBot.java | 62 Map<String, String> rows = new HashMap<>(); local
70 rows.put(
75 return rows;
81 Map<String, String> rows = getTableRows(details); local
82 return rows.containsKey(key);
88 Map<String, String> rows = getTableRows(details); local
89 return rows.containsKey(key) && value.equals(rows.get(key));
|
| /external/gemmlowp/test/ |
| benchmark_all_sizes.cc | 64 Matrix(int rows, int cols) : Map(nullptr, 0, 0, 0) { Resize(rows, cols); }
79 void Resize(int rows, int cols) {
80 rows_ = rows;
82 stride_ = kOrder == MapOrder::ColMajor ? rows : cols;
100 for (int r = 0; r < m->rows(); r++) {
109 float benchmark_8bit(int rows, int depth, int cols) {
118 lhs.Resize(rows, depth);
120 result.Resize(rows, cols);
161 float benchmark_8bit_to_32bit(int rows, int depth, int cols)
203 int rows; member in struct:Shape
[all...] |
| /external/eigen/Eigen/src/Eigenvalues/ |
| HessenbergDecomposition.h | 121 m_temp(matrix.rows()),
124 if(matrix.rows()<2)
129 m_hCoeffs.resize(matrix.rows()-1,1);
155 if(matrix.rows()<2)
160 m_hCoeffs.resize(matrix.rows()-1,1);
238 .setLength(m_matrix.rows() - 1)
296 eigen_assert(matA.rows()==matA.cols());
297 Index n = matA.rows();
358 Index n = result.rows();
363 Index rows() const { return m_hess.packedMatrix().rows(); function in struct:Eigen::internal::HessenbergDecompositionMatrixHReturnType
[all...] |
| /external/eigen/Eigen/src/LU/ |
| FullPivLU.h | 92 FullPivLU(Index rows, Index cols);
226 * b.rows()==A.rows(), where A is the matrix of which *this is the LU decomposition.
378 return rank() == rows();
390 return isInjective() && (m_lu.rows() == m_lu.cols());
403 eigen_assert(m_lu.rows() == m_lu.cols() && "You can't take the inverse of a non-square matrix!");
409 EIGEN_DEVICE_FUNC inline Index rows() const { return m_lu.rows(); } function in class:Eigen::FullPivLU
450 FullPivLU<MatrixType>::FullPivLU(Index rows, Index cols)
451 : m_lu(rows, cols)
500 const Index rows = m_lu.rows(); local
757 const Index rows = this->rows(), local
808 const Index rows = this->rows(), cols = this->cols(), local
[all...] |
| /external/eigen/Eigen/src/QR/ |
| FullPivHouseholderQR.h | 103 FullPivHouseholderQR(Index rows, Index cols)
104 : m_qr(rows, cols),
105 m_hCoeffs((std::min)(rows,cols)),
106 m_rows_transpositions((std::min)(rows,cols)),
107 m_cols_transpositions((std::min)(rows,cols)),
119 * FullPivHouseholderQR<MatrixType> qr(matrix.rows(), matrix.cols());
127 : m_qr(matrix.rows(), matrix.cols()),
128 m_hCoeffs((std::min)(matrix.rows(), matrix.cols())),
129 m_rows_transpositions((std::min)(matrix.rows(), matrix.cols())),
130 m_cols_transpositions((std::min)(matrix.rows(), matrix.cols()))
318 inline Index rows() const { return m_qr.rows(); } function in class:Eigen::FullPivHouseholderQR
615 const Index rows = m_qr.rows(); local
627 const Index rows = m_qr.rows(); local
640 Index rows() const { return m_qr.rows(); } function in struct:Eigen::internal::FullPivHouseholderQRMatrixQReturnType
[all...] |
| /external/eigen/Eigen/src/Core/ |
| PlainObjectBase.h | 40 static EIGEN_ALWAYS_INLINE void run(Index rows, Index cols)
45 bool error = (rows == 0 || cols == 0) ? false
46 : (rows > max_index / cols);
151 EIGEN_STRONG_INLINE Index rows() const { return m_storage.rows(); } function in class:Eigen::PlainObjectBase
165 return m_storage.data()[rowId + colId * m_storage.rows()];
188 return m_storage.data()[rowId + colId * m_storage.rows()];
209 return m_storage.data()[rowId + colId * m_storage.rows()];
227 : rowId + colId * m_storage.rows()));
244 : rowId + colId * m_storage.rows()), val)
[all...] |
| /external/ImageMagick/coders/ |
| label.c | 139 if ((image->columns == 0) && (image->rows == 0))
142 image->rows=(size_t) floor(metrics.height+draw_info->stroke_width+0.5);
146 (((image->columns == 0) || (image->rows == 0)) ||
165 if ((image->columns != 0) && (image->rows != 0))
167 if ((width >= image->columns) && (height >= image->rows))
172 ((image->rows != 0) && (height >= image->rows)))
186 if ((image->columns != 0) && (image->rows != 0))
188 if ((width < image->columns) && (height < image->rows))
195 ((image->rows != 0) && (height < image->rows))
[all...] |
| psd-private.h | 31 rows, member in struct:_PSDInfo
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| DefaultRealMatrixChangingVisitor.java | 35 public void start(int rows, int columns,
|
| DefaultRealMatrixPreservingVisitor.java | 35 public void start(int rows, int columns,
|
| RealMatrixChangingVisitor.java | 34 * @param rows number of rows of the matrix
41 void start(int rows, int columns,
|
