/external/libunwind/src/mi/ |
H A D | dyn-cancel.c | 36 di->prev->next = di->next; 38 _U_dyn_info_list.first = di->next; 40 if (di->next) 41 di->next->prev = di->prev; 45 di->next = di->prev = NULL;
|
/external/okhttp/okio/okio/src/main/java/okio/ |
H A D | SegmentPool.java | 28 static Segment next; field in class:SegmentPool 38 if (next != null) { 39 Segment result = next; 40 next = result.next; 41 result.next = null; 50 if (segment.next != null || segment.prev != null) throw new IllegalArgumentException(); 55 segment.next = next; 57 next [all...] |
/external/libusb-compat/libusb/ |
H A D | usbi.h | 28 ent->next = begin; \ 29 ent->next->prev = ent; \ 31 ent->next = NULL; \ 39 ent->prev->next = ent->next; \ 41 begin = ent->next; \ 42 if (ent->next) \ 43 ent->next->prev = ent->prev; \ 45 ent->next = NULL; \
|
/external/libcxx/test/std/containers/associative/multiset/ |
H A D | erase_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 3)); 42 assert(i == next(m.begin(), 3)); 43 assert(*next(m.begin(), 0) == 1); 44 assert(*next(m.begin(), 1) == 2); 45 assert(*next(m.begin(), 2) == 3); 46 assert(*next(m.begin(), 3) == 5); 47 assert(*next(m.begin(), 4) == 6); 48 assert(*next(m.begin(), 5) == 7); 49 assert(*next(m.begin(), 6) == 8); 51 i = m.erase(next( [all...] |
H A D | insert_iter_iter.pass.cpp | 44 assert(*next(m.begin(), 0) == 1); 45 assert(*next(m.begin(), 1) == 1); 46 assert(*next(m.begin(), 2) == 1); 47 assert(*next(m.begin(), 3) == 2); 48 assert(*next(m.begin(), 4) == 2); 49 assert(*next(m.begin(), 5) == 2); 50 assert(*next(m.begin(), 6) == 3); 51 assert(*next(m.begin(), 7) == 3); 52 assert(*next(m.begin(), 8) == 3); 74 assert(*next( [all...] |
H A D | erase_iter_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5)); 42 assert(i == next(m.begin(), 5)); 43 assert(*next(m.begin(), 0) == 1); 44 assert(*next(m.begin(), 1) == 2); 45 assert(*next(m.begin(), 2) == 3); 46 assert(*next(m.begin(), 3) == 4); 47 assert(*next(m.begin(), 4) == 5); 48 assert(*next(m.begin(), 5) == 6); 49 assert(*next( [all...] |
/external/libcxx/test/std/containers/associative/set/ |
H A D | erase_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 3)); 42 assert(i == next(m.begin(), 3)); 43 assert(*next(m.begin(), 0) == 1); 44 assert(*next(m.begin(), 1) == 2); 45 assert(*next(m.begin(), 2) == 3); 46 assert(*next(m.begin(), 3) == 5); 47 assert(*next(m.begin(), 4) == 6); 48 assert(*next(m.begin(), 5) == 7); 49 assert(*next(m.begin(), 6) == 8); 51 i = m.erase(next( [all...] |
H A D | erase_key.pass.cpp | 43 assert(*next(m.begin(), 0) == 1); 44 assert(*next(m.begin(), 1) == 2); 45 assert(*next(m.begin(), 2) == 3); 46 assert(*next(m.begin(), 3) == 4); 47 assert(*next(m.begin(), 4) == 5); 48 assert(*next(m.begin(), 5) == 6); 49 assert(*next(m.begin(), 6) == 7); 50 assert(*next(m.begin(), 7) == 8); 55 assert(*next(m.begin(), 0) == 1); 56 assert(*next( [all...] |
H A D | erase_iter_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5)); 42 assert(i == next(m.begin(), 5)); 43 assert(*next(m.begin(), 0) == 1); 44 assert(*next(m.begin(), 1) == 2); 45 assert(*next(m.begin(), 2) == 3); 46 assert(*next(m.begin(), 3) == 4); 47 assert(*next(m.begin(), 4) == 5); 48 assert(*next(m.begin(), 5) == 6); 49 assert(*next( [all...] |
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
H A D | erase_after_many.pass.cpp | 27 C::iterator i = c.erase_after(next(c.cbefore_begin(), 4), next(c.cbefore_begin(), 4)); 28 assert(i == next(c.cbefore_begin(), 4)); 30 assert(*next(c.begin(), 0) == 0); 31 assert(*next(c.begin(), 1) == 1); 32 assert(*next(c.begin(), 2) == 2); 33 assert(*next(c.begin(), 3) == 3); 34 assert(*next(c.begin(), 4) == 4); 35 assert(*next(c.begin(), 5) == 5); 36 assert(*next( [all...] |
H A D | resize_size_value.pass.cpp | 30 assert(*next(c.begin(), 0) == 0); 31 assert(*next(c.begin(), 1) == 1); 32 assert(*next(c.begin(), 2) == 2); 36 assert(*next(c.begin(), 0) == 0); 37 assert(*next(c.begin(), 1) == 1); 38 assert(*next(c.begin(), 2) == 2); 39 assert(*next(c.begin(), 3) == 10); 40 assert(*next(c.begin(), 4) == 10); 41 assert(*next(c.begin(), 5) == 10); 45 assert(*next( [all...] |
/external/libdrm/ |
H A D | libdrm_lists.h | 23 * next paragraph) shall be included in all copies or substantial portions 37 struct _drmMMListHead *next; member in struct:_drmMMListHead 43 (__item)->next = (__item); \ 49 (__item)->next = (__list)->next; \ 50 (__list)->next->prev = (__item); \ 51 (__list)->next = (__item); \ 56 (__item)->next = (__list); \ 58 (__list)->prev->next = (__item); \ 64 (__item)->prev->next [all...] |
/external/libcxx/test/std/containers/associative/multiset/multiset.cons/ |
H A D | iter_iter.pass.cpp | 43 assert(*next(m.begin(), 0) == 1); 44 assert(*next(m.begin(), 1) == 1); 45 assert(*next(m.begin(), 2) == 1); 46 assert(*next(m.begin(), 3) == 2); 47 assert(*next(m.begin(), 4) == 2); 48 assert(*next(m.begin(), 5) == 2); 49 assert(*next(m.begin(), 6) == 3); 50 assert(*next(m.begin(), 7) == 3); 51 assert(*next(m.begin(), 8) == 3); 72 assert(*next( [all...] |
/external/lldb/test/api/multithreaded/ |
H A D | inferior.cpp | 6 int next() { function 15 i = next();
|
/external/libcxx/test/std/containers/associative/map/map.modifiers/ |
H A D | erase_iter_iter.pass.cpp | 45 assert(next(m.begin())->first == 2); 46 assert(next(m.begin())->second == 2.5); 47 assert(next(m.begin(), 2)->first == 3); 48 assert(next(m.begin(), 2)->second == 3.5); 49 assert(next(m.begin(), 3)->first == 4); 50 assert(next(m.begin(), 3)->second == 4.5); 51 assert(next(m.begin(), 4)->first == 5); 52 assert(next(m.begin(), 4)->second == 5.5); 53 assert(next(m.begin(), 5)->first == 6); 54 assert(next( [all...] |
/external/libcxx/test/std/containers/associative/multimap/multimap.modifiers/ |
H A D | erase_iter_iter.pass.cpp | 45 assert(next(m.begin())->first == 2); 46 assert(next(m.begin())->second == 2.5); 47 assert(next(m.begin(), 2)->first == 3); 48 assert(next(m.begin(), 2)->second == 3.5); 49 assert(next(m.begin(), 3)->first == 4); 50 assert(next(m.begin(), 3)->second == 4.5); 51 assert(next(m.begin(), 4)->first == 5); 52 assert(next(m.begin(), 4)->second == 5.5); 53 assert(next(m.begin(), 5)->first == 6); 54 assert(next( [all...] |
H A D | erase_iter.pass.cpp | 41 I i = m.erase(next(m.cbegin(), 3)); 43 assert(i == next(m.begin(), 3)); 46 assert(next(m.begin())->first == 1); 47 assert(next(m.begin())->second == 1.5); 48 assert(next(m.begin(), 2)->first == 1); 49 assert(next(m.begin(), 2)->second == 2); 50 assert(next(m.begin(), 3)->first == 2); 51 assert(next(m.begin(), 3)->second == 1.5); 52 assert(next(m.begin(), 4)->first == 2); 53 assert(next( [all...] |
/external/mesa3d/src/mesa/drivers/dri/i915/ |
H A D | intel_resolve_map.c | 11 * The above copyright notice and this permission notice (including the next 41 struct intel_resolve_map **tail = &head->next; 50 tail = &(*tail)->next; 55 (*tail)->next = NULL; 70 struct intel_resolve_map *item = head->next; 76 item = item->next; 89 elem->prev->next = elem->next; 90 if (elem->next) 91 elem->next 101 struct intel_resolve_map *next = head->next; local [all...] |
/external/mesa3d/src/mesa/drivers/dri/i965/ |
H A D | intel_resolve_map.c | 11 * The above copyright notice and this permission notice (including the next 41 struct intel_resolve_map **tail = &head->next; 50 tail = &(*tail)->next; 55 (*tail)->next = NULL; 70 struct intel_resolve_map *item = head->next; 76 item = item->next; 89 elem->prev->next = elem->next; 90 if (elem->next) 91 elem->next 101 struct intel_resolve_map *next = head->next; local [all...] |
/external/mesa3d/src/mesa/drivers/dri/intel/ |
H A D | intel_resolve_map.c | 11 * The above copyright notice and this permission notice (including the next 41 struct intel_resolve_map **tail = &head->next; 50 tail = &(*tail)->next; 55 (*tail)->next = NULL; 70 struct intel_resolve_map *item = head->next; 76 item = item->next; 89 elem->prev->next = elem->next; 90 if (elem->next) 91 elem->next 101 struct intel_resolve_map *next = head->next; local [all...] |
/external/iptables/libiptc/ |
H A D | linux_list.h | 48 * sometimes we already know the next/prev entries and we can 54 struct list_head *next, *prev; member in struct:list_head 63 (ptr)->next = (ptr); (ptr)->prev = (ptr); \ 70 * the prev/next entries already! 74 struct list_head *next) 76 next->prev = new; 77 new->next = next; 79 prev->next = new; 92 __list_add(new, head, head->next); 72 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument 114 __list_add_rcu(struct list_head * new, struct list_head * prev, struct list_head * next) argument 174 __list_del(struct list_head * prev, struct list_head * next) argument 279 struct list_head *next = head->next; local 514 struct hlist_node *next, **pprev; member in struct:hlist_node 534 struct hlist_node *next = n->next; local 626 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument 635 hlist_add_after(struct hlist_node *n, struct hlist_node *next) argument [all...] |
/external/apache-xml/src/main/java/org/apache/xml/dtm/ |
H A D | DTMAxisTraverser.java | 38 * nodeHandle=myTraverser.next(myContext,nodeHandle)) 61 return next(context, context); 80 return next(context, context, extendedTypeID); 84 * Traverse to the next node after the current node. 94 * @return the next node in the iteration, or DTM.NULL. 97 public abstract int next(int context, int current); method in class:DTMAxisTraverser 100 * Traverse to the next node after the current node that is matched 112 * @return the next node in the iteration, or DTM.NULL. 115 public abstract int next(int context, int current, int extendedTypeID); method in class:DTMAxisTraverser
|
/external/dexmaker/src/dx/java/com/android/dx/util/ |
H A D | IntIterator.java | 25 * Checks to see if the iterator has a next value. 27 * @return true if next() will succeed 32 * Returns the next value in the iterator. 34 * @return next value 35 * @throws java.util.NoSuchElementException if no next element exists 37 int next(); method in interface:IntIterator
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
H A D | UForwardCharacterIterator.java | 32 * <p>ForwardCharacterIterator provides next() to access 50 * while((c=it.next())!=UForwardCharacterIterator.DONE) { 68 * Returns the UTF16 code unit at index, and increments to the next 72 * @return the next UTF16 code unit, or DONE if the index is at the limit 76 public int next(); method in interface:UForwardCharacterIterator 79 * Returns the code point at index, and increments to the next code 82 * <code>next()<code>. Otherwise the iterator is incremented past 85 * @return the next codepoint in text, or DONE if the index is at
|
/external/linux-tools-perf/src/tools/perf/util/include/linux/ |
H A D | list.h | 18 begin->prev->next = end->next; 19 end->next->prev = begin->prev; 28 for (; pos != (head); pos = pos->next)
|