| /external/eigen/test/ |
| block.cpp | 43 Index rows = m.rows(); local
46 MatrixType m1 = MatrixType::Random(rows, cols),
48 m2 = MatrixType::Random(rows, cols),
49 m3(rows, cols),
50 ones = MatrixType::Ones(rows, cols);
51 VectorType v1 = VectorType::Random(rows);
55 Index r1 = internal::random<Index>(0,rows-1);
56 Index r2 = internal::random<Index>(r1,rows-1);
82 VectorType bc1(m1.block(0,c1,rows,1))
183 Index rows = m.rows(); local
217 Index rows = m.rows(); local
[all...] |
| /external/icu/icu4c/source/common/ |
| propsvec.c | 32 int32_t rows; member in struct:UPropsVectors
68 pv->rows=2+(UPVEC_MAX_CP-UPVEC_FIRST_SPECIAL_CP);
70 /* set the all-Unicode row and the special-value rows */
72 uprv_memset(row, 0, pv->rows*columns*4);
98 limit=pv->rows;
184 /* find the rows whose ranges overlap with the input range */
186 /* find the first and last rows, always successful */
191 * Rows need to be split if they partially overlap with the
192 * input range (only possible for the first and last rows)
198 /* split first/last rows if necessary *
200 int32_t count, rows; local
336 int32_t i, columns, valueColumns, rows, count; local
[all...] |
| /external/chromium_org/third_party/sqlite/src/test/ |
| analyze6.test | 64 } {0 0 1 {SCAN TABLE cat (~16 rows)} 0 1 0 {SEARCH TABLE ev USING COVERING INDEX evy (y=?) (~32 rows)}}
71 } {0 0 0 {SCAN TABLE cat (~16 rows)} 0 1 1 {SEARCH TABLE ev USING COVERING INDEX evy (y=?) (~32 rows)}}
85 } {0 0 0 {SEARCH TABLE t201 USING INDEX t201z (z=?) (~10 rows)}}
88 } {0 0 0 {SEARCH TABLE t201 USING INDEX sqlite_autoindex_t201_1 (y=?) (~1 rows)}}
91 } {0 0 0 {SEARCH TABLE t201 USING INTEGER PRIMARY KEY (rowid=?) (~1 rows)}}
98 } {0 0 0 {SEARCH TABLE t201 USING INDEX t201z (z=?) (~10 rows)}}
101 } {0 0 0 {SEARCH TABLE t201 USING INDEX sqlite_autoindex_t201_1 (y=?) (~1 rows)}}
104 } {0 0 0 {SEARCH TABLE t201 USING INTEGER PRIMARY KEY (rowid=?) (~1 rows)}}
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_lu.cpp | 17 for(int a = 0; a < 3*(m.rows()+m.cols()); a++)
20 int i = Eigen::ei_random<int>(0,m.rows()-1); // i is a random row number
23 j = Eigen::ei_random<int>(0,m.rows()-1);
41 int rows = ei_random<int>(20,200), cols = ei_random<int>(20,200), cols2 = ei_random<int>(20,200); local
42 int rank = ei_random<int>(1, std::min(rows, cols)-1);
44 MatrixType m1(rows, cols), m2(cols, cols2), m3(rows, cols2), k(1,1);
45 m1 = MatrixType::Random(rows,cols);
46 if(rows <= cols)
47 for(int i = rank; i < rows; i++) m1.row(i).setZero()
[all...] |
| eigen2_sparse_solvers.cpp | 17 Matrix<Scalar,Dynamic,Dynamic> aux(refMat.rows(),refMat.cols());
27 for (int i=j ; i<sparseMat.rows(); ++i)
33 template<typename Scalar> void sparse_solvers(int rows, int cols)
35 double density = std::max(8./(rows*cols), 0.01);
40 DenseVector vec1 = DenseVector::Random(rows);
48 SparseMatrix<Scalar> m2(rows, cols);
49 DenseMatrix refMat2 = DenseMatrix::Zero(rows, cols);
75 SparseMatrix<Scalar> m2(rows, cols);
76 DenseMatrix refMat2(rows, cols);
116 SparseMatrix<Scalar> m2(rows, cols)
[all...] |
| /frameworks/base/core/tests/coretests/src/android/database/sqlite/ |
| SQLiteCursorTest.java | 81 Set<Integer> rows = new HashSet<Integer>(); local
86 rows.add(j); // store in a hashtable so we can verify the results from cursor later on
90 assertEquals(N, rows.size());
102 assertTrue(rows.contains(val));
103 assertTrue(rows.remove(val));
105 // did I see all the rows in the table?
106 assertTrue(rows.isEmpty());
109 rows = new HashSet<Integer>();
113 rows.add(j);
122 assertEquals(M, rows.size())
[all...] |
| /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/keyboard/layout/expected/ |
| AbstractKeyboardBuilder.java | 24 * A keyboard consists of an array of rows, and a row consists of an array of elements. Each row
31 // A building array of rows.
50 * elements of <code>rows</rows>.
51 * @param rows the template keyboard rows. The elements of the <code>rows</code> will be
54 AbstractKeyboardBuilder(final E[][] rows) {
55 mRows = newArrayOfArray(rows.length);
56 for (int rowIndex = 0; rowIndex < rows.length; rowIndex++)
[all...] |
| /cts/tests/tests/provider/src/android/provider/cts/ |
| Settings_SystemTest.java | 64 * rows: an int, a long, a float, a String, and a ShowGTalkServiceStatus.
65 * Get these six rows to check whether insert succeeded and then delete them.
67 // Precondition: these rows must not exist in the db when we begin
70 // first query exist rows
79 // insert 5 rows, and update 1 rows
91 // get these rows to assert
99 // delete the tested rows again
|
| /external/ceres-solver/include/ceres/ |
| crs_matrix.h | 49 // rows, cols and values.
51 // rows is a num_rows + 1 sized array that points into the cols and
54 // cols[rows[i]] ... cols[rows[i + 1] - 1] are the indices of the
57 // values[rows[i]] .. values[rows[i + 1] - 1] are the values of the
73 // rows = [ 0, 2, 5, 7]
78 vector<int> rows; member in struct:ceres::CRSMatrix
|
| /external/eigen/Eigen/src/Core/products/ |
| Parallelizer.h | 86 void parallelize_gemm(const Functor& func, Index rows, Index cols, bool transpose)
96 func(0,rows, 0,cols);
108 return func(0,rows, 0,cols);
110 Index size = transpose ? cols : rows;
120 return func(0,rows, 0,cols);
126 std::swap(rows,cols);
129 Index blockRows = (rows / threads) & ~Index(0x7);
137 Index actualBlockRows = (i+1==threads) ? rows-r0 : blockRows;
|
| /external/libvpx/libvpx/vp9/common/ |
| vp9_tile_common.h | 26 // 'cm->log2_tile_(rows|cols)' & 'cm->mi_(rows|cols)'
|
| /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:
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/ |
| vp9_tile_common.h | 26 // 'cm->log2_tile_(rows|cols)' & 'cm->mi_(rows|cols)'
|
| /external/chromium_org/media/base/ |
| video_util.cc | 34 void CopyPlane(size_t plane, const uint8* source, int stride, int rows,
43 int rows_to_copy = std::min(frame->rows(plane), rows);
53 void CopyYPlane(const uint8* source, int stride, int rows, VideoFrame* frame) {
54 CopyPlane(VideoFrame::kYPlane, source, stride, rows, frame);
57 void CopyUPlane(const uint8* source, int stride, int rows, VideoFrame* frame) {
58 CopyPlane(VideoFrame::kUPlane, source, stride, rows, frame);
61 void CopyVPlane(const uint8* source, int stride, int rows, VideoFrame* frame) {
62 CopyPlane(VideoFrame::kVPlane, source, stride, rows, frame);
65 void CopyAPlane(const uint8* source, int stride, int rows, VideoFrame* frame)
118 const int rows = frame->rows(plane); local
[all...] |
| /external/ceres-solver/internal/ceres/ |
| compressed_col_sparse_matrix_utils_test.cc | 91 int* rows,
106 rows[offset] = row_pos + r;
134 int* rows = tsm.mutable_rows(); local
142 rows + offset, cols + offset);
200 rows.resize(7);
204 rows[0] = 0;
208 rows[1] = 1;
212 rows[2] = 1;
214 rows[3] = 2;
218 rows[4] = 0
229 vector<int> rows; member in class:ceres::internal::SolveUpperTriangularTest
[all...] |
| visibility_test.cc | 65 bs.rows.push_back(CompressedRow());
66 CompressedRow& row = bs.rows.back();
75 bs.rows.push_back(CompressedRow());
76 CompressedRow& row = bs.rows.back();
85 bs.rows.push_back(CompressedRow());
86 CompressedRow& row = bs.rows.back();
95 bs.rows.push_back(CompressedRow());
96 CompressedRow& row = bs.rows.back();
145 bs.rows.push_back(CompressedRow());
146 CompressedRow& row = bs.rows.back()
[all...] |
| /external/chromium_org/third_party/WebKit/ManualTests/ |
| input-type-file-autocomplete-refresh.html | 5 <frameset rows="50%,50%">
|
| /external/chromium_org/third_party/WebKit/ManualTests/resources/ |
| textarea-form-back-on-submit.html | 8 <textarea name="text" rows="3" cols="10" id="textarea">123</textarea><br />
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/Layout/ |
| floats_100_100.html | 4 <title>Floats layout performance tester with 2 columns and 100 rows</title>
|
| floats_100_100_nested.html | 4 <title>Floats layout performance tester with 2 columns and 100 rows</title>
|
| floats_10_1000.html | 4 <title>Layout performance tester with 1000 rows containing 10 floats and a normal flow div.</title>
|
| floats_20_100.html | 4 <title>Floats layout performance tester with 2 columns and 100 rows</title>
|
| floats_20_100_nested.html | 4 <title>Floats layout performance tester with 2 columns and 100 rows</title>
|
| floats_2_100.html | 4 <title>Floats layout performance tester with 2 columns and 100 rows</title>
|
| floats_2_100_nested.html | 4 <title>Floats layout performance tester with 2 columns and 100 rows</title>
|
