/external/libvpx/vp8/common/ |
H A D | mv.h | 17 short row; member in struct:__anon8787
|
/external/eigen/bench/btl/generic_bench/init/ |
H A D | init_matrix.hh | 28 BTL_DONT_INLINE void init_row(Vector & X, int size, int row){ argument 33 X[j]=typename Vector::value_type(init_function(row,j)); 45 for (int row=0; row<A.size() ; row++){ 46 init_row<init_function>(A[row],size,row); 53 for (int row=0; row<A.size() ; row [all...] |
/external/eigen/test/ |
H A D | schur_real.cpp | 22 for(int row = 2; row < size; ++row) { 23 for(int col = 0; col < row - 1; ++col) { 24 VERIFY(T(row,col) == Scalar(0)); 30 for(int row = 1; row < size; ++row) { 31 if (T(row,row [all...] |
/external/eigen/doc/snippets/ |
H A D | MatrixBase_row.cpp | 2 m.row(1) = Vector3d(4,5,6);
|
H A D | MatrixBase_setOnes.cpp | 2 m.row(1).setOnes();
|
H A D | MatrixBase_setZero.cpp | 2 m.row(1).setZero();
|
H A D | Tutorial_commainit_01b.cpp | 2 m.row(0) << 1, 2, 3;
|
H A D | MatrixBase_eval.cpp | 5 cout << "Now we want to copy a column into a row." << endl; 6 cout << "If we do m.col(1) = m.row(0), then m becomes:" << endl; 7 m.col(1) = m.row(0); 9 cout << "Now let us instead do m.col(1) = m.row(0).eval(). Then m becomes" << endl; 11 m.col(1) = m.row(0).eval();
|
/external/skia/src/gpu/ |
H A D | GrRectanizer.cpp | 61 void initRow(Row* row, int rowHeight) { argument 62 row->fLoc.set(0, fNextStripY); 63 row->fRowHeight = rowHeight; 77 We use bsearch, but there may be more than one row with the same height, 86 Row* row = &fRows[HeightToRowIndex(height)]; local 87 GrAssert(row->fRowHeight == 0 || row->fRowHeight == height); 89 if (0 == row->fRowHeight) { 93 this->initRow(row, height); 95 if (!row [all...] |
H A D | GrRectanizer_fifo.cpp | 61 void initRow(Row* row, int rowHeight) { argument 62 row->fLoc.set(0, fNextStripY); 63 row->fRowHeight = rowHeight; 77 We use bsearch, but there may be more than one row with the same height, 86 Row* row = &fRows[HeightToRowIndex(height)]; local 87 GrAssert(row->fRowHeight == 0 || row->fRowHeight == height); 89 if (0 == row->fRowHeight) { 93 this->initRow(row, height); 95 if (!row [all...] |
/external/chromium/chrome/browser/ui/views/ |
H A D | database_open_info_view.cc | 35 int row = 0; local 36 SetValue(row++, url); 37 SetValue(row++, database_name); 38 SetValue(row++, display_name); 39 SetValue(row++, size);
|
H A D | appcache_info_view.cc | 35 int row = 0; local 36 SetValue(row++, manifest_url); 37 SetValue(row++, size); 38 SetValue(row++, creation_date); 39 SetValue(row++, last_access_date);
|
H A D | generic_info_view.cc | 27 void GenericInfoView::SetNameByStringId(int row, int name_string_id) { argument 28 SetName(row, UTF16ToWide(l10n_util::GetStringUTF16(name_string_id))); 31 void GenericInfoView::SetName(int row, const string16& name) { argument 33 DCHECK(row >= 0 && row < number_of_rows_); 34 name_views_[row]->SetText(name); 37 void GenericInfoView::SetValue(int row, const string16& name) { argument 39 DCHECK(row >= 0 && row < number_of_rows_); 40 value_views_[row] [all...] |
/external/webkit/Source/WebCore/html/ |
H A D | HTMLTableRowElement.cpp | 66 // To match Firefox, the row indices work like this: 69 // Rows from other <thead> and <tfoot> elements don't get row indices at all. 74 for (Node *row = head->firstChild(); row; row = row->nextSibling()) { 75 if (row == this) 77 if (row->hasTagName(trTag)) 85 for (Node* row = section->firstChild(); row; ro [all...] |
/external/v8/tools/ |
H A D | process-heap-prof.py | 64 for row in logreader: 65 if row[0] == 'heap-sample-begin' and row[1] == 'Heap': 66 sample_time = float(row[3])/1000.0 72 elif row[0] == 'heap-sample-end' and row[1] == 'Heap': 75 elif row[0] == itemname and sampling: 76 print(row[1]), 78 print('%d' % (int(row[2]))), 80 print('%d' % (int(row[ [all...] |
/external/webkit/LayoutTests/fast/dom/HTMLTableRowElement/script-tests/ |
H A D | cells.js | 5 var row = document.createElement("tr"); 8 row.appendChild(container); 10 return row.cells.length; 15 var row = document.createElement("tr"); 18 row.appendChild(container); 20 return row.cells.length;
|
/external/markdown/markdown/extensions/ |
H A D | tables.py | 55 for row in rows: 56 self._build_row(row, tbody, align, border) 58 def _build_row(self, row, parent, align, border): 59 """ Given a row of text, build table cells. """ 64 cells = self._split_row(row, border) 65 # We use align here rather than cells to ensure every row 76 def _split_row(self, row, border): 77 """ split a row of text into list of cells. """ 79 if row.startswith('|'): 80 row [all...] |
/external/eigen/Eigen/src/Eigen2Support/ |
H A D | Minor.h | 62 Index row, Index col) 63 : m_matrix(matrix), m_row(row), m_col(col) 65 eigen_assert(row >= 0 && row < matrix.rows() 74 inline Scalar& coeffRef(Index row, Index col) argument 76 return m_matrix.const_cast_derived().coeffRef(row + (row >= m_row), col + (col >= m_col)); 79 inline const Scalar coeff(Index row, Index col) const argument 81 return m_matrix.coeff(row + (row > 61 Minor(const MatrixType& matrix, Index row, Index col) argument 101 minor(Index row, Index col) argument 110 minor(Index row, Index col) const argument [all...] |
/external/eigen/Eigen/src/Core/ |
H A D | Swap.h | 52 inline Scalar& coeffRef(Index row, Index col) argument 54 return m_expression.const_cast_derived().coeffRef(row, col); 62 inline Scalar& coeffRef(Index row, Index col) const argument 64 return m_expression.coeffRef(row, col); 73 void copyCoeff(Index row, Index col, const DenseBase<OtherDerived>& other) argument 76 eigen_internal_assert(row >= 0 && row < rows() 78 Scalar tmp = m_expression.coeff(row, col); 79 m_expression.coeffRef(row, col) = _other.coeff(row, co 94 copyPacket(Index row, Index col, const DenseBase<OtherDerived>& other) argument [all...] |
H A D | NestByValue.h | 50 inline const CoeffReturnType coeff(Index row, Index col) const argument 52 return m_expression.coeff(row, col); 55 inline Scalar& coeffRef(Index row, Index col) argument 57 return m_expression.const_cast_derived().coeffRef(row, col); 71 inline const PacketScalar packet(Index row, Index col) const argument 73 return m_expression.template packet<LoadMode>(row, col); 77 inline void writePacket(Index row, Index col, const PacketScalar& x) argument 79 m_expression.const_cast_derived().template writePacket<LoadMode>(row, col, x);
|
/external/icu4c/common/ |
H A D | propsvec.c | 32 int32_t prevRow; /* search optimization: remember last row seen */ 43 uint32_t *v, *row; local 69 /* set the all-Unicode row and the special-value rows */ 70 row=pv->v; 71 uprv_memset(row, 0, pv->rows*columns*4); 72 row[0]=0; 73 row[1]=0x110000; 74 row+=columns; 76 row[0]=cp; 77 row[ 93 uint32_t *row; local 278 uint32_t *row; local 292 uint32_t *row; local 334 uint32_t *row; local 494 upvec_compactToUTrie2Handler(void *context, UChar32 start, UChar32 end, int32_t rowIndex, uint32_t *row, int32_t columns, UErrorCode *pErrorCode) argument [all...] |
/external/qemu/distrib/sdl-1.2.15/src/video/maccommon/ |
H A D | SDL_macmouse.c | 56 int row, bytes; local 74 for ( row=0; row<h; ++row ) { 75 SDL_memcpy(&cursor->curs.data[row], data, bytes); 78 for ( row=0; row<h; ++row ) { 79 SDL_memcpy(&cursor->curs.mask[row], mask, bytes);
|
/external/webkit/Source/WebCore/accessibility/ |
H A D | AccessibilityARIAGrid.cpp | 67 AccessibilityTableRow* row = static_cast<AccessibilityTableRow*>(child); 68 if (appendedRows.contains(row)) 72 unsigned rowCellCount = row->children().size(); 76 row->setRowIndex((int)m_rows.size()); 77 m_rows.append(row); 79 // Try adding the row if it's not ignoring accessibility, 81 if (!row->accessibilityIsIgnored()) 82 m_children.append(row); 84 m_children.append(row->children()); 86 appendedRows.add(row); 141 cellForColumnAndRow(unsigned column, unsigned row) argument [all...] |
/external/eigen/unsupported/Eigen/src/Skyline/ |
H A D | SkylineInplaceLU.h | 127 for (Index row = 0; row < rows; row++) { 128 const double pivot = m_lu.coeffDiag(row); 131 const Index& col = row; 138 for (Index rrow = row + 1; rrow < m_lu.rows(); rrow++) { 139 typename MatrixType::InnerUpperIterator uItPivot(m_lu, row); 143 uItPivot += (rrow - row - 1); 157 for (Index rrow = row + 1; rrow < m_lu.rows(); rrow++) { 158 typename MatrixType::InnerUpperIterator uItPivot(m_lu, row); [all...] |
/external/guava/guava-gwt/src/com/google/common/collect/ |
H A D | HashBasedTable_CustomFieldSerializer.java | 42 for (Entry<?, ?> row : hashMap.entrySet()) { 43 table.row(row.getKey()).putAll((Map<?, ?>) row.getValue()); 53 * Therefore, the backing map is serializable (assuming the row,
|