/external/skia/src/core/ |
H A D | SkAAClip.cpp | 116 class SkAAClip::Iter { class in class:SkAAClip 118 Iter(const SkAAClip&); 135 SkAAClip::Iter::Iter(const SkAAClip& clip) { function in class:SkAAClip::Iter 156 void SkAAClip::Iter::next() { 1518 static void adjust_iter(SkAAClip::Iter& iter, int& topA, int& botA, int bot) { 1532 SkAAClip::Iter iterA(A); 1533 SkAAClip::Iter iterB(B); 1784 Iter iter(*this);
|
H A D | SkClipStack.cpp | 642 Iter iter(*this, Iter::kTop_IterStart); 667 SkDeque::Iter iter(fDeque, SkDeque::Iter::kBack_IterStart); 742 SkClipStack::Iter::Iter() : fStack(NULL) { function in class:SkClipStack::Iter 745 SkClipStack::Iter::Iter(const SkClipStack& stack, IterStart startLoc) function in class:SkClipStack::Iter 750 const SkClipStack::Element* SkClipStack::Iter::next() { 754 const SkClipStack::Element* SkClipStack::Iter [all...] |
H A D | SkDeque.cpp | 241 SkDeque::Iter::Iter() : fCurBlock(NULL), fPos(NULL), fElemSize(0) {} function in class:SkDeque::Iter 243 SkDeque::Iter::Iter(const SkDeque& d, IterStart startLoc) { function in class:SkDeque::Iter 249 void* SkDeque::Iter::next() { 268 void* SkDeque::Iter::prev() { 290 void SkDeque::Iter::reset(const SkDeque& d, IterStart startLoc) {
|
H A D | SkMetaData.cpp | 303 SkMetaData::Iter::Iter(const SkMetaData& metadata) { function in class:SkMetaData::Iter 307 void SkMetaData::Iter::reset(const SkMetaData& metadata) { 311 const char* SkMetaData::Iter::next(SkMetaData::Type* t, int* count) {
|
H A D | SkPath.cpp | 33 SkPath::Iter iter(path, false); 1662 SkPath::Iter iter(*this, false); 1737 SkPath::Iter::Iter() { function in class:SkPath::Iter 1751 SkPath::Iter::Iter(const SkPath& path, bool forceClose) { function in class:SkPath::Iter 1755 void SkPath::Iter::setPath(const SkPath& path, bool forceClose) { 1767 bool SkPath::Iter::isClosedContour() const { 1795 SkPath::Verb SkPath::Iter::autoClose(SkPoint pts[2]) { 1817 const SkPoint& SkPath::Iter [all...] |
H A D | SkTDynamicHash.h | 33 class Iter { class in class:SkTDynamicHash 35 explicit Iter(SkTDynamicHash* hash) : fHash(hash), fCurrentIndex(-1) { function in class:SkTDynamicHash::Iter
|
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/gpu/ |
H A D | GrOrderedSet.h | 22 class Iter; 44 Iter insert(const T& t); 51 void remove(const Iter& iter); 56 Iter begin(); 63 Iter end(); 69 Iter last(); 76 Iter find(const T& t); 85 class GrOrderedSet<T,C>::Iter { class in class:GrOrderedSet 87 Iter() {} function in class:GrOrderedSet::Iter 88 Iter(cons function in class:GrOrderedSet::Iter 112 explicit Iter(typename GrRedBlackTree<T, C>::Iter iter) { function in class:GrOrderedSet::Iter [all...] |
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...] |
H A D | GrTraceMarker.h | 58 class Iter; 60 Iter begin() const; 62 Iter end() const; 68 class GrTraceMarkerSet::Iter { class in class:GrTraceMarkerSet 70 Iter() {}; function in class:GrTraceMarkerSet::Iter 71 Iter& operator=(const Iter& i) { 76 bool operator==(const Iter& i) const { 79 bool operator!=(const Iter& i) const { return !(*this == i); } 81 Iter 89 Iter(const GrTraceMarkerSet* markers, int index) function in class:GrTraceMarkerSet::Iter [all...] |
/external/skia/src/lazy/ |
H A D | SkDiscardableMemoryPool.cpp | 154 typedef SkTInternalLList<PoolDiscardableMemory>::Iter Iter; typedef 155 Iter iter; 156 PoolDiscardableMemory* cur = iter.init(fList, Iter::kTail_IterStart);
|
/external/skia/src/pdf/ |
H A D | SkPDFTypes.cpp | 471 SkPDFDict::Iter::Iter(const SkPDFDict& dict) function in class:SkPDFDict::Iter 476 SkPDFName* SkPDFDict::Iter::next(SkPDFObject** value) {
|
H A D | SkPDFTypes.h | 434 class Iter { class in class:SkPDFDict 436 explicit Iter(const SkPDFDict& dict);
|
/external/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 | 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/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...] |
H A D | skia_test.cpp | 48 class Iter { class 50 Iter() { this->reset(); } function in class:Iter 182 Iter iter;
|
/external/skia/bench/ |
H A D | benchmain.cpp | 55 class Iter { class 57 Iter() : fBenches(BenchRegistry::Head()), fGMs(skiagm::GMRegistry::Head()) {} function in class:Iter 434 Iter iter;
|
/external/skia/gm/ |
H A D | gmmain.cpp | 94 class Iter { class 96 Iter() { function in class:Iter 313 SkTDict<int>::Iter iter(this->fRenderModesEncountered); 2308 Iter iter;
|
/external/skia/include/core/ |
H A D | SkClipStack.h | 364 class Iter { class in class:SkClipStack 367 kBottom_IterStart = SkDeque::Iter::kFront_IterStart, 368 kTop_IterStart = SkDeque::Iter::kBack_IterStart 374 Iter(); 376 Iter(const SkClipStack& stack, IterStart startLoc); 398 SkDeque::Iter fIter; 403 * It inherits privately from Iter to prevent access to reverse iteration. 405 class B2TIter : private Iter { 410 * Wrap Iter's 2 parameter ctor to force initialization to the 417 using Iter [all...] |
H A D | SkDeque.h | 65 class Iter { class in class:SkDeque 75 Iter(); 77 Iter(const SkDeque& d, IterStart startLoc); 89 // Inherit privately from Iter to prevent access to reverse iteration 90 class F2BIter : private Iter { 95 * Wrap Iter's 2 parameter ctor to force initialization to the 100 using Iter::next; 103 * Wrap Iter::reset to force initialization to the beginning of the 111 typedef Iter INHERITED;
|
H A D | SkMetaData.h | 129 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 D | SkOSFile.h | 97 class Iter { class in class:SkOSFile 99 Iter(); 100 Iter(const char path[], const char suffix[] = NULL); 101 ~Iter();
|
H A D | SkPath.h | 837 class SK_API Iter { class in class:SkPath 839 Iter(); 840 Iter(const SkPath&, bool forceClose); 1001 friend class Iter;
|
H A D | SkTDict.h | 98 friend class Iter; 101 class Iter { class in class:SkTDict 103 Iter(const SkTDict<T>& dict) { function in class:SkTDict::Iter 143 friend class Iter;
|