| /external/eigen/Eigen/src/Core/ |
| ForceAlignedAccess.h | 49 inline const CoeffReturnType coeff(Index row, Index col) const
51 return m_expression.coeff(row, col);
54 inline Scalar& coeffRef(Index row, Index col)
56 return m_expression.const_cast_derived().coeffRef(row, col);
70 inline const PacketScalar packet(Index row, Index col) const
72 return m_expression.template packet<Aligned>(row, col);
76 inline void writePacket(Index row, Index col, const PacketScalar& x)
78 m_expression.const_cast_derived().template writePacket<Aligned>(row, col, x);
|
| SelfAdjointView.h | 83 inline Scalar coeff(Index row, Index col) const
85 Base::check_coordinates_internal(row, col);
86 return m_matrix.coeff(row, col);
92 inline Scalar& coeffRef(Index row, Index col)
94 Base::check_coordinates_internal(row, col);
95 return m_matrix.const_cast_derived().coeffRef(row, col);
208 col = (UnrollCount-1) / Derived1::RowsAtCompileTime, enumerator in enum:Eigen::internal::triangular_assignment_selector::__anon255
216 if(row == col)
217 dst.coeffRef(row, col) = numext::real(src.coeff(row, col));
233 col = (UnrollCount-1) \/ Derived1::RowsAtCompileTime, enumerator in enum:Eigen::internal::triangular_assignment_selector::__anon256
[all...] |
| Reverse.h | 110 inline Scalar& operator()(Index row, Index col)
112 eigen_assert(row >= 0 && row < rows() && col >= 0 && col < cols());
113 return coeffRef(row, col);
116 inline Scalar& coeffRef(Index row, Index col)
119 ReverseCol ? m_matrix.cols() - col - 1 : col);
122 inline CoeffReturnType coeff(Index row, Index col) const
125 ReverseCol ? m_matrix.cols() - col - 1 : col);
[all...] |
| /external/eigen/test/ |
| eigen2support.cpp | 41 VERIFY_IS_EQUAL((m1.col(0).start(1)), (m1.col(0).segment(0,1)));
42 VERIFY_IS_EQUAL((m1.col(0).template start<1>()), (m1.col(0).segment(0,1)));
43 VERIFY_IS_EQUAL((m1.col(0).end(1)), (m1.col(0).segment(rows-1,1)));
44 VERIFY_IS_EQUAL((m1.col(0).template end<1>()), (m1.col(0).segment(rows-1,1)));
|
| product_syrk.cpp | 77 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(m1.col(c),s1)._expression()),
78 ((s1 * m1.col(c) * m1.col(c).adjoint()).eval().template triangularView<Lower>().toDenseMatrix()));
81 VERIFY_IS_APPROX((m2.template selfadjointView<Upper>().rankUpdate(m1.col(c),s1)._expression()),
82 ((s1 * m1.col(c) * m1.col(c).adjoint()).eval().template triangularView<Upper>().toDenseMatrix()));
84 VERIFY_IS_APPROX((rm2.template selfadjointView<Upper>().rankUpdate(m1.col(c),s1)._expression()),
85 ((s1 * m1.col(c) * m1.col(c).adjoint()).eval().template triangularView<Upper>().toDenseMatrix()));
87 VERIFY_IS_APPROX((m2.template triangularView<Upper>() += s1 * m3.col(c) * m1.col(c).adjoint()).nestedExpression()
[all...] |
| /external/eigen/Eigen/src/Core/products/ |
| CoeffBasedProduct.h | 163 EIGEN_STRONG_INLINE const Scalar coeff(Index row, Index col) const
166 ScalarCoeffImpl::run(row, col, m_lhs, m_rhs, res);
177 const Index col = RowsAtCompileTime == 1 ? index : 0; local
178 ScalarCoeffImpl::run(row, col, m_lhs, m_rhs, res);
183 EIGEN_STRONG_INLINE const PacketScalar packet(Index row, Index col) const
189 ::run(row, col, m_lhs, m_rhs, res);
242 static EIGEN_STRONG_INLINE void run(Index row, Index col, const Lhs& lhs, const Rhs& rhs, RetScalar &res)
244 product_coeff_impl<DefaultTraversal, UnrollingIndex-1, Lhs, Rhs, RetScalar>::run(row, col, lhs, rhs, res);
245 res += lhs.coeff(row, UnrollingIndex) * rhs.coeff(UnrollingIndex, col);
253 static EIGEN_STRONG_INLINE void run(Index row, Index col, const Lhs& lhs, const Rhs& rhs, RetScalar &res
[all...] |
| /external/eigen/bench/ |
| eig33.cpp | 123 // evecs.col(k) = (base + Vector(-beta*scaledMat(2,0), -alpha*scaledMat(2,1), alpha*beta)).normalized();
125 // evecs.col(2) = evecs.col(0).cross(evecs.col(1)).normalized();
131 // evecs.col(0) = tmp.row(0).cross(tmp.row(1)).normalized();
135 // evecs.col(1) = tmp.row(0).cross(tmp.row(1)).normalized();
139 // evecs.col(2) = tmp.row(0).cross(tmp.row(1)).normalized();
151 evecs.col (2) = tmp.row (0).cross (tmp.row (1)).normalized ();
155 evecs.col(1) = tmp.row (0).cross(tmp.row (1));
156 Scalar n1 = evecs.col(1).norm()
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| TriangularSolver.h | 33 for(int col=0 ; col<other.cols() ; ++col)
37 Scalar tmp = other.coeff(i,col);
46 tmp -= lastVal * other.coeff(lastIndex,col);
49 other.coeffRef(i,col) = tmp;
53 other.coeffRef(i,col) = tmp/lastVal;
67 for(int col=0 ; col<other.cols() ; ++col)
[all...] |
| SparseTranspose.h | 43 typename TransposeImpl<MatrixType,Sparse>::Index row() const { return Base::col(); }
44 typename TransposeImpl<MatrixType,Sparse>::Index col() const { return Base::row(); } function in class:Eigen::TransposeImpl::InnerIterator
57 typename TransposeImpl<MatrixType,Sparse>::Index row() const { return Base::col(); }
58 typename TransposeImpl<MatrixType,Sparse>::Index col() const { return Base::row(); } function in class:Eigen::TransposeImpl::ReverseInnerIterator
|
| /external/aac/libSBRdec/src/ |
| sbrdec_drc.cpp | 185 \col Number of the time slot.
195 int col,
225 col += indx;
230 if (col < (numQmfSubSamples>>1)) { /* first half of current frame */
232 int j = col + (numQmfSubSamples>>1);
254 else if (col < numQmfSubSamples) { /* second half of current frame */
256 int j = col - (numQmfSubSamples>>1);
295 int j = col - (numQmfSubSamples>>1);
317 col -= numQmfSubSamples;
379 if (col == (numQmfSubSamples>>1)-1)
487 int col; local
[all...] |
| /external/ceres-solver/internal/ceres/ |
| block_random_access_matrix.h | 73 // int row, col, row_stride, col_stride;
75 // &row, &col,
81 // m.block(row, col, row_block_size, col_block_size) = ...
107 // (row, col) within this matrix.
115 int* col,
|
| dynamic_compressed_row_sparse_matrix.cc | 49 int col,
53 CHECK_GE(col, 0);
54 CHECK_LT(col, num_cols());
55 dynamic_cols_[row].push_back(col);
|
| dynamic_compressed_row_sparse_matrix.h | 77 void InsertEntry(int row, int col, const double& value);
|
| small_blas.h | 165 for (int col = 0; col < NUM_COL_C; ++col) {
168 tmp += A[row * NUM_COL_A + k] * B[k * NUM_COL_B + col];
171 const int index = (row + start_row_c) * col_stride_c + start_col_c + col;
225 for (int col = 0; col < NUM_COL_C; ++col) {
228 tmp += A[k * NUM_COL_A + row] * B[k * NUM_COL_B + col];
231 const int index = (row + start_row_c) * col_stride_c + start_col_c + col;
[all...] |
| /external/eigen/doc/examples/ |
| Tutorial_ReductionsVisitorsBroadcasting_broadcast_1nn.cpp | 23 cout << m.col(index) << endl;
|
| /external/libvpx/libvpx/vp9/common/ |
| vp9_tile_common.h | 25 // initializes 'tile->mi_(row|col)_(start|end)' for (row, col) based on
28 int row, int col);
|
| /developers/demos/JustForUs/justforus/src/main/java/com/example/android/justforus/ |
| AssetProvider.java | 149 for (int col = 0; col < projection.length; col++) {
150 if (OpenableColumns.DISPLAY_NAME.equals(projection[col])) {
151 row[col] = path;
152 } else if (OpenableColumns.SIZE.equals(projection[col])) {
156 row[col] = Long.valueOf(afd.getLength());
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/ |
| lookahead.c | 112 int row, col, active_end; local
130 col = 0;
135 for (; col < mb_cols; ++col)
137 if (active_map[col])
142 if (col == mb_cols)
146 active_end = col;
157 col << 4, 16,
158 (active_end - col) << 4);
161 col = active_end
[all...] |
| /external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/ |
| vp9_lookahead.c | 94 int row, col, active_end; local
114 col = 0;
118 for (; col < mb_cols; ++col) {
119 if (active_map[col])
124 if (col == mb_cols)
128 active_end = col;
138 col << 4, 16,
139 (active_end - col) << 4);
142 col = active_end
[all...] |
| /external/libhevc/common/ |
| ihevc_padding.c | 150 //WORD32 col;
439 WORD32 col; local
450 for(col = -pad_size; col < 0; col++)
451 pu2_src[col] = u2_uv_val;
560 WORD32 col; local
571 for(col = 0; col < pad_size; col++
[all...] |
| /external/libvpx/libvpx/vp8/encoder/ |
| lookahead.c | 112 int row, col, active_end; local
130 col = 0;
135 for (; col < mb_cols; ++col)
137 if (active_map[col])
142 if (col == mb_cols)
146 active_end = col;
157 col << 4, 16,
158 (active_end - col) << 4);
161 col = active_end
[all...] |
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_lookahead.c | 97 int row, col, active_end; local
117 col = 0;
121 for (; col < mb_cols; ++col) {
122 if (active_map[col])
127 if (col == mb_cols)
131 active_end = col;
141 col << 4, 16,
142 (active_end - col) << 4);
145 col = active_end
[all...] |
| /external/libvterm/src/ |
| state.c | 32 fprintf(stderr, "libvterm: Unhandled putglyph U+%04x at (%d,%d)\n", chars[0], pos.col, pos.row);
37 if(state->pos.col == oldpos->col && state->pos.row == oldpos->row)
121 static void set_col_tabstop(VTermState *state, int col)
123 unsigned char mask = 1 << (col & 7);
124 state->tabstops[col >> 3] |= mask;
127 static void clear_col_tabstop(VTermState *state, int col)
129 unsigned char mask = 1 << (col & 7);
130 state->tabstops[col >> 3] &= ~mask;
133 static int is_col_tabstop(VTermState *state, int col)
855 int row, col; local
1416 int col; local
[all...] |
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/thirdparty/coverage/ |
| phystokens.py | 79 col = 0
88 col = 0
95 if mark_start and scol > col:
96 line.append(("ws", " " * (scol - col)))
105 col = ecol
|
| /external/chromium_org/third_party/freetype/src/base/ |
| ftlcdfil.c | 109 FT_Byte* col = column; local
114 val1 = col[0];
120 col += pitch;
122 val1 = col[0];
127 col += pitch;
134 val = col[0];
143 col[-2 * pitch] = (FT_Byte)pix;
144 col += pitch;
153 col[-2 * pitch] = (FT_Byte)pix;
157 col[-pitch] = (FT_Byte)pix
233 FT_Byte* col = column; local
[all...] |
