| /external/guava/guava/src/com/google/common/collect/ |
| LinkedListMultimap.java | 114 Node<K, V> next; // the next node (with any key) field in class:LinkedListMultimap.Node
116 Node<K, V> nextSibling; // the next node with the same key
197 tail.next = node;
211 node.next = nextSibling;
221 nextSibling.previous.next = node;
237 node.previous.next = node.next;
239 head = node.next;
241 if (node.next != null)
281 Node<K, V> next; field in class:LinkedListMultimap.NodeIterator
300 next(); method
310 public Node<K, V> next() { method in class:LinkedListMultimap.NodeIterator
366 Node<K, V> next = head; field in class:LinkedListMultimap.DistinctKeyIterator
374 public K next() { method in class:LinkedListMultimap.DistinctKeyIterator
395 Node<K, V> next; field in class:LinkedListMultimap.ValueForKeyIterator
426 next(); method
439 public V next() { method in class:LinkedListMultimap.ValueForKeyIterator
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| LinkedListMultimap.java | 110 Node<K, V> next; // the next node (with any key) field in class:LinkedListMultimap.Node
112 Node<K, V> nextSibling; // the next node with the same key
193 tail.next = node;
207 node.next = nextSibling;
217 nextSibling.previous.next = node;
233 node.previous.next = node.next;
235 head = node.next;
237 if (node.next != null)
277 Node<K, V> next; field in class:LinkedListMultimap.NodeIterator
296 next(); method
306 public Node<K, V> next() { method in class:LinkedListMultimap.NodeIterator
362 Node<K, V> next = head; field in class:LinkedListMultimap.DistinctKeyIterator
370 public K next() { method in class:LinkedListMultimap.DistinctKeyIterator
391 Node<K, V> next; field in class:LinkedListMultimap.ValueForKeyIterator
422 next(); method
435 public V next() { method in class:LinkedListMultimap.ValueForKeyIterator
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMDefaultBaseTraversers.java | 204 * Traverse to the next node after the current node.
209 * @return the next node in the iteration, or DTM.NULL.
211 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.AncestorTraverser
217 * Traverse to the next node after the current node that is matched
224 * @return the next node in the iteration, or DTM.NULL.
226 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.AncestorTraverser
276 ? context : next(context, context, expandedTypeID);
287 * Traverse to the next node after the current node.
292 * @return the next node in the iteration, or DTM.NULL.
294 public int next(int context, int current method in class:DTMDefaultBaseTraversers.AttributeTraverser
310 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.AttributeTraverser
460 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.ChildTraverser
475 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.ChildTraverser
558 int next = findElementFromIndex(nsIndex, lnIndex, nextPotential); local
701 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.DescendantTraverser
730 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.DescendantTraverser
805 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.AllFromNodeTraverser
926 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.FollowingTraverser
958 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.FollowingTraverser
994 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.FollowingSiblingTraverser
1009 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.FollowingSiblingTraverser
1036 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.NamespaceDeclsTraverser
1054 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.NamespaceDeclsTraverser
1087 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.NamespaceTraverser
1105 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.NamespaceTraverser
1183 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.ParentTraverser
1201 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.ParentTraverser
1245 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.PrecedingTraverser
1274 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.PrecedingTraverser
1309 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.PrecedingAndAncestorTraverser
1337 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.PrecedingAndAncestorTraverser
1370 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.PrecedingSiblingTraverser
1385 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.PrecedingSiblingTraverser
1443 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.SelfTraverser
1458 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.SelfTraverser
1504 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.AllFromRootTraverser
1530 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.AllFromRootTraverser
1579 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.RootTraverser
1594 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.RootTraverser
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| Date.java | 394 char next = offset < length ? string.charAt(offset) : '\r'; local
397 if (next == '(') {
401 if (next == ')') {
405 next = ' ';
412 if ('a' <= next && next <= 'z' || 'A' <= next && next <= 'Z') {
414 } else if ('0' <= next && next <= '9')
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| LinkedBlockingQueue.java | 84 * self-link implicitly means to advance to head.next.
96 * - this Node, meaning the successor is head.next
99 Node<E> next; field in class:LinkedBlockingQueue.Node
118 * Invariant: last.next == null
168 // assert last.next == null;
169 last = last.next = node;
181 Node<E> first = h.next;
182 h.next = h; // help GC
478 Node<E> first = head.next;
493 // p.next is not changed, to allow iterators that ar
794 public E next() { method in class:LinkedBlockingQueue.Itr
[all...] |
| /system/core/adb/ |
| transport.c | 31 .next = &transport_list,
36 .next = &pending_list,
91 adisconnect* dis = t->disconnects.next;
95 adisconnect* next = dis->next; local
97 dis = next;
394 device_tracker* next; member in struct:device_tracker
409 *pnode = node->next;
412 pnode = &node->next;
489 tracker->next = device_tracker_list
507 device_tracker* next = tracker->next; local
1077 atransport *t, *next; local
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| addressmap-inl.h | 163 Entry* next; member in struct:AddressMap::Entry
177 Cluster* next; // Next cluster in hash table chain member in struct:AddressMap::Cluster
217 for (Cluster* c = hashtable_[h]; c != NULL; c = c->next) {
227 c->next = hashtable_[h];
246 Object* next; member in struct:AddressMap::Object
261 obj->next = allocated_;
282 Object* next = obj->next; local
284 obj = next;
[all...] |
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| addressmap-inl.h | 163 Entry* next; member in struct:AddressMap::Entry
177 Cluster* next; // Next cluster in hash table chain member in struct:AddressMap::Cluster
217 for (Cluster* c = hashtable_[h]; c != NULL; c = c->next) {
227 c->next = hashtable_[h];
246 Object* next; member in struct:AddressMap::Object
261 obj->next = allocated_;
282 Object* next = obj->next; local
284 obj = next;
[all...] |
| /libcore/luni/src/test/java/libcore/java/sql/ |
| OldResultSetTest.java | 68 target.next();
76 assertFalse(target.next());
93 assertTrue(target.next());
116 target.next();
147 while (rs2.next()){
158 while (rs1.next()) {
209 target.next();
225 assertTrue(target.next());
245 target.next();
271 assertFalse(emptyTarget.next());
[all...] |
| /bionic/libc/bionic/ |
| debug_mapinfo.cpp | 54 mi->next = 0;
69 mi->next = milist;
81 mi = mi->next;
88 for (; mi != NULL; mi = mi->next) {
|
| debug_mapinfo.h | 35 struct mapinfo_t* next; member in struct:mapinfo_t
|
| /bionic/libc/kernel/common/linux/ |
| vmalloc.h | 14 *** Any manual change here will be lost the next time this script will
44 struct vm_struct *next; member in struct:vm_struct
|
| /bionic/libc/stdlib/ |
| atexit.h | 36 struct atexit *next; /* next in list */ member in struct:atexit
37 int ind; /* next index in this table */
|
| /dalvik/vm/mterp/armv5te/ |
| OP_NOP.S | 2 FETCH_ADVANCE_INST(1) @ advance to next instr, load rINST
|
| /dalvik/vm/mterp/mips/ |
| OP_NOP.S | 2 FETCH_ADVANCE_INST(1) # advance to next instr, load rINST
|
| /development/ndk/platforms/android-3/include/linux/ |
| vmalloc.h | 37 struct vm_struct *next; member in struct:vm_struct
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ |
| DTMAxisIterator.java | 33 * Get the next node in the iteration.
35 * @return The next node handle in the iteration, or END.
37 public int next(); method in interface:DTMAxisIterator
60 * Remembers the current node for the next call to gotoMark().
71 * i.e. subsequent call to next() should return END.
81 * i.e. subsequent call to next() should return END.
|
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| ChildIterator.java | 77 * Returns the next node in the set and advances the position of the
81 * @return The next <code>Node</code> in the set being iterated over, or
89 int next; local
91 m_lastFetched = next = (DTM.NULL == m_lastFetched)
95 // m_lastFetched = next;
96 if (DTM.NULL != next)
99 return next;
|
| /external/checkpolicy/ |
| checkpolicy.h | 13 struct te_assert *next; member in struct:te_assert
|
| /external/chromium_org/base/containers/ |
| linked_list.h | 12 // list, as extending LinkNode (this gives it next/previous pointers).
18 // Next, to keep track of the list's head/tail, use a LinkedList instance:
37 // node = node->next()) {
71 // A. Doubly-linked lists are made up of nodes that contain "next" and
75 // space for the "next" and "previous" pointers (base::LinkNode<T>*).
77 // needs to glue on the "next" and "previous" pointers using
86 LinkNode(LinkNode<T>* previous, LinkNode<T>* next)
87 : previous_(previous), next_(next) {}
115 LinkNode<T>* next() const { function in class:base::LinkNode
137 // list (root_.next() will point back to the start of the list
[all...] |
| /external/chromium_org/native_client_sdk/src/libraries/third_party/pthreads-win32/ |
| pthread_cond_destroy.c | 198 ptw32_cond_list_head = cv->next;
202 cv->prev->next = cv->next;
211 cv->next->prev = cv->prev;
|
| pthread_timechange_handler_np.c | 102 cv = cv->next;
|
| /external/chromium_org/third_party/WebKit/Source/platform/ |
| PODFreeListArena.h | 81 m_freeList->next = oldFreeList;
97 m_freeList = m_freeList->next;
106 for (FixedSizeMemoryChunk* cur = m_freeList; cur; cur = cur->next) {
118 FixedSizeMemoryChunk* next; member in struct:WebCore::PODFreeListArena::FixedSizeMemoryChunk
|
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| wbnf.h | 18 then LanguageGenerator will generate a random string on every next() call.
152 const char *next(); /* Return a null-terminated c-string. The buffer is owned by callee. */
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nouveau/ |
| nouveau_heap.h | 28 struct nouveau_heap *next; member in struct:nouveau_heap
|
