| /external/chromium_org/chrome/common/extensions/docs/examples/extensions/benchmark/util/ |
| sorttable.js | 21 -To avoid including the non-data rows (e.g., radio buttions) into sorting,
53 the.appendChild(table.rows[0]);
59 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
61 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
62 // "total" rows, for example). This is B&R, since what you're supposed
63 // to do is put them in a tfoot. So, if there are sortbottom rows,
66 for (var i=0; i<table.rows.length; i++) {
67 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
68 sortbottomrows[sortbottomrows.length] = table.rows[i]
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderFrameSet.cpp | 132 size_t rows = m_rows.m_sizes.size(); local
137 for (size_t r = 0; r < rows; r++) {
195 // Count the total length of all of the fixed columns/rows -> totalFixed
196 // Count the number of columns/rows which are fixed -> countFixed
203 // Count the total percentage of all of the percentage columns/rows -> totalPercent
204 // Count the number of columns/rows which are percentages -> countPercent
211 // Count the total relative of all the relative columns/rows -> totalRelative
212 // Count the number of columns/rows which are relative -> countRelative
221 // Fixed columns/rows are our first priority. If there is not enough space to fit all fixed
222 // columns/rows we need to proportionally adjust their size
424 int rows = frameSet()->totalRows(); local
459 unsigned rows = frameSet()->totalRows(); local
504 int rows = frameSet()->totalRows(); local
[all...] |
| /external/eigen/Eigen/src/Core/ |
| TriangularMatrix.h | 49 inline Index rows() const { return derived().rows(); } function in class:Eigen::TriangularBase
88 DenseMatrixType res(rows(), cols());
99 eigen_assert(col>=0 && col<cols() && row>=0 && row<rows());
195 inline Index rows() const { return m_matrix.rows(); } function in class:Eigen::TriangularView
213 { return *this = MatrixType::Constant(rows(), cols(), value); }
482 Index maxi = (std::min)(j, dst.rows()-1);
486 for(Index i = maxi+1; i < dst.rows(); ++i)
500 for(Index i = j; i < dst.rows(); ++i
[all...] |
| MapBase.h | 61 using Base::rows;
79 inline Index rows() const { return m_rows.value(); } function in class:Eigen::MapBase
143 inline MapBase(PointerType data, Index rows, Index cols)
144 : m_data(data), m_rows(rows), m_cols(cols)
147 || ( rows >= 0 && (RowsAtCompileTime == Dynamic || RowsAtCompileTime == rows)
181 using Base::rows;
229 inline MapBase(PointerType data, Index rows, Index cols) : Base(data, rows, cols) {}
|
| Array.h | 151 /** constructs an uninitialized matrix with \a rows rows and \a cols columns.
156 Array(Index rows, Index cols);
186 : Base(other.rows() * other.cols(), other.rows(), other.cols())
193 : Base(other.rows() * other.cols(), other.rows(), other.cols())
203 Base::resize(other.rows(), other.cols());
210 : Base(other.derived().rows() * other.derived().cols(), other.derived().rows(), other.derived().cols()
[all...] |
| /external/eigen/debug/gdb/ |
| printers.py | 55 self.rows = val['m_storage']['m_rows']
57 self.rows = int(template_params[1])
81 def __init__ (self, rows, cols, dataPtr, rowMajor):
82 self.rows = rows
101 if self.currentRow >= self.rows:
105 if self.currentRow >= self.rows:
118 elif (self.rows == 1): #if it's a row vector
124 return self._iterator(self.rows, self.cols, self.data, self.rowMajor)
127 return "Eigen::%s<%s,%d,%d,%s> (data ptr: %s)" % (self.variety, self.innerType, self.rows, self.cols, "RowMajor" if self.rowMajor else "ColMajor", self.data
[all...] |
| /packages/apps/Email/emailcommon/src/com/android/emailcommon/provider/ |
| MessageChangeLogTable.java | 12 * This object may actually correspond to multiple rows in the table.
101 * @return A {@link android.database.Cursor} containing all rows, in id order.
128 * Delete all rows for a set of messages. Used to clear no-op changes (i.e. multiple rows for
134 * @return The number of rows deleted from the DB.
151 * @return The number of rows updated.
169 * @return The number of rows updated.
182 * @return The number of rows updated.
190 * Start processing our table and get a {@link Cursor} for the rows to process.
195 * @return A {@link Cursor} with the change log rows we're interested in
[all...] |
| /external/eigen/Eigen/src/Core/products/ |
| GeneralMatrixMatrix.h | 28 Index rows, Index cols, Index depth,
41 ::run(cols,rows,depth,rhs,rhsStride,lhs,lhsStride,res,resStride,alpha,blocking,info);
54 static void run(Index rows, Index cols, Index depth,
68 Index mc = (std::min)(rows,blocking.mc()); // cache block size along the M direction
93 const Index actual_kc = (std::min)(k+kc,depth)-k; // => rows of B', and cols of the A'
128 for(Index i=mc; i<rows; i+=mc)
130 const Index actual_mc = (std::min)(i+mc,rows)-i;
175 for(Index i2=0; i2<rows; i2+=mc)
177 const Index actual_mc = (std::min)(i2+mc,rows)-i2;
217 void operator() (Index row, Index rows, Index col=0, Index cols=-1, GemmParallelInfo<Index>* info=0) cons
[all...] |
| TriangularMatrixMatrix_MKL.h | 102 Index rows = IsLower ? _rows : diagSize; \
110 if (rows != depth) { \
114 if (((nthr==1) && (((std::max)(rows,depth)-diagSize)/(double)diagSize < 0.5))) { \
122 Map<const MatrixLhs, 0, OuterStride<> > lhsMap(_lhs,rows,depth,OuterStride<>(lhsStride)); \
127 rows, cols, depth, aa_tmp.data(), aStride, _rhs, rhsStride, res, resStride, alpha, blocking, 0); \
161 Map<const MatrixLhs, 0, OuterStride<> > lhs(_lhs,rows,depth,OuterStride<>(lhsStride)); \
181 Map<MatrixX##EIGPREFIX, 0, OuterStride<> > res_tmp(res,rows,cols,OuterStride<>(resStride)); \
216 Index rows = _rows; \
241 rows, cols, depth, _lhs, lhsStride, aa_tmp.data(), aStride, res, resStride, alpha, blocking, 0); \
257 m = (MKL_INT)rows; \
[all...] |
| /external/ceres-solver/internal/ceres/ |
| schur_eliminator_impl.h | 86 const int num_row_blocks = bs->rows.size();
104 // matrix should already have been ordered so that all rows
109 const int chunk_block_id = bs->rows[r].cells.front().block_id;
124 const CompressedRow& row = bs->rows[r + chunk.size];
228 const int e_block_id = bs->rows[chunk.start].cells.front().block_id;
293 // For rows with no e_blocks, the schur complement update reduces to
310 const int e_block_id = bs->rows[chunk.start].cells.front().block_id;
328 const CompressedRow& row = bs->rows[chunk.start + j];
336 (b + bs->rows[chunk.start + j].block.position, row.block.size);
378 const int e_block_id = bs->rows[chunk.start].cells.front().block_id
[all...] |
| compressed_col_sparse_matrix_utils.h | 71 const IntegerType* rows,
78 const IntegerType r = rows[idx];
92 const IntegerType* rows,
98 const IntegerType r = rows[idx];
118 const IntegerType* rows,
128 const IntegerType r = rows[idx];
136 SolveUpperTriangularInPlace(num_cols, rows, cols, values, solution);
|
| /external/opencv/cv/src/ |
| cvundistort.cpp | 150 if( !CV_IS_MAT(A) || A->rows != 3 || A->cols != 3 ||
154 if( !CV_IS_MAT(dist_coeffs) || (dist_coeffs->rows != 1 && dist_coeffs->cols != 1) ||
155 (dist_coeffs->rows*dist_coeffs->cols*CV_MAT_CN(dist_coeffs->type) != 4 &&
156 dist_coeffs->rows*dist_coeffs->cols*CV_MAT_CN(dist_coeffs->type) != 5) ||
163 _k = cvMat( dist_coeffs->rows, dist_coeffs->cols,
213 if( !CV_IS_MAT(A) || A->rows != 3 || A->cols != 3 ||
217 if( !CV_IS_MAT(dist_coeffs) || (dist_coeffs->rows != 1 && dist_coeffs->cols != 1) ||
218 (dist_coeffs->rows*dist_coeffs->cols*CV_MAT_CN(dist_coeffs->type) != 4 &&
219 dist_coeffs->rows*dist_coeffs->cols*CV_MAT_CN(dist_coeffs->type) != 5) ||
226 _k = cvMat( dist_coeffs->rows, dist_coeffs->cols
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/style/ |
| GridCoordinate.h | 41 // A span in a single direction (either rows or columns). Note that |initialPositionIndex|
117 // This represents a grid area that spans in both rows' and columns' direction.
122 , rows(0, 0)
128 , rows(r)
134 return columns == o.columns && rows == o.rows;
143 GridSpan rows; member in struct:WebCore::GridCoordinate
|
| /external/chromium_org/third_party/skia/src/gpu/effects/ |
| GrTextureStripAtlas.h | 19 * Maintains a single large texture whose rows store many textures of a small fixed height,
20 * stored in rows across the x-axis such that we can safely wrap/repeat them horizontally.
107 * Grabs the least recently used free row out of the LRU list, returns NULL if no rows are free.
121 * Compare two atlas rows by key, so we can sort/search by key
163 // Total locks on all rows (when this reaches zero, we can unlock our texture)
170 // Array of AtlasRows which store the state of all our rows. Stored in a contiguous array, in
175 // Head and tail for linked list of least-recently-used rows (front = least recently used).
|
| /external/eigen/Eigen/src/SVD/ |
| UpperBidiagonalization.h | 56 : m_householder(matrix.rows(), matrix.cols()),
91 Index rows = matrix.rows(); local
94 eigen_assert(rows >= cols && "UpperBidiagonalization is only for matrices satisfying rows>=cols.");
98 ColVectorType temp(rows);
102 Index remainingRows = rows - k;
|
| /external/eigen/test/ |
| mapstride.cpp | 56 Index rows = _m.rows(), cols = _m.cols(); local
58 MatrixType m = MatrixType::Random(rows,cols);
60 Index arraysize = 2*(rows+4)*(cols+4);
69 Map<MatrixType, Alignment, OuterStride<Dynamic> > map(array, rows, cols, OuterStride<Dynamic>(m.innerSize()+1));
88 map(array, rows, cols, OuterStride<OuterStrideAtCompileTime>(m.innerSize()+4));
101 Map<MatrixType, Alignment, Stride<Dynamic,Dynamic> > map(array, rows, cols, Stride<Dynamic,Dynamic>(2*m.innerSize()+1, 2));
|
| product_notemporary.cpp | 41 Index rows = m.rows(); local
44 ColMajorMatrixType m1 = MatrixType::Random(rows, cols),
45 m2 = MatrixType::Random(rows, cols),
46 m3(rows, cols);
47 RowVectorType rv1 = RowVectorType::Random(rows), rvres(rows);
49 RowMajorMatrixType rm3(rows, cols);
58 r1 = internal::random<Index>(8,rows-r0);
|
| /external/skia/src/gpu/effects/ |
| GrTextureStripAtlas.h | 19 * Maintains a single large texture whose rows store many textures of a small fixed height,
20 * stored in rows across the x-axis such that we can safely wrap/repeat them horizontally.
107 * Grabs the least recently used free row out of the LRU list, returns NULL if no rows are free.
121 * Compare two atlas rows by key, so we can sort/search by key
163 // Total locks on all rows (when this reaches zero, we can unlock our texture)
170 // Array of AtlasRows which store the state of all our rows. Stored in a contiguous array, in
175 // Head and tail for linked list of least-recently-used rows (front = least recently used).
|
| /external/chromium_org/chrome/browser/predictors/ |
| autocomplete_action_predictor_table.cc | 93 void AutocompleteActionPredictorTable::GetAllRows(Rows* row_buffer) {
117 AddAndUpdateRows(Rows(1, row), Rows());
126 AddAndUpdateRows(Rows(), Rows(1, row));
130 const Rows& rows_to_add,
131 const Rows& rows_to_update) {
138 for (Rows::const_iterator it = rows_to_add.begin();
156 for (Rows::const_iterator it = rows_to_update.begin();
|
| /frameworks/base/core/tests/coretests/src/android/widget/ |
| SimpleCursorAdapterTest.java | 68 private ArrayList<ArrayList> createTestList(int rows, int cols) {
72 for (int i = 0; i < rows; i++) {
92 // Now see if we can pull 2 rows from the adapter
103 // The adapter should report zero rows
114 // Now see if we can pull 2 rows from the adapter
117 // now put in a different cursor (5 rows)
122 // Now see if we can pull 5 rows from the adapter
133 // Now see if we can pull 2 rows from the adapter
139 // The adapter should report zero rows
|
| /external/chromium_org/chrome/browser/history/android/ |
| android_urls_database.h | 41 // Deletes the rows whose url_id is in |url_ids|. Returns true if all
45 // Deletes all the rows whose url_id doesn't exist in urls table. Returns true
55 // Clears all the rows in android_urls table, returns true on success, false
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_linear.h | 63 unsigned rows; member in struct:pipe_tile_info
94 if (t->tile.size != t->block.size * t->cols * t->rows)
100 if (t->size < t->stride * t->rows * t->tiles_y)
|
| /external/eigen/Eigen/src/Householder/ |
| BlockHouseholder.h | 27 eigen_assert(triFactor.rows() == nbVecs && triFactor.cols() == nbVecs && vectors.rows()>=nbVecs);
31 Index rs = vectors.rows() - i;
|
| /external/eigen/Eigen/src/misc/ |
| Kernel.h | 26 MatrixType::ColsAtCompileTime, // the number of rows in the "kernel matrix"
50 inline Index rows() const { return m_dec.cols(); } function in struct:Eigen::internal::kernel_retval_base
75 using Base::rows; \
|
| /external/eigen/demos/mix_eigen_and_c/ |
| binary_library.h | 27 struct C_MatrixXd* MatrixXd_new(int rows, int cols);
31 void MatrixXd_resize (struct C_MatrixXd *m, int rows, int cols);
50 struct C_Map_MatrixXd* Map_MatrixXd_new(double *array, int rows, int cols);
|
