| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Math.h | 169 Matrix(unsigned Rows, unsigned Cols) :
170 Rows(Rows), Cols(Cols), Data(new PBQPNum[Rows * Cols]) {
175 Matrix(unsigned Rows, unsigned Cols, PBQPNum InitVal)
176 : Rows(Rows), Cols(Cols), Data(new PBQPNum[Rows * Cols]) {
177 std::fill(Data, Data + (Rows * Cols), InitVal);
182 : Rows(M.Rows), Cols(M.Cols), Data(new PBQPNum[Rows * Cols])
[all...] |
| /external/eigen/test/ |
| dense_storage.cpp | 14 template <typename T, int Rows, int Cols>
17 static const int Size = ((Rows==Dynamic || Cols==Dynamic) ? Dynamic : Rows*Cols);
18 typedef DenseStorage<T,Size, Rows,Cols, 0> DenseStorageType;
20 const int rows = (Rows==Dynamic) ? 4 : Rows; local
22 const int size = rows*cols;
23 DenseStorageType reference(size, rows, cols);
34 template <typename T, int Rows, int Cols
40 const int rows = (Rows==Dynamic) ? 4 : Rows; local
[all...] |
| product_small.cpp | 36 for(Index i=0;i<C.rows();++i)
43 template<typename T, int Rows, int Cols, int Depth, int OC, int OA, int OB>
44 typename internal::enable_if<! ( (Rows ==1&&Depth!=1&&OA==ColMajor)
45 || (Depth==1&&Rows !=1&&OA==RowMajor)
48 || (Rows ==1&&Cols !=1&&OC==ColMajor)
49 || (Cols ==1&&Rows !=1&&OC==RowMajor)),void>::type
50 test_lazy_single(int rows, int cols, int depth)
52 Matrix<T,Rows,Depth,OA> A(rows,depth); A.setRandom();
54 Matrix<T,Rows,Cols,OC> C(rows,cols); C.setRandom()
86 int rows = internal::random<int>(1,12); local
115 int rows = internal::random<int>(1,12); local
151 int rows = internal::random<int>(1,12); local
[all...] |
| qr_colpivoting.cpp | 19 Index rows = internal::random<Index>(2, EIGEN_TEST_MAX_SIZE); local
22 Index rank = internal::random<Index>(1, (std::min)(rows, cols) - 1);
29 createRandomPIMatrixOfRank(rank, rows, cols, matrix);
44 t.setZero(rows, cols);
68 Rows = MatrixType::RowsAtCompileTime,
72 int rank = internal::random<int>(1, (std::min)(int(Rows), int(Cols)) - 1);
73 Matrix<Scalar, Rows, Cols> matrix;
74 createRandomPIMatrixOfRank(rank, Rows, Cols, matrix);
75 CompleteOrthogonalDecomposition<Matrix<Scalar, Rows, Cols> > cod(matrix);
78 VERIFY(cod.isInjective() == (rank == Rows));
99 Index rows = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE), cols = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE), cols2 = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE); local
218 Index rows = 300, cols = rows; local
[all...] |
| permutationmatrices.cpp | 19 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime,
21 typedef PermutationMatrix<Rows> LeftPermutationType;
22 typedef Matrix<int, Rows, 1> LeftPermutationVectorType;
28 Index rows = m.rows(); local
31 MatrixType m_original = MatrixType::Random(rows,cols);
33 randomPermutationVector(lv, rows);
38 MatrixType m_permuted = MatrixType::Random(rows,cols);
42 for (int i=0; i<rows; i++)
46 Matrix<Scalar,Rows,Rows> lm(lp)
[all...] |
| qr.cpp | 17 Index rows = m.rows(); local
23 MatrixType a = MatrixType::Random(rows,cols);
35 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
37 Matrix<Scalar,Rows,Cols> m1 = Matrix<Scalar,Rows,Cols>::Random();
38 HouseholderQR<Matrix<Scalar,Rows,Cols> > qr(m1);
40 Matrix<Scalar,Rows,Cols> r = qr.matrixQR();
42 for(int i = 0; i < Rows; i++) for(int j = 0; j < Cols; j++) if(i>j) r(i,j) = Scalar(0);
47 Matrix<Scalar,Rows,Cols2> m3 = m1*m2
[all...] |
| /external/deqp/framework/common/ |
| tcuMatrix.hpp | 34 template <typename T, int Rows, int Cols>
38 typedef Vector<T, Rows> Element;
44 ROWS = Rows,
50 explicit Matrix (const T src[Rows*Cols]);
51 Matrix (const Vector<T, Rows>& src);
52 Matrix (const Matrix<T, Rows, Cols>& src);
55 Matrix<T, Rows, Cols>& operator= (const Matrix<T, Rows, Cols>& src);
56 Matrix<T, Rows, Cols>& operator*= (const Matrix<T, Rows, Cols>& src)
[all...] |
| tcuMatrixUtil.hpp | 36 template <typename T, int Rows, int Cols>
37 Matrix<T, Cols, Rows> transpose (const Matrix<T, Rows, Cols>& mat);
60 template <typename T, int Rows, int Cols>
61 inline Matrix<T, Cols, Rows> transpose (const Matrix<T, Rows, Cols>& mat)
63 Matrix<T, Cols, Rows> res;
64 for (int row = 0; row < Rows; row++)
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/PBQP/ |
| Math.h | 128 Matrix(unsigned Rows, unsigned Cols) :
129 Rows(Rows), Cols(Cols), Data(llvm::make_unique<PBQPNum []>(Rows * Cols)) {
134 Matrix(unsigned Rows, unsigned Cols, PBQPNum InitVal)
135 : Rows(Rows), Cols(Cols),
136 Data(llvm::make_unique<PBQPNum []>(Rows * Cols)) {
137 std::fill(Data.get(), Data.get() + (Rows * Cols), InitVal);
142 : Rows(M.Rows), Cols(M.Cols)
[all...] |
| /external/clang/tools/scan-build-py/libscanbuild/resources/ |
| selectable.js | 3 var Rows = document.getElementsByTagName("tr");
4 for ( var i = 0 ; i < Rows.length; ++i ) {
5 if (Rows[i].className == RowClass) {
6 Rows[i].style.display = DisplayVal;
|
| /external/gemmlowp/internal/ |
| simd_wrappers.h | 151 static constexpr int Rows = ResultBlockType::kRows;
158 static_assert(LhsRows == Rows || LhsRows == 1, "");
159 static_assert(RhsRows == Rows || RhsRows == 1, "");
172 for (int r = 0; r < Rows; r++) {
173 const int lhs_r = LhsRows == Rows ? r : 0;
174 const int rhs_r = RhsRows == Rows ? r : 0;
175 result.buf.reg[r + c * Rows] =
200 static constexpr int Rows = ResultBlockType::kRows;
213 static_assert(LhsRows == Rows || LhsRows == 1, "");
214 static_assert(RhsRows == Rows || RhsRows == 1, "")
[all...] |
| simd_wrappers_common_neon_sse.h | 489 template <int Rows>
490 struct BroadcastMulAddImpl<RegBlockInt32<Rows, 1>, RegBlockInt32<1, 1>,
491 RegBlockInt32<Rows, 1>> {
492 static void Run(const RegBlockInt32<Rows, 1>& lhs,
493 const RegBlockInt32<1, 1>& rhs, RegBlockInt32<Rows, 1>* acc) {
495 for (int i = 0; i < RegBlockInt32<Rows, 1>::kRegisterCount; i++) {
502 template <int Rows, int Cols>
503 struct BroadcastMulAddImpl<RegBlockInt32<Rows, 1>, RegBlockInt32<1, 1>,
504 RegBlockInt32<Rows, Cols>> {
505 static void Run(const RegBlockInt32<Rows, 1>& lhs
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/DebugInfo/DWARF/ |
| DWARFUnitIndex.cpp | 43 Rows.reset();
58 Rows = llvm::make_unique<Entry[]>(Header.NumBuckets);
65 Rows[i].Signature = IndexData.getU64(&Offset);
72 Rows[i].Index = this;
73 Rows[i].Contributions =
75 Contribs[Index - 1] = Rows[i].Contributions.get();
138 auto &Row = Rows[i];
168 if (const auto &Contribs = Rows[i].Contributions) {
172 return &Rows[i];
182 while (Rows[H].getSignature() != S && Rows[H].getSignature() != 0
[all...] |
| /external/pdfium/testing/libfuzzer/ |
| pdf_codec_fax_fuzzer.cc | 24 int Rows = GetInteger(data + 16);
34 ByteAlign, BlackIs1, Columns, Rows));
|
| /external/pdfium/core/fxcodec/codec/ |
| ccodec_faxmodule.h | 28 int Rows);
|
| /external/webrtc/webrtc/modules/desktop_capture/ |
| desktop_region.cc | 50 for (Rows::iterator it = rows_.begin(); it != rows_.end(); ++it) {
59 // Iterate over rows of the tow regions and compare each row.
60 Rows::const_iterator it1 = rows_.begin();
61 Rows::const_iterator it2 = region.rows_.begin();
77 for (Rows::iterator row = rows_.begin(); row != rows_.end(); ++row) {
93 // we iterate over the rows until it reaches |rect.bottom()|.
96 // Iterate over all rows that may intersect with |rect| and add new rows when
98 Rows::iterator row = rows_.upper_bound(top);
107 row, Rows::value_type(bottom, new Row(top, bottom)))
[all...] |
| desktop_region.h | 25 // Internally each region is stored as a set of rows where each row contains one
59 // Type used to store list of rows in the region. The bottom position of row
60 // is used as the key so that rows are always ordered by their position. The
62 typedef std::map<int, Row*> Rows;
81 // |row_span_| matches spans on consecutive rows then they are also merged
85 Rows::const_iterator row_;
86 Rows::const_iterator previous_row_;
157 // the region). If the rows were merged |row| remains a valid iterator to the
159 void MergeWithPrecedingRow(Rows::iterator row);
161 Rows rows_
[all...] |
| /external/dng_sdk/source/ |
| dng_matrix.cpp | 34 dng_matrix::dng_matrix (uint32 rows,
42 if (rows < 1 || rows > kMaxColorPlanes ||
50 fRows = rows;
113 if (Rows () != m.Rows () ||
121 for (uint32 j = 0; j < Rows (); j++)
148 if (Rows () != Cols ())
153 for (uint32 j = 0; j < Rows (); j++)
187 for (uint32 j = 0; j < Rows (); j++
[all...] |
| dng_camera_profile.cpp | 298 fColorMatrix1.Rows () > 1;
308 fColorMatrix2.Rows () == fColorMatrix1.Rows ();
415 uint32 colorChannels = ColorMatrix1 ().Rows ();
421 if (fForwardMatrix1.Rows () == fColorMatrix1.Cols () &&
422 fForwardMatrix1.Cols () == fColorMatrix1.Rows ())
429 if (colorChannels > 3 && fReductionMatrix1.Rows () *
444 if (fForwardMatrix2.Rows () == fColorMatrix2.Cols () &&
445 fForwardMatrix2.Cols () == fColorMatrix2.Rows ())
452 if (colorChannels > 3 && fReductionMatrix2.Rows () *
[all...] |
| /external/llvm/lib/DebugInfo/DWARF/ |
| DWARFUnitIndex.cpp | 39 Rows.reset();
54 Rows = llvm::make_unique<Entry[]>(Header.NumBuckets);
61 Rows[i].Signature = IndexData.getU64(&Offset);
68 Rows[i].Index = this;
69 Rows[i].Contributions =
71 Contribs[Index - 1] = Rows[i].Contributions.get();
134 auto &Row = Rows[i];
163 if (const auto &Contribs = Rows[i].Contributions)
165 return &Rows[i];
|
| /external/llvm/include/llvm/DebugInfo/DWARF/ |
| DWARFUnitIndex.h | 72 std::unique_ptr<Entry[]> Rows;
87 return makeArrayRef(Rows.get(), Header.NumBuckets);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/DebugInfo/DWARF/ |
| DWARFUnitIndex.h | 76 std::unique_ptr<Entry[]> Rows;
99 return makeArrayRef(Rows.get(), Header.NumBuckets);
|
| /development/tools/repo_diff/service/repodiff/repositories/ |
| denormalizer_test.go | 50 assert.Equal(t, 0, getRowCountAtTable(tableName), "Rows should start empty")
58 assert.Equal(t, len(fixtures), getRowCountAtTable(tableName), "Rows should be inserted")
95 assert.Equal(t, len(fixtures), getRowCountAtTable(tableName), "Rows should be inserted")
139 assert.Equal(t, 3, getRowCountAtTable("project_commit"), "Rows should be inserted")
152 assert.Equal(t, 3, getRowCountAtTable("denormalized_view_recent_commit"), "Rows should be inserted")
157 assert.Equal(t, 2, getRowCountAtTable(tableName), "Rows should be inserted")
200 assert.Equal(t, 3, getRowCountAtTable("project_commit"), "Rows should be inserted")
213 assert.Equal(t, 3, getRowCountAtTable("denormalized_view_recent_commit"), "Rows should be inserted")
218 assert.Equal(t, 2, getRowCountAtTable(tableName), "Rows should be inserted")
|
| /external/swiftshader/third_party/LLVM/lib/DebugInfo/ |
| DWARFDebugLine.h | 130 void appendRow(const DWARFDebugLine::Row &state) { Rows.push_back(state); }
133 Rows.clear();
140 std::vector<Row> Rows;
172 /// Parse a single line table (prologue and all rows).
|
| /external/deqp/modules/glshared/ |
| glsBuiltinPrecisionTests.cpp | 503 template <typename T, int Rows, int Cols>
504 struct Traits<Matrix<T, Rows, Cols> > :
505 ContainerTraits<Matrix<T, Rows, Cols>, Matrix<typename Traits<T>::IVal, Rows, Cols> >
933 template <typename T, int Rows, int Cols>
934 class ExprP<Matrix<T, Rows, Cols> > : public ContainerExprPBase<Matrix<T, Rows, Cols> > {};
1007 template<int Rows, int Cols>
1008 ExprP<Vector<float, Rows> > operator* (const ExprP<Vector<float, Cols> >& left,
1009 const ExprP<Matrix<float, Rows, Cols> >& right)
[all...] |
