/external/chromium_org/third_party/skia/src/core/ |
H A D | SkTLList.h | 18 const typename SkTLList<T>::Iter& location); 43 class Iter; 54 typename NodeList::Iter iter; 55 Node* node = iter.init(fList, Iter::kHead_IterStart); 107 T* addBefore(const T& t, const Iter& location) { 113 T* addAfter(const T& t, const Iter& location) { 118 Iter headIter() const { return Iter(*this, Iter::kHead_IterStart); } 119 Iter tailIte 188 class Iter : private NodeList::Iter { class in class:SkTLList 199 Iter() {} function in class:SkTLList::Iter 201 Iter(const SkTLList& list, IterStart start = kHead_IterStart) { function in class:SkTLList::Iter [all...] |
/external/skia/src/core/ |
H A D | SkTLList.h | 18 const typename SkTLList<T>::Iter& location); 43 class Iter; 54 typename NodeList::Iter iter; 55 Node* node = iter.init(fList, Iter::kHead_IterStart); 107 T* addBefore(const T& t, const Iter& location) { 113 T* addAfter(const T& t, const Iter& location) { 118 Iter headIter() const { return Iter(*this, Iter::kHead_IterStart); } 119 Iter tailIte 188 class Iter : private NodeList::Iter { class in class:SkTLList 199 Iter() {} function in class:SkTLList::Iter 201 Iter(const SkTLList& list, IterStart start = kHead_IterStart) { function in class:SkTLList::Iter [all...] |
/external/chromium_org/third_party/skia/tests/ |
H A D | LListTest.cpp | 72 typedef SkTInternalLList<ListElement>::Iter Iter; typedef 73 Iter iter; 75 ListElement* cur = iter.init(list, Iter::kHead_IterStart); 80 cur = iter.init(list, Iter::kTail_IterStart); 116 cur = iter.init(list, Iter::kHead_IterStart); 124 typedef ElList::Iter Iter; typedef 131 Iter iter1; 132 Iter iter [all...] |
/external/skia/tests/ |
H A D | LListTest.cpp | 72 typedef SkTInternalLList<ListElement>::Iter Iter; typedef 73 Iter iter; 75 ListElement* cur = iter.init(list, Iter::kHead_IterStart); 80 cur = iter.init(list, Iter::kTail_IterStart); 116 cur = iter.init(list, Iter::kHead_IterStart); 124 typedef ElList::Iter Iter; typedef 131 Iter iter1; 132 Iter iter [all...] |
/external/chromium_org/third_party/skia/src/utils/ |
H A D | SkNWayCanvas.cpp | 40 class SkNWayCanvas::Iter { class in class:SkNWayCanvas 42 Iter(const SkTDArray<SkCanvas*>& list) : fList(list) { function in class:SkNWayCanvas::Iter 61 Iter iter(fList); 71 Iter iter(fList); 82 Iter iter(fList); 90 Iter iter(fList); 98 Iter iter(fList); 106 Iter iter(fList); 114 Iter iter(fList); 122 Iter ite [all...] |
H A D | SkOSFile.cpp | 74 SkOSFile::Iter::Iter() : fHandle(0), fPath16(NULL) function in class:SkOSFile::Iter 78 SkOSFile::Iter::Iter(const char path[], const char suffix[]) : fHandle(0), fPath16(NULL) function in class:SkOSFile::Iter 83 SkOSFile::Iter::~Iter() 90 void SkOSFile::Iter::reset(const char path[], const char suffix[]) 143 bool SkOSFile::Iter::next(SkString* name, bool getDir) 170 SkOSFile::Iter::Iter() function in class:SkOSFile::Iter 174 SkOSFile::Iter::Iter(const char path[], const char suffix[]) : fDIR(0) function in class:SkOSFile::Iter [all...] |
/external/libcxx/test/algorithms/alg.modifying.operations/alg.remove/ |
H A D | remove_if.pass.cpp | 12 // template<ForwardIterator Iter, Predicate<auto, Iter::value_type> Pred> 13 // requires OutputIterator<Iter, RvalueOf<Iter::reference>::type> 15 // Iter 16 // remove_if(Iter first, Iter last, Pred pred); 27 template <class Iter> 50 template <class Iter> 65 Iter [all...] |
/external/skia/src/gpu/ |
H A D | GrTraceMarker.cpp | 27 for (Iter iter = markerSet.begin(); iter != markerSet.end(); ++iter) { 80 GrTraceMarkerSet::Iter GrTraceMarkerSet::begin() const { 81 return Iter(this, 0); 84 GrTraceMarkerSet::Iter GrTraceMarkerSet::end() const { 85 return Iter(this, this->fMarkerArray.count());
|
H A D | GrRedBlackTree.h | 58 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/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/ |
H A D | next_permutation.pass.cpp | 12 // 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 D | next_permutation_comp.pass.cpp | 12 // 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 D | prev_permutation.pass.cpp | 12 // 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 D | prev_permutation_comp.pass.cpp | 12 // 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/chromium_org/v8/test/cctest/ |
H A D | test-gc-tracer.cc | 39 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/src/utils/ |
H A D | SkOSFile.cpp | 70 SkOSFile::Iter::Iter() : fHandle(0), fPath16(NULL) function in class:SkOSFile::Iter 74 SkOSFile::Iter::Iter(const char path[], const char suffix[]) : fHandle(0), fPath16(NULL) function in class:SkOSFile::Iter 79 SkOSFile::Iter::~Iter() 86 void SkOSFile::Iter::reset(const char path[], const char suffix[]) 139 bool SkOSFile::Iter::next(SkString* name, bool getDir) 166 SkOSFile::Iter::Iter() function in class:SkOSFile::Iter 170 SkOSFile::Iter::Iter(const char path[], const char suffix[]) : fDIR(0) function in class:SkOSFile::Iter [all...] |
/external/bison/src/ |
H A D | state.h | 151 #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/chromium_org/third_party/skia/src/gpu/ |
H A D | GrTraceMarker.cpp | 27 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 D | GrRedBlackTree.h | 58 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/libcxx/test/algorithms/alg.modifying.operations/alg.fill/ |
H A D | fill_n.pass.cpp | 12 // template<class Iter, IntegralLike Size, class T> 13 // requires OutputIterator<Iter, const T&> 15 // fill_n(Iter first, Size n, const T& value); 22 template <class Iter> 28 assert(std::fill_n(Iter(ca), n, char(1)) == std::next(Iter(ca), n)); 35 template <class Iter> 41 assert(std::fill_n(Iter(ia), n, 1) == std::next(Iter(ia), n));
|
/external/chromium_org/third_party/leveldatabase/src/table/ |
H A D | block.h | 39 class Iter;
|
/external/chromium_org/third_party/skia/include/core/ |
H A D | SkOSFile.h | 99 class Iter { class in class:SkOSFile 101 Iter(); 102 Iter(const char path[], const char suffix[] = NULL); 103 ~Iter();
|
/external/skia/include/core/ |
H A D | SkOSFile.h | 97 class Iter { class in class:SkOSFile 99 Iter(); 100 Iter(const char path[], const char suffix[] = NULL); 101 ~Iter();
|
/external/llvm/include/llvm/TableGen/ |
H A D | SetTheory.h | 127 template<typename Iter> 128 void evaluate(Iter begin, Iter end, RecSet &Elts, ArrayRef<SMLoc> Loc) {
|
/external/libcxx/test/support/ |
H A D | test_iterators.h | 287 template <class Iter> 288 inline Iter base(output_iterator<Iter> i) { return i.base(); } 290 template <class Iter> 291 inline Iter base(input_iterator<Iter> i) { return i.base(); } 293 template <class Iter> 294 inline Iter base(forward_iterator<Iter> i) { return i.base(); } 296 template <class Iter> [all...] |
/external/clang/lib/StaticAnalyzer/Checkers/ |
H A D | CastSizeChecker.cpp | 56 RecordDecl::field_iterator Iter(RD->field_begin()); 59 for (; Iter != End; ++Iter) 60 Last = *Iter;
|