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

1 2 3 4 56 7 8 91011>>

  /external/clang/lib/Basic/
VersionTuple.cpp 42 char next = input[0]; local
44 if (next < '0' || next > '9') return true;
45 value = (unsigned) (next - '0');
48 next = input[0];
49 if (next < '0' || next > '9') return false;
51 value = value * 10 + (unsigned) (next - '0');
  /external/clang/test/CodeGen/
2002-02-14-EntryNodePreds.c 11 struct edge_rec *next; member in struct:edge_rec
33 return (int)basel->next;
types.c 4 struct FileName *next; member in struct:FileName
9 struct ieeeExternal *next; member in struct:ieeeExternal
  /external/linux-tools-perf/util/include/linux/
types.h 14 struct list_head *next, *prev; member in struct:list_head
22 struct hlist_node *next, **pprev; member in struct:hlist_node
  /external/oprofile/opjitconv/
conversion.c 20 struct jitentry * entry, * next; local
22 for (entry = jitentry_list; entry; entry = next) {
25 next = entry->next;
33 struct jitentry_debug_line * entry, * next; local
35 for (entry = jitentry_debug_line_list; entry; entry = next) {
36 next = entry->next;
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.ops/
find.pass.cpp 44 assert(r == next(m.begin()));
46 assert(r == next(m.begin(), 2));
48 assert(r == next(m.begin(), 3));
50 assert(r == next(m.begin(), 4));
52 assert(r == next(m.begin(), 5));
54 assert(r == next(m.begin(), 6));
56 assert(r == next(m.begin(), 7));
58 assert(r == next(m.begin(), 8));
77 assert(r == next(m.begin()));
79 assert(r == next(m.begin(), 2))
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/
find.pass.cpp 44 assert(r == next(m.begin()));
46 assert(r == next(m.begin(), 2));
48 assert(r == next(m.begin(), 3));
50 assert(r == next(m.begin(), 4));
52 assert(r == next(m.begin(), 5));
54 assert(r == next(m.begin(), 6));
56 assert(r == next(m.begin(), 7));
58 assert(r == next(m.begin(), 8));
77 assert(r == next(m.begin()));
79 assert(r == next(m.begin(), 2))
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/
find.pass.cpp 44 assert(r == next(m.begin()));
46 assert(r == next(m.begin(), 2));
48 assert(r == next(m.begin(), 3));
50 assert(r == next(m.begin(), 4));
52 assert(r == next(m.begin(), 5));
54 assert(r == next(m.begin(), 6));
56 assert(r == next(m.begin(), 7));
58 assert(r == next(m.begin(), 8));
77 assert(r == next(m.begin()));
79 assert(r == next(m.begin(), 2))
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/fetch/
ResourceClientWalker.h 35 // Just keep calling next() on this. It's safe from deletions of items.
48 T* next() function in class:WebCore::ResourceClientWalker
52 ResourceClient* next = m_clientVector[m_index++]; local
53 if (m_clientSet.contains(next)) {
54 ASSERT(T::expectedType() == ResourceClient::expectedType() || next->resourceClientType() == T::expectedType());
55 return static_cast<T*>(next);
  /external/chromium_org/third_party/WebKit/Source/wtf/
TreeNode.h 61 NodeType* next() const { return m_next; } function in class:WTF::TreeNode
74 ASSERT(!newChild->next());
98 ASSERT(!child->next());
122 m_firstChild = child->next();
126 NodeType* oldNext = child->next();
149 if (typename TreeNode<T>::NodeType* next = current->firstChild())
150 return next;
153 if (typename TreeNode<T>::NodeType* next = current->next())
154 return next;
    [all...]
  /external/guava/guava/src/com/google/common/collect/
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/mockito/src/org/mockito/internal/configuration/injection/filter/
TypeBasedCandidateFilter.java 14 MockCandidateFilter next; field in class:TypeBasedCandidateFilter
16 public TypeBasedCandidateFilter(MockCandidateFilter next) {
17 this.next = next;
28 return next.filterCandidate(mockTypeMatches, field, fieldInstance);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.ops/
upper_bound.pass.cpp 45 assert(r == next(m.begin(), 3));
47 assert(r == next(m.begin(), 3));
49 assert(r == next(m.begin(), 6));
51 assert(r == next(m.begin(), 6));
53 assert(r == next(m.begin(), 9));
75 assert(r == next(m.begin(), 3));
77 assert(r == next(m.begin(), 3));
79 assert(r == next(m.begin(), 6));
81 assert(r == next(m.begin(), 6));
83 assert(r == next(m.begin(), 9))
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/
emplace_after.pass.cpp 35 assert(i == next(c.begin()));
37 assert(*next(c.begin()) == Emplaceable(1, 2.5));
40 i = c.emplace_after(next(c.cbegin()), 2, 3.5);
41 assert(i == next(c.begin(), 2));
43 assert(*next(c.begin()) == Emplaceable(1, 2.5));
44 assert(*next(c.begin(), 2) == Emplaceable(2, 3.5));
48 assert(i == next(c.begin()));
50 assert(*next(c.begin(), 1) == Emplaceable(3, 4.5));
51 assert(*next(c.begin(), 2) == Emplaceable(1, 2.5));
52 assert(*next(c.begin(), 3) == Emplaceable(2, 3.5))
    [all...]
insert_after_const.pass.cpp 33 assert(i == next(c.begin()));
35 assert(*next(c.begin()) == 1);
38 i = c.insert_after(next(c.cbegin()), 2);
39 assert(i == next(c.begin(), 2));
41 assert(*next(c.begin()) == 1);
42 assert(*next(c.begin(), 2) == 2);
46 assert(i == next(c.begin()));
48 assert(*next(c.begin(), 1) == 3);
49 assert(*next(c.begin(), 2) == 1);
50 assert(*next(c.begin(), 3) == 2)
    [all...]
insert_after_rv.pass.cpp 35 assert(i == next(c.begin()));
37 assert(*next(c.begin()) == 1);
40 i = c.insert_after(next(c.cbegin()), 2);
41 assert(i == next(c.begin(), 2));
43 assert(*next(c.begin()) == 1);
44 assert(*next(c.begin(), 2) == 2);
48 assert(i == next(c.begin()));
50 assert(*next(c.begin(), 1) == 3);
51 assert(*next(c.begin(), 2) == 1);
52 assert(*next(c.begin(), 3) == 2)
    [all...]
  /external/chromium_org/third_party/mesa/src/src/glx/
glxconfig.c 12 * The above copyright notice and this permission notice (including the next
228 struct glx_config **next; local
231 next = &base;
233 *next = (struct glx_config *) malloc(size);
234 if (*next == NULL) {
240 (void) memset(*next, 0, size);
241 (*next)->visualID = GLX_DONT_CARE;
242 (*next)->visualType = GLX_DONT_CARE;
243 (*next)->visualRating = GLX_NONE;
244 (*next)->transparentPixel = GLX_NONE
270 struct glx_config *const next = configs->next; local
    [all...]
  /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/
brw_fs_cfg.cpp 11 * The above copyright notice and this permission notice (including the next
81 fs_bblock *next; local
114 next = new_block();
115 next->start = (fs_inst *)inst->next;
116 cur_if->add_successor(mem_ctx, next);
118 set_next_block(next);
124 next = new_block();
125 next->start = (fs_inst *)inst->next;
    [all...]
  /external/mesa3d/src/glx/
glxconfig.c 12 * The above copyright notice and this permission notice (including the next
228 struct glx_config **next; local
231 next = &base;
233 *next = (struct glx_config *) malloc(size);
234 if (*next == NULL) {
240 (void) memset(*next, 0, size);
241 (*next)->visualID = GLX_DONT_CARE;
242 (*next)->visualType = GLX_DONT_CARE;
243 (*next)->visualRating = GLX_NONE;
244 (*next)->transparentPixel = GLX_NONE
270 struct glx_config *const next = configs->next; local
    [all...]
  /external/mesa3d/src/mesa/drivers/dri/i965/
brw_fs_cfg.cpp 11 * The above copyright notice and this permission notice (including the next
81 fs_bblock *next; local
114 next = new_block();
115 next->start = (fs_inst *)inst->next;
116 cur_if->add_successor(mem_ctx, next);
118 set_next_block(next);
124 next = new_block();
125 next->start = (fs_inst *)inst->next;
    [all...]
  /cts/tools/cts-native-scanner/tests/src/com/android/cts/nativescanner/
TestScannerTest.java 41 assertEquals("suite:TestSuite", it.next());
42 assertEquals("case:FakeTestCase", it.next());
43 assertEquals("test:FakeTestName", it.next());
56 assertEquals("suite:TestSuite", it.next());
57 assertEquals("case:Case1", it.next());
58 assertEquals("test:Test1", it.next());
59 assertEquals("test:Test2", it.next());
60 assertEquals("case:Case2", it.next());
61 assertEquals("test:Test3", it.next());
62 assertEquals("test:Test4", it.next());
    [all...]
  /external/chromium_org/media/midi/
midi_message_queue.cc 52 const uint8 next = queue_.front(); local
59 if (IsSystemRealTimeMessage(next)) {
60 message->push_back(next);
68 ((next_message_[0] == kSysEx && IsFirstStatusByte(next)) ||
69 (next_message_[0] != kSysEx && !IsDataByte(next)))) {
76 if (IsFirstStatusByte(next)) {
77 next_message_.push_back(next);
88 next_message_.push_back(next);
91 if (next == kEndOfSysEx) {
99 DCHECK(IsDataByte(next));
    [all...]
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_list.h 39 x->next = 0;
43 x->next = 0;
44 last_->next = x;
52 x->next = 0;
56 x->next = first_;
64 first_ = first_->next;
80 l->last_->next = first_;
94 last_->next = l->first_;
107 for (Item *i = first_; ; i = i->next) {
112 CHECK_EQ(last_->next, 0)
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.spec/
member_swap.pass.cpp 33 assert(*next(c1.begin(), 0) == 10);
34 assert(*next(c1.begin(), 1) == 11);
35 assert(*next(c1.begin(), 2) == 12);
39 assert(*next(c2.begin(), 0) == 0);
40 assert(*next(c2.begin(), 1) == 1);
41 assert(*next(c2.begin(), 2) == 2);
42 assert(*next(c2.begin(), 3) == 3);
43 assert(*next(c2.begin(), 4) == 4);
44 assert(*next(c2.begin(), 5) == 5);
60 assert(*next(c2.begin(), 0) == 0)
    [all...]
non_member_swap.pass.cpp 34 assert(*next(c1.begin(), 0) == 10);
35 assert(*next(c1.begin(), 1) == 11);
36 assert(*next(c1.begin(), 2) == 12);
40 assert(*next(c2.begin(), 0) == 0);
41 assert(*next(c2.begin(), 1) == 1);
42 assert(*next(c2.begin(), 2) == 2);
43 assert(*next(c2.begin(), 3) == 3);
44 assert(*next(c2.begin(), 4) == 4);
45 assert(*next(c2.begin(), 5) == 5);
61 assert(*next(c2.begin(), 0) == 0)
    [all...]

Completed in 738 milliseconds

1 2 3 4 56 7 8 91011>>