| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Math.h | 116 Matrix(unsigned rows, unsigned cols) : in Matrix() argument
117 rows(rows), cols(cols), data(new PBQPNum[rows * cols]) { in Matrix()
122 Matrix(unsigned rows, unsigned cols, PBQPNum initVal) : in Matrix() argument
123 rows(rows), cols(cols), data(new PBQPNum[rows * cols]) { in Matrix()
124 std::fill(data, data + (rows * cols), initVal); in Matrix()
129 rows(m.rows), cols(m.cols), data(new PBQPNum[rows * cols]) { in Matrix()
130 std::copy(m.data, m.data + (rows * cols), data); in Matrix()
139 rows = m.rows; cols = m.cols;
140 data = new PBQPNum[rows * cols];
141 std::copy(m.data, m.data + (rows * cols), data);
[all …]
|
| /external/eigen/Eigen/src/Core/ |
| D | PlainObjectBase.h | 25 EIGEN_ALWAYS_INLINE void check_rows_cols_for_overflow(Index rows, Index cols) in check_rows_cols_for_overflow() argument
30 bool error = (rows < 0 || cols < 0) ? true in check_rows_cols_for_overflow()
31 : (rows == 0 || cols == 0) ? false in check_rows_cols_for_overflow()
32 : (rows > max_index / cols); in check_rows_cols_for_overflow()
120 EIGEN_STRONG_INLINE Index cols() const { return m_storage.cols(); }
125 return m_storage.data()[col + row * m_storage.cols()];
138 return m_storage.data()[col + row * m_storage.cols()];
151 return m_storage.data()[col + row * m_storage.cols()];
167 ? col + row * m_storage.cols()
184 ? col + row * m_storage.cols()
[all …]
|
| D | DenseStorage.h | 95 static inline DenseIndex cols(void) {return _Cols;}
111 static inline DenseIndex cols(void) {return _Cols;}
138 … inline DenseStorage(DenseIndex, DenseIndex rows, DenseIndex cols) : m_rows(rows), m_cols(cols) {}
142 inline DenseIndex cols(void) const {return m_cols;}
143 … conservativeResize(DenseIndex, DenseIndex rows, DenseIndex cols) { m_rows = rows; m_cols = cols; }
144 … inline void resize(DenseIndex, DenseIndex rows, DenseIndex cols) { m_rows = rows; m_cols = cols; }
161 inline DenseIndex cols(void) const {return _Cols;}
177 inline DenseStorage(DenseIndex, DenseIndex, DenseIndex cols) : m_cols(cols) {}
180 inline DenseIndex cols(void) const {return m_cols;}
181 inline void conservativeResize(DenseIndex, DenseIndex, DenseIndex cols) { m_cols = cols; }
[all …]
|
| /external/eigen/test/ |
| D | corners.cpp | 20 Index cols = m.cols(); in corners() local
23 Index c = internal::random<Index>(1,cols); in corners()
25 MatrixType matrix = MatrixType::Random(rows,cols); in corners()
26 const MatrixType const_matrix = MatrixType::Random(rows,cols); in corners()
29 COMPARE_CORNER(topRightCorner(r,c), block(0,cols-c,r,c)); in corners()
31 COMPARE_CORNER(bottomRightCorner(r,c), block(rows-r,cols-c,r,c)); in corners()
35 Index sc = internal::random<Index>(1,cols) - 1; in corners()
36 Index nc = internal::random<Index>(1,cols-sc); in corners()
38 COMPARE_CORNER(topRows(r), block(0,0,r,cols)); in corners()
39 COMPARE_CORNER(middleRows(sr,nr), block(sr,0,nr,cols)); in corners()
[all …]
|
| D | array.cpp | 21 Index cols = m.cols(); in array() local
23 ArrayType m1 = ArrayType::Random(rows, cols), in array()
24 m2 = ArrayType::Random(rows, cols), in array()
25 m3(rows, cols); in array()
28 RowVectorType rv1 = RowVectorType::Random(cols); in array()
35 VERIFY_IS_APPROX(m1 + s1, ArrayType::Constant(rows,cols,s1) + m1); in array()
37 VERIFY_IS_APPROX(m1 - s1, m1 - ArrayType::Constant(rows,cols,s1)); in array()
38 VERIFY_IS_APPROX(s1 - m1, ArrayType::Constant(rows,cols,s1) - m1); in array()
39 VERIFY_IS_APPROX((m1*Scalar(2)) - s2, (m1+m1) - ArrayType::Constant(rows,cols,s2) ); in array()
49 …ArrayType::Map(m1.data(), m1.rows(), m1.cols()) -= ArrayType::Map(m2.data(), m2.rows(), m2.cols()); in array()
[all …]
|
| D | mapstaticmethods.cpp | 72 int rows = m.rows(), cols = m.cols(); in run() local
76 PlainObjectType::Map(ptr, rows, cols).setZero(); in run()
77 PlainObjectType::MapAligned(ptr, rows, cols).setZero(); in run()
78 PlainObjectType::Map(const_ptr, rows, cols).sum(); in run()
79 PlainObjectType::MapAligned(const_ptr, rows, cols).sum(); in run()
81 PlainObjectType::Map(ptr, rows, cols, InnerStride<>(i)).setZero(); in run()
82 PlainObjectType::MapAligned(ptr, rows, cols, InnerStride<>(i)).setZero(); in run()
83 PlainObjectType::Map(const_ptr, rows, cols, InnerStride<>(i)).sum(); in run()
84 PlainObjectType::MapAligned(const_ptr, rows, cols, InnerStride<>(i)).sum(); in run()
86 PlainObjectType::Map(ptr, rows, cols, InnerStride<2>()).setZero(); in run()
[all …]
|
| D | array_for_matrix.cpp | 21 Index cols = m.cols(); in array_for_matrix() local
23 MatrixType m1 = MatrixType::Random(rows, cols), in array_for_matrix()
24 m2 = MatrixType::Random(rows, cols), in array_for_matrix()
25 m3(rows, cols); in array_for_matrix()
28 RowVectorType rv1 = RowVectorType::Random(cols); in array_for_matrix()
35 VERIFY_IS_APPROX((m1.array() + s1).matrix(), MatrixType::Constant(rows,cols,s1) + m1); in array_for_matrix()
36 …VERIFY_IS_APPROX(((m1*Scalar(2)).array() - s2).matrix(), (m1+m1) - MatrixType::Constant(rows,cols,… in array_for_matrix()
62 VERIFY_IS_APPROX(m1.block(0,0,0,cols).colwise().sum(), RowVectorType::Zero(cols)); in array_for_matrix()
82 Index cols = m.cols(); in comparisons() local
85 c = internal::random<Index>(0, cols-1); in comparisons()
[all …]
|
| D | array_reverse.cpp | 23 Index cols = m.cols(); in reverse() local
27 MatrixType m1 = MatrixType::Random(rows, cols); in reverse()
33 for ( int j = 0; j < cols; j++ ) { in reverse()
34 VERIFY_IS_APPROX(m1_r(i, j), m1(rows - 1 - i, cols - 1 - j)); in reverse()
41 for ( int j = 0; j < cols; j++ ) { in reverse()
42 VERIFY_IS_APPROX(m1_rd(i, j), m1(rows - 1 - i, cols - 1 - j)); in reverse()
49 for ( int j = 0; j < cols; j++ ) { in reverse()
50 VERIFY_IS_APPROX(m1_rb(i, j), m1(rows - 1 - i, cols - 1 - j)); in reverse()
57 for ( int j = 0; j < cols; j++ ) { in reverse()
65 for ( int j = 0; j < cols; j++ ) { in reverse()
[all …]
|
| D | resize.cpp | 12 template<DenseIndex rows, DenseIndex cols>
15 MatrixXf A(rows, cols); in resizeLikeTest()
17 Matrix<double, rows, cols> C; in resizeLikeTest()
20 VERIFY(B.rows() == rows && B.cols() == cols); in resizeLikeTest()
25 VERIFY(y.rows() == 1 && y.cols() == rows); in resizeLikeTest()
27 y.resize(cols); in resizeLikeTest()
29 VERIFY(x.rows() == cols && x.cols() == 1); in resizeLikeTest()
|
| D | bandmatrix.cpp | 20 Index cols = _m.cols(); in bandmatrix() local
24 MatrixType m(rows,cols,supers,subs); in bandmatrix()
26 DenseMatrixType dm1(rows,cols); in bandmatrix()
44 for (int i=0; i<cols; ++i) in bandmatrix()
49 Index d = (std::min)(rows,cols); in bandmatrix()
50 Index a = std::max<Index>(0,cols-d-supers); in bandmatrix()
53 dm1.block(0,supers+1,cols-supers-1-a,cols-supers-1-a).template triangularView<Upper>().setZero(); in bandmatrix()
55 if(b>0) dm1.block(d+subs,0,b,cols).setZero(); in bandmatrix()
69 Index cols = internal::random<Index>(1,10); in test_bandmatrix() local
70 Index sups = internal::random<Index>(0,cols-1); in test_bandmatrix()
[all …]
|
| /external/eigen/Eigen/src/QR/ |
| D | ColPivHouseholderQR.h | 81 ColPivHouseholderQR(Index rows, Index cols) in ColPivHouseholderQR() argument
82 : m_qr(rows, cols), in ColPivHouseholderQR()
83 m_hCoeffs((std::min)(rows,cols)), in ColPivHouseholderQR()
84 m_colsPermutation(cols), in ColPivHouseholderQR()
85 m_colsTranspositions(cols), in ColPivHouseholderQR()
86 m_temp(cols), in ColPivHouseholderQR()
87 m_colSqNorms(cols), in ColPivHouseholderQR()
92 : m_qr(matrix.rows(), matrix.cols()), in ColPivHouseholderQR()
93 m_hCoeffs((std::min)(matrix.rows(),matrix.cols())), in ColPivHouseholderQR()
94 m_colsPermutation(matrix.cols()), in ColPivHouseholderQR()
[all …]
|
| D | HouseholderQR.h | 76 HouseholderQR(Index rows, Index cols) in HouseholderQR() argument
77 : m_qr(rows, cols), in HouseholderQR()
78 m_hCoeffs((std::min)(rows,cols)), in HouseholderQR()
79 m_temp(cols), in HouseholderQR()
83 : m_qr(matrix.rows(), matrix.cols()), in HouseholderQR()
84 m_hCoeffs((std::min)(matrix.rows(),matrix.cols())), in HouseholderQR()
85 m_temp(matrix.cols()), in HouseholderQR()
163 inline Index cols() const { return m_qr.cols(); } in cols() function
177 …eigen_assert(m_qr.rows() == m_qr.cols() && "You can't take the determinant of a non-square matrix!… in absDeterminant()
185 …eigen_assert(m_qr.rows() == m_qr.cols() && "You can't take the determinant of a non-square matrix!… in logAbsDeterminant()
[all …]
|
| D | FullPivHouseholderQR.h | 93 FullPivHouseholderQR(Index rows, Index cols)
94 : m_qr(rows, cols),
95 m_hCoeffs((std::min)(rows,cols)),
97 m_cols_transpositions(cols),
98 m_cols_permutation(cols),
99 m_temp((std::min)(rows,cols)),
104 : m_qr(matrix.rows(), matrix.cols()),
105 m_hCoeffs((std::min)(matrix.rows(), matrix.cols())),
107 m_cols_transpositions(matrix.cols()),
108 m_cols_permutation(matrix.cols()),
[all …]
|
| /external/eigen/bench/ |
| D | sparse_product.cpp | 101 int cols = SIZE; in main() local
104 EigenSparseMatrix sm1(rows,cols), sm2(rows,cols), sm3(rows,cols), sm4(rows,cols); in main()
111 fillMatrix2(nnzPerCol, rows, cols, sm1); in main()
112 fillMatrix2(nnzPerCol, rows, cols, sm2); in main()
119 DenseMatrix m1(rows,cols), m2(rows,cols), m3(rows,cols); in main()
155 …std::cout << "Eigen sparse\t" << sm1.nonZeros()/(float(sm1.rows())*float(sm1.cols()))*100 << "% * " in main()
156 << sm2.nonZeros()/(float(sm2.rows())*float(sm2.cols()))*100 << "%\n"; in main()
254 UBlasSparse m1(rows,cols), m2(rows,cols), m3(rows,cols); in main()
267 GmmDynSparse gmmT3(rows,cols); in main()
268 GmmSparse m1(rows,cols), m2(rows,cols), m3(rows,cols); in main()
[all …]
|
| D | sparse_transpose.cpp | 39 int cols = SIZE; in main() local
42 EigenSparseMatrix sm1(rows,cols), sm3(rows,cols); in main()
47 fillMatrix(density, rows, cols, sm1); in main()
52 DenseMatrix m1(rows,cols), m3(rows,cols); in main()
59 std::cout << "Non zeros: " << sm1.nonZeros()/float(sm1.rows()*sm1.cols())*100 << "%\n"; in main()
81 GmmDynSparse gmmT3(rows,cols); in main()
82 GmmSparse m1(rows,cols), m3(rows,cols); in main()
92 MtlSparse m1(rows,cols), m3(rows,cols); in main()
|
| D | spmv.cpp | 41 int cols = size; in main() local
55 cols = atoi(argv[i]+1); in main()
80 …std::cout << "SpMV " << rows << " x " << cols << " with " << nnzPerCol << " non zeros per column. … in main()
82 EigenSparseMatrix sm(rows,cols); in main()
83 DenseVector dv(cols), res(rows); in main()
91 fillMatrix2(nnzPerCol, rows, cols, sm); in main()
96 DenseMatrix dm(rows,cols), (rows,cols); in main()
137 om = oski_CreateMatCSC(sm._outerIndexPtr(), sm._innerIndexPtr(), sm._valuePtr(), rows, cols, in main()
139 ov = oski_CreateVecView(dv.data(), cols, STRIDE_UNIT); in main()
173 UblasMatrix um(rows,cols); in main()
[all …]
|
| D | sparse_trisolver.cpp | 40 void fillMatrix(float density, int rows, int cols, EigenSparseTriMatrix& dst) in fillMatrix() argument
42 dst.startFill(rows*cols*density); in fillMatrix()
43 for(int j = 0; j < cols; j++) in fillMatrix()
59 int cols = SIZE; in main() local
63 EigenSparseTriMatrix sm1(rows,cols); in main()
65 DenseVector b = DenseVector::Random(cols); in main()
66 DenseVector x = DenseVector::Random(cols); in main()
72 EigenSparseTriMatrix sm1(rows, cols); in main()
73 fillMatrix(density, rows, cols, sm1); in main()
81 DenseMatrix m1(rows,cols); in main()
[all …]
|
| D | sparse_dense_product.cpp | 55 int cols = SIZE; in main() local
58 EigenSparseMatrix sm1(rows,cols); in main()
59 DenseVector v1(cols), v2(cols); in main()
66 fillMatrix2(7, rows, cols, sm1); in main()
72 DenseMatrix m1(rows,cols); in main()
93 std::cout << "Eigen sparse\t" << sm1.nonZeros()/float(sm1.rows()*sm1.cols())*100 << "%\n"; in main()
120 GmmSparse m1(rows,cols); in main()
123 std::vector<Scalar> gmmV1(cols), gmmV2(cols); in main()
124 Map<Matrix<Scalar,Dynamic,1> >(&gmmV1[0], cols) = v1; in main()
125 Map<Matrix<Scalar,Dynamic,1> >(&gmmV2[0], cols) = v2; in main()
[all …]
|
| /external/valgrind/main/drd/tests/ |
| D | omp_matinv.c | 44 static elem_t* new_matrix(const int rows, const int cols) in new_matrix() argument
47 assert(cols > 0); in new_matrix()
48 return malloc(rows * cols * sizeof(elem_t)); in new_matrix()
58 static void init_matrix(elem_t* const a, const int rows, const int cols) in init_matrix() argument
65 a[i * cols + j] = 1.0 / (1 + abs(i-j)); in init_matrix()
72 const elem_t* const a, const int rows, const int cols) in print_matrix() argument
78 for (j = 0; j < cols; j++) in print_matrix()
80 printf("%g ", a[i * cols + j]); in print_matrix()
158 static void gj(elem_t* const a, const int rows, const int cols) in gj() argument
169 if (a[k * cols + i] > a[j * cols + i]) in gj()
[all …]
|
| D | matinv.c | 36 int cols; member
56 static elem_t* new_matrix(const int rows, const int cols) in new_matrix() argument
59 assert(cols > 0); in new_matrix()
60 return malloc(rows * cols * sizeof(elem_t)); in new_matrix()
70 static void init_matrix(elem_t* const a, const int rows, const int cols) in init_matrix() argument
77 a[i * cols + j] = 1.0 / (1 + abs(i-j)); in init_matrix()
84 const elem_t* const a, const int rows, const int cols) in print_matrix() argument
90 for (j = 0; j < cols; j++) in print_matrix()
92 printf("%g ", a[i * cols + j]); in print_matrix()
175 const int cols = p->cols; in gj_threadfunc() local
[all …]
|
| /external/eigen/Eigen/src/LU/ |
| D | FullPivLU.h | 79 FullPivLU(Index rows, Index cols);
313 return cols() - rank(); in dimensionOfKernel()
326 return rank() == cols(); in isInjective()
351 return isInjective() && (m_lu.rows() == m_lu.cols()); in isInvertible()
364 … eigen_assert(m_lu.rows() == m_lu.cols() && "You can't take the inverse of a non-square matrix!"); in inverse()
366 (*this, MatrixType::Identity(m_lu.rows(), m_lu.cols())); in inverse()
372 inline Index cols() const { return m_lu.cols(); } in cols() function
392 FullPivLU<MatrixType>::FullPivLU(Index rows, Index cols) in FullPivLU() argument
393 : m_lu(rows, cols), in FullPivLU()
395 m_q(cols), in FullPivLU()
[all …]
|
| /external/eigen/test/eigen2/ |
| D | eigen2_array.cpp | 24 int cols = m.cols(); in array() local
26 MatrixType m1 = MatrixType::Random(rows, cols), in array()
27 m2 = MatrixType::Random(rows, cols), in array()
28 m3(rows, cols); in array()
35 VERIFY_IS_APPROX(m1.cwise() + s1, MatrixType::Constant(rows,cols,s1) + m1); in array()
36 VERIFY_IS_APPROX((m1*Scalar(2)).cwise() - s2, (m1+m1) - MatrixType::Constant(rows,cols,s2) ); in array()
59 int cols = m.cols(); in comparisons() local
62 c = ei_random<int>(0, cols-1); in comparisons()
64 MatrixType m1 = MatrixType::Random(rows, cols), in comparisons()
65 m2 = MatrixType::Random(rows, cols), in comparisons()
[all …]
|
| D | eigen2_sparse_solvers.cpp | 17 Matrix<Scalar,Dynamic,Dynamic> aux(refMat.rows(),refMat.cols()); in initSPD()
26 for (int j=0 ; j<sparseMat.cols(); ++j) in initSPD()
33 template<typename Scalar> void sparse_solvers(int rows, int cols) in sparse_solvers() argument
35 double density = std::max(8./(rows*cols), 0.01); in sparse_solvers()
48 SparseMatrix<Scalar> m2(rows, cols); in sparse_solvers()
49 DenseMatrix refMat2 = DenseMatrix::Zero(rows, cols); in sparse_solvers()
75 SparseMatrix<Scalar> m2(rows, cols); in sparse_solvers()
76 DenseMatrix refMat2(rows, cols); in sparse_solvers()
78 DenseVector b = DenseVector::Random(cols); in sparse_solvers()
79 DenseVector refX(cols), x(cols); in sparse_solvers()
[all …]
|
| D | product.h | 37 int cols = m.cols(); in product() local
41 MatrixType m1 = MatrixType::Random(rows, cols), in product()
42 m2 = MatrixType::Random(rows, cols), in product()
43 m3(rows, cols), in product()
44 mzero = MatrixType::Zero(rows, cols); in product()
50 square2 = ColSquareMatrixType::Random(cols, cols), in product()
51 res2 = ColSquareMatrixType::Random(cols, cols); in product()
55 ColVectorType vc2 = ColVectorType::Random(cols), vcres(cols); in product()
61 c = ei_random<int>(0, cols-1); in product()
87 VERIFY_IS_APPROX(MatrixType::Identity(rows, cols)(r,c), static_cast<Scalar>(r==c)); in product()
[all …]
|
| /external/wpa_supplicant_6/wpa_supplicant/wpa_gui/ |
| D | scanresults.ui.h | 60 QStringList cols = QStringList::split(QChar('\t'), *it, true); in updateResults() local
62 bssid = cols.count() > 0 ? cols[0] : ""; in updateResults()
63 freq = cols.count() > 1 ? cols[1] : ""; in updateResults()
64 signal = cols.count() > 2 ? cols[2] : ""; in updateResults()
65 flags = cols.count() > 3 ? cols[3] : ""; in updateResults()
66 ssid = cols.count() > 4 ? cols[4] : ""; in updateResults()
|