HomeSort by relevance Sort by last modified time
    Searched refs:next (Results 426 - 450 of 10635) sorted by null

<<11121314151617181920>>

  /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/clang/lib/Basic/
VersionTuple.cpp 44 char next = input[0]; local
46 if (next < '0' || next > '9') return true;
47 value = (unsigned) (next - '0');
50 next = input[0];
51 if (next < '0' || next > '9') return false;
53 value = value * 10 + (unsigned) (next - '0');
  /external/guava/guava/src/com/google/common/collect/
ForwardingIterator.java 47 public T next() { method in class:ForwardingIterator
48 return delegate().next();
AbstractIterator.java 46 * String s = in.next();
71 /** We have computed the next element and haven't returned it yet. */
84 private T next; field in class:AbstractIterator
87 * Returns the next element. <b>Note:</b> the implementation must call {@link
91 * <p>The initial invocation of {@link #hasNext()} or {@link #next()} calls
93 * next} following each successful call to {@code next}. Once the
98 * {@code hasNext} or {@code next} invocation that invoked this method. Any
103 * {@code next}, or {@link #peek()} methods on this instance; if it does, an
106 * @return the next element if there was one. If {@code endOfData} was calle
152 public final T next() { method in class:AbstractIterator
    [all...]
  /external/guava/guava/src/com/google/common/util/concurrent/
AtomicDouble.java 94 long next = doubleToRawLongBits(newValue); local
95 value = next;
106 // long next = doubleToRawLongBits(newValue);
107 // updater.lazySet(this, next);
117 long next = doubleToRawLongBits(newValue); local
118 return longBitsToDouble(updater.getAndSet(this, next));
169 long next = doubleToRawLongBits(nextVal); local
170 if (updater.compareAndSet(this, current, next)) {
187 long next = doubleToRawLongBits(nextVal); local
188 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/std/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/tlsdate/src/
conf-unittest.c 48 ASSERT_NE (NULL, e->next);
49 EXPECT_STREQ (e->next->key, "baz");
50 EXPECT_STREQ (e->next->value, "quxx");
51 ASSERT_NULL (e->next->next);
63 EXPECT_NULL (e->next);
75 EXPECT_NULL (e->next);
87 EXPECT_NULL (e->next);
  /frameworks/base/libs/hwui/font/
FontUtil.h 47 #define AUTO_KERN(prev, next) (((next) - (prev) + 32) >> 6 << 16)
  /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);
  /toolchain/binutils/binutils-2.25/bfd/
cpu-score.c 46 #define N(addr_bits, machine, print, default, next) \
60 next \
  /toolchain/binutils/binutils-2.25/ld/
ldctor.h 35 struct set_info *next; /* Next set. */ member in struct:set_info
43 struct set_element *next; /* Next element. */ member in struct:set_element
  /frameworks/minikin/tests/
WordBreakerTests.cpp 44 EXPECT_EQ(6, breaker.next()); // after "hello "
49 EXPECT_EQ((ssize_t)NELEM(buf), breaker.next()); // end
62 EXPECT_EQ(7, breaker.next()); // after "hel{SOFT HYPHEN}lo "
66 EXPECT_EQ((ssize_t)NELEM(buf), breaker.next()); // end
79 EXPECT_EQ(4, breaker.next()); // after CENT SIGN
83 EXPECT_EQ((ssize_t)NELEM(buf), breaker.next()); // end of string
96 EXPECT_EQ((ssize_t)NELEM(buf), breaker.next()); // end of string
116 EXPECT_EQ(7, breaker.next()); // after man + zwj + heart + zwj + man
119 EXPECT_EQ(17, breaker.next()); // after woman + zwj + heart + zwj + woman
122 EXPECT_EQ(22, breaker.next()); // after eye + zwj + left speech bubbl
    [all...]
  /prebuilts/go/darwin-x86/src/runtime/
mem_plan9.go 15 next *memHdr
24 for p := memFreelist; p != nil; p = p.next {
28 prevp.next = p.next
30 memFreelist = p.next
51 bp.next = nil
60 bp.next = p.next
63 bp.next = p
67 for ; p.next != nil; p = p.next
    [all...]
  /prebuilts/go/linux-x86/src/runtime/
mem_plan9.go 15 next *memHdr
24 for p := memFreelist; p != nil; p = p.next {
28 prevp.next = p.next
30 memFreelist = p.next
51 bp.next = nil
60 bp.next = p.next
63 bp.next = p
67 for ; p.next != nil; p = p.next
    [all...]
  /external/guava/guava-tests/test/com/google/common/collect/
AbstractBiMapTest.java 30 // The next two tests verify that map entries are not accessed after they're
40 iterator.next();
41 iterator.next();
43 iterator.next();
57 iterator.next();
58 iterator.next();
60 iterator.next();
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;
  /toolchain/binutils/binutils-2.25/gas/config/
xtensa-relax.h 50 TransitionList *next; member in struct:transition_list
56 PreconditionList *next; member in struct:precondition_list
82 ReqOptionList *next; member in struct:req_option_list
89 ReqOrOptionList *next; member in struct:req_or_option_list
142 BuildOp *next; member in struct:build_op
160 BuildInstr *next; member in struct:build_instr
  /external/skia/src/utils/
SkNWayCanvas.cpp 45 bool next() { function in class:SkNWayCanvas::Iter
62 while (iter.next()) {
71 while (iter.next()) {
82 while (iter.next()) {
90 while (iter.next()) {
98 while (iter.next()) {
106 while (iter.next()) {
114 while (iter.next()) {
122 while (iter.next()) {
130 while (iter.next()) {
    [all...]

Completed in 1158 milliseconds

<<11121314151617181920>>