| /external/chromium_org/third_party/WebKit/PerformanceTests/resources/ |
| jquery.tablesorter.min.js | 3 function(){var parsers=[],widgets=[];this.defaults={cssHeader:"header",cssAsc:"headerSortUp",cssDesc:"headerSortDown",cssChildRow:"expand-child",sortInitialOrder:"asc",sortMultiSortKey:"shiftKey",sortForce:null,sortAppend:null,sortLocaleCompare:true,textExtraction:"simple",parsers:{},widgets:[],widgetZebra:{css:["even","odd"]},headers:{},widthFixed:false,cancelSelection:true,sortList:[],headerList:[],dateFormat:"us",decimal:'/\.|\,/g',onRenderHeader:null,selectorHeaders:'thead th',debug:false};function benchmark(s,d){log(s+","+(new Date().getTime()-d.getTime())+"ms");}this.benchmark=benchmark;function log(s){if(typeof console!="undefined"&&typeof console.debug!="undefined"){console.log(s);}else{alert(s);}}function buildParserCache(table,$headers){if(table.config.debug){var parsersDebug="";}if(table.tBodies.length==0)return;var rows=table.tBodies[0].rows;if(rows[0]){var list=[],cells=rows[0].cells,l=cells.length;for(var i=0;i<l;i++){var p=false;if($.metadata&&($($headers[i]).metadata()&&$($headers[i]).metadata().sorter)){p=getParserById($($headers[i]).metadata().sorter);}else if((table.config.headers[i]&&table.config.headers[i].sorter)){p=getParserById(table.config.headers[i].sorter);}if(!p){p=detectParserForColumn(table,rows,-1,i);}if(table.config.debug){parsersDebug+="column:"+i+" parser:"+p.id+"\n";}list.push(p);}}if(table.config.debug){log(parsersDebug);}return list;};function detectParserForColumn(table,rows,rowIndex,cellIndex){var l=parsers.length,node=false,nodeValue=false,keepLooking=true;while(nodeValue==''&&keepLooking){rowIndex++;if(rows[rowIndex]){node=getNodeFromRowAndCellIndex(rows,rowIndex,cellIndex);nodeValue=trimAndGetNodeText(table.config,node);if(table.config.debug){log('Checking if value was empty on row:'+rowIndex);}}else{keepLooking=false;}}for(var i=1;i<l;i++){if(parsers[i].is(nodeValue,table,node)){return parsers[i];}}return parsers[0];}function getNodeFromRowAndCellIndex(rows,rowIndex,cellIndex){return rows[rowIndex].cells[cellIndex];}function trimAndGetNodeText(config,node){return $.trim(getElementText( (…)
[all...] |
| /external/eigen/Eigen/src/QR/ |
| ColPivHouseholderQR.h | 81 ColPivHouseholderQR(Index rows, Index cols)
82 : m_qr(rows, cols),
83 m_hCoeffs((std::min)(rows,cols)),
92 : m_qr(matrix.rows(), matrix.cols()),
93 m_hCoeffs((std::min)(matrix.rows(),matrix.cols())),
227 return rank() == rows();
253 (*this, MatrixType::Identity(m_qr.rows(), m_qr.cols()));
256 inline Index rows() const { return m_qr.rows(); } function in class:Eigen::ColPivHouseholderQR
346 eigen_assert(m_qr.rows() == m_qr.cols() && "You can't take the determinant of a non-square matrix!")
361 Index rows = matrix.rows(); local
[all...] |
| /libcore/luni/src/main/java/java/sql/ |
| Statement.java | 22 * The resulting table rows are returned as {@code ResultSet}s. For any given
75 * but a count of the number of rows it affected is unavailable.
246 * count</i> (the number of rows in the database affected by the
249 * completed successfully but the number of rows affected is
281 * @return the count of updated rows, or 0 for a statement that returns
302 * @return the number of updated rows, or 0 if the statement returns
322 * @return the count of updated rows, or 0 for a statement that returns
342 * @return the count of updated rows, or 0 for a statement that returns
362 * Gets the default direction for fetching rows for {@code ResultSet}s
376 * Gets the default number of rows for a fetch for the {@code ResultSet
[all...] |
| /cts/tests/tests/database/src/android/database/sqlite/cts/ |
| SQLiteStatementTest.java | 91 // insert 2 rows and then update them.
100 // should still have 2 rows in the table
104 // insert 2 more rows and delete 3 of them
114 // if the SQL statement is something that causes rows of data to
151 // if the sql statement is something that causes rows of data to
177 // test query returns zero rows
201 // test query returns zero rows
|
| /external/ceres-solver/internal/ceres/ |
| compressed_row_jacobian_writer.cc | 76 int* rows = jacobian->mutable_rows(); local
79 rows[0] = 0;
108 rows[row_pos + j + 1] = rows[row_pos + j] + num_derivatives;
123 const int column_block_begin = rows[row_pos + r] + col_pos;
133 CHECK_EQ(num_jacobian_nonzeros, rows[total_num_residuals]);
163 const int* jacobian_rows = jacobian->rows();
|
| /external/chromium_org/chrome/browser/predictors/ |
| autocomplete_action_predictor.h | 159 // Removes all rows from the database and caches.
162 // Removes rows from the database and caches that contain a URL in |rows|.
163 void DeleteRowsWithURLs(const history::URLRows& rows);
168 // Adds and updates rows in the database and caches.
170 const AutocompleteActionPredictorTable::Rows& rows_to_add,
171 const AutocompleteActionPredictorTable::Rows& rows_to_update);
|
| 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);
|
| /external/chromium_org/third_party/ots/test/ |
| side-by-side.cc | 23 for (int i = 0; i < bitmap->rows * bitmap->width; ++i) {
46 orig->rows == trans->rows) {
47 for (int i = 0; i < orig->rows * orig->width; ++i) {
56 orig->width, orig->rows, trans->width, trans->rows);
98 bitmap->rows = h;
|
| /external/eigen/Eigen/src/Core/ |
| Reverse.h | 102 inline Index rows() const { return m_matrix.rows(); } function in class:Eigen::Reverse
112 eigen_assert(row >= 0 && row < rows() && col >= 0 && col < cols());
118 return m_matrix.const_cast_derived().coeffRef(ReverseRow ? m_matrix.rows() - row - 1 : row,
124 return m_matrix.coeff(ReverseRow ? m_matrix.rows() - row - 1 : row,
148 ReverseRow ? m_matrix.rows() - row - OffsetRow : row,
156 ReverseRow ? m_matrix.rows() - row - OffsetRow : row,
|
| /external/eigen/test/ |
| nomalloc.cpp | 35 Index rows = m.rows(); local
38 MatrixType m1 = MatrixType::Random(rows, cols),
39 m2 = MatrixType::Random(rows, cols),
40 m3(rows, cols);
44 Index r = internal::random<Index>(0, rows-1),
49 VERIFY_IS_APPROX(m1.cwiseProduct(m1.block(0,0,rows,cols)), (m1.array()*m1.array()).matrix());
|
| sparse_permutations.cpp | 16 const Index rows = ref.rows(); local
24 double density = (std::max)(8./(rows*cols), 0.01);
26 SparseMatrixType mat(rows, cols), up(rows,cols), lo(rows,cols);
28 DenseMatrix mat_d = DenseMatrix::Zero(rows, cols), up_sym_d, lo_sym_d, res_d;
|
| /frameworks/base/core/java/android/database/ |
| CursorJoiner.java | 63 /** The rows pointed to by both cursors are the same */
117 * Returns whether or not there are more rows to compare using next().
118 * @return true if there are more rows to compare
143 * has no more rows but the other does then subsequent calls to this will indicate that
144 * the remaining rows are unique.
153 * if the row pointed to by the right cursor is unique, BOTH if the rows in both
213 * Increment the cursors past the rows indicated in the most recent call to next().
|
| /libcore/luni/src/test/java/libcore/sqlite/ |
| OldFunctionContextTest.java | 51 String row[] = (String[]) res.rows.elementAt(0);
64 String row[] = (String[]) res.rows.elementAt(0);
77 String row[] = (String[]) res.rows.elementAt(0);
122 String row[] = (String[]) res.rows.elementAt(0);
160 String row[] = (String[]) res.rows.elementAt(0);
165 assertEquals(((String[]) res2.rows.elementAt(0))[0], val);
190 String row[] = (String[]) res.rows.elementAt(0);
|
| /external/chromium_org/skia/ext/ |
| convolver.cc | 39 // Stores a list of rows in a circular buffer. The usage is you write into it
41 // should use next, and the total number of rows added.
45 // The maximum number of rows needed in the buffer is |max_y_filter_size|
46 // (we only need to store enough rows for the biggest filter).
49 // following rows returned by Advance().
73 // Returns a pointer to an "unrolled" array of rows. These rows will start
75 // order for the maximum number of rows in this circular buffer.
89 // to the first_row_index and the negative rows will never be used.
105 // The buffer storing the rows. They are packed, each one row_byte_width_
[all...] |
| /external/chromium_org/tools/code_coverage/third_party/ |
| sorttable.js | 47 the.appendChild(table.rows[0]);
53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
55 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
56 // "total" rows, for example). This is B&R, since what you're supposed
57 // to do is put them in a tfoot. So, if there are sortbottom rows,
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells
[all...] |
| /external/clang/tools/scan-build/ |
| sorttable.js | 47 the.appendChild(table.rows[0]);
53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
55 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
56 // "total" rows, for example). This is B&R, since what you're supposed
57 // to do is put them in a tfoot. So, if there are sortbottom rows,
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells
[all...] |
| /frameworks/base/tools/preload/ |
| sorttable.js | 47 the.appendChild(table.rows[0]);
53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
55 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
56 // "total" rows, for example). This is B&R, since what you're supposed
57 // to do is put them in a tfoot. So, if there are sortbottom rows,
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells
[all...] |
| /external/opencv/cv/src/ |
| cvfilter.cpp | 61 rows = 0;
74 rows = 0;
87 rows = 0;
99 int min_rows = max_ky*2 + 3, rows = MAX(min_rows,10), row_sz; local
116 buf_size = rows*row_sz;
184 rows = (uchar**)ptr;
307 uchar* row1 = border_mode == IPL_BORDER_CONSTANT ? const_row : rows[max_ky];
309 for( i = 0; i < top_rows && rows[i] == 0; i++ )
310 rows[i] = row1;
312 row1 = border_mode == IPL_BORDER_CONSTANT ? const_row : rows[row_count-1]
[all...] |
| cvfundam.cpp | 113 int i, count = _err->rows*_err->cols, goodCount = 0;
176 int count = m1->rows*m1->cols, maxGoodCount = 0;
271 int count = m1->rows*m1->cols;
361 int count = m1->cols*m1->rows;
446 int i, count = m1->rows*m1->cols;
509 int i, count = m1->rows*m1->cols;
527 int i, j, k, count = m1->rows*m1->cols;
530 CvMat modelPart = cvMat( solver.param->rows, solver.param->cols, model->type, model->data.ptr );
594 count = MAX(imagePoints->cols, imagePoints->rows);
606 (mask->rows == 1 || mask->cols == 1) &
[all...] |
| /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/keyboard/ |
| MoreKeysKeyboardBuilderFixedOrderTests.java | 74 assertEquals("1 key fix 5 M0 rows", 1, params.mNumRows);
86 assertEquals("1 key fix 5 L0 rows", 1, params.mNumRows);
98 assertEquals("1 key fix 5 L1 rows", 1, params.mNumRows);
110 assertEquals("1 key fix 5 L2 rows", 1, params.mNumRows);
122 assertEquals("1 key fix 5 R0 rows", 1, params.mNumRows);
134 assertEquals("1 key fix 5 R1 rows", 1, params.mNumRows);
146 assertEquals("1 key fix 5 R2 rows", 1, params.mNumRows);
158 assertEquals("2 key fix 5 M0 rows", 1, params.mNumRows);
171 assertEquals("2 key fix 5 L0 rows", 1, params.mNumRows);
184 assertEquals("2 key fix 5 L1 rows", 1, params.mNumRows)
[all...] |
| /external/chromium_org/chrome/browser/history/android/ |
| android_provider_backend.h | 71 // Runs the given update and returns the number of the updated rows in
86 // Deletes the specified rows and returns the number of the deleted rows in
119 // Runs the given update and returns the number of updated rows in
133 // Deletes the matched rows and the number of deleted rows is returned in
194 // Runs the given update and returns the number of updated rows in
218 // Deletes the specified rows and returns the number of the deleted rows in
282 // succeeds, the selected URLID and url are returned in |rows|
[all...] |
| /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/opencv/cvaux/src/ |
| cvbgfg_codebook.cpp | 106 roi.height = image->rows;
110 (unsigned)roi.y < (unsigned)image->rows &&
113 roi.y + roi.height <= image->rows );
115 if( image->cols != model->size.width || image->rows != model->size.height )
120 int bufSz = image->cols*image->rows*sizeof(model->cbmap[0]);
123 model->size = cvSize(image->cols, image->rows);
241 image->cols == model->size.width && image->rows == model->size.height &&
247 roi.height = image->rows;
251 (unsigned)roi.y < (unsigned)image->rows &&
254 roi.y + roi.height <= image->rows );
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| csv.py | 77 self.restkey = restkey # key to catch long rows
78 self.restval = restval # default value for short rows
151 rows = []
153 rows.append(self._dict_to_list(rowdict))
154 return self.writer.writerows(rows)
285 e.g. 'x occurred 5 times in 10 rows, 6 times in 1000 rows,
286 7 times in 2 rows'
338 # (rows of consistent data) / (number of rows) = 100
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| csv.py | 77 self.restkey = restkey # key to catch long rows
78 self.restval = restval # default value for short rows
151 rows = []
153 rows.append(self._dict_to_list(rowdict))
154 return self.writer.writerows(rows)
285 e.g. 'x occurred 5 times in 10 rows, 6 times in 1000 rows,
286 7 times in 2 rows'
338 # (rows of consistent data) / (number of rows) = 100
[all...] |
