| /external/guava/guava-tests/test/com/google/common/collect/ |
| LinkedHashMultimapTest.java | 98 assertEquals(Maps.immutableEntry("foo", 5), entryIterator.next());
99 assertEquals(Maps.immutableEntry("bar", 4), entryIterator.next());
100 assertEquals(Maps.immutableEntry("foo", 3), entryIterator.next());
101 assertEquals(Maps.immutableEntry("cow", 2), entryIterator.next());
102 assertEquals(Maps.immutableEntry("bar", 1), entryIterator.next());
106 Map.Entry<String, Collection<Integer>> entry = collectionIterator.next();
109 entry = collectionIterator.next();
112 entry = collectionIterator.next();
|
| /external/harfbuzz_ng/src/ |
| hb-common.cc | 175 struct hb_language_item_t *next; member in struct:hb_language_item_t
202 hb_language_item_t *next = langs->next; local
205 langs = next;
215 for (hb_language_item_t *lang = first_lang; lang; lang = lang->next)
223 lang->next = first_lang;
|
| hb-graphite2.cc | 50 struct hb_graphite2_tablelist_t *next; member in struct:hb_graphite2_tablelist_t
68 for (hb_graphite2_tablelist_t *p = tlist; p; p = p->next)
88 p->next = face_data->tlist;
135 tlist = tlist->next;
|
| hb-set-private.hh | 246 inline bool next (hb_codepoint_t *codepoint) const function in struct:hb_set_t
268 if (!next (&i))
272 while (next (&i) && i == *last + 1)
|
| /external/icu4c/common/ |
| caniter.cpp | 127 *@return the next string that is canonically equivalent. The value null is returned when
130 UnicodeString CanonicalIterator::next() { function in class:CanonicalIterator
148 // find next value for next time
367 //String item = (String) it.next();
378 //String possible = (String) it2.next();
454 while (iter.next()) {
|
| ustrenum.cpp | 42 StringEnumeration::next(int32_t *resultLength, UErrorCode &status) { function in class:StringEnumeration
76 const char *s=next(&length, status);
146 const char *UStringEnumeration::next(int32_t *resultLength, UErrorCode &status) { function in class:UStringEnumeration
210 return THIS(en)->next(resultLength, *ec);
|
| /external/icu4c/i18n/ |
| anytrans.cpp | 73 * The code of the current run, valid after next() returns. May
80 * The start of the run, inclusive, valid after next() returns.
85 * The end of the run, exclusive, valid after next() returns.
100 UBool next();
122 UBool ScriptRunIterator::next() { function in class:ScriptRunIterator
235 while (it.next()) {
|
| identifier_info.cpp | 182 ScriptSet *next = static_cast<ScriptSet *>(nextHashEl->key.pointer); local
184 if (fRequiredScripts->intersects(*next)) {
187 fCommonAmongAlternates->intersect(*next);
195 if (next != other && next->contains(*other)) {
|
| /external/icu4c/layout/ |
| GlyphIterator.cpp | 225 next();
449 le_bool GlyphIterator::next(le_uint32 delta) function in class:GlyphIterator
|
| /external/icu4c/test/thaitest/ |
| thaitest.cpp | 46 // return next break position
47 int32_t next();
232 nextSpaceBreak = spaceIter.next();
233 nextBreak = breakIter->next();
250 nextSpaceBreak = spaceIter.next();
254 nextBreak = breakIter->next();
412 int32_t nextbreak = breakIter->next();
522 * Return the next break, counting words and spaces.
524 int32_t SpaceBreakIterator::next() function in class:SpaceBreakIterator
532 nextBreak = fBreakIter->next();
[all...] |
| /external/icu4c/tools/pkgdata/ |
| pkgtypes.h | 31 struct _CharList *next; member in struct:_CharList
|
| /external/iproute2/lib/ |
| rt_names.c | 31 struct rtnl_hash_entry *next; member in struct:rtnl_hash_entry
70 entry->next = hash[id & (size - 1)];
351 entry = entry->next;
377 entry = entry->next;
491 entry = entry->next;
|
| /external/ipsec-tools/src/racoon/ |
| remoteconf.c | 324 if (sa->next)
325 delisakmpsa(sa->next);
347 new->next = NULL;
349 if (orig->next)
350 new->next=dupetypes(orig->next);
359 if (e->next)
360 deletypes(e->next);
384 struct remoteconf *p, *next; local
386 for (p = TAILQ_FIRST(&rmtree); p; p = next) {
[all...] |
| /external/iptables/extensions/ |
| libxt_multiport.c | 87 char *buffer, *cp, *next; local
93 for (cp=buffer, i=0; cp && i<XT_MULTI_PORTS; cp=next,i++)
95 next=strchr(cp, ',');
96 if (next) *next++='\0';
109 char *buffer, *cp, *next, *range; local
119 for (cp=buffer, i=0; cp && i<XT_MULTI_PORTS; cp=next, i++) {
120 next=strchr(cp, ',');
121 if (next) *next++='\0'
[all...] |
| /external/javassist/src/main/javassist/ |
| ClassPoolTail.java | 25 ClassPathList next; field in class:ClassPathList
29 next = n;
194 list = list.next;
212 while (list.next != null)
213 list = list.next;
215 list.next = tail;
225 pathList = list.next;
227 while (list.next != null)
228 if (list.next.path == cp)
229 list.next = list.next.next
[all...] |
| CtMember.java | 23 CtMember next; // for internal use field in class:CtMember
54 fieldTail.next = this;
65 method.next = methodTail.next;
66 methodTail.next = method;
79 cons.next = consTail.next;
80 consTail.next = cons;
88 field.next = this; // or fieldTail.next
131 final CtMember next() { return next; } method in class:CtMember
[all...] |
| /external/javassist/src/main/javassist/bytecode/analysis/ |
| MultiType.java | 124 resolved = Type.get((CtClass)map.values().iterator().next());
179 CtClass intf = (CtClass)iter.next();
261 if (! interfaces.containsKey(iter.next()))
272 resolved = Type.get((CtClass) merged.values().iterator().next());
304 buffer.append(iter.next());
|
| /external/javassist/src/main/javassist/compiler/ |
| Lex.java | 19 public Token next = null; field in class:Token
57 lookAheadTokens = lookAheadTokens.next;
63 * Looks at the next token.
73 tk.next = null;
77 for (; i-- > 0; tk = tk.next)
78 if (tk.next == null) {
80 tk.next = tk2 = new Token();
|
| /external/javassist/src/main/javassist/expr/ |
| ExprEditor.java | 144 NewOp next; field in class:ExprEditor.NewOp
149 next = n;
181 int pos = iterator.next();
212 context.newList = newList.next;
|
| /external/jmonkeyengine/engine/src/core/com/jme3/light/ |
| LightList.java | 277 public Light next() { method
|
| /external/jmonkeyengine/engine/src/core/com/jme3/util/ |
| IntMap.java | 99 for (Entry e = table[i]; e != null; e = e.next){
110 for (Entry e = table[index]; e != null; e = e.next){
120 for (Entry e = table[index]; e != null; e = e.next){
131 for (Entry e = table[index]; e != null; e = e.next){
151 Entry next = e.next; local
153 e.next = newTable[index];
155 e = next;
172 Entry next = e.next; local
236 public Entry next() { method in class:IntMap.IntMapIterator
275 Entry next; field in class:IntMap.Entry
[all...] |
| SafeArrayList.java | 49 * case by buffering them as a normal ArrayList until the next time the contents
237 Object o1 = i1.next();
238 Object o2 = i2.next();
344 private int next; field in class:SafeArrayList.ArrayIterator
349 this.next = index;
354 return next != array.length;
357 public E next() { method in class:SafeArrayList.ArrayIterator
360 lastReturned = next++;
365 return next != 0;
371 lastReturned = --next;
[all...] |
| /external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/geomipmap/picking/ |
| BresenhamYUpGridTracer.java | 122 public void next() { method in class:BresenhamYUpGridTracer
123 // Walk us to our next location based on distances to next X or Z grid
|
| /external/jsilver/src/com/google/clearsilver/jsilver/data/ |
| DefaultDataContext.java | 148 local.next = head;
196 // not null. Note we begin looking for the dereferenced in the next
230 curr = curr.next;
247 // Pointer to next LocalVariable in the list.
248 LocalVariable next; field in class:DefaultDataContext.LocalVariable
249 // Pointer to the first LocalVariable in the next scope down.
|
| DelegatedData.java | 161 public DelegatedData next() { method in class:DelegatedData.DelegatedIterator
162 return newInstance(iterator.next());
|
