| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
| resize_size_value.pass.cpp | 35 assert(*next(c.begin(), 0) == 0);
36 assert(*next(c.begin(), 1) == 1);
37 assert(*next(c.begin(), 2) == 2);
41 assert(*next(c.begin(), 0) == 0);
42 assert(*next(c.begin(), 1) == 1);
43 assert(*next(c.begin(), 2) == 2);
44 assert(*next(c.begin(), 3) == 10);
45 assert(*next(c.begin(), 4) == 10);
46 assert(*next(c.begin(), 5) == 10);
50 assert(*next(c.begin(), 0) == 0)
[all...] |
| /external/libcxx/test/std/containers/associative/multiset/ |
| 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(m.begin(), 6) == 7)
[all...] |
| /external/libcxx/test/std/containers/associative/set/ |
| 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(m.begin(), 6) == 7)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multiset/ |
| 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(m.begin(), 6) == 7)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/set/ |
| 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(m.begin(), 6) == 7)
[all...] |
| /external/libcxx/test/std/containers/associative/multimap/multimap.modifiers/ |
| erase_iter.pass.cpp | 49 I i = m.erase(next(m.cbegin(), 3));
51 assert(i == next(m.begin(), 3));
54 assert(next(m.begin())->first == 1);
55 assert(next(m.begin())->second == 1.5);
56 assert(next(m.begin(), 2)->first == 1);
57 assert(next(m.begin(), 2)->second == 2);
58 assert(next(m.begin(), 3)->first == 2);
59 assert(next(m.begin(), 3)->second == 1.5);
60 assert(next(m.begin(), 4)->first == 2);
61 assert(next(m.begin(), 4)->second == 2)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multimap/multimap.modifiers/ |
| erase_iter.pass.cpp | 49 I i = m.erase(next(m.cbegin(), 3));
51 assert(i == next(m.begin(), 3));
54 assert(next(m.begin())->first == 1);
55 assert(next(m.begin())->second == 1.5);
56 assert(next(m.begin(), 2)->first == 1);
57 assert(next(m.begin(), 2)->second == 2);
58 assert(next(m.begin(), 3)->first == 2);
59 assert(next(m.begin(), 3)->second == 1.5);
60 assert(next(m.begin(), 4)->first == 2);
61 assert(next(m.begin(), 4)->second == 2)
[all...] |
| /external/iptables/libiptc/ |
| 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);
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
[all...] |
| /external/libnetfilter_conntrack/include/internal/ |
| linux_list.h | 53 * sometimes we already know the next/prev entries and we can
59 struct list_head *next, *prev; member in struct:list_head
68 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
75 * the prev/next entries already!
79 struct list_head *next)
81 next->prev = new;
82 new->next = next;
84 prev->next = new;
97 __list_add(new, head, head->next);
284 struct list_head *next = head->next; local
519 struct hlist_node *next, **pprev; member in struct:hlist_node
539 struct hlist_node *next = n->next; local
[all...] |
| /external/libnfnetlink/include/ |
| linux_list.h | 52 * sometimes we already know the next/prev entries and we can
58 struct list_head *next, *prev; member in struct:list_head
67 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
74 * the prev/next entries already!
78 struct list_head *next)
80 next->prev = new;
81 new->next = next;
83 prev->next = new;
96 __list_add(new, head, head->next);
283 struct list_head *next = head->next; local
518 struct hlist_node *next, **pprev; member in struct:hlist_node
538 struct hlist_node *next = n->next; local
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/util/ |
| 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
|
| /dalvik/dx/src/com/android/dx/util/ |
| 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
|
| /device/linaro/bootloader/edk2/StdLib/LibC/Stdio/ |
| glue.h | 42 struct glue *next;
member in struct:glue
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ |
| 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/icu/android_icu4j/src/main/java/android/icu/text/ |
| UForwardCharacterIterator.java | 35 * <p>ForwardCharacterIterator provides next() to access
53 * while((c=it.next())!=UForwardCharacterIterator.DONE) {
69 * Returns the UTF16 code unit at index, and increments to the next
73 * @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/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| UForwardCharacterIterator.java | 34 * <p>ForwardCharacterIterator provides next() to access
52 * while((c=it.next())!=UForwardCharacterIterator.DONE) {
69 * Returns the UTF16 code unit at index, and increments to the next
73 * @return the next UTF16 code unit, or DONE if the index is at the limit
77 public int next(); method in interface:UForwardCharacterIterator
80 * Returns the code point at index, and increments to the next code
83 * <code>next()</code>. Otherwise the iterator is incremented past
86 * @return the next codepoint in text, or DONE if the index is at
|
| /external/mockito/src/main/java/org/mockito/internal/progress/ |
| SequenceNumber.java | 11 public static synchronized int next() { method in class:SequenceNumber
|
| /external/owasp/sanitizer/src/main/org/owasp/html/ |
| TokenStream.java | 32 HtmlToken next(); method in interface:TokenStream
|
| /external/syslinux/com32/lib/ |
| atexit.h | 13 struct atexit *next; member in struct:atexit
|
| /hardware/interfaces/vr/1.0/ |
| IVr.hal | 24 @callflow(next={"*"})
38 @callflow(next={"*"})
|
| /external/libcxx/test/std/containers/associative/map/map.modifiers/ |
| erase_key.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(m.begin(), 5)->second == 6.5)
[all...] |
| /external/syslinux/gpxe/src/include/gpxe/ |
| list.h | 22 * sometimes we already know the next/prev entries and we can
28 struct list_head *next; member in struct:list_head
38 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
45 * the prev/next entries already!
49 struct list_head *next ) {
50 next->prev = new;
51 new->next = next;
53 prev->next = new;
66 __list_add ( new, head, head->next );
[all...] |
| /frameworks/layoutlib/bridge/tests/src/com/android/layoutlib/bridge/impl/ |
| LayoutParserWrapperTest.java | 40 assertEquals("Expected START_TAG", START_TAG, parser.next());
42 for (int next = parser.next(); next != START_TAG && next != END_DOCUMENT;
43 next = parser.next());
53 for (int next = parser.next();
54 (next != END_TAG || !"RelativeLayout".equals(parser.getName())) && next != END_DOCUMENT
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/map/map.modifiers/ |
| erase_key.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(m.begin(), 5)->second == 6.5)
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| kernel-list.h | 9 * sometimes we already know the next/prev entries and we can
15 struct list_head *next, *prev; member in struct:list_head
21 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
32 * the prev/next entries already!
36 struct list_head * next)
38 next->prev = new;
39 new->next = next;
41 prev->next = new;
49 __list_add(new, head, head->next);
[all...] |
