Searched refs:next (Results 1 - 25 of 5149) 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/android-clat/
H A Dring.c78 ring->next = (struct tpacket2_hdr *) ring->base;
87 * advances to the next position in the packet ring
91 uint8_t *next = (uint8_t *) ring->next; local
94 next += TP_FRAME_SIZE;
101 next += TP_FRAME_GAP;
104 next = (uint8_t *) ring->base;
108 ring->next = (struct tpacket2_hdr *) next;
109 return ring->next;
[all...]
H A Dring.h47 struct tpacket2_hdr *next; member in struct:packet_ring
/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/
H A DPlot.java456 if(it.next().size() <= 0) {
472 it.next();
/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/ui/
H A DDynamicTableModel.java32 * the end of the row is reached, then proceeding to the next row.
34 * until the end of the row is reached, then proceeding to the next column.
232 public RectF next() { method in class:DynamicTableModel.TableModelIterator
248 // move to the begining of the next row down:// move to the begining of the next row down:
253 // move to the next column over:
260 // move to the top of the next column over:
265 // move to the next row down:
H A DFixedTableModel.java86 public RectF next() { method in class:FixedTableModel.FixedTableModelIterator
/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/util/
H A DConfigurator.java263 xrp.next();
/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/xy/
H A DXYLegendWidget.java189 cellRect = it.next();
201 cellRect = it.next();
/external/androidplot/AndroidPlot-Core/src/test/java/com/androidplot/ui/
H A DDynamicTableModelTest.java73 it.next();
84 it.next();
104 RectF cellRect = it.next();
113 cellRect = it.next();
122 cellRect = it.next();
131 cellRect = it.next();
162 RectF cellRect = it.next();
171 cellRect = it.next();
180 cellRect = it.next();
189 cellRect = it.next();
[all...]
H A DFixedTableModelTest.java52 RectF cellRect = it.next();
55 cellRect = it.next();
58 cellRect = it.next();
61 cellRect = it.next();
64 cellRect = it.next();
68 cellRect = it.next();
84 RectF cellRect = it.next();
91 cellRect = it.next();
98 cellRect = it.next();
105 cellRect = it.next();
[all...]
/external/androidplot/Examples/DemoApp/src/com/androidplot/demos/
H A DBarPlotExampleActivity.java281 XYSeries setElement = iterator1.next();
H A DDualScaleXYPlotExampleActivity.java157 XYSeries setElement = iterator1.next();
162 XYSeries setElement = iterator2.next();
/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)

Completed in 1526 milliseconds

1234567891011>>