| /external/eigen/test/ |
| 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";
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));
|
| dontalign.cpp | 27 Index rows = m.rows(); local
30 MatrixType a = MatrixType::Random(rows,cols);
31 SquareMatrixType square = SquareMatrixType::Random(rows,rows);
32 VectorType v = VectorType::Random(rows);
43 Scalar* array = internal::aligned_new<Scalar>(rows);
44 v = VectorType::MapAligned(array, rows);
45 internal::aligned_delete(array, rows);
|
| bandmatrix.cpp | 18 Index rows = _m.rows(); local
23 MatrixType m(rows,cols,supers,subs);
25 DenseMatrixType dm1(rows,cols);
48 Index d = (std::min)(rows,cols);
50 Index b = std::max<Index>(0,rows-d-subs);
51 if(a>0) dm1.block(0,d+supers,rows,a).setZero();
53 dm1.block(subs+1,0,rows-subs-1-b,rows-subs-1-b).template triangularView<Lower>().setZero();
65 Index rows = internal::random<Index>(1,10) local
[all...] |
| householder.cpp | 21 Index rows = m.rows(); local
34 Matrix<Scalar, EIGEN_SIZE_MAX(MatrixType::RowsAtCompileTime,MatrixType::ColsAtCompileTime), 1> _tmp((std::max)(rows,cols));
41 VectorType v1 = VectorType::Random(rows), v2;
46 if(rows>=2) VERIFY_IS_MUCH_SMALLER_THAN(v1.tail(rows-1).norm(), v1.norm());
47 v1 = VectorType::Random(rows);
52 MatrixType m1(rows, cols),
53 m2(rows, cols);
55 v1 = VectorType::Random(rows);
[all...] |
| product_selfadjoint.cpp | 21 Index rows = m.rows(); local
24 MatrixType m1 = MatrixType::Random(rows, cols),
25 m2 = MatrixType::Random(rows, cols),
27 VectorType v1 = VectorType::Random(rows),
28 v2 = VectorType::Random(rows),
29 v3(rows);
30 RowVectorType r1 = RowVectorType::Random(rows),
31 r2 = RowVectorType::Random(rows);
32 RhsMatrixType m4 = RhsMatrixType::Random(rows,10)
[all...] |
| sparse_vector.cpp | 12 template<typename Scalar,typename StorageIndex> void sparse_vector(int rows, int cols)
14 double densityMat = (std::max)(8./(rows*cols), 0.01);
15 double densityVec = (std::max)(8./(rows), 0.1);
22 SparseMatrixType m1(rows,rows);
23 SparseVectorType v1(rows), v2(rows), v3(rows);
24 DenseMatrix refM1 = DenseMatrix::Zero(rows, rows);
[all...] |
| inverse.cpp | 21 Index rows = m.rows(); local
26 MatrixType m1(rows, cols),
27 m2(rows, cols),
28 identity = MatrixType::Identity(rows, rows);
29 createRandomPIMatrixOfRank(rows,rows,rows,m1);
64 VectorType v3 = VectorType::Random(rows);
[all...] |
| mapstaticmethods.cpp | 73 Index rows = m.rows(), cols = m.cols(); local
77 PlainObjectType::Map(ptr, rows, cols).setZero();
78 PlainObjectType::MapAligned(ptr, rows, cols).setZero();
79 PlainObjectType::Map(const_ptr, rows, cols).sum();
80 PlainObjectType::MapAligned(const_ptr, rows, cols).sum();
82 PlainObjectType::Map(ptr, rows, cols, InnerStride<>(i)).setZero();
83 PlainObjectType::MapAligned(ptr, rows, cols, InnerStride<>(i)).setZero();
84 PlainObjectType::Map(const_ptr, rows, cols, InnerStride<>(i)).sum();
85 PlainObjectType::MapAligned(const_ptr, rows, cols, InnerStride<>(i)).sum()
[all...] |
| special_numbers.cpp | 15 int rows = internal::random<int>(1,300); local
22 MatType m1 = MatType::Random(rows,cols),
23 mnan = MatType::Random(rows,cols),
24 minf = MatType::Random(rows,cols),
25 mboth = MatType::Random(rows,cols);
30 mnan(internal::random<int>(0,rows-1), internal::random<int>(0,cols-1)) = nan;
31 minf(internal::random<int>(0,rows-1), internal::random<int>(0,cols-1)) = inf;
|
| array_reverse.cpp | 22 Index rows = m.rows(); local
27 MatrixType m1 = MatrixType::Random(rows, cols), m2;
28 VectorType v1 = VectorType::Random(rows);
32 for ( int i = 0; i < rows; i++ ) {
34 VERIFY_IS_APPROX(m1_r(i, j), m1(rows - 1 - i, cols - 1 - j));
40 for ( int i = 0; i < rows; i++ ) {
42 VERIFY_IS_APPROX(m1_rd(i, j), m1(rows - 1 - i, cols - 1 - j));
48 for ( int i = 0; i < rows; i++ ) {
50 VERIFY_IS_APPROX(m1_rb(i, j), m1(rows - 1 - i, cols - 1 - j))
[all...] |
| integer_types.cpp | 27 Index rows = m.rows(); local
30 MatrixType m1(rows, cols),
31 m2 = MatrixType::Random(rows, cols),
32 mzero = MatrixType::Zero(rows, cols);
35 m1 = MatrixType::Random(rows, cols);
61 Index rows = m.rows(); local
66 MatrixType m1(rows, cols),
67 m2 = MatrixType::Random(rows, cols)
[all...] |
| /external/eigen/bench/ |
| sparse_transpose.cpp | 38 int rows = 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...] |
| sparse_product.cpp | 53 // mkl_scscmm(&n, lhs.rows(), rhs.cols(), lhs.cols(), &alpha, matdescra,
56 // // mkl_somatcopy('C', 'T', lhs.rows(), lhs.cols(), 1,
57 // // lhs._valuePtr(), lhs.rows(), DST, dst_stride);
100 int rows = SIZE; local
104 EigenSparseMatrix sm1(rows,cols), sm2(rows,cols), sm3(rows,cols), sm4(rows,cols);
111 fillMatrix2(nnzPerCol, rows, cols, sm1);
112 fillMatrix2(nnzPerCol, rows, cols, sm2)
[all...] |
| /external/skia/src/sksl/ir/ |
| SkSLType.cpp | 26 this->rows() == other.rows()) {
40 const Type& Type::toCompound(const Context& context, int columns, int rows) const {
42 if (columns == 1 && rows == 1) {
46 switch (rows) {
75 default: ABORT("unsupported row count (%d)", rows);
78 switch (rows) {
107 default: ABORT("unsupported row count (%d)", rows);
110 switch (rows) {
118 default: ABORT("unsupported row count (%d)", rows);
[all...] |
| /external/eigen/doc/examples/ |
| tut_matrix_resize_fixed_size.cpp | 11 << m.rows() << "x" << m.cols() << std::endl;
|
| tut_matrix_resize.cpp | 11 << m.rows() << "x" << m.cols() << std::endl;
17 << v.rows() << "x" << v.cols() << std::endl;
|
| /external/mesa3d/src/glsl/tests/ |
| uniform_initializer_utils.h | 37 unsigned columns, unsigned rows,
42 unsigned columns, unsigned rows, unsigned array_size,
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/linux/ |
| virtio_console.h | 15 /* rows of the screens */
16 __u16 rows; member in struct:virtio_console_config
|
| /external/gemmlowp/meta/generators/ |
| gemm_NxMxK_neon.py | 41 def GenerateCommonTempsCountersAndConsts(emitter, rows):
56 if rows is not 0:
58 'std::int32_t*', 'zipped_lhs_%d_offsets' % rows,
59 'reinterpret_cast<std::int32_t*>(zipped_lhs + padded_k * %d)' % rows)
68 def GenerateQuantized8BitTempsCountersAndConsts(emitter, rows):
70 GenerateCommonTempsCountersAndConsts(emitter, rows)
85 def GenerateFullTempsCountersAndConsts(emitter, result_type, rows):
87 GenerateCommonTempsCountersAndConsts(emitter, rows)
97 def ZipName(rows, leftovers, aligned):
98 return zip_Nx8_neon.BuildName(rows, leftovers, aligned
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/plat-mac/lib-scriptpackages/StdSuites/ |
| Table_Suite.py | 42 class rows(aetools.ComponentItem): class in inherits:aetools.ComponentItem
43 """rows - """
46 row = rows
66 rows._superclassnames = []
67 rows._privpropdict = {
69 rows._privelemdict = {
89 'crow' : rows,
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/plat-mac/lib-scriptpackages/StdSuites/ |
| Table_Suite.py | 42 class rows(aetools.ComponentItem): class in inherits:aetools.ComponentItem
43 """rows - """
46 row = rows
66 rows._superclassnames = []
67 rows._privpropdict = {
69 rows._privelemdict = {
89 'crow' : rows,
|
| /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;
54 const_cast<CommaInitializer&>(o).m_row = m_xpr.rows();
68 eigen_assert(m_row<m_xpr.rows()
69 && "Too many rows passed to comma initializer (operator<<)");
83 if (m_col==m_xpr.cols() && (other.cols()!=0 || other.rows()!=m_currentBlockRows))
87 m_currentBlockRows = other.rows();
88 eigen_assert(m_row+m_currentBlockRows<=m_xpr.rows()
89 && "Too many rows passed to comma initializer (operator<<)");
93 eigen_assert(m_currentBlockRows==other.rows());
[all...] |
| /external/eigen/Eigen/src/Core/products/ |
| Parallelizer.h | 86 void parallelize_gemm(const Functor& func, Index rows, Index cols, Index depth, bool transpose)
97 func(0,rows, 0,cols);
108 Index size = transpose ? rows : cols;
112 double work = static_cast<double>(rows) * static_cast<double>(cols) *
124 return func(0,rows, 0,cols);
130 std::swap(rows,cols);
141 Index blockRows = (rows / actual_threads);
145 Index actualBlockRows = (i+1==actual_threads) ? rows-r0 : blockRows;
153 if(transpose) func(c0, actualBlockCols, 0, rows, info);
154 else func(0, rows, c0, actualBlockCols, info)
[all...] |
| /prebuilts/go/darwin-x86/src/database/sql/ |
| example_test.go | 17 rows, err := db.Query("SELECT name FROM users WHERE age=?", age)
21 defer rows.Close()
22 for rows.Next() {
24 if err := rows.Scan(&name); err != nil {
29 if err := rows.Err(); err != nil {
71 rows, err := db.Query(q, age)
75 defer rows.Close()
77 for rows.Next() {
82 if err := rows.Scan(&id, &name); err != nil {
87 if !rows.NextResultSet()
[all...] |
| /prebuilts/go/linux-x86/src/database/sql/ |
| example_test.go | 17 rows, err := db.Query("SELECT name FROM users WHERE age=?", age)
21 defer rows.Close()
22 for rows.Next() {
24 if err := rows.Scan(&name); err != nil {
29 if err := rows.Err(); err != nil {
71 rows, err := db.Query(q, age)
75 defer rows.Close()
77 for rows.Next() {
82 if err := rows.Scan(&id, &name); err != nil {
87 if !rows.NextResultSet()
[all...] |
