| /external/libsepol/src/ |
| hashtab.c | 79 cur = cur->next;
92 newnode->next = prev->next;
93 prev->next = newnode;
95 newnode->next = h->htable[hvalue];
118 cur = cur->next;
125 h->htable[hvalue] = cur->next;
127 last->next = cur->next;
151 cur = cur->next;
[all...] |
| /external/doclava/test/doclava/ |
| ApiCheckTest.java | 52 assertEquals(Errors.CHANGED_TYPE, report.errors().iterator().next().error());
62 ErrorMessage m1 = errors.next();
63 ErrorMessage m2 = errors.next();
75 ErrorMessage m1 = errors.next();
76 ErrorMessage m2 = errors.next();
87 assertEquals(Errors.ADDED_CLASS, report.errors().iterator().next().error());
95 assertEquals(Errors.REMOVED_CLASS, report.errors().iterator().next().error());
103 assertEquals(Errors.CHANGED_SUPERCLASS, report.errors().iterator().next().error());
125 assertEquals(Errors.ADDED_INTERFACE, report.errors().iterator().next().error());
133 assertEquals(Errors.REMOVED_INTERFACE, report.errors().iterator().next().error())
[all...] |
| /external/llvm/unittests/ADT/ |
| TinyPtrVectorTest.cpp | 75 EXPECT_EQ(Values[i], *std::next(V.begin(), i));
77 EXPECT_EQ(V.end(), std::next(V.begin(), Values.size()));
303 this->V.erase(std::next(this->V.begin(), 1));
304 this->TestPtrs.erase(std::next(this->TestPtrs.begin(), 1));
306 this->V.erase(std::next(this->V.begin(), 2));
307 this->TestPtrs.erase(std::next(this->TestPtrs.begin(), 2));
309 this->V.erase(std::next(this->V.begin(), 5));
310 this->TestPtrs.erase(std::next(this->TestPtrs.begin(), 5));
312 this->V.erase(std::next(this->V.begin(), 13));
313 this->TestPtrs.erase(std::next(this->TestPtrs.begin(), 13))
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/cso_cache/ |
| cso_hash.c | 15 * next paragraph) shall be included in all copies or substantial portions
75 struct cso_node *next; member in struct:cso_node
120 node->next = (struct cso_node*)(*anextNode);
159 while (lastNode->next != e && lastNode->next->key == h)
160 lastNode = lastNode->next;
162 afterLastNode = lastNode->next;
165 beforeFirstNode = &(*beforeFirstNode)->next;
166 lastNode->next = *beforeFirstNode;
209 assert(*node == hash->data.e || (*node)->next);
269 struct cso_node *next = cur->next; local
304 struct cso_node *next; member in union:__anon18324
371 struct cso_hash_iter next = {iter.hash, cso_hash_data_next(iter.node)}; local
388 struct cso_node *next = (*node)->next; local
[all...] |
| /external/mesa3d/src/gallium/auxiliary/cso_cache/ |
| cso_hash.c | 15 * next paragraph) shall be included in all copies or substantial portions
75 struct cso_node *next; member in struct:cso_node
120 node->next = (struct cso_node*)(*anextNode);
159 while (lastNode->next != e && lastNode->next->key == h)
160 lastNode = lastNode->next;
162 afterLastNode = lastNode->next;
165 beforeFirstNode = &(*beforeFirstNode)->next;
166 lastNode->next = *beforeFirstNode;
209 assert(*node == hash->data.e || (*node)->next);
269 struct cso_node *next = cur->next; local
304 struct cso_node *next; member in union:__anon6662
371 struct cso_hash_iter next = {iter.hash, cso_hash_data_next(iter.node)}; local
388 struct cso_node *next = (*node)->next; local
[all...] |
| /external/bison/src/ |
| reader.c | 90 head.next = merge_functions;
91 for (syms = &head, n = 1; syms->next; syms = syms->next, n += 1)
92 if (UNIQSTR_EQ (name, syms->next->name))
94 if (syms->next == NULL)
96 syms->next = xmalloc (sizeof syms->next[0]);
97 syms->next->name = uniqstr_new (name);
100 syms->next->type = NULL;
101 syms->next->next = NULL
[all...] |
| /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/chromium_org/v8/test/mjsunit/es6/ |
| array-iterator.js | 62 assertIteratorResult('a', false, iterator.next());
63 assertIteratorResult('b', false, iterator.next());
64 assertIteratorResult('c', false, iterator.next());
65 assertIteratorResult(void 0, true, iterator.next());
68 assertIteratorResult(void 0, true, iterator.next());
76 assertIteratorResult('a', false, iterator.next());
77 assertIteratorResult('b', false, iterator.next());
78 assertIteratorResult('c', false, iterator.next());
80 assertIteratorResult('d', false, iterator.next());
81 assertIteratorResult(void 0, true, iterator.next());
[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...] |
| /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...] |
| /bionic/libc/bionic/ |
| debug_mapinfo.h | 35 struct mapinfo_t* next; member in struct:mapinfo_t
|
| /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 | 14 // list, as extending LinkNode (this gives it next/previous pointers).
20 // Next, to keep track of the list's head/tail, use a LinkedList instance:
39 // node = node->next()) {
73 // A. Doubly-linked lists are made up of nodes that contain "next" and
77 // space for the "next" and "previous" pointers (base::LinkNode<T>*).
79 // needs to glue on the "next" and "previous" pointers using
88 LinkNode(LinkNode<T>* previous, LinkNode<T>* next)
89 : previous_(previous), next_(next) {}
111 // next() and previous() return non-NULL if and only this node is not in any
121 LinkNode<T>* next() const function in class:base::LinkNode
[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:blink::PODFreeListArena::FixedSizeMemoryChunk
|
| /external/chromium_org/third_party/WebKit/Source/web/ |
| WebSelector.cpp | 47 for (const CSSSelector* selector = selectorList.first(); selector; selector = selectorList.next(*selector)) {
|
| /external/chromium_org/third_party/boringssl/src/crypto/lhash/ |
| lhash.c | 102 LHASH_ITEM *n, *next; local
109 for (n = lh->buckets[i]; n != NULL; n = next) {
110 next = n->next;
124 * element of |lh->buckets|, otherwise it returns a pointer to the |next|
142 ret = &cur->next;
164 LHASH_ITEM **new_buckets, *cur, *next; local
179 for (cur = lh->buckets[i]; cur != NULL; cur = next) {
181 next = cur->next;
279 LHASH_ITEM *cur, *next; local
[all...] |
| /external/chromium_org/third_party/boringssl/src/ssl/pqueue/ |
| pqueue_test.c | 68 pitem *next = pqueue_next(&iter); local
69 if (next == NULL) {
73 int *next_data = (int*)next->data;
77 curr = next;
|
| /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. */
|
