| /development/samples/browseable/TextSwitcher/src/com.example.android.common.logger/ |
| MessageOnlyLogFilter.java | 28 * Takes the "next" LogNode as a parameter, to simplify chaining.
30 * @param next The next LogNode in the pipeline.
32 public MessageOnlyLogFilter(LogNode next) {
33 mNext = next;
47 * Returns the next LogNode in the chain.
|
| /development/samples/browseable/repeatingAlarm/src/com.example.android.common/logger/ |
| MessageOnlyLogFilter.java | 28 * Takes the "next" LogNode as a parameter, to simplify chaining.
30 * @param next The next LogNode in the pipeline.
32 public MessageOnlyLogFilter(LogNode next) {
33 mNext = next;
47 * Returns the next LogNode in the chain.
|
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| ReverseAxesWalker.java | 70 * Get the next node in document order on the axes.
72 * @return the next node in document order on the axes, or null.
79 int next = m_iterator.next(); local
84 if (DTM.NULL == next)
87 return next;
150 int next; local
152 while (DTM.NULL != (next = clone.nextNode()))
213 int next; local
215 while (DTM.NULL != (next = clone.nextNode())
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| ForwardingIterator.java | 47 public T next() { method in class:ForwardingIterator
48 return delegate().next();
|
| /external/guava/guava/src/com/google/common/util/concurrent/ |
| AtomicDouble.java | 96 long next = doubleToRawLongBits(newValue); local
97 value = next;
108 // long next = doubleToRawLongBits(newValue);
109 // updater.lazySet(this, next);
119 long next = doubleToRawLongBits(newValue); local
120 return longBitsToDouble(updater.getAndSet(this, next));
171 long next = doubleToRawLongBits(nextVal); local
172 if (updater.compareAndSet(this, current, next)) {
189 long next = doubleToRawLongBits(nextVal); local
190 if (updater.compareAndSet(this, current, next)) {
[all...] |
| /external/hamcrest/src/org/hamcrest/internal/ |
| SelfDescribingValueIterator.java | 18 public SelfDescribing next() { method in class:SelfDescribingValueIterator
19 return new SelfDescribingValue<T>(values.next());
|
| /external/libusb-compat/examples/ |
| lsusb.c | 33 for (bus = busses; bus; bus = bus->next) {
35 for (dev = bus->devices; dev; dev = dev->next) {
|
| /external/nist-sip/java/gov/nist/javax/sip/parser/ims/ |
| PVisitedNetworkIDParser.java | 135 char next = this.lexer.getNextChar(); local
136 if (next == '\"') {
139 } else if (next == '\0') {
141 } else if (next == '\\') {
142 retval.append(next);
143 next = this.lexer.getNextChar();
144 retval.append(next);
146 retval.append(next);
|
| /external/qemu/ |
| notify.c | 34 Notifier *notifier, *next; local
36 QTAILQ_FOREACH_SAFE(notifier, &list->notifiers, node, next) {
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.modifiers/ |
| insert_iter_iter.pass.cpp | 45 assert(next(m.begin())->first == 2);
46 assert(next(m.begin())->second == 1);
47 assert(next(m.begin(), 2)->first == 3);
48 assert(next(m.begin(), 2)->second == 1);
71 assert(next(m.begin())->first == 2);
72 assert(next(m.begin())->second == 1);
73 assert(next(m.begin(), 2)->first == 3);
74 assert(next(m.begin(), 2)->second == 1);
|
| /external/chromium/base/ |
| linked_list.h | 13 // list, as extending LinkNode (this gives it next/previous pointers).
19 // Next, to keep track of the list's head/tail, use a LinkedList instance:
38 // node = node->next()) {
72 // A. Doubly-linked lists are made up of nodes that contain "next" and
76 // space for the "next" and "previous" pointers (base::LinkNode<T>*).
78 // needs to glue on the "next" and "previous" pointers using
87 LinkNode(LinkNode<T>* previous, LinkNode<T>* next)
88 : previous_(previous), next_(next) {}
116 LinkNode<T>* next() const { function in class:base::LinkNode
132 void set(LinkNode<T>* prev, LinkNode<T>* next) {
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/pipe-loader/ |
| pipe_loader.c | 15 * next paragraph) shall be included in all copies or substantial portions
76 const char *next; local
80 for (next = library_paths; *next; library_paths = next + 1) {
81 next = util_strchrnul(library_paths, ':');
82 len = next - library_paths;
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| UnmodifiableListIteratorTest.java | 38 assertEquals("a", iterator.next());
49 assertEquals("a", iterator.next());
50 assertEquals("b", iterator.next());
62 assertEquals("a", iterator.next());
63 assertEquals("b", iterator.next());
81 public String next() { method
|
| /external/icu4c/layout/ |
| LEInsertionList.cpp | 17 InsertionRecord *next; member in struct:InsertionRecord
41 head = head->next;
73 insertion->next = NULL;
74 tail->next = insertion;
78 insertion->next = head;
87 for (InsertionRecord *rec = head; rec != NULL; rec = rec->next) {
|
| /external/mesa3d/src/gallium/auxiliary/pipe-loader/ |
| pipe_loader.c | 15 * next paragraph) shall be included in all copies or substantial portions
76 const char *next; local
80 for (next = library_paths; *next; library_paths = next + 1) {
81 next = util_strchrnul(library_paths, ':');
82 len = next - library_paths;
|
| /libcore/luni/src/main/java/java/util/ |
| AbstractSequentialList.java | 44 int next = it.nextIndex(); local
46 it.add(colIt.next());
48 return next != it.nextIndex();
54 return listIterator(location).next();
72 E result = it.next();
86 E result = it.next();
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| NodeTraversal.cpp | 47 if (Node* next = current.pseudoAwareFirstChild())
48 return next;
51 if (Node* next = current.pseudoAwareNextSibling())
52 return next;
56 if (Node* next = parent->pseudoAwareNextSibling())
57 return next;
66 if (Node* next = current.pseudoAwareNextSibling())
67 return next;
71 if (Node* next = parent->pseudoAwareNextSibling())
72 return next;
[all...] |
| /external/chromium_org/v8/test/mjsunit/harmony/ |
| array-iterator.js | 48 assertIteratorResult('a', false, iterator.next());
49 assertIteratorResult('b', false, iterator.next());
50 assertIteratorResult('c', false, iterator.next());
51 assertIteratorResult(void 0, true, iterator.next());
54 assertIteratorResult(void 0, true, iterator.next());
61 assertIteratorResult('a', false, iterator.next());
62 assertIteratorResult('b', false, iterator.next());
63 assertIteratorResult('c', false, iterator.next());
65 assertIteratorResult('d', false, iterator.next());
66 assertIteratorResult(void 0, true, iterator.next());
[all...] |
| /external/valgrind/main/coregrind/m_gdbserver/ |
| inferiors.c | 44 new_inferior->next = NULL;
46 list->tail->next = new_inferior;
55 struct inferior_list_entry *cur = list->head, *next; local
58 next = cur->next;
60 cur = next;
79 list->head = entry->next;
86 while (*cur && (*cur)->next != entry)
87 cur = &(*cur)->next;
92 (*cur)->next = entry->next
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_mm.c | 44 for (p = heap->next; p != heap; p = p->next) {
87 heap->next = block;
93 block->next = heap;
113 /* break left [p, newblock, p->next], then p = newblock */
123 newblock->next = p->next;
125 p->next->prev = newblock;
126 p->next = newblock;
137 /* break right, also [p, newblock, p->next] */
290 struct mem_block *next = p->next; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/main/ |
| mm.c | 42 for(p = heap->next; p != heap; p = p->next) {
78 heap->next = block;
84 block->next = heap;
104 /* break left [p, newblock, p->next], then p = newblock */
114 newblock->next = p->next;
116 p->next->prev = newblock;
117 p->next = newblock;
128 /* break right, also [p, newblock, p->next] */
277 struct mem_block *next = p->next; local
[all...] |
| /external/harfbuzz_ng/test/api/ |
| test-set.c | 35 hb_codepoint_t next = (hb_codepoint_t) -1; local
40 g_assert (!hb_set_next (s, &next));
41 g_assert_cmpint (next, ==, (hb_codepoint_t) -1);
47 hb_codepoint_t next = (hb_codepoint_t) -1; local
51 g_assert (hb_set_next (s, &next));
52 g_assert_cmpint (next, !=, (hb_codepoint_t) -1);
155 hb_codepoint_t next, first, last; local
165 next = (hb_codepoint_t) -1;
166 g_assert (hb_set_next (s, &next));
167 g_assert_cmpint (next, ==, 6)
[all...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_mm.c | 44 for (p = heap->next; p != heap; p = p->next) {
87 heap->next = block;
93 block->next = heap;
113 /* break left [p, newblock, p->next], then p = newblock */
123 newblock->next = p->next;
125 p->next->prev = newblock;
126 p->next = newblock;
137 /* break right, also [p, newblock, p->next] */
290 struct mem_block *next = p->next; local
[all...] |
| /external/mesa3d/src/mesa/main/ |
| mm.c | 42 for(p = heap->next; p != heap; p = p->next) {
78 heap->next = block;
84 block->next = heap;
104 /* break left [p, newblock, p->next], then p = newblock */
114 newblock->next = p->next;
116 p->next->prev = newblock;
117 p->next = newblock;
128 /* break right, also [p, newblock, p->next] */
277 struct mem_block *next = p->next; local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| CounterNode.cpp | 106 CounterNode* next; local
107 while (!(next = current->m_nextSibling)) {
112 return next;
117 if (CounterNode* next = m_firstChild)
118 return next;
213 m_rootRenderer->invalidate(); // This makes m_rootRenderer point to the next renderer if any since it disconnects the m_rootRenderer from this.
253 CounterNode* next; local
256 next = refChild->m_nextSibling;
259 next = m_firstChild;
266 if (next) {
330 CounterNode* next = oldChild->m_nextSibling; local
[all...] |
