| /external/libcxx/test/containers/associative/multimap/multimap.cons/ |
| iter_iter.pass.cpp | 42 assert(*next(m.begin()) == V(1, 1.5));
43 assert(*next(m.begin(), 2) == V(1, 2));
44 assert(*next(m.begin(), 3) == V(2, 1));
45 assert(*next(m.begin(), 4) == V(2, 1.5));
46 assert(*next(m.begin(), 5) == V(2, 2));
47 assert(*next(m.begin(), 6) == V(3, 1));
48 assert(*next(m.begin(), 7) == V(3, 1.5));
49 assert(*next(m.begin(), 8) == V(3, 2));
70 assert(*next(m.begin()) == V(1, 1.5));
71 assert(*next(m.begin(), 2) == V(1, 2))
[all...] |
| iter_iter_comp.pass.cpp | 46 assert(*next(m.begin()) == V(1, 1.5));
47 assert(*next(m.begin(), 2) == V(1, 2));
48 assert(*next(m.begin(), 3) == V(2, 1));
49 assert(*next(m.begin(), 4) == V(2, 1.5));
50 assert(*next(m.begin(), 5) == V(2, 2));
51 assert(*next(m.begin(), 6) == V(3, 1));
52 assert(*next(m.begin(), 7) == V(3, 1.5));
53 assert(*next(m.begin(), 8) == V(3, 2));
76 assert(*next(m.begin()) == V(1, 1.5));
77 assert(*next(m.begin(), 2) == V(1, 2))
[all...] |
| /external/libcxx/test/containers/associative/set/ |
| lower_bound.pass.cpp | 45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 0));
61 assert(r == next(m.begin(), 1));
63 assert(r == next(m.begin(), 2))
[all...] |
| find.pass.cpp | 45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 8));
78 assert(r == next(m.begin()));
80 assert(r == next(m.begin(), 2))
[all...] |
| /external/mockito/src/org/mockito/internal/configuration/injection/filter/ |
| NameBasedCandidateFilter.java | 15 private final MockCandidateFilter next;
field in class:NameBasedCandidateFilter
18 public NameBasedCandidateFilter(MockCandidateFilter next) {
19 this.next = next;
30 return next.filterCandidate(mockNameMatches, field, fieldInstance);
32 return next.filterCandidate(mocks, field, fieldInstance);
|
| /external/skia/src/views/ |
| SkTagList.cpp | 38 SkTagList* next = rec->fNext;
43 prev->fNext = next;
45 *head = next;
50 rec = next;
58 SkTagList* next = rec->fNext;
60 rec = next;
|
| /libcore/luni/src/main/java/java/util/ |
| AbstractSet.java | 79 Object next = it.next(); local
80 result += next == null ? 0 : next.hashCode();
102 if (collection.contains(it.next())) {
110 result = remove(it.next()) || result;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.ops/ |
| lower_bound.pass.cpp | 45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 0));
61 assert(r == next(m.begin(), 1));
63 assert(r == next(m.begin(), 2))
[all...] |
| find.pass.cpp | 45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 8));
78 assert(r == next(m.begin()));
80 assert(r == next(m.begin(), 2))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.cons/ |
| iter_iter.pass.cpp | 42 assert(*next(m.begin()) == V(1, 1.5));
43 assert(*next(m.begin(), 2) == V(1, 2));
44 assert(*next(m.begin(), 3) == V(2, 1));
45 assert(*next(m.begin(), 4) == V(2, 1.5));
46 assert(*next(m.begin(), 5) == V(2, 2));
47 assert(*next(m.begin(), 6) == V(3, 1));
48 assert(*next(m.begin(), 7) == V(3, 1.5));
49 assert(*next(m.begin(), 8) == V(3, 2));
70 assert(*next(m.begin()) == V(1, 1.5));
71 assert(*next(m.begin(), 2) == V(1, 2))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/ |
| lower_bound.pass.cpp | 45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 0));
61 assert(r == next(m.begin(), 1));
63 assert(r == next(m.begin(), 2))
[all...] |
| find.pass.cpp | 45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 8));
78 assert(r == next(m.begin()));
80 assert(r == next(m.begin(), 2))
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| span.cc | 73 list->next = list;
78 span->prev->next = span->next;
79 span->next->prev = span->prev;
81 span->next = NULL;
86 for (Span* s = list->next; s != list; s = s->next) {
93 ASSERT(span->next == NULL);
95 span->next = list->next;
[all...] |
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| span.cc | 73 list->next = list;
78 span->prev->next = span->next;
79 span->next->prev = span->prev;
81 span->next = NULL;
86 for (Span* s = list->next; s != list; s = s->next) {
93 ASSERT(span->next == NULL);
95 span->next = list->next;
[all...] |
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_list.h | 41 x->next = 0;
45 x->next = 0;
46 last_->next = x;
54 x->next = 0;
58 x->next = first_;
66 first_ = first_->next;
82 l->last_->next = first_;
96 last_->next = l->first_;
109 for (Item *i = first_; ; i = i->next) {
114 CHECK_EQ(last_->next, 0)
122 Item *next() { function in class:__sanitizer::IntrusiveList::Iterator
[all...] |
| /external/libcxx/test/containers/associative/map/map.ops/ |
| find.pass.cpp | 45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 8));
78 assert(r == next(m.begin()));
80 assert(r == next(m.begin(), 2))
[all...] |
| /external/libcxx/test/containers/associative/multiset/ |
| find.pass.cpp | 45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 8));
78 assert(r == next(m.begin()));
80 assert(r == next(m.begin(), 2))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| find.pass.cpp | 45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 8));
78 assert(r == next(m.begin()));
80 assert(r == next(m.begin(), 2))
[all...] |
| /bionic/libc/stdio/ |
| glue.h | 44 struct glue *next; member in struct:glue
|
| /bionic/libc/upstream-openbsd/lib/libc/stdlib/ |
| atexit.h | 34 struct atexit *next; /* next in list */ member in struct:atexit
35 int ind; /* next index in this table */
|
| /bionic/linker/ |
| linked_list.h | 24 LinkedListEntry<T>* next; member in struct:LinkedListEntry
41 new_entry->next = head_;
51 new_entry->next = nullptr;
56 tail_->next = new_entry;
68 head_ = entry->next;
81 head_ = head_->next;
98 for (LinkedListEntry<T>* e = head_; e != nullptr; e = e->next) {
110 LinkedListEntry<T>* next = e->next; local
112 head_ = next;
[all...] |
| /dalvik/dx/src/com/android/multidex/ |
| ArchivePathElement.java | 67 ZipEntry next = null;
71 while (next == null && delegate.hasMoreElements()) {
72 next = delegate.nextElement();
73 if (next.isDirectory()) {
74 next = null;
77 return next != null;
81 public String next() { method
83 String name = next.getName();
84 next = null;
|
| /external/chromium_org/third_party/skia/samplecode/ |
| TransitionView.h | 13 SkView* create_transition(SkView* prev, SkView* next, int direction);
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkAutoKern.h | 15 #define SkAutoKern_AdjustF(prev, next) (((next) - (prev) + 32) >> 6 << 16)
16 #define SkAutoKern_AdjustS(prev, next) SkIntToScalar(((next) - (prev) + 32) >> 6)
|
| /external/dhcpcd/ |
| control.h | 36 struct fd_list *next; member in struct:fd_list
|
