| /external/chromium_org/chrome/browser/predictors/ |
| autocomplete_action_predictor_unittest.cc | 168 AutocompleteActionPredictorTable::Rows(1, row),
169 AutocompleteActionPredictorTable::Rows());
178 AutocompleteActionPredictorTable::Rows(),
179 AutocompleteActionPredictorTable::Rows(1, row));
186 void DeleteRowsWithURLs(const history::URLRows& rows) {
187 predictor_->DeleteRowsWithURLs(rows);
299 history::URLRows rows; local
301 rows.push_back(history::URLRow(test_url_db[i].url));
303 DeleteRowsWithURLs(rows);
|
| resource_prefetch_predictor_unittest.cc | 734 history::URLRows rows; local
[all...] |
| /external/chromium_org/chrome/browser/sync/test/integration/ |
| typed_urls_helper.cc | 45 GetTypedUrlsTask(history::URLRows* rows, base::WaitableEvent* event)
46 : rows_(rows), wait_event_(event) {}
173 history::URLRows rows; local
175 service->ScheduleDBTask(new GetTypedUrlsTask(&rows, &wait_event),
178 return rows;
|
| /external/chromium_org/content/browser/accessibility/ |
| browser_accessibility_cocoa.h | 91 @property(nonatomic, readonly) NSArray* rows; variable
|
| /external/chromium_org/media/base/ |
| video_frame.cc | 351 // Align Y rows at least at 16 byte boundaries. The stride for both
353 // U and V applies to two rows of Y (one byte of UV for 4 bytes of Y), so in
359 // applies to a full two rows of Y. YV12A is the same as YV12, but with an
459 int VideoFrame::rows(size_t plane) const { function in class:media::VideoFrame
508 for (int row = 0; row < rows(plane); ++row) {
|
| 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)
104 const int rows = frame->rows(plane); local
[all...] |
| /external/chromium_org/sql/ |
| recovery_unittest.cc | 23 // columns and |row_sep| between rows.
439 size_t rows = 0; local
440 EXPECT_TRUE(recovery->AutoRecoverTable("x", 0, &rows));
441 EXPECT_EQ(2u, rows);
462 size_t rows = 0; local
463 EXPECT_FALSE(recovery->AutoRecoverTable("y", 0, &rows));
478 // rows. The row with 17 will get the default injected at insert
501 // defaults coming from the recovery system. The two %5 rows should
519 size_t rows = 0; local
520 EXPECT_TRUE(recovery->AutoRecoverTable("x", 0, &rows));
555 size_t rows = 0; local
594 size_t rows = 0; local
639 size_t rows = 0; local
674 size_t rows = 0; local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| HTMLTableElement.cpp | 201 exceptionState.throwDOMException(IndexSizeError, "The index provided (" + String::number(index) + ") is greater than the number of rows in the table (" + String::number(i) + ").");
248 exceptionState.throwDOMException(IndexSizeError, "The index provided (" + String::number(index) + ") is greater than the number of rows in the table (" + String::number(i) + ").");
392 else if (equalIgnoringCase(value, "rows"))
521 static PassRefPtr<StylePropertySet> createGroupBorderStyle(int rows)
524 if (rows) {
538 const StylePropertySet* HTMLTableElement::additionalGroupStyle(bool rows)
543 if (rows) {
556 PassRefPtr<HTMLCollection> HTMLTableElement::rows() function in class:WebCore::HTMLTableElement
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| ConsoleMessage.js | 540 var rows = []; variable
565 rows.push([rowProperty.name, rowValue]);
569 for (var i = 0; i < rows.length; ++i) {
570 var rowName = rows[i][0];
571 var rowValue = rows[i][1];
[all...] |
| /external/chromium_org/third_party/angle/src/libGLESv2/renderer/ |
| Image11.cpp | 270 int rows = inputSize / inputPitch; local
271 for (int i = 0; i < rows; ++i)
|
| Image9.cpp | 129 int rows = d3d9::IsCompressedFormat(desc.Format) ? desc.Height / 4 : desc.Height; local
133 for(int i = 0; i < rows; i++)
473 int rows = inputSize / inputPitch; local
474 for (int i = 0; i < rows; ++i)
|
| /external/chromium_org/third_party/icu/source/common/ |
| propsvec.c | 31 int32_t rows; member in struct:UPropsVectors
67 pv->rows=2+(UPVEC_MAX_CP-UPVEC_FIRST_SPECIAL_CP);
69 /* set the all-Unicode row and the special-value rows */
71 uprv_memset(row, 0, pv->rows*columns*4);
94 int32_t columns, i, start, limit, prevRow, rows; local
97 rows=limit=pv->rows;
183 /* find the rows whose ranges overlap with the input range */
185 /* find the first and last rows, always successful */
190 * Rows need to be split if they partially overlap with th
199 int32_t count, rows; local
335 int32_t i, columns, valueColumns, rows, count; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/glx/xlib/ |
| glx_usefont.c | 166 unsigned int rows, pages; local
170 rows = fs->max_byte1 - fs->min_byte1 + 1;
173 if (rows == 1) {
190 if (rows == 1) {
257 rows = fs->max_byte1 - fs->min_byte1 + 1;
258 unsigned int first_char, last_char, pages, rows;
|
| /external/chromium_org/third_party/mesa/src/src/glx/ |
| xfont.c | 172 unsigned int rows, pages; local
176 rows = fs->max_byte1 - fs->min_byte1 + 1;
179 if (rows == 1) {
196 if (rows == 1) {
260 rows = fs->max_byte1 - fs->min_byte1 + 1;
261 unsigned int first_char, last_char, pages, rows;
|
| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/radeon/ |
| radeon_mipmap_tree.c | 451 uint32_t rows = image->base.Base.Height * image->base.Base.Depth; local
456 rows = (rows + blockHeight - 1) / blockHeight;
460 rows, srcrowstride);
|
| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/x11/ |
| xfonts.c | 173 unsigned int rows, pages; local
177 rows = fs->max_byte1 - fs->min_byte1 + 1;
180 if (rows == 1) {
197 if (rows == 1) {
263 rows = fs->max_byte1 - fs->min_byte1 + 1;
264 unsigned int first_char, last_char, pages, rows;
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.build.tools/scripts_cvs/searchcvs/www/projectName/ |
| searchcvs.php | 76 $rows = $row[0]; variable
78 $title = "<span>$rows results total</span>Showing results " . ($offset + 1) . "-" . ($offset + $pagesize > $rows ? $rows : $offset + $pagesize) . " for " . ($_GET["q"] == "" ? "last $days days of commits" : "$et" . sanitize($_GET["q"], "text"));
79 $title = ($rows == 0 ? "No results found for " . sanitize($_GET["q"], "text") . "" : $title);
84 dopager($rows, $page, $pagesize);
103 dopager($rows, $page, $pagesize);
146 print $rows;
227 function dopager($rows, $page, $pagesize)
230 $endpage = ($page + 5 > $rows/$pagesize ? ceil($rows/$pagesize) : $page + 5)
[all...] |
| /external/eigen/Eigen/src/Cholesky/ |
| LDLT.h | 93 : m_matrix(matrix.rows(), matrix.cols()),
94 m_transpositions(matrix.rows()),
95 m_temporary(matrix.rows()),
179 eigen_assert(m_matrix.rows()==b.rows()
180 && "LDLT::solve(): invalid number of rows of the right hand side matrix b");
213 inline Index rows() const { return m_matrix.rows(); } function in class:Eigen::LDLT
254 eigen_assert(mat.rows()==mat.cols());
255 const Index size = mat.rows();
[all...] |
| /external/eigen/Eigen/src/CholmodSupport/ |
| CholmodSupport.h | 57 res.nrow = mat.rows();;
122 res.nrow = mat.rows();
188 inline Index rows() const { return m_cholmodFactor->n; } function in class:Eigen::CholmodBase
221 eigen_assert(rows()==b.rows()
222 && "CholmodDecomposition::solve(): invalid number of rows of the right hand side matrix b");
235 eigen_assert(rows()==b.rows()
236 && "CholmodDecomposition::solve(): invalid number of rows of the right hand side matrix b");
289 eigen_assert(size==b.rows());
[all...] |
| /external/eigen/Eigen/src/Core/ |
| BandMatrix.h | 50 using Base::rows;
72 Index len = coeffs().rows();
76 len = (std::min)(rows(),std::max<Index>(0,coeffs().rows() - (supers()-i)));
78 else if (i>=rows()-subs())
79 len = std::max<Index>(0,coeffs().rows() - (i + 1 - rows() + subs()));
85 { return Block<CoefficientsType,1,SizeAtCompileTime>(coeffs(),supers(),0,1,(std::min)(rows(),cols())); }
89 { return Block<const CoefficientsType,1,SizeAtCompileTime>(coeffs(),supers(),0,1,(std::min)(rows(),cols())); }
136 dst.resize(rows(),cols())
214 inline Index rows() const { return m_rows.value(); } function in class:Eigen::internal::BandMatrix
278 inline Index rows() const { return m_rows.value(); } function in class:Eigen::internal::BandMatrixWrapper
[all...] |
| Block.h | 22 * \param BlockRows the number of rows of the block we are taking at compile time (optional)
117 m_blockRows(BlockRows==1 ? 1 : xpr.rows()),
121 ((BlockRows==1) && (BlockCols==XprType::ColsAtCompileTime) && i<xpr.rows())
132 eigen_assert(startRow >= 0 && BlockRows >= 1 && startRow + BlockRows <= xpr.rows()
146 eigen_assert(startRow >= 0 && blockRows >= 0 && startRow + blockRows <= xpr.rows()
152 inline Index rows() const { return m_blockRows.value(); } function in class:Eigen::Block
274 BlockRows==1 ? 1 : xpr.rows(),
279 ((BlockRows==1) && (BlockCols==XprType::ColsAtCompileTime) && i<xpr.rows())
289 eigen_assert(startRow >= 0 && BlockRows >= 1 && startRow + BlockRows <= xpr.rows()
304 eigen_assert(startRow >= 0 && blockRows >= 0 && startRow + blockRows <= xpr.rows()
[all...] |
| CwiseBinaryOp.h | 131 eigen_assert(lhs.rows() == rhs.rows() && lhs.cols() == rhs.cols());
134 EIGEN_STRONG_INLINE Index rows() const { function in class:Eigen::CwiseBinaryOp
137 return m_rhs.rows();
139 return m_lhs.rows();
|
| CwiseNullaryOp.h | 57 CwiseNullaryOp(Index rows, Index cols, const NullaryOp& func = NullaryOp())
58 : m_rows(rows), m_cols(cols), m_functor(func)
60 eigen_assert(rows >= 0
61 && (RowsAtCompileTime == Dynamic || RowsAtCompileTime == rows)
66 EIGEN_STRONG_INLINE Index rows() const { return m_rows.value(); } function in class:Eigen::CwiseNullaryOp
69 EIGEN_STRONG_INLINE const Scalar coeff(Index rows, Index cols) const
71 return m_functor(rows, cols);
103 * The parameters \a rows and \a cols are the number of rows and of columns of
107 * it is redundant to pass \a rows and \a cols as arguments, so Zero() should be use
[all...] |
| PermutationMatrix.h | 107 /** \returns the number of rows */
108 inline Index rows() const { return indices().size(); } function in class:Eigen::PermutationBase
121 for (int i=0; i<rows();++i)
218 for (int i=0; i<rows();++i) indices().coeffRef(other.indices().coeff(i)) = i;
223 eigen_assert(lhs.cols() == rhs.rows());
224 for (int i=0; i<rows();++i) indices().coeffRef(i) = lhs.indices().coeff(rhs.indices().coeff(i));
263 * \param SizeAtCompileTime the number of rows/cols, or Dynamic
264 * \param MaxSizeAtCompileTime the maximum number of rows/cols, or Dynamic. This optional parameter defaults to SizeAtCompileTime. Most of the time, you should not have to specify it.
518 /** \returns the matrix with the permutation applied to the rows.
549 inline int rows() const { return m_matrix.rows(); function in struct:Eigen::internal::permut_matrix_product_retval
637 inline int rows() const { return m_permutation.rows(); } function in class:Eigen::Transpose
[all...] |
| ProductBase.h | 93 eigen_assert(lhs.cols() == rhs.rows()
98 inline Index rows() const { return m_lhs.rows(); } function in class:Eigen::ProductBase
119 m_result.resize(m_lhs.rows(), m_rhs.cols());
141 eigen_assert(this->rows() == 1 && this->cols() == 1);
150 eigen_assert(this->rows() == 1 && this->cols() == 1);
158 eigen_assert(this->rows() == 1 && this->cols() == 1);
165 eigen_assert(this->rows() == 1 && this->cols() == 1);
|
