| /external/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
| CollectionIteratorTester.java | 141 iterator.next();
145 iterator.next();
146 fail("iterator.next() should throw NoSuchElementException");
|
| CollectionRemoveTester.java | 120 iterator.next();
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| AbstractIteratorTest.java | 58 assertEquals(0, (int) iter.next());
64 assertEquals(1, (int) iter.next());
72 iter.next();
104 assertEquals(0, (int) iter.next());
107 assertEquals(1, (int) iter.next());
122 iter.next();
123 fail("next() should throw NoSuchElementException as usual");
129 fail("peek() should still throw NoSuchElementException after next()");
235 assertEquals(0, (int) iter.next());
259 // hasNext/next/peek), but we'll cop out for now, knowing that peek() an
[all...] |
| ForwardingListIteratorTest.java | 62 forward.next();
63 assertEquals("[next]", getCalls());
|
| SimpleAbstractMultisetTest.java | 94 public Multiset.Entry<E> next() { method in class:SimpleAbstractMultisetTest.NoRemoveMultiset
95 final Map.Entry<E, Integer> mapEntry = backingEntries.next();
|
| /external/icu4c/common/ |
| normlzr.cpp | 257 * Return the next character in the normalized text and advance
261 UChar32 Normalizer::next() { function in class:Normalizer
304 return next();
325 * {@link #next} and {@link #previous} iterate through characters in the
327 * correspondence between characters returned by <tt>next</tt> and
|
| uchriter.cpp | 151 UCharCharacterIterator::next() { function in class:UCharCharacterIterator
|
| ulist.c | 17 UListNode *next; member in struct:UListNode
62 newItem->next = NULL;
87 newItem->next = NULL;
89 list->tail->next = newItem;
115 newItem->next = list->head;
139 pointer = pointer->next;
154 list->curr = curr->next;
183 listPointer = listHead->next;
|
| /external/icu4c/common/unicode/ |
| stringtriebuilder.h | 283 : ValueNode(0x222222*37+hashCode(nextNode)), next(nextNode) { setValue(v); }
288 Node *next; member in class:StringTrieBuilder::IntermediateValueNode
298 length(len), next(nextNode) {}
303 Node *next; member in class:StringTrieBuilder::LinearMatchNode
372 length(len), next(subNode) {}
378 Node *next; // A branch sub-node. member in class:StringTrieBuilder::BranchHeadNode
|
| uiter.h | 147 * Check if current() and next() can still
151 * @return boolean value for whether current() and next() can still return another code unit
189 * Function type declaration for UCharIterator.next().
325 * The current() and next() functions only check the current index against the
402 * (public) Check if current() and next() can still
435 UCharIteratorNext *next; member in struct:UCharIterator
497 * Helper function for UCharIterator to get the next code point.
|
| /external/icu4c/i18n/ |
| search.cpp | 236 int32_t SearchIterator::next(UErrorCode &status) function in class:SearchIterator
262 // the next call to next will set the offset.
299 // setOffset has been called or that next ran off the text
|
| /external/icu4c/test/intltest/ |
| canittst.cpp | 157 //UnicodeString *result = new UnicodeString(it.next());
158 UnicodeString result(it.next());
195 UnicodeString item = it.next();
271 //String item = (String) it.next();
294 result.append(it.next().toString());
320 UnicodeString next = can.next(); local
321 logln("CanonicalIterator::next returned "+next);
325 UnicodeString afterReset = can.next();
[all...] |
| /external/iproute2/include/ |
| iptables.h | 29 struct iptables_rule_match *next; member in struct:iptables_rule_match
37 struct iptables_match *next; member in struct:iptables_match
90 struct iptables_target *next; member in struct:iptables_target
|
| /external/iproute2/ip/ |
| ipmaddr.c | 65 struct ma_info *next; member in struct:ma_info
77 for (; (mp=*lst) != NULL; lst = &mp->next) {
81 m->next = *lst;
235 for (; list; list = list->next) {
|
| /external/ipsec-tools/src/racoon/ |
| getcertsbyname.c | 100 struct certinfo *next; local
103 next = ci->ci_next;
107 ci = next;
|
| nattraversal.c | 335 struct natt_ka_addrs *ka, *next = NULL; local
340 for (ka = TAILQ_FIRST(&ka_tree); ka; ka = next) {
341 next = TAILQ_NEXT(ka, chain);
430 struct natt_ka_addrs *ka, *next = NULL; local
434 for (ka = TAILQ_FIRST(&ka_tree); ka; ka = next) {
435 next = TAILQ_NEXT(ka, chain);
|
| policy.c | 305 struct ipsecrequest *req = NULL, *next; local
307 for (req = sp->req; req; req = next) {
308 next = req->next;
410 struct secpolicy *p, *next; local
412 for (p = TAILQ_FIRST(&sptree); p; p = next) {
413 next = TAILQ_NEXT(p, chain);
|
| policy.h | 100 struct ipsecrequest *next; member in struct:ipsecrequest
101 /* pointer to next structure */
|
| proposal.h | 69 struct saprop *next; member in struct:saprop
94 struct saproto *next; /* next protocol */ member in struct:saproto
104 struct satrns *next; /* next transform */ member in struct:satrns
117 * v next
125 * (next)
131 * | | (next) | (next)
134 * v (next)
145 struct prop_pair *next; \/* next prop_pair with same proposal # *\/ member in struct:prop_pair
[all...] |
| sainfo.c | 217 struct sainfo *s, *next; local
219 for (s = LIST_FIRST(&sitree); s; s = next) {
220 next = LIST_NEXT(s, chain);
248 struct sainfoalg *a, *next; local
250 for (a = alg; a; a = next) {
251 next = a->next;
263 for (a = *head; a && a->next; a = a->next)
266 a->next = new
[all...] |
| schedule.c | 77 * time to block until next event.
84 struct sched *p, *next = NULL; local
88 for (p = TAILQ_FIRST(&sctree); p; p = next) {
93 /* if the time hasn't come, proceed to the next entry */
95 next = TAILQ_NEXT(p, chain);
105 next = TAILQ_NEXT(p, chain);
|
| session.c | 215 for (p = lcconf->myaddrs; p; p = p->next) {
303 for (p = lcconf->myaddrs; p; p = p->next) {
489 struct sadb_msg *msg, *end, *next; local
509 next = (struct sadb_msg *)((caddr_t)msg + PFKEY_UNUNIT64(msg->sadb_msg_len));
511 msg = next;
518 msg = next;
524 msg = next;
530 msg = next;
534 msg = next;
|
| /external/iptables/extensions/ |
| libip6t_rt.c | 74 char *buffer, *cp, *next; local
80 for (cp=buffer, i=0; cp && i<IP6T_RT_HOPS; cp=next,i++)
82 next=strchr(cp, ',');
83 if (next) *next++='\0';
|
| /external/jmonkeyengine/engine/src/tools/jme3tools/optimize/ |
| FastOctnode.java | 45 FastOctnode next; field in class:FastOctnode
86 node = node.next;
144 node = node.next;
163 children = children.next;
|
| /external/kernel-headers/original/linux/ |
| futex.h | 34 struct robust_list __user *next; member in struct:robust_list
|
