Searched refs:next (Results 1 - 25 of 5321) sorted by path

1234567891011>>

/external/aac/libAACdec/src/
H A Dchannel.cpp432 list = list->next[decision_bit];
/external/aac/libAACenc/src/
H A Dbitenc.cpp1253 list = list->next[decision_bit];
/external/aac/libFDK/include/
H A DFDK_tools_rom.h254 const struct element_list *next[2]; member in struct:element_list
/external/ant-glob/src/org/apache/tools/ant/util/
H A DFileUtils.java161 int next = colon + 1;
162 root = path.substring(0, next);
166 next = (ca[next] == sep) ? next + 1 : next;
170 for (int i = next; i < ca.length; i++) {
/external/antlr/antlr-3.4/lib/
H A Dantlr-3.4-complete.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ...
/external/antlr/antlr-3.4/runtime/ActionScript/project/lib/
H A DFlexAntTasks.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/adobe/ com/adobe/ac/ com/adobe/ac/ant/ ...
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/
H A DBaseRecognizer.as150 * 5. next match() will reset errorRecovery mode
281 * an error and next valid token match
367 * You don't want the exact set of viable next tokens because the
451 * viable tokens that can possibly come next (lookahead depth 1)
496 * the viable next token set, then you know there is most likely
560 // if next token is what we are looking for then "delete" this token
622 * the next token in the stream is what we want we assume that
H A DDFA.as97 var snext:int = transition[s][c-min[s]]; // move to next state
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
H A DCommonErrorNode.as56 // next one is for sure correct.
H A DRewriteRuleNodeStream.as23 // circuited next() so it doesn't call.
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3collections.h78 /** Pointer to the next entry in this bucket if there
154 * enumerated as this structure just tracks the next pointers in the
167 /* Next entry to return, if NULL, then move to next bucket if any
173 int (*next) (struct ANTLR3_HASH_ENUM_struct * en, pANTLR3_HASH_KEY *key, void ** data); member in struct:ANTLR3_HASH_ENUM_struct
295 /** The next vector available in the pool
342 struct ANTLR3_TRIE_ENTRY_struct * next; /* Allows duplicate entries for same key in insertion order */ member in struct:ANTLR3_TRIE_ENTRY_struct
378 pANTLR3_INT_TRIE_NODE current; /* Used to traverse the TRIE with the next() method */
H A Dantlr3commontreenodestream.h67 /// Get tree node at current input pointer + i ahead where i=1 is next node.
231 /// this node yet; next consume() request will set currentIndex to 0.
236 /// IntStream.next is hence 1 + this value. Size will be same.
274 pANTLR3_BASE_TREE (*next) (struct ANTLR3_COMMON_TREE_NODE_STREAM_struct * ctns); member in struct:ANTLR3_COMMON_TREE_NODE_STREAM_struct
H A Dantlr3rewritestreams.h52 /// Once you start next()ing, do not try to add more elements. It will
65 /// Cursor 0..n-1. If singleElement!=NULL, cursor is 0 until you next(),
95 /// If dirty, then next() always returns a dup.
114 /// Return the next element in the stream. If out of elements, throw
117 void * (*next) (struct ANTLR3_REWRITE_RULE_ELEMENT_STREAM_struct * stream); member in struct:ANTLR3_REWRITE_RULE_ELEMENT_STREAM_struct
133 /// Returns ANTLR3_TRUE if there is a next element available
137 /// Treat next element as a single node even if it's a subtree.
138 /// This is used instead of next() when the result has to be a
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3bitset.c223 while (en->next(en, &key, (void **)(&bit)) == ANTLR3_SUCCESS)
H A Dantlr3collections.c222 /* Save next entry - we do not want to access memory in entry after we
246 entry = nextEntry; /* Load next pointer to see if we shoud free it */
292 * as we need to set its next pointer to the next pointer
296 nextPointer = & bucket->entries; /* Where to put the next pointer of the deleted entry */
304 /* It was the correct entry, so we set the next pointer
305 * of the previous entry to the next pointer of this
317 * move to the next one, if any.
319 nextPointer = & (entry->nextEntry); /* Address of the next pointer in the current entry */
320 entry = entry->nextEntry; /* Address of the next elemen
[all...]
H A Dantlr3exception.c135 /* Move to next in the chain (if any)
156 pANTLR3_EXCEPTION next; local
165 next = ex->nextException;
185 ex = next;
H A Dantlr3rewritestreams.c42 static void * next (pANTLR3_REWRITE_RULE_ELEMENT_STREAM stream);
227 stream->next = next;
562 /// Return the next element in the stream. If out of elements, throw
589 /// Return the next element for a caller that wants just the token
597 /// Return the next element in the stream. If out of elements, throw
601 next (pANTLR3_REWRITE_RULE_ELEMENT_STREAM stream) function
618 /// Do the work of getting the next element, making sure that it's
747 /// Returns ANTLR3_TRUE if there is a next element available
763 /// Get the next toke
[all...]
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
H A DAntlr.Runtime.Tree.pas350 /// Get tree node at current input pointer + i ahead where i=1 is next node.
792 /// a -> rewrite rule. We need to subclass to fill in the next() method,
796 /// Once you start next()ing, do not try to add more elements. It will
825 /// Return the next element in the stream.
851 /// Treat next element as a single node even if it's a subtree.
854 /// This is used instead of next() when the result has to be a
868 /// Get next token from stream and make a node for it.
1378 /// The index into the nodes list of the current node (next node
1488 /// Cursor 0..n-1. If singleElement!=null, cursor is 0 until you next(),
1510 /// If dirty, then next() alway
[all...]
H A DAntlr.Runtime.pas73 /// Get int at current input pointer + I ahead (where I=1 is next int)
100 /// Resets the stream so that the next call to
323 /// Get Token at current input pointer + I ahead (where I=1 is next
379 /// <summary>Index into the char stream of next lookahead char </summary>
749 /// 5. next Match() will reset errorRecovery mode
909 /// an error and next valid token match
1493 /// is actually what we wanted next. Used for tree node errors too.
1617 /// <summary>Index in our array for the next char (0..n-1)</summary>
2069 /// the next token in the stream is what we want we assume that
2094 /// viable tokens that can possibly come next (lookahea
[all...]
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/
H A DTokenRewriteStream.java106 * Return the index of the next token to operate on.
224 // to insert after, just insert before next index (even if past end)
385 i++; // move to next token
400 RewriteOperation op = (RewriteOperation)it.next();
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
H A DBufferedTreeNodeStream.java67 public Object next() { method in class:BufferedTreeNodeStream.StreamIterator
111 /** The index into the nodes list of the current node (next node
H A DCommonTreeNodeStream.java84 Object t = it.next();
88 if ( level==0 && hasNilRoot ) return it.next(); // don't give last UP; get EOF
93 t = it.next(); // t is now DOWN, so get first real node next
95 t = it.next();
H A DTreeIterator.java53 * next() call.
85 public Object next() { method in class:TreeIterator
100 // next node will be child 0 if any children
103 nodes.add(tree); // real node is next after DOWN
106 // if no children, look for next sibling of tree or ancestor
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/
H A DCommonTreeNodeStream.js33 /** The index into the nodes list of the current node (next node
65 next: function() {
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
H A DANTLRBufferedTreeNodeStream.h56 - (id) next;

Completed in 8399 milliseconds

1234567891011>>