| /external/apache-http/src/org/apache/http/message/ |
| BasicListHeaderIterator.java | 58 * The position of the next header in {@link #allHeaders allHeaders}.
100 * Determines the index of the next header.
105 * @return the index of the next header that matches the filter name,
148 * Obtains the next header from this iteration.
150 * @return the next header in this iteration
170 * Returns the next header.
173 * @return the next header in this iteration
177 public final Object next() method in class:BasicListHeaderIterator
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ |
| DTMAxisIterator.java | 33 * Get the next node in the iteration.
35 * @return The next node handle in the iteration, or END.
37 public int next(); method in interface:DTMAxisIterator
60 * Remembers the current node for the next call to gotoMark().
71 * i.e. subsequent call to next() should return END.
81 * i.e. subsequent call to next() should return END.
|
| /external/bison/src/ |
| nullable.c | 40 struct rule_list *next; member in struct:rule_list
98 p->next = rsets[*rp - ntokens];
119 for (p = rsets[*s1++ - ntokens]; p; p = p->next)
|
| /external/chromium/base/ |
| linked_list.h | 13 // list, as extending LinkNode (this gives it next/previous pointers).
19 // Next, to keep track of the list's head/tail, use a LinkedList instance:
38 // node = node->next()) {
72 // A. Doubly-linked lists are made up of nodes that contain "next" and
76 // space for the "next" and "previous" pointers (base::LinkNode<T>*).
78 // needs to glue on the "next" and "previous" pointers using
87 LinkNode(LinkNode<T>* previous, LinkNode<T>* next)
88 : previous_(previous), next_(next) {}
116 LinkNode<T>* next() const { function in class:base::LinkNode
132 void set(LinkNode<T>* prev, LinkNode<T>* next) {
[all...] |
| /external/clang/test/CodeGen/ |
| 2002-02-14-EntryNodePreds.c | 11 struct edge_rec *next; member in struct:edge_rec
33 return (int)basel->next;
|
| /external/clang/test/SemaCXX/ |
| constexpr-turing.cpp | 11 unsigned next; member in struct:Action
38 tm[state][tape.val].next) + 1;
|
| /external/dropbear/ |
| fake-rfc2553.c | 107 struct addrinfo *next; local
110 next = ai->ai_next;
112 ai = next;
|
| /external/e2fsprogs/intl/ |
| loadinfo.h | 75 struct loaded_l10nfile *next; member in struct:loaded_l10nfile
98 its ->next field denotes the chaining inside *L10NFILE_LIST, and
|
| /external/e2fsprogs/lib/e2p/ |
| mntopts.c | 98 char *cp, *buf, *next; local
111 next = skip_over_word(cp);
112 if (*next == 0)
113 next = 0;
115 *next = 0;
138 cp = next ? next+1 : 0;
|
| /external/e2fsprogs/lib/ext2fs/ |
| kernel-list.h | 9 * sometimes we already know the next/prev entries and we can
15 struct list_head *next, *prev; member in struct:list_head
24 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
35 * the prev/next entries already!
39 struct list_head * next)
41 next->prev = new;
42 new->next = next;
44 prev->next = new;
52 __list_add(new, head, head->next);
[all...] |
| link.c | 40 struct ext2_dir_entry *next; local
54 next = (struct ext2_dir_entry *) (buf + offset + curr_rec_len);
56 (next->inode == 0) &&
57 (offset + curr_rec_len + next->rec_len <= blocksize)) {
58 curr_rec_len += next->rec_len;
78 next = (struct ext2_dir_entry *) (buf + offset +
80 next->inode = 0;
81 next->name_len = 0;
82 ls->err = ext2fs_set_rec_len(ls->fs, rec_len, next);
|
| /external/e2fsprogs/misc/ |
| ismounted.c | 58 char *word, *next; local
65 next = skip_over_word(word);
66 if (*next)
67 *next++ = 0;
68 *buf = next;
|
| /external/easymock/src/org/easymock/internal/ |
| Results.java | 45 public Result next() {
method in class:Results
|
| /external/freetype/src/cache/ |
| ftcmru.c | 52 cnode = cnode->next;
59 last->next = node;
60 node->next = first;
65 node->next = node;
83 FTC_MruNode prev, next, last; local
93 cnode = cnode->next;
103 next = node->next;
105 prev->next = next;
126 FTC_MruNode prev, next; local
331 FTC_MruNode first, node, next; local
[all...] |
| /external/guava/guava/src/com/google/common/base/ |
| AbstractIterator.java | 40 private T next; field in class:AbstractIterator
64 next = computeNext();
73 public final T next() { method in class:AbstractIterator
78 return next;
|
| /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...] |
| AbstractMapBasedMultiset.java | 103 public Multiset.Entry<E> next() { method
104 final Map.Entry<E, Count> mapEntry = backingEntries.next();
128 "no calls to next() since the last call to remove()");
161 * Not subclassing AbstractMultiset$MultisetIterator because next() needs to
181 public E next() {
183 currentEntry = entryIterator.next();
194 "no calls to next() since the last call to remove()");
352 public E next() {
353 toRemove = entries.next();
360 "no calls to next() since the last call to remove()")
[all...] |
| LinkedListMultimap.java | 114 Node<K, V> next; // the next node (with any key) field in class:LinkedListMultimap.Node
116 Node<K, V> nextSibling; // the next node with the same key
197 tail.next = node;
211 node.next = nextSibling;
221 nextSibling.previous.next = node;
237 node.previous.next = node.next;
239 head = node.next;
241 if (node.next != null)
281 Node<K, V> next; field in class:LinkedListMultimap.NodeIterator
300 next(); method
310 public Node<K, V> next() { method in class:LinkedListMultimap.NodeIterator
366 Node<K, V> next = head; field in class:LinkedListMultimap.DistinctKeyIterator
374 public K next() { method in class:LinkedListMultimap.DistinctKeyIterator
395 Node<K, V> next; field in class:LinkedListMultimap.ValueForKeyIterator
426 next(); method
439 public V next() { method in class:LinkedListMultimap.ValueForKeyIterator
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| AbstractMapBasedMultiset.java | 100 public Multiset.Entry<E> next() { method
101 final Map.Entry<E, Count> mapEntry = backingEntries.next();
125 "no calls to next() since the last call to remove()");
158 * Not subclassing AbstractMultiset$MultisetIterator because next() needs to
178 public E next() {
180 currentEntry = entryIterator.next();
191 "no calls to next() since the last call to remove()");
349 public E next() {
350 toRemove = entries.next();
357 "no calls to next() since the last call to remove()")
[all...] |
| LinkedListMultimap.java | 110 Node<K, V> next; // the next node (with any key) field in class:LinkedListMultimap.Node
112 Node<K, V> nextSibling; // the next node with the same key
193 tail.next = node;
207 node.next = nextSibling;
217 nextSibling.previous.next = node;
233 node.previous.next = node.next;
235 head = node.next;
237 if (node.next != null)
277 Node<K, V> next; field in class:LinkedListMultimap.NodeIterator
296 next(); method
306 public Node<K, V> next() { method in class:LinkedListMultimap.NodeIterator
362 Node<K, V> next = head; field in class:LinkedListMultimap.DistinctKeyIterator
370 public K next() { method in class:LinkedListMultimap.DistinctKeyIterator
391 Node<K, V> next; field in class:LinkedListMultimap.ValueForKeyIterator
422 next(); method
435 public V next() { method in class:LinkedListMultimap.ValueForKeyIterator
[all...] |
| /external/hamcrest/src/org/hamcrest/ |
| BaseDescription.java | 78 appendDescriptionOf(i.next());
|
| /external/icu4c/common/ |
| ucharstrie.cpp | 134 UCharsTrie::next(int32_t uchar) { function in class:UCharsTrie
157 UCharsTrie::next(const UChar *s, int32_t sLength) { function in class:UCharsTrie
168 // Fetch the next input unit, if there is one.
221 // Fetch the next input unit, if there is one.
351 out.appendCodeUnit(*pos); // Next unit of a pending linear-match node.
|
| /external/iproute2/include/ |
| xt-internal.h | 37 struct xtables_rule_match *next; member in struct:xtables_rule_match
|
| /external/ipsec-tools/src/racoon/ |
| isakmp_unity.h | 64 struct unity_netentry *next; member in struct:unity_netentry
|
| /external/iptables/extensions/ |
| libip6t_dst.c | 58 char *buffer, *cp, *next, *range; local
65 for (cp = buffer, i = 0; cp && i < IP6T_OPTS_OPTSNR; cp = next, i++)
67 next = strchr(cp, ',');
69 if (next)
70 *next++='\0';
|
