/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/zlib/ |
crc32.c | 361 unsigned long row;
local 371 row = 1;
373 odd[n] = row;
374 row <<= 1;
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/zlib/ |
crc32.c | 376 unsigned long row;
local 386 row = 1;
388 odd[n] = row;
389 row <<= 1;
|
/external/autotest/frontend/client/src/autotest/common/table/ |
FragmentedTable.java | 23 public Element getElement(int row, int column) { 24 checkCellBounds(row, column); 25 Element bodyElem = bodyElems.get(getFragmentIndex(row)); 26 return getCellElement(bodyElem, getRowWithinFragment(row), column); 33 private native Element getCellElement(Element tbody, int row, int col) /*-{ 34 return tbody.rows[row].cells[col]; 70 private int getRowWithinFragment(int row) { 71 return row % rowsPerFragment; 74 private int getFragmentIndex(int row) { 75 return row / rowsPerFragment 89 int row = fragmentIndex * rowsPerFragment + rowWithinFragment; local [all...] |
/external/autotest/frontend/client/src/autotest/moblab/wizard/ |
CloudStorageCard.java | 44 int row = 0; local 48 layoutTable.setWidget(row, 1, chkUseExisting); 68 // Row for boto key id. 69 row++; 70 layoutTable.setWidget(row, 0, new Label("Boto Key ID")); 71 layoutTable.setWidget(row, 1, createValueFieldWidget(CloudStorageInfo.JSON_FIELD_BOTO_KEY_ID, 74 // Row for boto key secret. 75 row++; 76 layoutTable.setWidget(row, 0, new Label("Boto Key Secret")); 77 layoutTable.setWidget(row, 1, createStringValueFieldWidget [all...] |
/external/autotest/frontend/client/src/autotest/tko/ |
ParameterizedFieldListDisplay.java | 53 fieldTable.getRowFormatter().setStyleName(0, "data-row-header"); 84 int row = fieldTable.getRowCount(); local 86 fieldTable.setText(row, 0, name); 87 fieldTable.setText(row, 1, filteringName); 88 fieldTable.setWidget(row, 2, widget.deleteLink); 96 for (int row = 1; row < fieldTable.getRowCount(); row++) { 97 if (fieldTable.getText(row, 0).equals(fieldWidget.getLabel())) { 98 fieldTable.removeRow(row); [all...] |
TkoUtils.java | 84 int row = table.getRowCount(); local 85 table.setText(row, 0, text); 86 table.getFlexCellFormatter().setStylePrimaryName(row, 0, "field-name"); 87 table.setWidget(row, 1, control); 88 return row;
|
/external/clang/test/Analysis/ |
dead-stores.cpp | 52 class row : protected _Row_base<_Tp, _Number2> { class in namespace:TestTemp 56 explicit row(const pencil_type& __a = pencil_type()) : _Base(__a) {} function in class:TestTemp::row 61 TestTemp::row<const char*> x; // no-warning
|
/external/deqp/external/vulkancts/modules/vulkan/tessellation/ |
vktTessellationPrimitiveDiscardTests.cpp | 131 const int row = index / numCols; local 137 result.push_back((float)row / (float)numRows * 2.0f - 1.0f);
|
/external/eigen/Eigen/src/Core/ |
Visitor.h | 22 row = (UnrollCount-1) % Derived::RowsAtCompileTime enumerator in enum:Eigen::internal::visitor_impl::__anon18057 29 visitor(mat.coeff(row, col), row, col); 78 EIGEN_DEVICE_FUNC CoeffReturnType coeff(Index row, Index col) const 79 { return m_evaluator.coeff(row, col); } 128 Index row, col; member in struct:Eigen::internal::coeff_visitor 134 row = i; 154 this->row = i; 182 this->row = i; 198 * \returns the minimum of all coefficients of *this and puts in *row and *col its location [all...] |
/external/eigen/Eigen/src/SparseCore/ |
SparseCwiseBinaryOp.h | 114 EIGEN_STRONG_INLINE Index row() const { return Lhs::IsRowMajor ? m_lhsIter.row() : index(); } function in class:Eigen::internal::binary_evaluator::InnerIterator 198 EIGEN_STRONG_INLINE Index row() const { return IsRowMajor ? m_rhsIter.outer() : m_id; } 286 EIGEN_STRONG_INLINE Index row() const { return IsRowMajor ? m_lhsIter.outer() : m_id; } 449 EIGEN_STRONG_INLINE Index row() const { return m_lhsIter.row(); } 521 EIGEN_STRONG_INLINE Index row() const { return m_rhsIter.row(); } 596 EIGEN_STRONG_INLINE Index row() const { return m_lhsIter.row(); } [all...] |
SparseDiagonalProduct.h | 18 // 1 - diag * row-major sparse 113 inline Index row() const { return SparseXprType::IsRowMajor ? m_sparseIter.outer() : m_sparseIter.index(); } function in class:Eigen::internal::sparse_diagonal_product_evaluator::InnerIterator
|
SparseUtil.h | 163 /** \returns the row index of the element */ 164 const StorageIndex& row() const { return m_row; } function in class:Eigen::Triplet
|
/external/eigen/Eigen/src/plugins/ |
BlockMethods.h | 16 /// \internal expression type of a row */ 47 /// \param startRow the first row in the block 427 EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF(row-major) 455 EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF(row-major) 483 EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF(row-major) 511 EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF(row-major) 534 /// \param startRow the index of the first row in the block 540 EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF(row-major) 560 /// \param startRow the index of the first row in the block 569 EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF(row-major 859 inline RowXpr row(Index i) function 866 inline ConstRowXpr row(Index i) const function [all...] |
/external/eigen/unsupported/Eigen/src/Splines/ |
SplineFitting.h | 307 A.row(i).segment(span-degree, degree+1) = SplineType::BasisFunctions(knot_parameters[i], degree, knots); 382 DenseIndex row = startRow; local 390 A.block(row, span - degree, 2, degree + 1) 393 b.col(row++) = points.col(i); 394 b.col(row++) = derivatives.col(derivativeIndex++); 398 A.row(row++).segment(span - degree, degree + 1)
|
/external/guava/guava/src/com/google/common/collect/ |
AbstractTable.java | 58 for (Map<C, V> row : rowMap().values()) { 59 if (row.containsValue(value)) { 68 Map<C, V> row = Maps.safeGet(rowMap(), rowKey); local 69 return row != null && Maps.safeContainsKey(row, columnKey); 74 Map<C, V> row = Maps.safeGet(rowMap(), rowKey); local 75 return (row == null) ? null : Maps.safeGet(row, columnKey); 90 Map<C, V> row = Maps.safeGet(rowMap(), rowKey); local 91 return (row == null) ? null : Maps.safeRemove(row, columnKey) 125 Map<C, V> row = Maps.safeGet(rowMap(), cell.getRowKey()); local 136 Map<C, V> row = Maps.safeGet(rowMap(), cell.getRowKey()); local [all...] |
Table.java | 29 * A collection that associates an ordered pair of keys, called a row key and a 31 * fraction of row key / column key pairs possessing a corresponding value. 33 * <p>The mappings corresponding to a given row key may be viewed as a {@link 35 * column with a row key / value map. Note that, in some implementations, data 37 * than data access by row key. 52 * @param <R> the type of the table row keys 65 * row and column keys. 67 * @param rowKey key of row to search for 74 * row key. 76 * @param rowKey key of row to search fo 178 Map<C, V> row(R rowKey); method in interface:Table [all...] |
/external/icu/icu4c/source/common/ |
rbbidata.cpp | 261 RBBIStateTableRow *row = (RBBIStateTableRow *) local 263 RBBIDebugPrintf("%4d | %3d %3d %3d ", s, row->fAccepting, row->fLookAhead, row->fTagIdx); 265 RBBIDebugPrintf("%3d ", row->fNextState[c]);
|
/external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/layout/ |
ThaiStateTable.java | 148 ThaiStateTransition[] row = (ThaiStateTransition[]) stateTable.elementAt(state); local 150 return row[currClass]; 174 ThaiStateTransition[] row = (ThaiStateTransition[]) stateTable.elementAt(state); local 187 row[c].write(output);
|
/external/libavc/common/ |
ih264_chroma_intra_pred_filters.c | 128 WORD32 col, row; /*loop variables*/ local 211 for(row = 0; row < 4; row++) 216 *(pu1_dst + row * dst_strd + col) = val_u1; 217 *(pu1_dst + row * dst_strd + col + 1) = val_v1; 222 *(pu1_dst + row * dst_strd + col) = val_u2; 223 *(pu1_dst + row * dst_strd + col + 1) = val_v2; 248 for(row = 4; row < 8; row++ 372 WORD32 row;\/*loop variable*\/ local [all...] |
ih264_inter_pred_filters.c | 119 WORD32 row, col; local 122 for(row = 0; row < ht; row++) 177 WORD32 row, col; local 180 for(row = 0; row < ht; row++) 236 WORD32 row, col; local 241 for(row = 0; row < ht; row++ 306 WORD32 row, col; local 375 WORD32 row, col; local 460 WORD32 row, col; local 536 WORD32 row, col; local 619 WORD32 row, col; local 720 WORD32 row, col; local 836 WORD32 row, col; local 956 WORD32 row, col; local 1024 WORD32 row, col; local [all...] |
/external/libhevc/decoder/ |
ihevcd_deblk.c | 119 WORD32 col, row; local 184 for(row = 0; row < (ctb_size >> 3) + 1; row++) 185 au2_ctb_no_loop_filter_flag[row] = ps_deblk->au2_ctb_no_loop_filter_flag[row] >> (ctb_size >> 3); 247 /* BS for the column - Last row is excluded and the top row is included*/ 258 for(row = 0; row < ctb_size / 4; [all...] |
/external/libjpeg-turbo/ |
rdrle.c | 62 * then fetch the required row from the virtual array on subsequent calls. 72 JDIMENSION row; /* current row # in the virtual array */ member in struct:_rle_source_struct 74 rle_pixel **rle_row; /* holds a row returned by rle_getrow() */ 184 * Read one row of pixels. 194 source->row--; 196 ((j_common_ptr) cinfo, source->image, source->row, (JDIMENSION) 1, FALSE); 202 * Read one row of pixels. 218 source->row--; 220 ((j_common_ptr) cinfo, source->image, source->row, (JDIMENSION) 1, FALSE) 247 JDIMENSION row, col; local [all...] |
/external/libmpeg2/common/ |
ideint.c | 120 * Start row 144 WORD32 i, row, col; local 169 /* Start row has to be multiple of 8 */ 259 for(row = comp_row_start; row < comp_row_end; row++) 262 pu1_out += (ps_out_frm->ai4_strd[i] * row << 3); 265 pu1_prv += (ps_prv_fld->ai4_strd[i] * row << 2); 277 pu1_top += (cur_strd * row << 2); 278 pu1_bot += (cur_strd * row << 2) [all...] |
/external/libopus/celt/ |
cwrs.c | 144 This allows us to construct a row of one of the tables above given the 145 previous row or the next row. 149 When encoding, we build up from the U(2,K) row and work our way forwards. 150 When decoding, we need to start at the U(N,K) row and work our way backwards, 158 This allows us to construct an arbitrary row of the U(N,K) table by starting 202 Thus, the number of entries in row I is the larger of the maximum number of 475 const opus_uint32 *row; local 476 row=CELT_PVQ_U_ROW[_n]; 478 p=row[_k+1] [all...] |
/external/libpng/contrib/examples/ |
pngpixel.c | 10 * This code illustrates basic 'by-row' reading of a PNG file using libpng. 32 /* Return component 'c' of pixel 'x' from the given row. */ 34 component(png_const_bytep row, png_uint_32 x, unsigned int c, 39 * bytes wide. Since the row fitted into memory, however, the following must 45 row = (png_const_bytep)(((PNG_CONST png_byte (*)[8])row) + bit_offset_hi); 46 row += bit_offset_lo >> 3; 55 case 1: return (row[0] >> (7-bit_offset_lo)) & 0x01; 56 case 2: return (row[0] >> (6-bit_offset_lo)) & 0x03; 57 case 4: return (row[0] >> (4-bit_offset_lo)) & 0x0f 156 volatile png_bytep row = NULL; local [all...] |