HomeSort by relevance Sort by last modified time
    Searched refs:next (Results 1251 - 1275 of 7540) sorted by null

<<51525354555657585960>>

  /frameworks/base/core/java/android/os/
Broadcaster.java 44 r.next = r;
54 r = r.next;
64 reg.next = r;
66 r.prev.next = reg;
113 r = r.next;
160 r = r.next;
185 r = r.next;
204 Registration next; field in class:Broadcaster.Registration
  /frameworks/base/core/java/android/webkit/
UrlInterceptRegistry.java 131 UrlInterceptHandler handler = (UrlInterceptHandler) iter.next();
159 UrlInterceptHandler handler = (UrlInterceptHandler) iter.next();
  /frameworks/base/tools/aidl/
aidl.cpp 49 if (p->next) printf(", ");
50 p=p->next;
55 q=q->next;
71 d = d->next;
98 struct import_info* next; member in struct:import_info
119 import->next = g_imports;
266 items = items->next;
380 items = items->next;
466 goto next;
474 goto next;
598 const document_item_type* next = items->next; local
    [all...]
  /hardware/ti/omap3/dspbridge/inc/
list.h 60 #define LST_IsEmpty(l) (((l)->head.next == &(l)->head))
63 struct LST_ELEM *next; member in struct:LST_ELEM
84 * An empty list is indicated by the "next" pointer in the element
95 * "empty" element, because its "next" and "prev" pointers point at
158 * Else, removes the element at the head of the list, making the next
161 * "next" pointer at the next element after the head, and by making the
162 * "prev" pointer of the next element after the head point at the tail
163 * element. So the next element after the head becomes the new head of
177 * Because the tail of the list points forward (its "next" pointer) t
    [all...]
  /hardware/ti/omap3/dspbridge/libbridge/inc/
list.h 60 #define LST_IsEmpty(l) (((l)->head.next == &(l)->head))
63 struct LST_ELEM *next; member in struct:LST_ELEM
84 * An empty list is indicated by the "next" pointer in the element
95 * "empty" element, because its "next" and "prev" pointers point at
158 * Else, removes the element at the head of the list, making the next
161 * "next" pointer at the next element after the head, and by making the
162 * "prev" pointer of the next element after the head point at the tail
163 * element. So the next element after the head becomes the new head of
177 * Because the tail of the list points forward (its "next" pointer) t
    [all...]
  /libcore/luni/src/main/java/java/lang/ref/
ReferenceQueue.java 39 * Returns the next available reference from the queue, removing it in the
42 * @return the next available reference, or {@code null} if no reference is
67 * Returns the next available reference from the queue, removing it in the
77 * Returns the next available reference from the queue, removing it in the
84 * @return the next available reference, or {@code null} if no reference
153 Reference<?> next = unenqueued.pendingNext; local
155 list.pendingNext = next;
  /libcore/luni/src/main/java/java/text/
BreakIterator.java 58 * {@code first()}, {@code last()}, {@code next()}, and {@code previous()} that
70 * text and the user calls {@code next()}, or when the current position is the
125 * for (int end = boundary.next(); end != BreakIterator.DONE; start = end, end = boundary.next()) {
154 * int end = boundary.next();
187 * Find the next word:
195 * int current = wb.next();
202 * current = wb.next();
214 * next. With the word-break iterator, the characters between two boundaries
217 * the beginning of a word: If the characters between this boundary and the next
449 public abstract int next(); method in class:BreakIterator
460 public abstract int next(int n); method in class:BreakIterator
    [all...]
  /libcore/luni/src/main/java/java/util/concurrent/
ThreadLocalRandom.java 100 protected int next(int bits) { method in class:ThreadLocalRandom
113 * @return the next value
127 * @return the next value
140 int bits = next(2);
156 * @return the next value
172 * @return the next value
187 * @return the next value
  /libcore/luni/src/main/java/libcore/icu/
CollationElementIteratorICU.java 23 * data string depending on whether next() is called or previous().
29 * ce = iterator.next();
59 * Get the ordering priority of the next collation element in the text.
61 * @return next collation elements ordering, or NULLORDER if the end of the
65 public int next() { method in class:CollationElementIteratorICU
66 return NativeCollation.next(address);
83 * @param order collation order returned by previous or next.
  /libcore/luni/src/main/java/org/apache/harmony/security/asn1/
DerInputStream.java 51 public int next() throws IOException { method in class:DerInputStream
52 int tag = super.next();
  /libcore/luni/src/test/java/libcore/java/util/
OldAbstractSetTest.java 38 public Object next() { method in class:OldAbstractSetTest.Mock_AbstractSet
74 public Object next() {
  /libcore/support/src/test/java/tests/support/
Support_ListTest.java 119 elem = li.next();
130 assertTrue("listIterator(1)", li.next() == list.get(1));
152 assertTrue("list iterator next(): " + i, li.next() == list
158 assertTrue("list iterator next() exception: " + i, exception);
160 assertTrue("list iterator next() exception: " + i, !exception);
194 Object next = li.next(); local
195 assertTrue("list iterator add(), next(): " + next, next == list.get(1))
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/
emplace_front.pass.cpp 32 assert(*next(c.begin()) == Emplaceable());
45 assert(*next(c.begin()) == Emplaceable());
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/
splice_after_one.pass.cpp 90 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2),
91 next(c2.cbefore_begin(), f));
103 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c1),
104 next(c1.cbefore_begin(), f));
120 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2),
121 next(c2.cbefore_begin(), f));
133 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c1),
134 next(c1.cbefore_begin(), f));
  /ndk/sources/host-tools/make-3.81/
dep.h 31 chained through the `next'. `stem' is the stem for this
38 struct dep *next; member in struct:dep
53 struct nameseq *next; member in struct:nameseq
  /ndk/sources/third_party/googletest/googletest/samples/
sample3_unittest.cc 106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
  /packages/apps/Camera/src/com/android/camera/
Exif.java 40 int event = parser.next();
62 event = parser.next();
  /packages/apps/Email/src/com/beetstra/jutf7/
CharsetProvider.java 72 Charset charset = iter.next();
77 Charset charset = iter.next();
  /packages/apps/Music/src/com/android/music/
IMediaPlaybackService.aidl 32 void next();
  /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
tree-iterator.h 68 return i.ptr != NULL && i.ptr->next == NULL;
74 i->ptr = i->ptr->next;
  /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
tree-iterator.h 68 return i.ptr != NULL && i.ptr->next == NULL;
74 i->ptr = i->ptr->next;
  /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
tree-iterator.h 68 return i.ptr != NULL && i.ptr->next == NULL;
74 i->ptr = i->ptr->next;
  /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
tree-iterator.h 68 return i.ptr != NULL && i.ptr->next == NULL;
74 i->ptr = i->ptr->next;
  /prebuilts/ndk/4/platforms/android-3/arch-arm/usr/include/linux/
proc_fs.h 47 struct proc_dir_entry *next, *parent, *subdir; member in struct:proc_dir_entry
57 struct kcore_list *next; member in struct:kcore_list
  /prebuilts/ndk/4/platforms/android-4/arch-arm/usr/include/linux/
proc_fs.h 47 struct proc_dir_entry *next, *parent, *subdir; member in struct:proc_dir_entry
57 struct kcore_list *next; member in struct:kcore_list

Completed in 916 milliseconds

<<51525354555657585960>>