| /libcore/luni/src/test/java/tests/api/java/util/ |
| HashMapTest.java | 152 "value", values.iterator().next());
154 "key", keys.iterator().next());
161 "value2", values2.iterator().next());
167 "key2", key2.iterator().next());
219 Map.Entry m = (Map.Entry) i.next();
245 assertTrue(hm.entrySet().remove(m2.entrySet().iterator().next()));
302 assertNull("Failed with null key", m.keySet().iterator().next());
309 Integer remove1 = (Integer) it.next();
312 Integer remove2 = (Integer) it.next();
318 assertTrue("Wrong result", it.next().equals(list.get(0)))
328 Integer next; local
[all...] |
| /system/core/logcat/ |
| logcat.cpp | 40 queued_entry_t* next; member in struct:queued_entry_t
43 next = NULL;
63 log_device_t* next; member in struct:log_device_t
70 next = NULL;
80 e = &((*e)->next);
82 entry->next = *e;
212 for (*firstdev = NULL; dev != NULL; dev = dev->next) {
236 dev->queue = entry->next;
261 for (dev=devices; dev; dev = dev->next) {
271 for (dev=devices; dev; dev = dev->next) {
[all...] |
| /external/chromium_org/third_party/mesa/src/src/glx/ |
| dri_common.c | 132 const char *libPaths, *p, *next; local
150 for (p = libPaths; *p; p = next) {
151 next = strchr(p, ':');
152 if (next == NULL) {
154 next = p + len;
157 len = next - p;
158 next++;
360 head.next = NULL;
361 for (m = configs; m; m = m->next) {
362 tail->next = createDriMode(core, m, driConfigs)
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/lhash/ |
| lhash.c | 279 nn=n->next;
311 nn->next=NULL;
346 *rn=nn->next;
402 n=a->next;
459 *n1= (*n1)->next;
460 np->next= *n2;
464 n1= &((*n1)->next);
524 while (n1->next != NULL)
525 n1=n1->next;
526 n1->next=np
[all...] |
| /external/jmonkeyengine/engine/src/core/com/jme3/font/ |
| LetterQuad.java | 35 private LetterQuad next;
field in class:LetterQuad
101 return next;
174 LetterQuad n = next;
175 next = ins;
176 ins.next = n;
187 return next == null;
195 * @return next letter
198 this.previous.next = next;
199 this.next.previous = previous;
[all...] |
| /external/libvpx/libvpx/vpx_mem/ |
| vpx_mem_tracker.c | 222 p = p->next;
442 struct mem_block *p = (memtrack.head ? memtrack.head->next : NULL);
463 p = p->next;
488 struct mem_block *p = memtrack.head->next;
518 p = p->next;
540 p->prev->next = p;
546 p->next = NULL;
585 p->prev->next = p->next;
587 if (p->next)
[all...] |
| /external/mesa3d/src/glx/ |
| dri_common.c | 132 const char *libPaths, *p, *next; local
150 for (p = libPaths; *p; p = next) {
151 next = strchr(p, ':');
152 if (next == NULL) {
154 next = p + len;
157 len = next - p;
158 next++;
360 head.next = NULL;
361 for (m = configs; m; m = m->next) {
362 tail->next = createDriMode(core, m, driConfigs)
[all...] |
| /external/opencv/cvaux/src/ |
| cvbgfg_codebook.cpp | 157 for( e = *cb; e != 0; e = e->next )
187 for( ; e != 0; e = e->next )
200 freeList[i].next = &freeList[i+1];
201 freeList[nblocks-1].next = 0;
204 freeList = freeList->next;
214 e->next = *cb;
275 for( e = *cb; e != 0; e = e->next )
336 for( first.next = e = *cb; e != 0; e = prev->next )
340 prev->next = e->next
[all...] |
| /external/oprofile/module/ia64/ |
| op_pmu.c | 581 pmu_add_sysctls(ctl_table * next)
583 ctl_table * start = next;
588 next->ctl_name = 1;
589 next->procname = names[i];
590 next->mode = 0700;
595 next->child = tab;
604 next++;
610 next = start;
612 kfree(next->child);
613 next++
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| HashtableTest.java | 206 iterator.next();
237 // next is removed "9"
257 s2.add(((Map.Entry) i.next()).getValue());
268 ((Map.Entry) ht10.entrySet().iterator().next()).setValue(null);
320 .next().hashCode())
383 iterator.next();
429 Integer remove1 = (Integer) it.next();
431 Integer remove2 = (Integer) it.next();
437 assertTrue("Wrong result", it.next().equals(list.get(0)));
439 assertTrue("Wrong contents", map.keySet().iterator().next().equals
447 Integer next; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/pipebuffer/ |
| pb_buffer_fenced.c | 15 * next paragraph) shall be included in all copies or substantial portions
200 struct list_head *curr, *next; local
206 curr = fenced_mgr->unfenced.next;
207 next = curr->next;
216 curr = next;
217 next = curr->next;
220 curr = fenced_mgr->fenced.next;
221 next = curr->next
400 struct list_head *curr, *next; local
459 struct list_head *curr, *next; local
[all...] |
| /external/mesa3d/src/gallium/auxiliary/pipebuffer/ |
| pb_buffer_fenced.c | 15 * next paragraph) shall be included in all copies or substantial portions
200 struct list_head *curr, *next; local
206 curr = fenced_mgr->unfenced.next;
207 next = curr->next;
216 curr = next;
217 next = curr->next;
220 curr = fenced_mgr->fenced.next;
221 next = curr->next
400 struct list_head *curr, *next; local
459 struct list_head *curr, *next; local
[all...] |
| /libcore/luni/src/main/java/java/text/ |
| SimpleDateFormat.java | 265 int next, last = -1, count = 0; local
269 next = (template.charAt(i));
270 if (next == '\'') {
275 if (last == next) {
278 last = next;
284 && (last == next || (next >= 'a' && next <= 'z') || (next >= 'A' && next <= 'Z')))
517 int next, last = -1, count = 0; local
1008 int next, last = -1, count = 0, offset = position.getIndex(); local
1296 char next = template.charAt(i); local
[all...] |
| /external/guava/guava/src/com/google/common/cache/ |
| LocalCache.java | 441 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
442 return new StrongEntry<K, V>(key, hash, next);
448 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
449 return new StrongAccessEntry<K, V>(key, hash, next);
463 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
464 return new StrongWriteEntry<K, V>(key, hash, next);
478 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
479 return new StrongAccessWriteEntry<K, V>(key, hash, next);
495 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
496 return new WeakEntry<K, V>(segment.keyReferenceQueue, key, hash, next);
1137 final ReferenceEntry<K, V> next; field in class:LocalCache.StrongEntry
1424 final ReferenceEntry<K, V> next; field in class:LocalCache.WeakEntry
2953 ReferenceEntry<K, V> next = head.getNext(); local
3674 ReferenceEntry<K, V> next = head.getNextInWriteQueue(); local
3680 ReferenceEntry<K, V> next = head.getNextInWriteQueue(); local
3694 ReferenceEntry<K, V> next = e.getNextInWriteQueue(); local
3727 ReferenceEntry<K, V> next = e.getNextInWriteQueue(); local
[all...] |
| /bionic/libc/netbsd/resolv/ |
| res_cache.c | 1006 struct Entry* hlink; /* next in collision chain */
1231 struct pending_req_info* next; member in struct:pending_req_info
1249 struct resolv_cache_info* next; member in struct:resolv_cache_info
1259 struct resolv_pidiface_info* next; member in struct:resolv_pidiface_info
1265 struct resolv_uidiface_info* next; member in struct:resolv_uidiface_info
2468 struct resolv_uidiface_info *next; local
2484 struct resolv_pidiface_info *next; local
[all...] |
| /libcore/luni/src/test/java/libcore/java/sql/ |
| OldResultSetGetterTests.java | 223 assertTrue(res.next());
245 res.next();
279 assertTrue(res.next());
311 assertTrue(res.next());
328 res.next();
361 assertTrue(res.next());
393 assertTrue(res.next());
425 assertTrue(res.next());
447 assertTrue(res.next());
467 assertTrue(res.next());
[all...] |
| /external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/ |
| XMPSerializerRDF.java | 316 XMPNode currSchema = (XMPNode) it.next();
365 XMPNode schema = (XMPNode) it.next();
373 XMPNode schema = (XMPNode) it.next();
392 XMPNode schema = (XMPNode) it.next();
419 XMPNode prop = (XMPNode) it.next();
493 XMPNode node = (XMPNode) it.next();
520 XMPNode qualifier = (XMPNode) iq.next();
665 XMPNode field = (XMPNode) ic.next();
759 XMPNode qualifier = (XMPNode) iq.next();
811 XMPNode propNode = (XMPNode) it.next();
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| ExpandedNameTable.java | 46 /** Next available extended type */
199 for (HashEntry e = m_table[index]; e != null; e = e.next)
260 old = old.next;
266 e.next = m_table[newIndex];
372 * The field next points to the next entry which is hashed into
380 HashEntry next; field in class:ExpandedNameTable.HashEntry
382 protected HashEntry(ExtendedType key, int value, int hash, HashEntry next)
387 this.next = next;
[all...] |
| /external/chromium/base/ |
| path_service.cc | 39 struct Provider* next; member in struct:__anon4147::Provider
113 Provider* next = p->next; local
116 p = next;
196 provider = provider->next;
255 p = p->next;
262 p->next = path_data->providers;
|
| /external/chromium_org/base/ |
| path_service.cc | 46 struct Provider* next; member in struct:__anon6294::Provider
135 Provider* next = p->next; local
138 p = next;
213 provider = provider->next;
320 iter = iter->next;
324 p->next = path_data->providers;
|
| /external/chromium_org/gpu/command_buffer/client/ |
| fenced_allocator.cc | 154 Block &next = blocks_[i + 1]; local
155 // This test is NOT included in the next one, because offset is unsigned.
156 if (next.offset <= current.offset)
158 if (next.offset != current.offset + current.size)
160 if (current.state == FREE && next.state == FREE)
172 // Collapse the block to the next one, then to the previous one. Provided the
177 Block &next = blocks_[index + 1]; local
178 if (next.state == FREE) {
179 blocks_[index].size += next.size;
|
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| TreeNodeTest.cpp | 57 ASSERT_EQ(firstChild->next(), lastChild.get());
79 ASSERT_EQ(firstChild->next(), lastChild.get());
88 ASSERT_EQ(middleChild->next(), lastChild.get());
89 ASSERT_EQ(firstChild->next(), middleChild.get());
102 ASSERT_EQ(child->next(), nullNode.get());
139 ASSERT_EQ(trio.firstChild->next(), trio.lastChild.get());
153 ASSERT_EQ(trio.middleChild->next(), nullNode.get());
|
| /external/chromium_org/third_party/libxslt/libxslt/ |
| attrvt.c | 39 struct _xsltAttrVT *next; /* next xsltAttrVT */ member in struct:_xsltAttrVT
78 cur->next = style->attVTs;
126 xsltAttrVTPtr cur = (xsltAttrVTPtr) avt, next; local
129 next = cur->next;
131 cur = next;
137 * @ val: the value to be set to the next available segment
182 (attr->children->next != NULL)) {
|
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| opt_function_inlining.cpp | 11 * The above copyright notice and this permission notice (including the next
92 assert(ret->next->is_tail_sentinel());
157 sig_param_iter.next();
158 param_iter.next();
187 param_iter.next();
188 sig_param_iter.next();
215 param_iter.next();
216 sig_param_iter.next();
|
| /external/chromium_org/third_party/zlib/ |
| inftrees.c | 27 on return points to the next available entry's address. bits is the
54 code FAR *next; /* next available space in table */ local
151 filled is at next and has curr index bits. The code being used is huff
203 next = *table; /* current table to fill in */
235 min = fill; /* save offset to next table */
238 next[(huff >> drop) + fill] = here;
252 /* go to next symbol, update count, len */
266 next += min; /* here min is 1 << curr */
268 /* determine length of next table *
[all...] |
