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

1234567891011>>

/external/libcxx/test/containers/associative/map/map.modifiers/
H A Dinsert_iter_iter.pass.cpp45 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 Dlsusb.c33 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 DPVisitedNetworkIDParser.java135 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_org/third_party/mesa/src/src/gallium/auxiliary/pipe-loader/
H A Dpipe_loader.c15 * 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/guava/guava-tests/test/com/google/common/collect/
H A DUnmodifiableListIteratorTest.java38 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 DLEInsertionList.cpp17 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 Dpipe_loader.c15 * 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/chromium_org/third_party/WebKit/Source/core/rendering/
H A DCounterNode.cpp106 CounterNode* next = current->m_nextSibling; local
107 for (; !next; next = current->m_nextSibling) {
112 return next;
117 if (CounterNode* next = m_firstChild)
118 return next;
213 m_rootRenderer->invalidate(); // This makes m_rootRenderer point to the next renderer if any since it disconnects the m_rootRenderer from this.
253 CounterNode* next; local
256 next = refChild->m_nextSibling;
259 next
330 CounterNode* next = oldChild->m_nextSibling; local
[all...]
/external/valgrind/main/coregrind/m_gdbserver/
H A Dinferiors.c44 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/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
H A Du_mm.c44 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 Du_dirty_surfaces.h14 * 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/chromium_org/third_party/mesa/src/src/mesa/main/
H A Dmm.c42 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/harfbuzz_ng/test/api/
H A Dtest-set.c35 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/mesa3d/src/gallium/auxiliary/util/
H A Du_mm.c44 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 Du_dirty_surfaces.h14 * 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 Dmm.c42 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/containers/associative/multimap/multimap.ops/
H A Dupper_bound.pass.cpp46 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/elfutils/0.153/src/
H A Dldscript.y186 if ($3 != $3->next)
188 $3->next->group_start = 1;
205 $2->next = $1->next;
206 $$ = $1->next = $2;
221 $$->val.section.input = $3->next;
227 $3->next = NULL;
235 $$->val.section.input->next = NULL;
261 $2->next = $1->next;
[all...]
/external/chromium_org/third_party/libxml/src/
H A Dlist.c33 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/libxml2/
H A Dlist.c33 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/oprofile/libutil++/
H A Dstring_manip.cpp57 string next; local
64 next += sep;
66 next += '\\';
69 result.push_back(next);
71 next.erase(next.begin(), next.end());
73 next += ch;
77 if (!next.empty())
78 result.push_back(next);
[all...]
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/writer/util/
H A DTryListBuilder.java56 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/chromium_org/third_party/WebKit/Source/platform/text/
H A DBidiRunList.h106 Run* next = m_firstRun; local
107 while (next != run) {
108 current = next;
109 next = current->next();
113 m_firstRun = run->next();
130 Run* next = current->next(); local
131 while (next != run) {
132 current = next;
233 Run* next = curr->next(); local
[all...]
/external/opencv/cv/src/
H A Dcvemd.cpp69 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/chromium_org/third_party/WebKit/Source/core/dom/
H A DNodeTraversal.cpp46 if (Node* next = current.pseudoAwareFirstChild())
47 return next;
50 if (Node* next = current.pseudoAwareNextSibling())
51 return next;
55 if (Node* next = parent->pseudoAwareNextSibling())
56 return next;
65 if (Node* next = current.pseudoAwareNextSibling())
66 return next;
70 if (Node* next = parent->pseudoAwareNextSibling())
71 return next;
[all...]

Completed in 8059 milliseconds

1234567891011>>