| /external/chromium_org/third_party/WebKit/public/platform/ |
| WebIDBMetadata.h | 44 struct Index;
65 WebVector<Index> indexes;
71 struct Index {
77 Index()
|
| /external/eigen/Eigen/src/Core/ |
| Swap.h | 38 inline Index rows() const { return m_expression.rows(); }
39 inline Index cols() const { return m_expression.cols(); }
40 inline Index outerStride() const { return m_expression.outerStride(); }
41 inline Index innerStride() const { return m_expression.innerStride(); }
52 inline Scalar& coeffRef(Index row, Index col)
57 inline Scalar& coeffRef(Index index)
59 return m_expression.const_cast_derived().coeffRef(index);
62 inline Scalar& coeffRef(Index row, Index col) cons
[all...] |
| Block.h | 27 * type of DenseBase::block(Index,Index,Index,Index) and DenseBase::block<int,int>(Index,Index) and
46 * \sa DenseBase::block(Index,Index,Index,Index), DenseBase::block(Index,Index), class VectorBloc
[all...] |
| PlainObjectBase.h | 24 template<typename Index>
25 EIGEN_ALWAYS_INLINE void check_rows_cols_for_overflow(Index rows, Index cols)
28 // we assume Index is signed
29 Index max_index = (size_t(1) << (8 * sizeof(Index) - 1)) - 1; // assume Index is signed
80 typedef typename internal::traits<Derived>::Index Index;
119 EIGEN_STRONG_INLINE Index rows() const { return m_storage.rows();
[all...] |
| Transpositions.h | 56 typedef typename IndicesType::Scalar Index;
81 inline Index size() const { return indices().size(); }
83 /** Direct access to the underlying index vector */
84 inline const Index& coeff(Index i) const { return indices().coeff(i); }
85 /** Direct access to the underlying index vector */
86 inline Index& coeffRef(Index i) { return indices().coeffRef(i); }
87 /** Direct access to the underlying index vector */
88 inline const Index& operator()(Index i) const { return indices()(i);
[all...] |
| CwiseNullaryOp.h | 57 CwiseNullaryOp(Index rows, Index cols, const NullaryOp& func = NullaryOp())
66 EIGEN_STRONG_INLINE Index rows() const { return m_rows.value(); }
67 EIGEN_STRONG_INLINE Index cols() const { return m_cols.value(); }
69 EIGEN_STRONG_INLINE const Scalar coeff(Index rows, Index cols) const
75 EIGEN_STRONG_INLINE PacketScalar packet(Index row, Index col) const
80 EIGEN_STRONG_INLINE const Scalar coeff(Index index) cons
[all...] |
| DiagonalProduct.h | 57 inline Index rows() const { return m_matrix.rows(); }
58 inline Index cols() const { return m_matrix.cols(); }
60 const Scalar coeff(Index row, Index col) const
66 EIGEN_STRONG_INLINE PacketScalar packet(Index row, Index col) const
71 const Index indexInDiagonalVector = ProductOrder == OnTheLeft ? row : col;
80 EIGEN_STRONG_INLINE PacketScalar packet_impl(Index row, Index col, Index id, internal::true_type) cons
[all...] |
| /external/eigen/Eigen/src/misc/ |
| Image.h | 41 typedef typename Base::Index Index;
49 inline Index rows() const { return m_dec.rows(); }
50 inline Index cols() const { return m_cols; }
51 inline Index rank() const { return m_rank; }
62 Index m_rank, m_cols;
72 typedef typename MatrixType::Index Index; \
|
| /external/eigen/doc/examples/ |
| Tutorial_ReductionsVisitorsBroadcasting_visitors.cpp | 15 MatrixXf::Index maxRow, maxCol;
19 MatrixXf::Index minRow, minCol;
|
| /external/eigen/test/ |
| miscmatrices.cpp | 17 typedef typename MatrixType::Index Index;
21 Index rows = m.rows();
22 Index cols = m.cols();
24 Index r = internal::random<Index>(0, rows-1), r2 = internal::random<Index>(0, rows-1), c = internal::random<Index>(0, cols-1);
|
| nullary.cpp | 15 typedef typename MatrixType::Index Index;
20 for (Index i = 0; i < A.rows(); ++i) {
21 for (Index j = i+1; j < A.cols(); ++j) {
25 for (Index i = 0; i < A.rows(); ++i) {
26 for (Index j = 0; j < (std::min)(i, A.cols()); ++j) {
38 typedef typename internal::traits<VectorType>::Index Index;
41 const Index size = base.size();
99 typedef typename MatrixType::Index Index
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseMatrixBase.h | 33 typedef typename internal::traits<Derived>::Index Index;
147 inline Index rows() const { return derived().rows(); }
149 inline Index cols() const { return derived().cols(); }
152 inline Index size() const { return rows() * cols(); }
155 inline Index nonZeros() const { return derived().nonZeros(); }
163 Index outerSize() const { return (int(Flags)&RowMajorBit) ? this->rows() : this->cols(); }
166 Index innerSize() const { return (int(Flags)&RowMajorBit) ? this->cols() : this->rows(); }
202 const Index outerSize = (int(OtherDerived::Flags) & RowMajorBit) ? other.rows() : other.cols();
209 for (Index j=0; j<outerSize; ++j
[all...] |
| AmbiVector.h | 27 typedef _Index Index;
30 AmbiVector(Index size)
39 Index nonZeros() const;
42 void setBounds(Index start, Index end) { m_start = start; m_end = end; }
47 Scalar& coeffRef(Index i);
48 Scalar& coeff(Index i);
54 void resize(Index size)
61 Index size() const { return m_size; }
65 void reallocate(Index size
103 Index index; member in struct:Eigen::internal::AmbiVector::ListEl
[all...] |
| /external/llvm/include/llvm/Object/ |
| MachOUniversal.h | 35 /// \brief Index of object in the universal binary.
36 uint32_t Index;
41 ObjectForArch(const MachOUniversalBinary *Parent, uint32_t Index);
45 Index = 0;
49 return (Parent == Other.Parent) && (Index == Other.Index);
52 ObjectForArch getNext() const { return ObjectForArch(Parent, Index + 1); }
|
| /external/eigen/Eigen/src/QR/ |
| HouseholderQR.h | 56 typedef typename MatrixType::Index Index;
76 HouseholderQR(Index rows, Index cols)
162 inline Index rows() const { return m_qr.rows(); }
163 inline Index cols() const { return m_qr.cols(); }
195 typedef typename MatrixQR::Index Index;
198 Index rows = mat.rows();
199 Index cols = mat.cols()
[all...] |
| /external/eigen/Eigen/src/Eigenvalues/ |
| RealSchur.h | 67 typedef typename MatrixType::Index Index;
83 RealSchur(Index size = RowsAtCompileTime==Dynamic ? 1 : RowsAtCompileTime)
195 Index findSmallSubdiagEntry(Index iu, Scalar norm);
196 void splitOffTwoRows(Index iu, bool computeU, Scalar exshift);
197 void computeShift(Index iu, Index iter, Scalar& exshift, Vector3s& shiftInfo);
198 void initFrancisQRStep(Index il, Index iu, const Vector3s& shiftInfo, Index& im, Vector3s& firstHouseholderVector)
[all...] |
| /external/eigen/Eigen/src/Core/products/ |
| TriangularMatrixMatrix_MKL.h | 41 template <typename Scalar, typename Index,
47 product_triangular_matrix_matrix<Scalar,Index,Mode,
54 template <typename Index, int Mode, \
57 struct product_triangular_matrix_matrix<Scalar,Index, Mode, LhsIsTriangular, \
59 static inline void run(Index _rows, Index _cols, Index _depth, const Scalar* _lhs, Index lhsStride,\
60 const Scalar* _rhs, Index rhsStride, Scalar* res, Index resStride, Scalar alpha) {
[all...] |
| SelfadjointMatrixMatrix_MKL.h | 44 template <typename Index, \
47 struct product_selfadjoint_matrix<EIGTYPE,Index,LhsStorageOrder,true,ConjugateLhs,RhsStorageOrder,false,ConjugateRhs,ColMajor> \
51 Index rows, Index cols, \
52 const EIGTYPE* _lhs, Index lhsStride, \
53 const EIGTYPE* _rhs, Index rhsStride, \
54 EIGTYPE* res, Index resStride, \
96 template <typename Index, \
99 struct product_selfadjoint_matrix<EIGTYPE,Index,LhsStorageOrder,true,ConjugateLhs,RhsStorageOrder,false,ConjugateRhs,ColMajor> \
102 Index rows, Index cols,
[all...] |
| GeneralMatrixMatrix_MKL.h | 51 typename Index, \
54 struct general_matrix_matrix_product<Index,EIGTYPE,LhsStorageOrder,ConjugateLhs,EIGTYPE,RhsStorageOrder,ConjugateRhs,ColMajor> \
56 static void run(Index rows, Index cols, Index depth, \
57 const EIGTYPE* _lhs, Index lhsStride, \
58 const EIGTYPE* _rhs, Index rhsStride, \
59 EIGTYPE* res, Index resStride, \
62 GemmParallelInfo<Index>* /*info = 0*/) \
|
| /external/eigen/Eigen/src/Geometry/ |
| EulerAngles.h | 33 MatrixBase<Derived>::eulerAngles(Index a0, Index a1, Index a2) const
42 const Index odd = ((a0+1)%3 == a1) ? 0 : 1;
43 const Index i = a0;
44 const Index j = (a0 + 1 + odd)%3;
45 const Index k = (a0 + 2 - odd)%3;
|
| /external/eigen/Eigen/src/LU/ |
| PartialPivLU.h | 62 typedef typename MatrixType::Index Index;
81 PartialPivLU(Index size);
170 inline Index rows() const { return m_lu.rows(); }
171 inline Index cols() const { return m_lu.cols(); }
177 Index m_det_p;
192 PartialPivLU<MatrixType>::PartialPivLU(Index size)
227 typedef typename MatrixType::Index Index;
237 * \returns The index of the first pivot which is exactly zero if any, or a negative number otherwise
[all...] |
| /external/chromium_org/third_party/angle_dx11/samples/gles2_book/Common/Win32/ |
| esUtil_TGA.c | 103 int Index= y * (*width) + x;
106 Index= ((*height) - 1 - y) * (*width) + x;
108 (*buffer)[(i * 3)]= Buffer24[Index].rgbtRed;
109 (*buffer)[(i * 3) + 1]= Buffer24[Index].rgbtGreen;
110 (*buffer)[(i * 3) + 2]= Buffer24[Index].rgbtBlue;
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| r1mpyq.h | 10 typedef DenseIndex Index;
13 for (Index j = n-2; j>=0; --j)
14 for (Index i = 0; i<m; ++i) {
20 for (Index j = 0; j<n-1; ++j)
21 for (Index i = 0; i<m; ++i) {
|
| /external/llvm/include/llvm/Option/ |
| Arg.h | 49 /// \brief The index at which this argument appears in the containing
51 unsigned Index;
65 Arg(const Option Opt, StringRef Spelling, unsigned Index,
67 Arg(const Option Opt, StringRef Spelling, unsigned Index,
69 Arg(const Option Opt, StringRef Spelling, unsigned Index,
75 unsigned getIndex() const { return Index; }
|
| /external/llvm/lib/Analysis/ |
| RegionPass.cpp | 69 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
70 RegionPass *RP = (RegionPass *)getContainedPass(Index);
83 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
84 RegionPass *P = (RegionPass*)getContainedPass(Index);
136 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index)
[all...] |
