Searched refs:next (Results 226 - 250 of 4746) sorted by relevance

1234567891011>>

/external/smack/src/org/jivesoftware/smackx/provider/
H A DHeaderProvider.java33 parser.next();
39 parser.next();
/external/stlport/test/eh/
H A Dtest_push_front.h38 typename C::const_iterator next = c.begin(); local
40 EH_ASSERT( EH_STD::equal( original.begin(), original.end(), ++next ) );
/external/wpa_supplicant_8/wpa_supplicant/
H A Dconfig_none.c47 for (ssid = config->ssid; ssid; ssid = ssid->next) {
51 for (blob = config->blobs; blob; blob = blob->next) {
/external/bison/lib/
H A Dlbitset.c63 struct lbitset_elt_struct *next; /* Next element. */ member in struct:lbitset_elt_struct
100 lbitset_free_list = elt->next;
159 elt->next = lbitset_free_list;
168 lbitset_elt *next = elt->next; local
172 prev->next = next;
174 if (next)
175 next->prev = prev;
178 LBITSET_HEAD (bset) = next;
213 lbitset_elt *next; local
391 lbitset_elt *next; local
569 lbitset_list_reverse(bitset bset, bitset_bindex *list, bitset_bindex num, bitset_bindex *next) argument
664 lbitset_list(bitset bset, bitset_bindex *list, bitset_bindex num, bitset_bindex *next) argument
867 lbitset_elt *next; local
[all...]
/external/libsepol/src/
H A Dhashtab.c79 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/
H A DApiCheckTest.java52 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()
[all...]
/external/llvm/unittests/ADT/
H A DTinyPtrVectorTest.cpp75 EXPECT_EQ(Values[i], *llvm::next(V.begin(), i));
77 EXPECT_EQ(V.end(), llvm::next(V.begin(), Values.size()));
337 this->V.erase(llvm::next(this->V.begin(), 1));
338 this->TestPtrs.erase(llvm::next(this->TestPtrs.begin(), 1));
340 this->V.erase(llvm::next(this->V.begin(), 2));
341 this->TestPtrs.erase(llvm::next(this->TestPtrs.begin(), 2));
343 this->V.erase(llvm::next(this->V.begin(), 5));
344 this->TestPtrs.erase(llvm::next(this->TestPtrs.begin(), 5));
346 this->V.erase(llvm::next(this->V.begin(), 13));
347 this->TestPtrs.erase(llvm::next(thi
[all...]
/external/chromium/net/disk_cache/
H A Drankings.cc258 node->Data()->next = my_head.value();
264 node->Data()->next = my_tail.value();
281 // y, prev is x and next is z):
286 // 4. r(0, 0), head(0), tail(0) next.Store()
290 // 2. a(x, r), r(a, b), b(a, y), head(x), tail(y) next.Store()
297 // 3. r(r, b), b(b, y), head(b), tail(y) next.Store()
304 // 4. a(x, a), r(0, 0), head(x), tail(a) next.Store()
307 node->Data()->next, node->Data()->prev, list);
312 Addr next_addr(node->Data()->next);
322 CacheRankingsBlock next(backend
728 CheckLinks(CacheRankingsBlock* node, CacheRankingsBlock* prev, CacheRankingsBlock* next, List* list) argument
767 CheckSingleLink(CacheRankingsBlock* prev, CacheRankingsBlock* next) argument
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/cso_cache/
H A Dcso_hash.c15 * 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:__anon12845
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/
H A Dcso_hash.c15 * 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:__anon23330
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/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/
H A DAttributedCharacterIteratorTest.java34 it.next();
37 it.next();
39 it.next();
90 it.next();
93 it.next();
95 it.next();
116 * @tests java.text.AttributedCharacterIterator#next()
122 assertEquals("Wrong first", 'e', it.next());
124 it.next();
125 assertEquals("Wrong last", 'g', it.next());
[all...]
/external/proguard/src/proguard/optimize/peephole/
H A DReachableCodeMarker.java44 private boolean next; field in class:ReachableCodeMarker
127 next = false;
141 next = false;
158 next = false;
178 next = false;
217 boolean oldNext = next;
221 next = oldNext;
230 boolean oldNext = next;
244 // By default, we'll assume we can continue with the next
246 next
[all...]
/external/bison/src/
H A Dreader.c90 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
[all...]
/external/libppp/src/
H A Dtimer.c105 for (t = TimerList; t; t = t->next) {
122 tp->next = t;
124 pt->next = tp;
142 * A RUNNING timer must be removed from TimerList (->next list).
143 * A STOPPED timer isn't in any list, but may have a bogus [e]next field.
151 for (t = TimerList; t != tp && t != NULL; t = t->next)
156 pt->next = t->next;
158 TimerList = t->next;
162 if (t->next) {
192 struct pppTimer *tp, *exp, *next; local
[all...]
/external/smali/dexlib/src/main/java/org/jf/dexlib/Util/
H A DTryListBuilder.java50 firstTryRange.next = lastTryRange;
57 public TryRange next = null; field in class:TryListBuilder.TryRange
70 this.next = null;
75 /*we use a dummy last item, so this.next will always
77 this.next.previous = tryRange;
78 tryRange.next = this.next;
80 this.next = tryRange;
87 this.previous.next = tryRange;
91 tryRange.next
[all...]
/external/srec/portable/src/
H A Dphashtable.c42 PHashTableEntry *next; member in struct:PHashTableEntry_t
50 struct PHashTableEntryBlock_t *next; member in struct:PHashTableEntryBlock_t
139 tmp = block->next;
173 entry = entry->next;
183 entry = entry->next;
193 entry->table->entries[entry->idx] = entry->next;
195 entry->prev->next = entry->next;
197 if (entry->next != NULL)
198 entry->next
279 PHashTableEntry *entry, *tmp, *next; local
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DLinkedListMultimap.java114 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 !
281 Node<K, V> next; field in class:LinkedListMultimap.NodeIterator
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
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/
H A DLinkedListMultimap.java110 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 !
277 Node<K, V> next; field in class:LinkedListMultimap.NodeIterator
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
435 public V next() { method in class:LinkedListMultimap.ValueForKeyIterator
[all...]
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/
H A DDTMDefaultBaseTraversers.java204 * 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(in 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
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/
H A Daddressmap-inl.h163 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;
298 for (Entry* e = c->blocks[BlockID(num)]; e != NULL; e = e->next) {
[all...]
/external/chromium_org/third_party/tcmalloc/vendor/src/
H A Daddressmap-inl.h163 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;
298 for (Entry* e = c->blocks[BlockID(num)]; e != NULL; e = e->next) {
[all...]
/external/apache-xml/src/main/java/org/apache/xml/dtm/
H A DDTMAxisIterator.java33 * 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/
H A DChildIterator.java77 * 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;
91 m_lastFetched = next = (DTM.NULL == m_lastFetched)
95 // m_lastFetched = next;
96 if (DTM.NULL != next)
99 return next;
/external/checkpolicy/
H A Dcheckpolicy.h13 struct te_assert *next; member in struct:te_assert
/external/chromium/chrome/browser/policy/
H A Dconfiguration_policy_store_interface.h58 ConfigurationPolicyStoreInterface* next)
59 : next_(next),
80 FilteringPolicyStoreInterface(ConfigurationPolicyStoreInterface* next, argument
82 : next_(next),
57 ObservingPolicyStoreInterface( ConfigurationPolicyStoreInterface* next) argument

Completed in 4670 milliseconds

1234567891011>>