| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/intel/ |
| 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->prev = elem->prev
101 struct intel_resolve_map *next = head->next; local
[all...] |
| /external/libcxx/test/containers/associative/map/map.modifiers/ |
| 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(m.begin(), 5)->second == 6.5)
[all...] |
| 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/libcxx/test/containers/associative/multimap/multimap.modifiers/ |
| 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(m.begin(), 5)->second == 6.5)
[all...] |
| 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(m.begin(), 4)->second == 2)
[all...] |
| /external/mesa3d/src/mesa/drivers/dri/intel/ |
| 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->prev = elem->prev
101 struct intel_resolve_map *next = head->next; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.modifiers/ |
| 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(m.begin(), 5)->second == 6.5)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.modifiers/ |
| 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(m.begin(), 5)->second == 6.5)
[all...] |
| 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(m.begin(), 4)->second == 2)
[all...] |
| /external/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
| 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(c.begin(), 0) == 0)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
| 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(c.begin(), 0) == 0)
[all...] |
| /external/libcxx/test/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/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...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/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...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/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/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...] |
| /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
|
| /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/dexmaker/src/dx/java/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
|
| /external/linux-tools-perf/perf-3.12.0/tools/perf/util/include/linux/ |
| list.h | 18 begin->prev->next = end->next;
19 end->next->prev = begin->prev;
28 for (; pos != (head); pos = pos->next)
|
| /external/mockito/src/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
|
| /libcore/luni/src/main/java/java/util/ |
| Iterator.java | 24 * methods {@code next} and {@code hasNext()} may throw a {@code ConcurrentModificationException}.
38 * @see #next
43 * Returns the next object and advances the iterator.
45 * @return the next object.
50 public E next(); method in interface:Iterator
53 * Removes the last object returned by {@code next} from the collection.
54 * This method can only be called once between each call to {@code next}.
60 * if {@code next} has not been called, or {@code remove} has
61 * already been called after the last call to {@code next}.
|
| /external/clang/test/CodeGenCXX/ |
| function-template-specialization.cpp | 3 T* next(T* ptr, const U& diff);
6 T* next(T* ptr, const U& diff) { function
12 iptr = next(iptr, diff);
15 fptr = next(fptr, diff);
19 T* next(T* ptr, const U& diff);
22 iptr = next(iptr, diff);
25 dptr = next(dptr, diff);
|
