| /bionic/libc/stdio/ |
| glue.h | 40 struct glue *next; member in struct:glue
|
| /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/util/include/linux/ |
| list.h | 26 begin->prev->next = end->next;
27 end->next->prev = begin->prev;
36 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
|
| /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/chromium_org/third_party/WebKit/Source/wtf/ |
| DecimalNumber.cpp | 105 LChar* next = buffer; local
113 *next++ = '-';
114 *next++ = '0';
115 *next++ = '.';
117 *next++ = '0';
119 *next++ = m_significand[i];
121 return next - buffer;
131 *next++ = '-';
133 *next++ = m_significand[i];
135 *next++ = '0'
161 LChar* next = buffer; local
[all...] |
| /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);
|
| /external/libvpx/libvpx/nestegg/halloc/src/ |
| hlist.h | 32 hlist_item_t * next; member in struct:hlist_head
37 hlist_item_t * next; member in struct:hlist_item
50 #define __hlist_init_item(i) { &hlist_null, &(i).next }
76 for (i = (h)->next; i != &hlist_null; i = i->next)
79 for (i = (h)->next, tmp = i->next; \
81 i = tmp, tmp = i->next)
89 h->next = &hlist_null;
95 i->prev = &i->next;
101 hlist_item_t * next; local
112 hlist_item_t * next; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/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...] |
| erase_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 3));
42 assert(i == next(m.begin(), 3));
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 == 5);
50 assert(next(m.begin(), 3)->second == 5.5);
51 assert(next(m.begin(), 4)->first == 6);
52 assert(next(m.begin(), 4)->second == 6.5)
[all...] |
| /device/lge/mako/camera/QCamera/stack/common/ |
| cam_list.h | 43 struct cam_list *next, *prev; member in struct:cam_list
48 ptr->next = ptr;
58 item->next = head;
60 prev->next = item;
66 struct cam_list *next = ptr->next; local
68 next->prev = ptr->prev;
69 prev->next = ptr->next;
70 ptr->next = ptr
[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
24 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
35 * the prev/next entries already!
39 struct list_head * next)
41 next->prev = new;
42 new->next = next;
44 prev->next = new;
52 __list_add(new, head, head->next);
[all...] |
| /external/elfutils/lib/ |
| list.h | 57 assert (_newp->next == NULL); \
60 (first) = _newp->next = _newp->previous = _newp; \
63 _newp->next = (first); \
65 _newp->previous->next = _newp->next->previous = _newp; \
76 || ({ __typeof (elem) _runp = first->next; \
81 _runp = _runp->next; \
83 if (unlikely (_elem->next == _elem)) \
87 _elem->next->previous = _elem->previous; \
88 _elem->previous->next = _elem->next;
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.modifiers/ |
| erase_key.pass.cpp | 44 assert(next(m.begin(), 0)->first == 1);
45 assert(next(m.begin(), 0)->second == 1);
46 assert(next(m.begin(), 1)->first == 1);
47 assert(next(m.begin(), 1)->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 == 3);
51 assert(next(m.begin(), 3)->second == 1);
52 assert(next(m.begin(), 4)->first == 3);
53 assert(next(m.begin(), 4)->second == 1.5)
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_simple_list.h | 47 (elem)->next->prev = (elem)->prev; \
48 (elem)->prev->next = (elem)->next; \
49 (elem)->next = elem; \
62 (elem)->next = (list)->next; \
63 (list)->next->prev = elem; \
64 (list)->next = elem; \
75 (elem)->next = list; \
77 (list)->prev->next = elem;
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/main/ |
| simple_list.h | 45 struct simple_node *next; member in struct:simple_node
56 (elem)->next->prev = (elem)->prev; \
57 (elem)->prev->next = (elem)->next; \
69 (elem)->next = (list)->next; \
70 (list)->next->prev = elem; \
71 (list)->next = elem; \
82 (elem)->next = list; \
84 (list)->prev->next = elem;
[all...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_simple_list.h | 47 (elem)->next->prev = (elem)->prev; \
48 (elem)->prev->next = (elem)->next; \
49 (elem)->next = elem; \
62 (elem)->next = (list)->next; \
63 (list)->next->prev = elem; \
64 (list)->next = elem; \
75 (elem)->next = list; \
77 (list)->prev->next = elem;
[all...] |
| /external/mesa3d/src/mesa/main/ |
| simple_list.h | 45 struct simple_node *next; member in struct:simple_node
56 (elem)->next->prev = (elem)->prev; \
57 (elem)->prev->next = (elem)->next; \
69 (elem)->next = (list)->next; \
70 (list)->next->prev = elem; \
71 (list)->next = elem; \
82 (elem)->next = list; \
84 (list)->prev->next = elem;
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/ |
| equal_range.pass.cpp | 42 assert(r.first == next(m.begin(), 0));
43 assert(r.second == next(m.begin(), 1));
45 assert(r.first == next(m.begin(), 1));
46 assert(r.second == next(m.begin(), 2));
48 assert(r.first == next(m.begin(), 2));
49 assert(r.second == next(m.begin(), 3));
51 assert(r.first == next(m.begin(), 3));
52 assert(r.second == next(m.begin(), 4));
54 assert(r.first == next(m.begin(), 4));
55 assert(r.second == next(m.begin(), 5))
[all...] |
| /external/kernel-headers/original/linux/ |
| list.h | 16 * sometimes we already know the next/prev entries and we can
22 struct list_head *next, *prev; member in struct:list_head
32 list->next = list;
40 * the prev/next entries already!
44 struct list_head *next)
46 next->prev = new;
47 new->next = next;
49 prev->next = new;
62 __list_add(new, head, head->next);
302 struct list_head *next = head->next; local
597 struct hlist_node *next, **pprev; member in struct:hlist_node
621 struct hlist_node *next = n->next; local
678 struct hlist_node *next = old->next; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| erase_key.pass.cpp | 44 assert(*next(m.begin(), 0) == 3);
45 assert(*next(m.begin(), 1) == 3);
46 assert(*next(m.begin(), 2) == 3);
47 assert(*next(m.begin(), 3) == 5);
48 assert(*next(m.begin(), 4) == 5);
49 assert(*next(m.begin(), 5) == 5);
50 assert(*next(m.begin(), 6) == 7);
51 assert(*next(m.begin(), 7) == 7);
52 assert(*next(m.begin(), 8) == 7);
57 assert(*next(m.begin(), 0) == 3)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/multiset.cons/ |
| copy.pass.cpp | 46 assert(*next(m.begin(), 0) == 1);
47 assert(*next(m.begin(), 1) == 1);
48 assert(*next(m.begin(), 2) == 1);
49 assert(*next(m.begin(), 3) == 2);
50 assert(*next(m.begin(), 4) == 2);
51 assert(*next(m.begin(), 5) == 2);
52 assert(*next(m.begin(), 6) == 3);
53 assert(*next(m.begin(), 7) == 3);
54 assert(*next(m.begin(), 8) == 3);
60 assert(*next(mo.begin(), 0) == 1)
[all...] |
