/external/hamcrest/src/org/hamcrest/internal/ |
H A D | SelfDescribingValueIterator.java | 18 public SelfDescribing next() { method in class:SelfDescribingValueIterator 19 return new SelfDescribingValue<T>(values.next());
|
/external/libcxx/test/std/containers/associative/map/map.modifiers/ |
H A D | insert_iter_iter.pass.cpp | 45 assert(next(m.begin())->first == 2); 46 assert(next(m.begin())->second == 1); 47 assert(next(m.begin(), 2)->first == 3); 48 assert(next(m.begin(), 2)->second == 1); 71 assert(next(m.begin())->first == 2); 72 assert(next(m.begin())->second == 1); 73 assert(next(m.begin(), 2)->first == 3); 74 assert(next(m.begin(), 2)->second == 1);
|
/external/libusb-compat/examples/ |
H A D | lsusb.c | 33 for (bus = busses; bus; bus = bus->next) { 35 for (dev = bus->devices; dev; dev = dev->next) {
|
/external/nist-sip/java/gov/nist/javax/sip/parser/ims/ |
H A D | PVisitedNetworkIDParser.java | 135 char next = this.lexer.getNextChar(); 136 if (next == '\"') { 139 } else if (next == '\0') { 141 } else if (next == '\\') { 142 retval.append(next); 143 next = this.lexer.getNextChar(); 144 retval.append(next); 146 retval.append(next);
|
/external/chromium-trace/trace-viewer/tracing/third_party/tvcm/tvcm/ |
H A D | fake_fs_unittest.py | 37 r = gen.next() 40 r = gen.next() 43 r = gen.next() 46 r = gen.next() 49 r = gen.next() 52 self.assertRaises(StopIteration, gen.next)
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | AbstractIterator.java | 46 * String s = in.next(); 71 /** We have computed the next element and haven't returned it yet. */ 84 private T next; field in class:AbstractIterator 87 * Returns the next element. <b>Note:</b> the implementation must call {@link 91 * <p>The initial invocation of {@link #hasNext()} or {@link #next()} calls 93 * next} following each successful call to {@code next}. Once the 98 * {@code hasNext} or {@code next} invocation that invoked this method. Any 103 * {@code next}, or {@link #peek()} methods on this instance; if it does, an 106 * @return the next elemen 152 public final T next() { method in class:AbstractIterator [all...] |
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | AbstractBiMapTest.java | 30 // The next two tests verify that map entries are not accessed after they're 40 iterator.next(); 41 iterator.next(); 43 iterator.next(); 57 iterator.next(); 58 iterator.next(); 60 iterator.next();
|
H A D | UnmodifiableListIteratorTest.java | 38 assertEquals("a", iterator.next()); 49 assertEquals("a", iterator.next()); 50 assertEquals("b", iterator.next()); 62 assertEquals("a", iterator.next()); 63 assertEquals("b", iterator.next()); 81 public String next() {
|
/external/icu/icu4c/source/layout/ |
H A D | LEInsertionList.cpp | 17 InsertionRecord *next; member in struct:InsertionRecord 41 head = head->next; 73 insertion->next = NULL; 74 tail->next = insertion; 78 insertion->next = head; 87 for (InsertionRecord *rec = head; rec != NULL; rec = rec->next) {
|
/external/mesa3d/src/gallium/auxiliary/pipe-loader/ |
H A D | pipe_loader.c | 15 * next paragraph) shall be included in all copies or substantial portions 76 const char *next; local 80 for (next = library_paths; *next; library_paths = next + 1) { 81 next = util_strchrnul(library_paths, ':'); 82 len = next - library_paths;
|
/external/valgrind/coregrind/m_gdbserver/ |
H A D | inferiors.c | 44 new_inferior->next = NULL; 46 list->tail->next = new_inferior; 55 struct inferior_list_entry *cur = list->head, *next; local 58 next = cur->next; 60 cur = next; 79 list->head = entry->next; 86 while (*cur && (*cur)->next != entry) 87 cur = &(*cur)->next; 92 (*cur)->next [all...] |
/external/harfbuzz_ng/test/api/ |
H A D | test-set.c | 35 hb_codepoint_t next = HB_SET_VALUE_INVALID; local 40 g_assert (!hb_set_next (s, &next)); 41 g_assert_cmpint (next, ==, HB_SET_VALUE_INVALID); 48 hb_codepoint_t next = HB_SET_VALUE_INVALID; local 52 g_assert (hb_set_next (s, &next)); 53 g_assert_cmpint (next, !=, HB_SET_VALUE_INVALID); 164 hb_codepoint_t next, first, last; local 174 next = HB_SET_VALUE_INVALID; 175 g_assert (hb_set_next (s, &next)); 176 g_assert_cmpint (next, [all...] |
/external/libdrm/intel/ |
H A D | mm.c | 39 for (p = heap->next; p != heap; p = p->next) { 74 heap->next = block; 80 block->next = heap; 98 /* break left [p, newblock, p->next], then p = newblock */ 109 newblock->next = p->next; 111 p->next->prev = newblock; 112 p->next = newblock; 123 /* break right, also [p, newblock, p->next] */ 265 struct mem_block *next = p->next; local [all...] |
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | u_mm.c | 44 for (p = heap->next; p != heap; p = p->next) { 87 heap->next = block; 93 block->next = heap; 113 /* break left [p, newblock, p->next], then p = newblock */ 123 newblock->next = p->next; 125 p->next->prev = newblock; 126 p->next = newblock; 137 /* break right, also [p, newblock, p->next] */ 290 struct mem_block *next = p->next; local [all...] |
H A D | u_dirty_surfaces.h | 14 * next paragraph) shall be included in all copies or substantial 59 struct list_head *p, *next; local 60 for(p = dss->dirty_list.next; p != &dss->dirty_list; p = next) 63 next = p->next; 72 struct list_head *p, *next; local 75 for(p = dss->dirty_list.next; p != &dss->dirty_list; p = next) 78 next [all...] |
/external/mesa3d/src/mesa/main/ |
H A D | mm.c | 42 for(p = heap->next; p != heap; p = p->next) { 78 heap->next = block; 84 block->next = heap; 104 /* break left [p, newblock, p->next], then p = newblock */ 114 newblock->next = p->next; 116 p->next->prev = newblock; 117 p->next = newblock; 128 /* break right, also [p, newblock, p->next] */ 277 struct mem_block *next = p->next; local [all...] |
/external/libcxx/test/std/containers/associative/multimap/multimap.ops/ |
H A D | upper_bound.pass.cpp | 46 assert(r == next(m.begin(), 3)); 48 assert(r == next(m.begin(), 3)); 50 assert(r == next(m.begin(), 6)); 52 assert(r == next(m.begin(), 6)); 54 assert(r == next(m.begin(), 9)); 76 assert(r == next(m.begin(), 3)); 78 assert(r == next(m.begin(), 3)); 80 assert(r == next(m.begin(), 6)); 82 assert(r == next(m.begin(), 6)); 84 assert(r == next( [all...] |
/external/selinux/libsepol/cil/src/ |
H A D | cil_build_ast.c | 75 for (curr = current; curr != NULL; curr = curr->next) { 179 key = parse_current->next->data; 231 inherit->block_str = parse_current->next->data; 276 abstract->block_str = parse_current->next->data; 322 in->block_str = parse_current->next->data; 367 key = parse_current->next->data; 374 if (parse_current->next->next != NULL) { 375 perms = parse_current->next->next 1781 struct cil_list_item *next = expr->next; local 2072 struct cil_list_item *next = expr->next; local 2517 struct cil_tree_node *next = NULL; local 2603 struct cil_tree_node *next = NULL; local [all...] |
/external/elfutils/src/src/ |
H A D | ldscript.y | 178 if ($3 != $3->next) 180 $3->next->group_start = 1; 197 $2->next = $1->next; 198 $$ = $1->next = $2; 213 $$->val.section.input = $3->next; 219 $3->next = NULL; 227 $$->val.section.input->next = NULL; 253 $2->next = $1->next; [all...] |
/external/android-clat/ |
H A D | ring.c | 78 ring->next = (struct tpacket2_hdr *) ring->base; 87 * advances to the next position in the packet ring 91 uint8_t *next = (uint8_t *) ring->next; local 94 next += TP_FRAME_SIZE; 101 next += TP_FRAME_GAP; 104 next = (uint8_t *) ring->base; 108 ring->next = (struct tpacket2_hdr *) next; 109 return ring->next; [all...] |
/external/libxml2/ |
H A D | list.c | 33 struct _xmlLink *next; member in struct:_xmlLink 61 (lk->prev)->next = lk->next; 62 (lk->next)->prev = lk->prev; 104 for(lk = l->sentinel->next;lk != l->sentinel && l->linkCompare(lk->data, data) <0 ;lk = lk->next); 206 l->sentinel->next = l->sentinel; 289 lkNew->next = lkPlace->next; 290 (lkPlace->next) 430 xmlLinkPtr next = lk->next; local [all...] |
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/writer/util/ |
H A D | TryListBuilder.java | 56 listStart.next = listEnd; 101 public MutableTryBlock<EH> next = null; field in class:TryListBuilder.MutableTryBlock 140 next.prev = prev; 141 prev.next = next; 145 //assert next.startCodeAddress == this.endCodeAddress; 146 this.endCodeAddress = next.endCodeAddress; 147 next.delete(); 151 next.prev = tryBlock; 152 tryBlock.next [all...] |
/external/jmonkeyengine/engine/src/core/com/jme3/util/ |
H A D | 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; 153 e.next = newTable[index]; 155 e = next; 172 Entry next = e.next; 236 public Entry next() { method in class:IntMap.IntMapIterator 275 Entry next; field in class:IntMap.Entry [all...] |
/external/opencv/cv/src/ |
H A D | cvemd.cpp | 69 struct CvNode1D *next; member in struct:CvNode1D 77 struct CvNode2D *next[2]; /* next row & next column */ member in struct:CvNode2D 595 u0_head.next = u; 598 u[i].next = u + i + 1; 600 u[ssize - 1].next = 0; 601 u1_head.next = 0; 603 v0_head.next = ssize > 1 ? v + 1 : 0; 606 v[i].next [all...] |
/external/fsck_msdos/ |
H A D | fat.c | 138 checkclnum(struct bootblock *boot, int fat, cl_t cl, cl_t *next) argument 140 if (*next >= (CLUST_RSRVD&boot->ClustMask)) 141 *next |= ~boot->ClustMask; 142 if (*next == CLUST_FREE) { 146 if (*next == CLUST_BAD) { 150 if (*next < CLUST_FIRST 151 || (*next >= boot->NumClusters && *next < CLUST_EOFS)) { 154 *next < CLUST_RSRVD ? "out of range" : "reserved", 155 *next [all...] |