| /external/eigen/unsupported/test/ |
| matrix_functions.h | 20 static void run(MatrixType& result, typename MatrixType::Index size)
25 for (typename MatrixType::Index i = 0; i < size; ++i) {
37 static void run(MatrixType& result, typename MatrixType::Index size)
|
| /external/llvm/lib/DebugInfo/PDB/DIA/ |
| DIADataStream.cpp | 37 DIADataStream::getItemAtIndex(uint32_t Index) const {
40 StreamData->Item(Index, 0, &RecordSize, nullptr);
45 if (S_OK != StreamData->Item(Index, RecordSize, &RecordSize, &Record[0]))
|
| /external/pdfium/third_party/bigint/ |
| BigIntegerUtils.hh | 26 BigInteger dataToBigInteger(const T* data, BigInteger::Index length, BigInteger::Sign sign);
51 BigInteger dataToBigInteger(const T* data, BigInteger::Index length, BigInteger::Sign sign) {
60 BigInteger::Index blockNum, pieceNum, pieceNumHere;
|
| BigUnsignedInABase.hh | 51 BigUnsignedInABase(int, Index c) : NumberlikeArray<Digit>(0, c) {}
73 BigUnsignedInABase(const Digit *d, Index l, Base base);
114 Digit getDigit(Index i) const { return i >= len ? 0 : blk[i]; }
|
| BigInteger.hh | 23 typedef BigUnsigned::Index Index;
47 BigInteger(const Blk *b, Index blen, Sign s);
50 BigInteger(const Blk *b, Index blen) : mag(b, blen) {
92 Index getLength() const { return mag.getLength(); }
93 Index getCapacity() const { return mag.getCapacity(); }
94 Blk getBlock(Index i) const { return mag.getBlock(i); }
|
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| r3xx_vertprog.c | 77 return vp->outputs[dst->Index];
79 return dst->Index;
110 if (a.Index != b.Index)
126 assert(vp->inputs[src->Index] != -1);
127 return vp->inputs[src->Index];
129 if (src->Index < 0) {
134 return src->Index;
177 if (dst->File == RC_FILE_OUTPUT && vp->outputs[dst->Index] == -1) {
180 assert(dst->Index == 0)
[all...] |
| radeon_program_tex.c | 69 inst_mov->U.I.DstReg.Index = temp;
72 inst_mov->U.I.SrcReg[1].Index =
78 inst->U.I.SrcReg[0].Index = temp;
91 inst_rcp->U.I.DstReg.Index = temp;
102 inst_mul->U.I.DstReg.Index = temp;
105 inst_mul->U.I.SrcReg[1].Index = temp;
111 inst->U.I.SrcReg[0].Index = temp;
172 inst->U.I.DstReg.Index = tmp_texsample;
182 inst_rcp->U.I.DstReg.Index = tmp_sum;
193 inst_mul->U.I.DstReg.Index = tmp_sum
[all...] |
| /external/eigen/Eigen/src/SVD/ |
| JacobiSVD.h | 54 typedef typename MatrixType::Index Index;
68 typedef typename MatrixType::Index Index;
109 typedef typename MatrixType::Index Index;
159 typedef typename MatrixType::Index Index;
200 typedef typename MatrixType::Index Index;
[all...] |
| UpperBidiagonalization.h | 31 typedef typename MatrixType::Index Index;
91 Index rows = matrix.rows();
92 Index cols = matrix.cols();
100 for (Index k = 0; /* breaks at k==cols-1 below */ ; ++k)
102 Index remainingRows = rows - k;
103 Index remainingCols = cols - k - 1;
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| Tridiagonalization.h | 70 typedef typename MatrixType::Index Index;
113 Tridiagonalization(Index size = Size==Dynamic ? 2 : Size)
316 Index n = m_matrix.rows();
349 typedef typename MatrixType::Index Index;
352 Index n = matA.rows();
356 for (Index i = 0; i<n-1; ++i)
358 Index remainingSize = n-i-1;
441 typedef typename MatrixType::Index Index
[all...] |
| /external/eigen/test/ |
| basicstuff.cpp | 16 typedef typename MatrixType::Index Index;
21 Index rows = m.rows();
22 Index cols = m.cols();
38 Index r = internal::random<Index>(0, rows-1),
39 c = internal::random<Index>(0, cols-1);
111 for(typename MatrixType::Index i=0;i<rows;++i)
116 for(typename MatrixType::Index i=0;i<rows;++i)
121 for(typename MatrixType::Index i=0;i<rows;++i
[all...] |
| array_reverse.cpp | 18 typedef typename MatrixType::Index Index;
22 Index rows = m.rows();
23 Index cols = m.cols();
94 Index r = internal::random<Index>(0, rows-1),
95 c = internal::random<Index>(0, cols-1);
|
| linearstructure.cpp | 18 typedef typename MatrixType::Index Index;
21 Index rows = m.rows();
22 Index cols = m.cols();
33 Index r = internal::random<Index>(0, rows-1),
34 c = internal::random<Index>(0, cols-1);
|
| /external/llvm/tools/llvm-diff/ |
| DifferenceEngine.cpp | 50 unsigned Index = Storage.size();
52 if (Index == 0) return;
56 unsigned Target = (Index + 1) / 2 - 1;
57 if (!Precedes(data[Index], data[Target])) return;
58 std::swap(data[Index], data[Target]);
60 Index = Target;
78 unsigned Index = 0;
80 // With a 1-based index, the children would be Index*2 and Index*2+1
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/ |
| DebugTokenStream.cs | 53 public virtual int Index {
55 return input.Index;
80 int a = input.Index;
83 int b = input.Index;
95 int firstOnChannelTokenIndex = input.Index;
141 public virtual void Seek(int index) {
143 // db.seek(index);
144 input.Seek(index);
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/ |
| DebugTokenStream.cs | 56 public virtual int Index
60 return input.Index;
92 int a = input.Index;
95 int b = input.Index;
110 int firstOnChannelTokenIndex = input.Index;
166 public virtual void Seek( int index )
169 // db.seek(index);
170 input.Seek( index );
|
| /external/eigen/Eigen/src/Core/ |
| CommaInitializer.h | 31 typedef typename XprType::Index Index;
119 Index m_row; // current row id
120 Index m_col; // current col id
121 Index m_currentBlockRows; // current block height
|
| CwiseBinaryOp.h | 61 typedef typename promote_index_type<typename traits<Lhs>::Index,
62 typename traits<Rhs>::Index>::type Index;
134 EIGEN_STRONG_INLINE Index rows() const {
141 EIGEN_STRONG_INLINE Index cols() const {
172 EIGEN_STRONG_INLINE const Scalar coeff(Index rowId, Index colId) const
179 EIGEN_STRONG_INLINE PacketScalar packet(Index rowId, Index colId) const
185 EIGEN_STRONG_INLINE const Scalar coeff(Index index) cons
[all...] |
| Map.h | 73 typedef typename PlainObjectType::Index Index;
121 inline Index innerStride() const
126 inline Index outerStride() const
151 inline Map(PointerArgType dataPtr, Index a_size, const StrideType& a_stride = StrideType())
164 inline Map(PointerArgType dataPtr, Index nbRows, Index nbCols, const StrideType& a_stride = StrideType())
|
| /external/llvm/lib/Option/ |
| OptTable.cpp | 189 Arg *OptTable::ParseOneArg(const ArgList &Args, unsigned &Index,
192 unsigned Prev = Index;
193 const char *Str = Args.getArgString(Index);
198 return new Arg(getOption(TheInputOptionID), Str, Index++, Str);
232 if (Arg *A = Opt.accept(Args, Index, ArgSize))
236 if (Prev != Index)
243 return new Arg(getOption(TheInputOptionID), Str, Index++, Str);
245 return new Arg(getOption(TheUnknownOptionID), Str, Index++, Str);
258 unsigned Index = 0, End = ArgArr.size();
259 while (Index < End)
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseSparseProductWithPruning.h | 25 typedef typename remove_all<Lhs>::type::Index Index;
28 Index rows = lhs.innerSize();
29 Index cols = rhs.outerSize();
30 //Index size = lhs.outerSize();
34 AmbiVector<Scalar,Index> tempVector(rows);
42 Index estimated_nnz_prod = lhs.nonZeros() + rhs.nonZeros();
52 for (Index j=0; j<cols; ++j)
61 // FIXME should be written like this: tmp += rhsIt.value() * lhs.col(rhsIt.index())
64 for (typename Lhs::InnerIterator lhsIt(lhs, rhsIt.index()); lhsIt; ++lhsIt
[all...] |
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| LMqrsolv.h | 22 template <typename Scalar,int Rows, int Cols, typename Index>
25 const PermutationMatrix<Dynamic,Dynamic,Index> &iPerm,
33 Index i, j, k, l;
35 Index n = s.cols();
88 Index nsing;
102 template <typename Scalar, int _Options, typename Index>
104 SparseMatrix<Scalar,_Options,Index> &s,
112 typedef SparseMatrix<Scalar,RowMajor,Index> FactorType;
113 Index i, j, k, l;
115 Index n = s.cols()
[all...] |
| LMpar.h | 33 typedef typename QRSolver::Index Index;
36 Index j;
39 Index iter;
51 const Index n = qr.matrixR().cols();
60 // const Index rank = qr.nonzeroPivots(); // exactly double(0.)
61 const Index rank = qr.rank(); // use a threshold
137 for (Index i = j+1; i < n; ++i)
|
| /external/llvm/lib/Target/Hexagon/MCTargetDesc/ |
| HexagonMCInstrInfo.h | 75 // Return the extender for instruction at Index or nullptr if none
76 MCInst const *extenderForIndex(MCInst const &MCB, size_t Index);
89 // Return the extender for instruction at Index or nullptr if none
90 MCInst const *extenderForIndex(MCInst const &MCB, size_t Index);
111 // Return the index of the extendable operand
135 // Return the operand index for the new value.
153 // Does the packet have an extender for the instruction at Index
154 bool hasExtenderForIndex(MCInst const &MCB, size_t Index);
162 // Return the instruction at Index
163 MCInst const &instruction(MCInst const &MCB, size_t Index);
[all...] |
| /system/update_engine/payload_generator/ |
| cycle_breaker.cc | 50 // We arbitrarily order each vertex by its index in the graph. Thus,
75 vector<Vertex::Index> component_indexes;
79 for (vector<Vertex::Index>::iterator it = component_indexes.begin();
82 for (vector<Vertex::Index>::iterator jt = component_indexes.begin();
109 static_cast<vector<Vertex::Index>::size_type>(2));
113 for (vector<Vertex::Index>::const_iterator it = stack_.begin();
133 void CycleBreaker::Unblock(Vertex::Index u) {
138 Vertex::Index w = it->first;
146 for (vector<Vertex::Index>::const_iterator it = ++stack_.begin(),
156 bool CycleBreaker::Circuit(Vertex::Index vertex, Vertex::Index depth)
[all...] |
