Searched defs:row (Results 151 - 175 of 652) sorted by relevance

1234567891011>>

/external/eigen/Eigen/src/Core/
H A DDiagonalProduct.h61 EIGEN_STRONG_INLINE const Scalar coeff(Index row, Index col) const argument
63 return m_diagonal.diagonal().coeff(ProductOrder == OnTheLeft ? row : col) * m_matrix.coeff(row, col);
75 EIGEN_STRONG_INLINE PacketScalar packet(Index row, Index col) const argument
80 const Index indexInDiagonalVector = ProductOrder == OnTheLeft ? row : col;
81 return packet_impl<LoadMode>(row,col,indexInDiagonalVector,typename internal::conditional<
97 EIGEN_STRONG_INLINE PacketScalar packet_impl(Index row, Index col, Index id, internal::true_type) const argument
99 return internal::pmul(m_matrix.template packet<LoadMode>(row, col),
104 EIGEN_STRONG_INLINE PacketScalar packet_impl(Index row, Index col, Index id, internal::false_type) const argument
110 return internal::pmul(m_matrix.template packet<LoadMode>(row, co
[all...]
H A DMapBase.h201 inline ScalarWithConstIfNotLvalue& coeffRef(Index row, Index col) argument
203 return this->m_data[col * colStride() + row * rowStride()];
213 inline void writePacket(Index row, Index col, const PacketScalar& val) argument
216 (this->m_data + (col * colStride() + row * rowStride()), val);
H A DSelfCwiseBinaryOp.h65 inline Scalar& coeffRef(Index row, Index col) argument
68 return m_matrix.const_cast_derived().coeffRef(row, col);
70 inline const Scalar& coeffRef(Index row, Index col) const argument
72 return m_matrix.coeffRef(row, col);
88 void copyCoeff(Index row, Index col, const DenseBase<OtherDerived>& other) argument
91 eigen_internal_assert(row >= 0 && row < rows()
93 Scalar& tmp = m_matrix.coeffRef(row,col);
94 tmp = m_functor(tmp, _other.coeff(row,col));
107 void copyPacket(Index row, Inde argument
[all...]
H A DVisitor.h22 row = (UnrollCount-1) % Derived::RowsAtCompileTime enumerator in enum:Eigen::internal::visitor_impl::__anon20721
28 visitor(mat.coeff(row, col), row, col);
99 Index row, col; member in struct:Eigen::internal::coeff_visitor
104 row = i;
124 this->row = i;
152 this->row = i;
167 /** \returns the minimum of all coefficients of *this and puts in *row and *col its location.
179 *rowId = minVisitor.row;
197 *index = (RowsAtCompileTime==1) ? minVisitor.col : minVisitor.row;
[all...]
/external/eigen/Eigen/src/SparseCore/
H A DSparseColEtree.h57 * \param firstRowElt The column index of the first element in each row
72 //Compute first nonzero column in each row
73 Index row,col; local
84 row = it.row();
85 firstRowElt(row) = (std::min)(firstRowElt(row), col);
90 Thus each row clique in A'*A is replaced by a star
110 row = firstRowElt(i);
111 if (row >
[all...]
H A DSparseTriangularView.h107 inline Index row() const { return (MatrixType::Flags&RowMajorBit ? Base::outer() : this->index()); } function in class:Eigen::SparseTriangularView::InnerIterator
155 inline Index row() const { return Base::row(); } function in class:Eigen::SparseTriangularView::ReverseInnerIterator
H A DSparseUtil.h158 /** \returns the row index of the element */
159 const Index& row() const { return m_row; } function in class:Eigen::Triplet
/external/eigen/bench/btl/libs/blitz/
H A Dblitz_LU_solve_interface.hh54 static inline real matrix_vector_product_sliced(const gene_matrix & A, gene_vector B, int row, int col_start, int col_end) argument
61 somme+=A(row,j)*B(j);
72 static inline real matrix_matrix_product_sliced(gene_matrix & A, int row, int col_start, int col_end, gene_matrix & B, int row_shift, int col ) argument
79 somme+=A(row,j)*B(j+row_shift,col);
/external/eigen/bench/btl/libs/gmm/
H A Dgmm_LU_solve_interface.hh54 static inline real matrix_vector_product_sliced(const gene_matrix & A, gene_vector B, int row, int col_start, int col_end) argument
61 somme+=A(row,j)*B(j);
72 static inline real matrix_matrix_product_sliced(gene_matrix & A, int row, int col_start, int col_end, gene_matrix & B, int row_shift, int col ) argument
79 somme+=A(row,j)*B(j+row_shift,col);
/external/eigen/bench/btl/libs/mtl4/
H A Dmtl4_LU_solve_interface.hh54 static inline real matrix_vector_product_sliced(const gene_matrix & A, gene_vector B, int row, int col_start, int col_end) argument
61 somme+=A(row,j)*B(j);
72 static inline real matrix_matrix_product_sliced(gene_matrix & A, int row, int col_start, int col_end, gene_matrix & B, int row_shift, int col ) argument
79 somme+=A(row,j)*B(j+row_shift,col);
/external/eigen/unsupported/Eigen/src/Polynomials/
H A DCompanion.h63 EIGEN_STRONG_INLINE const _Scalar operator()(Index row, Index col ) const argument
67 if( 0 < row ){ return m_bl_diag[col]; }
70 else{ return m_monic[row]; }
105 * \returns true if the row and the column, having colNorm and rowNorm
108 * the column and the row in order to balance them.
114 * \returns true if the row and the column, having colNorm and rowNorm
117 * the column and the row in order to balance them.
127 * A matrix with non zero row and non zero column is balanced
128 * for a certain norm if the i-th row and the i-th column
151 // then the balancing coefficient for the row i
[all...]
/external/emma/core/java12/com/vladium/emma/report/txt/
H A DReportGenerator.java144 // [all] coverage summary row:
147 // header row:
150 // coverage row:
157 row ("total packages:" + m_separator + item.getChildCount ());
158 row ("total classes:" + m_separator + item.getAggregate (IItem.TOTAL_CLASS_COUNT));
159 row ("total methods:" + m_separator + item.getAggregate (IItem.TOTAL_METHOD_COUNT));
163 row ("total executable files:" + m_separator + item.getAggregate (IItem.TOTAL_SRCFILE_COUNT));
166 row ("total executable lines:" + m_separator + item.getAggregate (IItem.TOTAL_LINE_COUNT));
183 // header row:
188 // coverage row
415 private void row (final StringBuffer str) method in class:ReportGenerator
430 private void row (final String str) method in class:ReportGenerator
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DEmptyImmutableTable.java102 @Override public ImmutableMap<Object, Object> row(Object rowKey) { method in class:EmptyImmutableTable
H A DForwardingTable.java115 public Map<C, V> row(R rowKey) { method in class:ForwardingTable
116 return delegate().row(rowKey);
H A DImmutableTable.java208 * Duplicate row key column key pairs are not allowed, and will cause
267 @Override public abstract ImmutableMap<C, V> row(R rowKey); method in class:ImmutableTable
H A DSingletonImmutableTable.java95 @Override public ImmutableMap<C, V> row(R rowKey) { method in class:SingletonImmutableTable
H A DTable.java30 * A collection that associates an ordered pair of keys, called a row key and a
32 * fraction of row key / column key pairs possessing a corresponding value.
34 * <p>The mappings corresponding to a given row key may be viewed as a {@link
36 * column with a row key / value map. Note that, in some implementations, data
38 * than data access by row key.
49 * @param <R> the type of the table row keys
63 * row and column keys.
65 * @param rowKey key of row to search for
72 * row key.
74 * @param rowKey key of row t
176 Map<C, V> row(R rowKey); method in interface:Table
[all...]
/external/icu/icu4c/source/common/
H A Drbbidata.cpp231 RBBIStateTableRow *row = (RBBIStateTableRow *) local
233 RBBIDebugPrintf("%4d | %3d %3d %3d ", s, row->fAccepting, row->fLookAhead, row->fTagIdx);
235 RBBIDebugPrintf("%3d ", row->fNextState[c]);
/external/jpeg/
H A Djcprepct.c33 * For the simple (no-context-row) case, we just need to buffer one
34 * row group's worth of pixels for the downsampling step. At the bottom of
35 * the image, we pad to a full row group by replicating the last pixel row.
36 * The downsampler's last output row is then replicated if needed to pad
37 * out to a full iMCU row.
39 * When providing context rows, we must buffer three row groups' worth of
40 * pixels. Three row groups are physically allocated, but the row pointer
41 * arrays are made five row group
109 register int row; local
219 int row; local
[all...]
H A Djddctmgr.c269 * coefficients scaled by scalefactor[row]*scalefactor[col], where
325 * coefficients scaled by scalefactor[row]*scalefactor[col], where
330 int row, col; local
337 for (row = 0; row < DCTSIZE; row++) {
341 aanscalefactor[row] * aanscalefactor[col]);
H A Drdrle.c59 * then fetch the required row from the virtual array on subsequent calls.
69 JDIMENSION row; /* current row # in the virtual array */ member in struct:_rle_source_struct
71 rle_pixel** rle_row; /* holds a row returned by rle_getrow() */
181 * Read one row of pixels.
191 source->row--;
193 ((j_common_ptr) cinfo, source->image, source->row, (JDIMENSION) 1, FALSE);
199 * Read one row of pixels.
215 source->row--;
217 ((j_common_ptr) cinfo, source->image, source->row, (JDIMENSIO
244 JDIMENSION row, col; local
[all...]
/external/libhevc/common/
H A Dihevc_inter_pred_filters.c116 WORD32 row, col; local
118 for(row = 0; row < ht; row++)
178 WORD32 row, col, i; local
181 for(row = 0; row < ht; row++)
251 WORD32 row, col, i; local
254 for(row
324 WORD32 row, col; local
390 WORD32 row, col, i; local
461 WORD32 row, col, i; local
531 WORD32 row, col, i; local
606 WORD32 row, col, i; local
678 WORD32 row, col; local
743 WORD32 row, col, i; local
825 WORD32 row, col, i; local
900 WORD32 row, col; local
966 WORD32 row, col, i; local
1042 WORD32 row, col, i; local
1113 WORD32 row, col, i; local
1190 WORD32 row, col, i; local
[all...]
H A Dihevc_weighted_pred.c117 WORD32 row, col; local
120 for(row = 0; row < ht; row++)
202 WORD32 row, col; local
205 for(row = 0; row < ht; row++)
308 WORD32 row, col; local
311 for(row
413 WORD32 row, col; local
500 WORD32 row, col; local
583 WORD32 row, col; local
[all...]
/external/libpng/arm/
H A Dfilter_neon_intrinsics.c22 /* libpng row pointers are not necessarily aligned to any particular boundary,
42 png_read_filter_row_up_neon(png_row_infop row_info, png_bytep row, argument
45 png_bytep rp = row;
46 png_bytep rp_stop = row + row_info->rowbytes;
61 png_read_filter_row_sub3_neon(png_row_infop row_info, png_bytep row, argument
64 png_bytep rp = row;
65 png_bytep rp_stop = row + row_info->rowbytes;
106 png_read_filter_row_sub4_neon(png_row_infop row_info, png_bytep row, argument
109 png_bytep rp = row;
110 png_bytep rp_stop = row
133 png_read_filter_row_avg3_neon(png_row_infop row_info, png_bytep row, png_const_bytep prev_row) argument
199 png_read_filter_row_avg4_neon(png_row_infop row_info, png_bytep row, png_const_bytep prev_row) argument
264 png_read_filter_row_paeth3_neon(png_row_infop row_info, png_bytep row, png_const_bytep prev_row) argument
330 png_read_filter_row_paeth4_neon(png_row_infop row_info, png_bytep row, png_const_bytep prev_row) argument
[all...]
/external/libpng/contrib/examples/
H A Dpngpixel.c10 * This code illustrates basic 'by-row' reading of a PNG file using libpng.
30 /* Return component 'c' of pixel 'x' from the given row. */
32 component(png_const_bytep row, png_uint_32 x, unsigned int c, argument
37 * bytes wide. Since the row fitted into memory, however, the following must
43 row = (png_const_bytep)(((PNG_CONST png_byte (*)[8])row) + bit_offset_hi);
44 row += bit_offset_lo >> 3;
53 case 1: return (row[0] >> (7-bit_offset_lo)) & 0x01;
54 case 2: return (row[0] >> (6-bit_offset_lo)) & 0x03;
55 case 4: return (row[
71 print_pixel(png_structp png_ptr, png_infop info_ptr, png_const_bytep row, png_uint_32 x) argument
154 volatile png_bytep row = NULL; local
[all...]

Completed in 6080 milliseconds

1234567891011>>