/external/smack/src/org/xbill/DNS/ |
H A D | NSECRecord.java | 23 private Name next; field in class:NSECRecord 35 * @param next The following name in an ordered list of the zone 39 NSECRecord(Name name, int dclass, long ttl, Name next, int [] types) { argument 41 this.next = checkName("next", next); 50 next = new Name(in); 56 // Note: The next name is not lowercased. 57 next.toWire(out, null, false); 63 next [all...] |
/external/chromium_org/third_party/mesa/src/src/glsl/ |
H A D | list.h | 11 * The above copyright notice and this permission notice (including the next 31 * \c next pointer being \c NULL. 33 * A list is empty if either the head sentinel's \c next pointer points to the 43 * - A \c head pointer that represents the \c next pointer of the 46 * sentinel node and the \c next pointer of the tail sentinel node. This 51 * Therefore, if \c head->next is \c NULL or \c tail_prev->prev is \c NULL, 75 struct exec_node *next; member in struct:exec_node 98 exec_node() : next(NULL), prev(NULL) 105 return next; 110 return next; 229 void next() function in class:iterator 251 void next() function in class:exec_list_iterator [all...] |
/external/mesa3d/src/glsl/ |
H A D | list.h | 11 * The above copyright notice and this permission notice (including the next 31 * \c next pointer being \c NULL. 33 * A list is empty if either the head sentinel's \c next pointer points to the 43 * - A \c head pointer that represents the \c next pointer of the 46 * sentinel node and the \c next pointer of the tail sentinel node. This 51 * Therefore, if \c head->next is \c NULL or \c tail_prev->prev is \c NULL, 75 struct exec_node *next; member in struct:exec_node 98 exec_node() : next(NULL), prev(NULL) 105 return next; 110 return next; 229 void next() function in class:iterator 251 void next() function in class:exec_list_iterator [all...] |
/external/chromium_org/v8/test/mjsunit/es6/ |
H A D | arguments-iterator.js | 41 assertIteratorResult(a, false, iterator.next()); 42 assertIteratorResult(b, false, iterator.next()); 43 assertIteratorResult(c, false, iterator.next()); 44 assertIteratorResult(undefined, true, iterator.next()); 52 assertIteratorResult(a, false, iterator.next()); 53 assertIteratorResult(b, false, iterator.next()); 54 assertIteratorResult(c, false, iterator.next()); 55 assertIteratorResult(undefined, true, iterator.next()); 62 assertIteratorResult(a, false, iterator.next()); 63 assertIteratorResult(b, false, iterator.next()); [all...] |
H A D | collection-iterator.js | 18 assertArrayEquals(['next'], propertyNames); 32 assertEquals({value: 1, done: false}, iter.next()); 33 assertEquals({value: 2, done: false}, iter.next()); 34 assertEquals({value: 3, done: false}, iter.next()); 35 assertEquals({value: undefined, done: true}, iter.next()); 36 assertEquals({value: undefined, done: true}, iter.next()); 52 assertEquals({value: [1, 1], done: false}, iter.next()); 53 assertEquals({value: [2, 2], done: false}, iter.next()); 54 assertEquals({value: [3, 3], done: false}, iter.next()); 55 assertEquals({value: undefined, done: true}, iter.next()); [all...] |
/external/dhcpcd/ |
H A D | eloop.c | 46 struct event *next; member in struct:event 55 struct timeout *next; member in struct:timeout 68 for (e = events; e; e = e->next) { 80 free_events = e->next; 86 e->next = NULL; 88 last->next = e; 98 for (e = events; e; e = e->next) { 101 last->next = e->next; 103 events = e->next; [all...] |
/external/chromium_org/third_party/WebKit/Source/platform/heap/ |
H A D | CallbackStack.cpp | 14 explicit Block(Block* next) argument 17 , m_next(next) 34 Block* next() const { return m_next; } function in class:blink::CallbackStack::Block 35 void setNext(Block* next) { m_next = next; } argument 129 Block* next; local 130 for (Block* current = m_first->next(); current; current = next) { 131 next = current->next(); 182 Block* next = m_first->next(); local [all...] |
/external/chromium_org/third_party/leveldatabase/src/table/ |
H A D | iterator.cc | 11 cleanup_.next = NULL; 17 for (Cleanup* c = cleanup_.next; c != NULL; ) { 19 Cleanup* next = c->next; local 21 c = next; 33 c->next = cleanup_.next; 34 cleanup_.next = c;
|
/external/chromium_org/third_party/polymer/components/core-field/ |
H A D | core-field.css | 15 polyfill-next-selector { content: ':host > core-icon'; } 20 polyfill-next-selector { content: ':host input'; } 30 polyfill-next-selector { content: ':host input:focus'; } 35 polyfill-next-selector { content: ':host input::placeholder'; }
|
/external/chromium_org/third_party/polymer/components-chromium/core-field/ |
H A D | core-field.css | 15 polyfill-next-selector { content: ':host > core-icon'; } 20 polyfill-next-selector { content: ':host input'; } 30 polyfill-next-selector { content: ':host input:focus'; } 35 polyfill-next-selector { content: ':host input::placeholder'; }
|
/external/clang/lib/Basic/ |
H A D | 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/ |
H A D | 2002-02-14-EntryNodePreds.c | 11 struct edge_rec *next; member in struct:edge_rec 33 return (int)basel->next;
|
H A D | types.c | 4 struct FileName *next; member in struct:FileName 9 struct ieeeExternal *next; member in struct:ieeeExternal
|
/external/linux-tools-perf/perf-3.12.0/tools/perf/util/include/linux/ |
H A D | types.h | 18 struct list_head *next, *prev; member in struct:list_head 26 struct hlist_node *next, **pprev; member in struct:hlist_node
|
/external/oprofile/opjitconv/ |
H A D | 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;
|
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | ChildNodeList.cpp | 52 for (Node* next = currentNode.nextSibling(); next; next = next->nextSibling()) { 54 return next;
|
/external/chromium_org/third_party/WebKit/Source/core/fetch/ |
H A D | ResourceClientWalker.h | 35 // Just keep calling next() on this. It's safe from deletions of items. 48 T* next() function in class:blink::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/ |
H A D | TreeNode.h | 63 NodeType* next() const { return m_next; } function in class:WTF::TreeNode 76 ASSERT(!newChild->next()); 100 ASSERT(!child->next()); 124 m_firstChild = child->next(); 128 NodeType* oldNext = child->next(); 161 if (typename TreeNode<T>::NodeType* next = current->firstChild()) 162 return next; 165 if (typename TreeNode<T>::NodeType* next = current->next()) 166 return next; [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | 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 elemen 152 public final T next() { method in class:AbstractIterator [all...] |
/external/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
H A D | 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( [all...] |
H A D | 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( [all...] |
H A D | 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( [all...] |
/external/mockito/src/org/mockito/internal/configuration/injection/filter/ |
H A D | TypeBasedCandidateFilter.java | 14 MockCandidateFilter next;
field in class:TypeBasedCandidateFilter 16 public TypeBasedCandidateFilter(MockCandidateFilter next) {
argument 17 this.next = next;
28 return next.filterCandidate(mockTypeMatches, field, fieldInstance);
|
/external/chromium_org/third_party/mesa/src/src/glx/ |
H A D | 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) 270 struct glx_config *const next = configs->next; local [all...] |
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/ |
H A D | 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...] |