| /development/samples/browseable/StorageProvider/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/SwipeRefreshLayoutBasic/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/SwipeRefreshListFragment/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/SwipeRefreshMultipleViews/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/SynchronizedNotifications/Application/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/TextLinkify/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/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.
|
| /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/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/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/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/icu/icu4c/source/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;
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| CounterNode.cpp | 106 CounterNode* next = current->m_nextSibling; local
107 for (; !next; 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
330 CounterNode* next = oldChild->m_nextSibling; local
[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_SET_VALUE_INVALID; local
40 g_assert (!hb_set_next (s, &next));
41 g_assert_cmpint (next, ==, HB_SET_VALUE_INVALID);
48 hb_codepoint_t next = HB_SET_VALUE_INVALID; local
52 g_assert (hb_set_next (s, &next));
53 g_assert_cmpint (next, !=, HB_SET_VALUE_INVALID);
164 hb_codepoint_t next, first, last; local
174 next = HB_SET_VALUE_INVALID;
175 g_assert (hb_set_next (s, &next));
176 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/libcxx/test/containers/associative/multimap/multimap.ops/ |
| upper_bound.pass.cpp | 46 assert(r == next(m.begin(), 3));
48 assert(r == next(m.begin(), 3));
50 assert(r == next(m.begin(), 6));
52 assert(r == next(m.begin(), 6));
54 assert(r == next(m.begin(), 9));
76 assert(r == next(m.begin(), 3));
78 assert(r == next(m.begin(), 3));
80 assert(r == next(m.begin(), 6));
82 assert(r == next(m.begin(), 6));
84 assert(r == next(m.begin(), 9))
[all...] |
