| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
| ANTLRLinkBase.h | 53 id<ANTLRLinkList> fNext;
57 @property (retain, getter=getfNext, setter=setFNext:) id<ANTLRLinkList> fNext;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
| ANTLRLinkBase.h | 53 id<ANTLRLinkList> fNext;
57 @property (retain, getter=getfNext, setter=setFNext:) id<ANTLRLinkList> fNext;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
| ANTLRLinkBase.h | 53 id<ANTLRLinkList> fNext;
57 @property (retain, getter=getfNext, setter=setFNext:) id<ANTLRLinkList> fNext;
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRLinkBase.h | 54 @property (retain) id<ANTLRLinkList> fNext;
59 id<ANTLRLinkList> fNext;
63 @property (retain) id<ANTLRLinkList> fNext;
|
| /external/skia/src/sksl/ast/ |
| SkSLASTForStatement.h | 25 , fNext(std::move(next))
38 if (fNext) {
39 result.append(fNext->description());
48 const std::unique_ptr<ASTExpression> fNext;
|
| /external/skia/src/sksl/ir/ |
| SkSLForStatement.h | 28 , fNext(std::move(next))
41 if (fNext) {
42 result += fNext->description();
53 std::unique_ptr<Expression> fNext;
|
| /external/skqp/src/sksl/ast/ |
| SkSLASTForStatement.h | 25 , fNext(std::move(next))
38 if (fNext) {
39 result.append(fNext->description());
48 const std::unique_ptr<ASTExpression> fNext;
|
| /external/skqp/src/sksl/ir/ |
| SkSLForStatement.h | 28 , fNext(std::move(next))
41 if (fNext) {
42 result += fNext->description();
53 std::unique_ptr<Expression> fNext;
|
| /external/skia/src/core/ |
| SkRefDict.cpp | 13 Impl* fNext;
34 rec = rec->fNext;
57 prev->fNext = rec->fNext;
59 fImpl = rec->fNext;
66 rec = rec->fNext;
75 rec->fNext = fImpl;
82 Impl* next = rec->fNext;
|
| SkArenaAllocList.h | 54 Node* fNext = nullptr;
68 fTail = fTail->fNext = n;
75 fCurr = fCurr->fNext;
|
| SkEdge.h | 26 SkEdge* fNext;
55 SkASSERT(fPrev && fNext);
56 SkASSERT(fPrev->fNext == this);
57 SkASSERT(fNext->fPrev == this);
|
| SkTLS.cpp | 20 SkTLSRec* fNext;
52 SkTLSRec* next = rec->fNext;
72 } while ((rec = rec->fNext) != nullptr);
78 rec->fNext = (SkTLSRec*)ptr;
101 } while ((rec = rec->fNext) != nullptr);
116 SkTLSRec* next = curr->fNext;
119 prev->fNext = next;
|
| SkSinglyLinkedList.h | 24 Node* next = node->fNext;
38 for (Node* node = fHead; node; node = node->fNext) {
46 fHead = node->fNext;
55 n->fNext = fHead;
66 fTail->fNext = n;
75 void operator++() { fNode = fNode->fNext; }
88 Node* fNext;
90 Node(Args&&... args) : fData(std::forward<Args>(args)...), fNext(nullptr) {}
|
| /external/skqp/src/core/ |
| SkRefDict.cpp | 13 Impl* fNext;
34 rec = rec->fNext;
57 prev->fNext = rec->fNext;
59 fImpl = rec->fNext;
66 rec = rec->fNext;
75 rec->fNext = fImpl;
82 Impl* next = rec->fNext;
|
| SkArenaAllocList.h | 54 Node* fNext = nullptr;
68 fTail = fTail->fNext = n;
75 fCurr = fCurr->fNext;
|
| SkEdge.h | 26 SkEdge* fNext;
55 SkASSERT(fPrev && fNext);
56 SkASSERT(fPrev->fNext == this);
57 SkASSERT(fNext->fPrev == this);
|
| SkTLS.cpp | 20 SkTLSRec* fNext;
52 SkTLSRec* next = rec->fNext;
72 } while ((rec = rec->fNext) != nullptr);
78 rec->fNext = (SkTLSRec*)ptr;
101 } while ((rec = rec->fNext) != nullptr);
116 SkTLSRec* next = curr->fNext;
119 prev->fNext = next;
|
| SkSinglyLinkedList.h | 24 Node* next = node->fNext;
38 for (Node* node = fHead; node; node = node->fNext) {
46 fHead = node->fNext;
55 n->fNext = fHead;
66 fTail->fNext = n;
75 void operator++() { fNode = fNode->fNext; }
88 Node* fNext;
90 Node(Args&&... args) : fData(std::forward<Args>(args)...), fNext(nullptr) {}
|
| /external/icu/icu4c/source/common/ |
| rbbisetb.h | 49 RangeDescriptor *fNext; // Next RangeDescriptor in the linked list.
|
| /external/skia/src/shaders/gradients/ |
| SkGradientBitmapCache.cpp | 15 Entry* fNext;
23 fNext(nullptr),
49 Entry* next = entry->fNext;
58 entry->fPrev->fNext = entry->fNext;
61 fHead = entry->fNext;
63 if (entry->fNext) {
65 entry->fNext->fPrev = entry->fPrev;
75 entry->fNext = fHead;
98 entry = entry->fNext;
[all...] |
| /external/skia/src/sksl/lex/ |
| NFAState.h | 35 , fNext(std::move(next)) {}
40 , fNext(std::move(next)) {}
49 , fNext(std::move(next)) {
88 for (int v : fNext) {
98 for (int v : fNext) {
126 for (int n : fNext) {
147 std::vector<int> fNext;
|
| /external/skqp/src/shaders/gradients/ |
| SkGradientBitmapCache.cpp | 15 Entry* fNext;
23 fNext(nullptr),
49 Entry* next = entry->fNext;
58 entry->fPrev->fNext = entry->fNext;
61 fHead = entry->fNext;
63 if (entry->fNext) {
65 entry->fNext->fPrev = entry->fPrev;
75 entry->fNext = fHead;
98 entry = entry->fNext;
[all...] |
| /external/skqp/src/sksl/lex/ |
| NFAState.h | 35 , fNext(std::move(next)) {}
40 , fNext(std::move(next)) {}
49 , fNext(std::move(next)) {
88 for (int v : fNext) {
98 for (int v : fNext) {
126 for (int n : fNext) {
147 std::vector<int> fNext;
|
| /external/skia/experimental/svg/model/ |
| SkPEG.h | 19 * If the match was successful, |fNext| points to the next unconsumed character in the
22 * Otherwise, |fNext| is nullptr and |fValue| is uninitialized.
26 MatchResult(std::nullptr_t) : fNext(nullptr) {}
27 MatchResult(const char* next, const V& v) : fNext(next), fValue(&v) {}
30 SkASSERT(fValue.isValid() == SkToBool(fNext));
31 return SkToBool(fNext);
37 const char* fNext;
59 return m ? MatchT(m.fNext, V(m.fValue.get()))
128 const auto tailMatch = Seq<Es...>::Match(headMatch.fNext);
129 return tailMatch ? MatchT(tailMatch.fNext, V(*headMatch, *tailMatch)
[all...] |
| /external/skqp/experimental/svg/model/ |
| SkPEG.h | 19 * If the match was successful, |fNext| points to the next unconsumed character in the
22 * Otherwise, |fNext| is nullptr and |fValue| is uninitialized.
26 MatchResult(std::nullptr_t) : fNext(nullptr) {}
27 MatchResult(const char* next, const V& v) : fNext(next), fValue(&v) {}
30 SkASSERT(fValue.isValid() == SkToBool(fNext));
31 return SkToBool(fNext);
37 const char* fNext;
59 return m ? MatchT(m.fNext, V(m.fValue.get()))
128 const auto tailMatch = Seq<Es...>::Match(headMatch.fNext);
129 return tailMatch ? MatchT(tailMatch.fNext, V(*headMatch, *tailMatch)
[all...] |
