/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
H A D | TestIntervalSet.java | 31 import org.antlr.misc.IntervalSet; 45 IntervalSet s = IntervalSet.of(99); 51 IntervalSet s = new IntervalSet(); 60 IntervalSet s = new IntervalSet(); 69 IntervalSet s = IntervalSet.of(10,20); 70 IntervalSet s [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
H A D | IntervalSet.java | 52 public class IntervalSet implements IntSet { class in inherits:IntSet 53 public static final IntervalSet COMPLETE_SET = IntervalSet.of(0,Label.MAX_CHAR_VALUE); 59 public IntervalSet() { method in class:IntervalSet 63 public IntervalSet(List<Interval> intervals) { method in class:IntervalSet 68 public static IntervalSet of(int a) { 69 IntervalSet s = new IntervalSet(); 75 public static IntervalSet of(int a, int b) { 76 IntervalSet [all...] |
H A D | BitSet.java | 100 else if ( set instanceof IntervalSet ) { 101 IntervalSet other = (IntervalSet)set; 349 if ( set instanceof IntervalSet ) {
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
H A D | LookaheadSet.java | 31 import org.antlr.misc.IntervalSet; 40 public IntervalSet tokenTypeSet; 43 tokenTypeSet = new IntervalSet(); 52 tokenTypeSet = IntervalSet.of(atom); 87 tokenTypeSet = (IntervalSet)tokenTypeSet.subtract(IntervalSet.of(a));
|
H A D | LL1DFA.java | 31 import org.antlr.misc.IntervalSet; 76 MultiMap<IntervalSet, Integer> edgeMap) 87 IntervalSet edge = (IntervalSet)it.next(); 140 protected Label getLabelForSet(IntervalSet edgeSet) {
|
H A D | Label.java | 31 import org.antlr.misc.IntervalSet; 115 //public static final IntSet ALLCHAR = IntervalSet.of(MIN_CHAR_VALUE,MAX_CHAR_VALUE); 121 // TODO: try IntervalSet for everything 132 this.labelSet = IntervalSet.of(INVALID); 150 l.labelSet = new IntervalSet(); 161 labelSet = IntervalSet.of(label); 220 return IntervalSet.of(label);
|
H A D | LL1Analyzer.java | 32 import org.antlr.misc.IntervalSet; 188 look = new LookaheadSet(IntervalSet.COMPLETE_SET); 207 return new LookaheadSet(IntervalSet.COMPLETE_SET);
|
H A D | DFA.java | 32 import org.antlr.misc.IntervalSet; 151 public IntSet recursiveAltSet = new IntervalSet(); 517 IntervalSet labels = (IntervalSet)label.getSet(); 563 IntervalSet labels = (IntervalSet)label.getSet(); 607 IntervalSet labels = (IntervalSet)label.getSet(); 1150 IntervalSet completeVocab = new IntervalSet(); [all...] |
/external/openfst/src/include/fst/ |
H A D | interval-set.h | 37 class IntervalSet { class in namespace:fst 77 IntervalSet() : count_(-1) {} function in class:fst::IntervalSet 97 void Union(const IntervalSet<T> &iset) { 115 bool operator==(const IntervalSet<T>& iset) const { 120 bool operator!=(const IntervalSet<T>& iset) const { 135 void Intersect(const IntervalSet<T> &iset, IntervalSet<T> *oset) const; 139 void Complement(T maxval, IntervalSet<T> *oset) const; 143 void Difference(const IntervalSet<T> &iset, IntervalSet< [all...] |
H A D | state-reachable.h | 50 typedef typename IntervalSet<I>::Interval Interval; 53 vector< IntervalSet<I> > *isets, 67 isets_->push_back(IntervalSet<Label>()); 128 vector< IntervalSet<I> > *isets_; 146 typedef typename IntervalSet<I>::Interval Interval; 183 const vector< IntervalSet<I> > &IntervalSets() { return isets_; } 189 vector< IntervalSet<I> > isets_; // Interval sets per state
|
H A D | label-reachable.h | 46 typedef typename IntervalSet<L>::Interval Interval; 58 vector< IntervalSet<L> > *IntervalSets() { return &isets_; } 108 vector<IntervalSet <L> > isets_; // Interval sets per state. 150 typedef typename IntervalSet<Label>::Interval Interval; 275 vector< IntervalSet<Label> > &isets = *data_->IntervalSets(); 283 vector< IntervalSet<Label> > &isets = *data_->IntervalSets(); 305 vector< IntervalSet<Label> > &isets = *data_->IntervalSets(); 475 vector< IntervalSet<Label> > &isets = *data_->IntervalSets();
|
/external/clang/test/SemaTemplate/ |
H A D | issue150.cpp | 89 template<class> class = allocator> class IntervalSet> 92 IntervalSet<T> IntervalSetT; 98 template<class> class = allocator> class IntervalSet> 101 IntervalSet<T> IntervalSetT;
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
H A D | RandomPhrase.java | 35 import org.antlr.misc.IntervalSet; 129 IntervalSet typeSet = (IntervalSet)label.getSet();
|
H A D | Grammar.java | 1206 List<IntervalSet> edges = new ArrayList<IntervalSet>(); 1209 edges.add((IntervalSet)s.tokenTypeSet); 1211 List<IntervalSet> disjoint = makeEdgeSetsDisjoint(edges); 1214 MultiMap<IntervalSet, Integer> edgeMap = new MultiMap<IntervalSet, Integer>(); 1216 IntervalSet ds = (IntervalSet) disjoint.get(i); 1246 protected List<IntervalSet> makeEdgeSetsDisjoint(List<IntervalSet> edge [all...] |
H A D | Interpreter.java | 32 import org.antlr.misc.IntervalSet; 359 new MismatchedSetException(((IntervalSet)label.getSet()).toRuntimeBitSet(),
|
H A D | NFAFactory.java | 32 import org.antlr.misc.IntervalSet; 166 Label label = new Label(IntervalSet.of(a, b));
|
/external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/ |
H A D | TreeToNFAConverter.g | 658 IntSet elements=new IntervalSet(); 674 setRule returns [IntSet elements=new IntervalSet()] 770 elements.addAll(IntervalSet.of(a,b)); 780 | ^( NOT {ns=new IntervalSet();} 849 {{ $alts = IntervalSet.of( Grammar.getCharValueFromGrammarCharLiteral($c1.text), Grammar.getCharValueFromGrammarCharLiteral($c2.text) ).size(); }}
|
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/ |
H A D | BitSet.js | 140 } else if (el instanceof org.antlr.runtime.IntervalSet) { 187 else if ( elements instanceof org.antlr.runtime.IntervalSet ) {
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
H A D | CodeGenerator.java | 759 if ( !(set instanceof IntervalSet) ) { 760 throw new IllegalArgumentException("unable to generate expressions for non IntervalSet objects"); 762 IntervalSet iset = (IntervalSet)set;
|
/external/antlr/antlr-3.4/lib/ |
H A D | antlr-3.4-complete.jar | META-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ... |