| /aosp_15_r20/out/soong/.intermediates/libcore/core_oj_api_files/gen/19/libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | ConcurrentLinkedDeque.java | 1363 private Node<E> nextNode; field in ConcurrentLinkedDeque.AbstractItr
1380 abstract Node<E> nextNode(Node<E> p); in nextNode() method in ConcurrentLinkedDeque.AbstractItr
1434 Node<E> nextNode(Node<E> p) { return succ(p); } in nextNode() method in ConcurrentLinkedDeque.Itr
1441 Node<E> nextNode(Node<E> p) { return pred(p); } in nextNode() method in ConcurrentLinkedDeque.DescendingItr
|
| /aosp_15_r20/libcore/ojluni/src/main/java/java/util/concurrent/ |
| H A D | ConcurrentLinkedDeque.java | 1363 private Node<E> nextNode; field in ConcurrentLinkedDeque.AbstractItr
1380 abstract Node<E> nextNode(Node<E> p); in nextNode() method in ConcurrentLinkedDeque.AbstractItr
1434 Node<E> nextNode(Node<E> p) { return succ(p); } in nextNode() method in ConcurrentLinkedDeque.Itr
1441 Node<E> nextNode(Node<E> p) { return pred(p); } in nextNode() method in ConcurrentLinkedDeque.DescendingItr
|
| H A D | LinkedBlockingDeque.java | 1062 abstract Node<E> nextNode(Node<E> n); in nextNode() method in LinkedBlockingDeque.AbstractItr
1166 Node<E> nextNode(Node<E> n) { return n.next; } in nextNode() method in LinkedBlockingDeque.Itr
1173 Node<E> nextNode(Node<E> n) { return n.prev; } in nextNode() method in LinkedBlockingDeque.DescendingItr
|
| /aosp_15_r20/out/soong/.intermediates/libcore/core_oj_api_files/gen/gensrcs/libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | ConcurrentLinkedDeque.java | 1363 private Node<E> nextNode; field in ConcurrentLinkedDeque.AbstractItr
1380 abstract Node<E> nextNode(Node<E> p); in nextNode() method in ConcurrentLinkedDeque.AbstractItr
1434 Node<E> nextNode(Node<E> p) { return succ(p); } in nextNode() method in ConcurrentLinkedDeque.Itr
1441 Node<E> nextNode(Node<E> p) { return pred(p); } in nextNode() method in ConcurrentLinkedDeque.DescendingItr
|
| D | LinkedBlockingDeque.java | 1062 abstract Node<E> nextNode(Node<E> n); in nextNode() method in LinkedBlockingDeque.AbstractItr
1166 Node<E> nextNode(Node<E> n) { return n.next; } in nextNode() method in LinkedBlockingDeque.Itr
1173 Node<E> nextNode(Node<E> n) { return n.prev; } in nextNode() method in LinkedBlockingDeque.DescendingItr
|
| /aosp_15_r20/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| H A D | DTMTreeWalker.java | 115 int nextNode = m_dtm.getFirstChild(pos); in traverse() local
168 int nextNode = m_dtm.getFirstChild(pos); in traverse() local
|
| /aosp_15_r20/external/apache-xml/src/main/java/org/apache/xml/utils/ |
| H A D | TreeWalker.java | 179 Node nextNode = pos.getFirstChild(); in traverseFragment() local
232 Node nextNode = pos.getFirstChild(); in traverse() local
|
| /aosp_15_r20/libcore/ojluni/annotations/hiddenapi/java/util/concurrent/ |
| H A D | LinkedBlockingDeque.java | 322 abstract Node<E> nextNode( in nextNode() method in LinkedBlockingDeque.AbstractItr
364 Node<E> nextNode( in nextNode() method in LinkedBlockingDeque.DescendingItr
381 Node<E> nextNode( in nextNode() method in LinkedBlockingDeque.Itr
|
| /aosp_15_r20/external/lzma/CPP/7zip/UI/Common/ |
| H A D | EnumDirItems.cpp | 693 const NWildcard::CCensorNode *nextNode = NULL; in EnumerateForItem() local
955 const NWildcard::CCensorNode *nextNode = NULL; in EnumerateDirItems() local
997 const NWildcard::CCensorNode &nextNode = curNode.SubNodes[i]; in EnumerateDirItems() local
1619 NWildcard::CCensorNode &nextNode = node.SubNodes[i]; in ConvertToLongNames() local
|
| /aosp_15_r20/external/icu/icu4c/source/common/unicode/ |
| H A D | stringtriebuilder.h | 300 IntermediateValueNode(int32_t v, Node *nextNode) in IntermediateValueNode()
317 LinearMatchNode(int32_t len, Node *nextNode) in LinearMatchNode()
|
| /aosp_15_r20/external/icu/libicu/cts_headers/unicode/ |
| H A D | stringtriebuilder.h | 300 IntermediateValueNode(int32_t v, Node *nextNode) in IntermediateValueNode()
317 LinearMatchNode(int32_t len, Node *nextNode) in LinearMatchNode()
|
| /aosp_15_r20/prebuilts/runtime/mainline/i18n/test-exports/android/include/external/icu/icu4c/source/common/unicode/ |
| H A D | stringtriebuilder.h | 300 IntermediateValueNode(int32_t v, Node *nextNode) in IntermediateValueNode()
317 LinearMatchNode(int32_t len, Node *nextNode) in LinearMatchNode()
|
| /aosp_15_r20/external/cronet/third_party/icu/source/common/unicode/ |
| H A D | stringtriebuilder.h | 300 IntermediateValueNode(int32_t v, Node *nextNode) in IntermediateValueNode()
317 LinearMatchNode(int32_t len, Node *nextNode) in LinearMatchNode()
|
| /aosp_15_r20/prebuilts/runtime/mainline/i18n/sdk/common_os/include/external/icu/icu4c/source/common/unicode/ |
| H A D | stringtriebuilder.h | 300 IntermediateValueNode(int32_t v, Node *nextNode) in IntermediateValueNode()
317 LinearMatchNode(int32_t len, Node *nextNode) in LinearMatchNode()
|
| /aosp_15_r20/prebuilts/runtime/mainline/i18n/test-exports/linux_bionic/include/external/icu/icu4c/source/common/unicode/ |
| H A D | stringtriebuilder.h | 300 IntermediateValueNode(int32_t v, Node *nextNode) in IntermediateValueNode()
317 LinearMatchNode(int32_t len, Node *nextNode) in LinearMatchNode()
|
| /aosp_15_r20/external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| H A D | TreeWalker.java | 147 Node nextNode = pos.getFirstChild(); in traverse() local
201 Node nextNode = pos.getFirstChild(); in traverse() local
|
| /aosp_15_r20/prebuilts/runtime/mainline/i18n/test-exports/linux_glibc/include/external/icu/icu4c/source/common/unicode/ |
| H A D | stringtriebuilder.h | 300 IntermediateValueNode(int32_t v, Node *nextNode) in IntermediateValueNode()
317 LinearMatchNode(int32_t len, Node *nextNode) in LinearMatchNode()
|
| /aosp_15_r20/external/guava/android/guava/src/com/google/common/graph/ |
| H A D | Graphs.java | 132 N nextNode = top.remainingSuccessors.remove(); in subgraphHasCycle() local
168 Graph<?> graph, Object nextNode, @CheckForNull Object previousNode) { in canTraverseWithoutReusingEdge()
|
| /aosp_15_r20/external/guava/guava/src/com/google/common/graph/ |
| H A D | Graphs.java | 133 N nextNode = top.remainingSuccessors.remove(); in subgraphHasCycle() local
169 Graph<?> graph, Object nextNode, @CheckForNull Object previousNode) { in canTraverseWithoutReusingEdge()
|
| /aosp_15_r20/external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| H A D | AxesWalker.java | 353 public int nextNode() in nextNode() method in AxesWalker
355 int nextNode = DTM.NULL; in nextNode() local
|
| H A D | LocPathIterator.java | 751 public abstract int nextNode(); in nextNode() method in LocPathIterator
761 protected int returnNextNode(int nextNode) in returnNextNode()
|
| /aosp_15_r20/external/antlr/runtime/Cpp/include/ |
| H A D | antlr3collections.inl | 181 IntTrieNodeType* nextNode; local
261 IntTrieNodeType* nextNode; local
|
| /aosp_15_r20/out/soong/.intermediates/libcore/core_oj_api_files/gen/20/libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | LinkedBlockingDeque.java | 1062 abstract Node<E> nextNode(Node<E> n); in nextNode() method in LinkedBlockingDeque.AbstractItr
1166 Node<E> nextNode(Node<E> n) { return n.next; } in nextNode() method in LinkedBlockingDeque.Itr
1173 Node<E> nextNode(Node<E> n) { return n.prev; } in nextNode() method in LinkedBlockingDeque.DescendingItr
|
| /aosp_15_r20/external/leakcanary2/shark/src/main/java/shark/internal/ |
| H A D | InternalSharedExpanderHelpers.kt | 171 val nextNode = node[nodeClassName, nodeNextFieldName]!!.valueAsInstance in read() constant
|
| /aosp_15_r20/external/virglrenderer/src/gallium/auxiliary/cso_cache/ |
| H A D | cso_hash.c | 224 struct cso_node **nextNode = cso_hash_find_node(hash, key); in cso_hash_insert() local
282 struct cso_node **nextNode = cso_hash_find_node(hash, key); in cso_hash_find() local
|