| /libcore/ojluni/src/main/java/sun/misc/ |
| Cleaner.java | 75 next = null, field in class:Cleaner
80 cl.next = first;
90 if (cl.next == cl)
95 if (cl.next != null)
96 first = cl.next;
100 if (cl.next != null)
101 cl.next.prev = cl.prev;
103 cl.prev.next = cl.next;
106 cl.next = cl
[all...] |
| /external/libcxx/test/std/containers/associative/map/map.ops/ |
| upper_bound.pass.cpp | 44 assert(r == next(m.begin(), 1));
46 assert(r == next(m.begin(), 2));
48 assert(r == next(m.begin(), 3));
50 assert(r == next(m.begin(), 4));
52 assert(r == next(m.begin(), 5));
54 assert(r == next(m.begin(), 6));
56 assert(r == next(m.begin(), 7));
58 assert(r == next(m.begin(), 8));
60 assert(r == next(m.begin(), 0));
62 assert(r == next(m.begin(), 1))
[all...] |
| /external/libcxx/test/std/containers/associative/set/ |
| upper_bound.pass.cpp | 44 assert(r == next(m.begin(), 1));
46 assert(r == next(m.begin(), 2));
48 assert(r == next(m.begin(), 3));
50 assert(r == next(m.begin(), 4));
52 assert(r == next(m.begin(), 5));
54 assert(r == next(m.begin(), 6));
56 assert(r == next(m.begin(), 7));
58 assert(r == next(m.begin(), 8));
60 assert(r == next(m.begin(), 0));
62 assert(r == next(m.begin(), 1))
[all...] |
| lower_bound.pass.cpp | 46 assert(r == next(m.begin()));
48 assert(r == next(m.begin(), 2));
50 assert(r == next(m.begin(), 3));
52 assert(r == next(m.begin(), 4));
54 assert(r == next(m.begin(), 5));
56 assert(r == next(m.begin(), 6));
58 assert(r == next(m.begin(), 7));
60 assert(r == next(m.begin(), 0));
62 assert(r == next(m.begin(), 1));
64 assert(r == next(m.begin(), 2))
[all...] |
| find.pass.cpp | 46 assert(r == next(m.begin()));
48 assert(r == next(m.begin(), 2));
50 assert(r == next(m.begin(), 3));
52 assert(r == next(m.begin(), 4));
54 assert(r == next(m.begin(), 5));
56 assert(r == next(m.begin(), 6));
58 assert(r == next(m.begin(), 7));
60 assert(r == next(m.begin(), 8));
79 assert(r == next(m.begin()));
81 assert(r == next(m.begin(), 2))
[all...] |
| /libcore/luni/src/test/java/libcore/xml/ |
| PullParserDtdTest.java | 41 while (parser.next() != XmlPullParser.END_DOCUMENT) {
64 assertEquals(XmlPullParser.START_TAG, parser.next());
65 assertEquals(XmlPullParser.TEXT, parser.next());
67 assertEquals(XmlPullParser.END_TAG, parser.next());
68 assertEquals(XmlPullParser.END_DOCUMENT, parser.next());
76 assertEquals(XmlPullParser.START_TAG, parser.next());
77 assertEquals(XmlPullParser.TEXT, parser.next());
79 assertEquals(XmlPullParser.END_TAG, parser.next());
80 assertEquals(XmlPullParser.END_DOCUMENT, parser.next());
86 assertEquals(XmlPullParser.START_TAG, parser.next());
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/map/map.ops/ |
| upper_bound.pass.cpp | 44 assert(r == next(m.begin(), 1));
46 assert(r == next(m.begin(), 2));
48 assert(r == next(m.begin(), 3));
50 assert(r == next(m.begin(), 4));
52 assert(r == next(m.begin(), 5));
54 assert(r == next(m.begin(), 6));
56 assert(r == next(m.begin(), 7));
58 assert(r == next(m.begin(), 8));
60 assert(r == next(m.begin(), 0));
62 assert(r == next(m.begin(), 1))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/set/ |
| upper_bound.pass.cpp | 44 assert(r == next(m.begin(), 1));
46 assert(r == next(m.begin(), 2));
48 assert(r == next(m.begin(), 3));
50 assert(r == next(m.begin(), 4));
52 assert(r == next(m.begin(), 5));
54 assert(r == next(m.begin(), 6));
56 assert(r == next(m.begin(), 7));
58 assert(r == next(m.begin(), 8));
60 assert(r == next(m.begin(), 0));
62 assert(r == next(m.begin(), 1))
[all...] |
| lower_bound.pass.cpp | 46 assert(r == next(m.begin()));
48 assert(r == next(m.begin(), 2));
50 assert(r == next(m.begin(), 3));
52 assert(r == next(m.begin(), 4));
54 assert(r == next(m.begin(), 5));
56 assert(r == next(m.begin(), 6));
58 assert(r == next(m.begin(), 7));
60 assert(r == next(m.begin(), 0));
62 assert(r == next(m.begin(), 1));
64 assert(r == next(m.begin(), 2))
[all...] |
| /hardware/interfaces/renderscript/1.0/ |
| IContext.hal | 55 @callflow(next={"*"})
72 @callflow(next={"*"})
83 @callflow(next={"*"})
100 @callflow(next={"*"})
115 @callflow(next={"*"})
132 @callflow(next={"*"})
146 @callflow(next={"*"})
159 @callflow(next={"*"})
168 @callflow(next={"*"})
181 @callflow(next={"*"}
[all...] |
| /external/libcxx/test/std/containers/associative/multimap/multimap.cons/ |
| iter_iter.pass.cpp | 43 assert(*next(m.begin()) == V(1, 1.5));
44 assert(*next(m.begin(), 2) == V(1, 2));
45 assert(*next(m.begin(), 3) == V(2, 1));
46 assert(*next(m.begin(), 4) == V(2, 1.5));
47 assert(*next(m.begin(), 5) == V(2, 2));
48 assert(*next(m.begin(), 6) == V(3, 1));
49 assert(*next(m.begin(), 7) == V(3, 1.5));
50 assert(*next(m.begin(), 8) == V(3, 2));
71 assert(*next(m.begin()) == V(1, 1.5));
72 assert(*next(m.begin(), 2) == V(1, 2))
[all...] |
| iter_iter_comp_alloc.pass.cpp | 49 assert(*next(m.begin()) == V(1, 1.5));
50 assert(*next(m.begin(), 2) == V(1, 2));
51 assert(*next(m.begin(), 3) == V(2, 1));
52 assert(*next(m.begin(), 4) == V(2, 1.5));
53 assert(*next(m.begin(), 5) == V(2, 2));
54 assert(*next(m.begin(), 6) == V(3, 1));
55 assert(*next(m.begin(), 7) == V(3, 1.5));
56 assert(*next(m.begin(), 8) == V(3, 2));
81 assert(*next(m.begin()) == V(1, 1.5));
82 assert(*next(m.begin(), 2) == V(1, 2))
[all...] |
| /external/skia/src/sksl/lex/ |
| NFA.cpp | 13 std::vector<int> next; local
18 next.push_back(nextId);
20 next.insert(next.end(), fStates[nextId].fData.begin(),
26 if (!next.size()) {
29 states = next;
|
| /external/skqp/src/sksl/lex/ |
| NFA.cpp | 13 std::vector<int> next; local
18 next.push_back(nextId);
20 next.insert(next.end(), fStates[nextId].fData.begin(),
26 if (!next.size()) {
29 states = next;
|
| /hardware/interfaces/graphics/composer/2.1/ |
| IComposer.hal | 64 @callflow(next="*")
75 @callflow(next="*")
89 @callflow(next="*")
|
| IComposerCallback.hal | 47 @callflow(next="*")
61 @callflow(next="*")
73 @callflow(next="*")
|
| /hardware/interfaces/thermal/1.0/ |
| IThermal.hal | 35 @callflow(next={"*"})
53 @callflow(next={"*"})
72 @callflow(next={"*"})
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multimap/multimap.cons/ |
| iter_iter.pass.cpp | 43 assert(*next(m.begin()) == V(1, 1.5));
44 assert(*next(m.begin(), 2) == V(1, 2));
45 assert(*next(m.begin(), 3) == V(2, 1));
46 assert(*next(m.begin(), 4) == V(2, 1.5));
47 assert(*next(m.begin(), 5) == V(2, 2));
48 assert(*next(m.begin(), 6) == V(3, 1));
49 assert(*next(m.begin(), 7) == V(3, 1.5));
50 assert(*next(m.begin(), 8) == V(3, 2));
71 assert(*next(m.begin()) == V(1, 1.5));
72 assert(*next(m.begin(), 2) == V(1, 2))
[all...] |
| iter_iter_comp_alloc.pass.cpp | 49 assert(*next(m.begin()) == V(1, 1.5));
50 assert(*next(m.begin(), 2) == V(1, 2));
51 assert(*next(m.begin(), 3) == V(2, 1));
52 assert(*next(m.begin(), 4) == V(2, 1.5));
53 assert(*next(m.begin(), 5) == V(2, 2));
54 assert(*next(m.begin(), 6) == V(3, 1));
55 assert(*next(m.begin(), 7) == V(3, 1.5));
56 assert(*next(m.begin(), 8) == V(3, 2));
81 assert(*next(m.begin()) == V(1, 1.5));
82 assert(*next(m.begin(), 2) == V(1, 2))
[all...] |
| /system/core/liblog/ |
| config_read.h | 30 for ((transp) = node_to_item((transports)->next, \
34 ((transp) != node_to_item((transp)->node.next, \
36 (transp) = node_to_item((transp)->node.next, \
40 for ((transp) = node_to_item((transports)->next, \
42 (n) = (transp)->node.next; \
48 (n) = (transp)->node.next)
|
| config_write.h | 30 for ((transp) = node_to_item((transports)->next, \
34 ((transp) != node_to_item((transp)->node.next, \
36 (transp) = node_to_item((transp)->node.next, \
40 for ((transp) = node_to_item((transports)->next, \
42 (n) = (transp)->node.next; \
48 (n) = (transp)->node.next)
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/ |
| rotatingtree.c | 66 rotating_node_t *next;
local
75 next = node->left;
76 if (next == NULL)
79 node->left = next->right;
80 next->right = node;
81 *pnode = next;
87 next = node->right;
88 if (next == NULL)
91 node->right = next->left;
92 next->left = node;
[all...] |
| /external/libcxx/test/std/containers/associative/multiset/ |
| find.pass.cpp | 46 assert(r == next(m.begin()));
48 assert(r == next(m.begin(), 2));
50 assert(r == next(m.begin(), 3));
52 assert(r == next(m.begin(), 4));
54 assert(r == next(m.begin(), 5));
56 assert(r == next(m.begin(), 6));
58 assert(r == next(m.begin(), 7));
60 assert(r == next(m.begin(), 8));
79 assert(r == next(m.begin()));
81 assert(r == next(m.begin(), 2))
[all...] |
| /external/llvm/unittests/ADT/ |
| SetVectorTest.cpp | 25 auto I = S.erase(std::next(S.begin()));
29 EXPECT_EQ(std::next(S.begin()), I);
32 EXPECT_EQ(2, *std::next(S.begin()));
|
| /external/python/cpython2/Modules/ |
| rotatingtree.c | 66 rotating_node_t *next; local
75 next = node->left;
76 if (next == NULL)
79 node->left = next->right;
80 next->right = node;
81 *pnode = next;
87 next = node->right;
88 if (next == NULL)
91 node->right = next->left;
92 next->left = node
[all...] |
