Searched refs:Iter (Results 51 - 75 of 228) sorted by relevance

12345678910

/external/libcxx/test/std/algorithms/alg.sorting/alg.permutation.generators/
H A Dnext_permutation.pass.cpp12 // template<BidirectionalIterator Iter>
13 // requires ShuffleIterator<Iter>
14 // && LessThanComparable<Iter::value_type>
16 // next_permutation(Iter first, Iter last);
33 template <class Iter>
47 x = std::next_permutation(Iter(ia), Iter(ia+e));
H A Dnext_permutation_comp.pass.cpp12 // template<BidirectionalIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
13 // requires ShuffleIterator<Iter>
16 // next_permutation(Iter first, Iter last, Compare comp);
34 template <class Iter>
49 x = std::next_permutation(Iter(ia), Iter(ia+e), C());
H A Dprev_permutation.pass.cpp12 // template<BidirectionalIterator Iter>
13 // requires ShuffleIterator<Iter>
14 // && LessThanComparable<Iter::value_type>
16 // prev_permutation(Iter first, Iter last);
33 template <class Iter>
47 x = std::prev_permutation(Iter(ia), Iter(ia+e));
H A Dprev_permutation_comp.pass.cpp12 // template<BidirectionalIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
13 // requires ShuffleIterator<Iter>
16 // prev_permutation(Iter first, Iter last, Compare comp);
34 template <class Iter>
49 x = std::prev_permutation(Iter(ia), Iter(ia+e), C());
/external/v8/test/cctest/
H A Dtest-gc-tracer.cc39 typedef RingBuffer<int, max_size>::const_iterator Iter; typedef
54 for (Iter iter = ring_buffer.begin(); iter != ring_buffer.end(); ++iter) {
62 Iter iter = ring_buffer.back();
75 typedef RingBuffer<int, max_size>::const_iterator Iter; typedef
87 for (Iter iter = ring_buffer.begin(); iter != ring_buffer.end(); ++iter) {
95 Iter iter = ring_buffer.back();
108 typedef RingBuffer<int, max_size>::const_iterator Iter; typedef
120 for (Iter iter = ring_buffer.begin(); iter != ring_buffer.end(); ++iter) {
/external/skia/include/core/
H A DSkOSFile.h93 class Iter { class in class:SkOSFile
95 Iter();
96 Iter(const char path[], const char suffix[] = NULL);
97 ~Iter();
H A DSkTInternalLList.h177 class Iter { class in class:SkTInternalLList
184 Iter() : fCurr(NULL) {} function in class:SkTInternalLList::Iter
185 Iter(const Iter& iter) : fCurr(iter.fCurr) {} function in class:SkTInternalLList::Iter
186 Iter& operator= (const Iter& iter) { fCurr = iter.fCurr; return *this; }
229 Iter iter;
230 for (T* item = iter.init(*this, Iter::kHead_IterStart); item; item = iter.next()) {
H A DSkMetaData.h129 class Iter;
130 friend class Iter;
132 class Iter { class in class:SkMetaData
134 Iter() : fRec(NULL) {} function in class:SkMetaData::Iter
135 Iter(const SkMetaData&);
H A DSkClipStack.h363 class Iter { class in class:SkClipStack
366 kBottom_IterStart = SkDeque::Iter::kFront_IterStart,
367 kTop_IterStart = SkDeque::Iter::kBack_IterStart
373 Iter();
375 Iter(const SkClipStack& stack, IterStart startLoc);
397 SkDeque::Iter fIter;
402 * It inherits privately from Iter to prevent access to reverse iteration.
404 class B2TIter : private Iter {
409 * Wrap Iter's 2 parameter ctor to force initialization to the
416 using Iter
[all...]
/external/bison/src/
H A Dstate.h151 #define FOR_EACH_SHIFT(Transitions, Iter) \
152 for (Iter = 0; \
153 Iter < Transitions->num \
154 && (TRANSITION_IS_DISABLED (Transitions, Iter) \
155 || TRANSITION_IS_SHIFT (Transitions, Iter)); \
156 ++Iter) \
157 if (!TRANSITION_IS_DISABLED (Transitions, Iter))
/external/skia/src/gpu/
H A DGrTraceMarker.cpp27 for (Iter iter = markerSet.begin(); iter != markerSet.end(); ++iter) {
97 GrTraceMarkerSet::Iter GrTraceMarkerSet::begin() const {
98 return Iter(this, 0);
101 GrTraceMarkerSet::Iter GrTraceMarkerSet::end() const {
102 return Iter(this, this->fMarkerArray.count());
H A DGrRedBlackTree.h58 class Iter;
65 Iter insert(const T& t);
85 Iter begin();
91 Iter end();
96 Iter last();
103 Iter find(const T& t);
110 Iter findFirst(const T& t);
117 Iter findLast(const T& t);
131 void remove(const Iter& iter) { deleteAtNode(iter.fN); }
184 class GrRedBlackTree<T,C>::Iter { class in class:GrRedBlackTree
186 Iter() {}; function in class:GrRedBlackTree::Iter
187 Iter(const Iter& i) {fN = i.fN; fTree = i.fTree;} function in class:GrRedBlackTree::Iter
217 explicit Iter(Node* n, GrRedBlackTree* tree) { function in class:GrRedBlackTree::Iter
[all...]
/external/skia/src/ports/
H A DSkOSFile_posix.cpp103 SK_COMPILE_ASSERT(sizeof(SkOSFileIterData) <= SkOSFile::Iter::kStorageSize, not_enough_space);
105 SkOSFile::Iter::Iter() { function in class:SkOSFile::Iter
109 SkOSFile::Iter::Iter(const char path[], const char suffix[]) { function in class:SkOSFile::Iter
114 SkOSFile::Iter::~Iter() {
122 void SkOSFile::Iter::reset(const char path[], const char suffix[]) {
147 bool SkOSFile::Iter::next(SkString* name, bool getDir) {
H A DSkOSFile_win.cpp131 SK_COMPILE_ASSERT(sizeof(SkOSFileIterData) <= SkOSFile::Iter::kStorageSize, not_enough_space);
158 SkOSFile::Iter::Iter() { function in class:SkOSFile::Iter
162 SkOSFile::Iter::Iter(const char path[], const char suffix[]) { function in class:SkOSFile::Iter
167 SkOSFile::Iter::~Iter() {
176 void SkOSFile::Iter::reset(const char path[], const char suffix[]) {
228 bool SkOSFile::Iter::next(SkString* name, bool getDir) {
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.fill/
H A Dfill_n.pass.cpp12 // template<class Iter, IntegralLike Size, class T>
13 // requires OutputIterator<Iter, const T&>
15 // fill_n(Iter first, Size n, const T& value);
25 template <class Iter>
31 assert(std::fill_n(Iter(ca), UDI(n), char(1)) == std::next(Iter(ca), n));
38 template <class Iter>
44 assert(std::fill_n(Iter(ia), UDI(n), 1) == std::next(Iter(ia), n));
/external/skia/src/core/
H A DSkRWBuffer.h30 class Iter { class in class:SkROBuffer
32 Iter(const SkROBuffer*);
H A DSkClipStack.cpp621 Iter iter(*this, Iter::kTop_IterStart);
650 SkClipStack::Iter iter(*this, SkClipStack::Iter::kBottom_IterStart);
675 SkDeque::Iter iter(fDeque, SkDeque::Iter::kBack_IterStart);
750 SkClipStack::Iter::Iter() : fStack(NULL) { function in class:SkClipStack::Iter
753 SkClipStack::Iter::Iter(cons function in class:SkClipStack::Iter
[all...]
/external/llvm/include/llvm/TableGen/
H A DSetTheory.h127 template<typename Iter>
128 void evaluate(Iter begin, Iter end, RecSet &Elts, ArrayRef<SMLoc> Loc) {
/external/llvm/tools/llvm-pdbdump/
H A DLinePrinter.h40 template <typename Iter>
41 void SetFilters(std::list<Regex> &List, Iter Begin, Iter End) {
/external/libcxx/test/support/
H A Dtest_iterators.h309 template <class Iter>
310 inline Iter base(output_iterator<Iter> i) { return i.base(); }
312 template <class Iter>
313 inline Iter base(input_iterator<Iter> i) { return i.base(); }
315 template <class Iter>
316 inline Iter base(forward_iterator<Iter> i) { return i.base(); }
318 template <class Iter>
[all...]
/external/clang/lib/StaticAnalyzer/Checkers/
H A DCastSizeChecker.cpp56 RecordDecl::field_iterator Iter(RD->field_begin());
59 for (; Iter != End; ++Iter)
60 Last = *Iter;
/external/skia/tests/
H A DGrRedBlackTreeTest.cpp26 Tree::Iter xi = tree.insert(x);
44 for (Tree::Iter a = tree.begin(); tree.end() != a; ++a) {
45 Tree::Iter b = a;
60 Tree::Iter iter = tree.findFirst(i);
90 Tree::Iter iter;
138 for (Tree::Iter a = tree.begin(); tree.end() != a; ++a) {
139 Tree::Iter b = a;
151 Tree::Iter iter = tree.findFirst(i);
H A DGrOrderedSetTest.cpp28 Set::Iter xi = set.insert(x);
50 for (Set::Iter a = set.begin(); set.end() != a; ++a) {
51 Set::Iter b = a;
96 for (Set::Iter a = set.begin(); set.end() != a; ++a) {
97 Set::Iter b = a;
/external/llvm/include/llvm/ADT/
H A DSparseBitVector.h315 ElementListConstIter Iter;
334 Iter = BitVector->Elements.begin();
335 BitNumber = Iter->index() * ElementSize;
336 unsigned BitPos = Iter->find_first();
339 Bits = Iter->word(WordNumber);
355 int NextSetBitNumber = Iter->find_next(BitNumber % ElementSize) ;
358 ++Iter;
362 if (Iter == BitVector->Elements.end()) {
367 BitNumber = Iter->index() * ElementSize;
368 NextSetBitNumber = Iter
[all...]
/external/llvm/lib/Object/
H A DIRObjectFile.cpp159 Module::const_iterator Iter(static_cast<const Function*>(GV));
160 ++Iter;
161 Res = skipEmpty(Iter, *M);
165 Module::const_global_iterator Iter(static_cast<const GlobalVariable*>(GV));
166 ++Iter;
167 Res = skipEmpty(Iter, *M);
171 Module::const_alias_iterator Iter(static_cast<const GlobalAlias*>(GV));
172 ++Iter;
173 Res = skipEmpty(Iter, *M);

Completed in 677 milliseconds

12345678910