| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| D | TestIntervalSet.java | 31 import org.antlr.misc.IntervalSet;
45 IntervalSet s = IntervalSet.of(99); in testSingleElement()
51 IntervalSet s = new IntervalSet(); in testIsolatedElements()
60 IntervalSet s = new IntervalSet(); in testMixedRangesAndElements()
69 IntervalSet s = IntervalSet.of(10,20); in testSimpleAnd()
70 IntervalSet s2 = IntervalSet.of(13,15); in testSimpleAnd()
77 IntervalSet s = IntervalSet.of('a','z'); in testRangeAndIsolatedElement()
78 IntervalSet s2 = IntervalSet.of('d'); in testRangeAndIsolatedElement()
85 IntervalSet s = IntervalSet.of('a','z'); in testEmptyIntersection()
86 IntervalSet s2 = IntervalSet.of('0','9'); in testEmptyIntersection()
[all …]
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| D | IntervalSet.java | 52 public class IntervalSet implements IntSet { class
53 public static final IntervalSet COMPLETE_SET = IntervalSet.of(0,Label.MAX_CHAR_VALUE);
59 public IntervalSet() { in IntervalSet() method in IntervalSet
63 public IntervalSet(List<Interval> intervals) { in IntervalSet() method in IntervalSet
68 public static IntervalSet of(int a) { in of()
69 IntervalSet s = new IntervalSet(); in of()
75 public static IntervalSet of(int a, int b) { in of()
76 IntervalSet s = new IntervalSet(); in of()
191 if ( !(set instanceof IntervalSet) ) { in addAll()
196 IntervalSet other = (IntervalSet)set; in addAll()
[all …]
|
| D | BitSet.java | 100 else if ( set instanceof IntervalSet ) { in addAll()
101 IntervalSet other = (IntervalSet)set; in addAll()
349 if ( set instanceof IntervalSet ) { in of()
|
| /external/openfst/src/include/fst/ |
| D | interval-set.h | 37 class IntervalSet {
77 IntervalSet() : count_(-1) {} in IntervalSet() function
97 void Union(const IntervalSet<T> &iset) { in Union()
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<T> *oset) const;
147 bool Overlaps(const IntervalSet<T> &iset) const;
151 bool StrictlyOverlaps(const IntervalSet<T> &iset) const;
[all …]
|
| D | state-reachable.h | 50 typedef typename IntervalSet<I>::Interval Interval;
53 vector< IntervalSet<I> > *isets, in IntervalReachVisitor()
67 isets_->push_back(IntervalSet<Label>()); in InitState()
128 vector< IntervalSet<I> > *isets_;
146 typedef typename IntervalSet<I>::Interval Interval;
183 const vector< IntervalSet<I> > &IntervalSets() { return isets_; } in IntervalSets()
189 vector< IntervalSet<I> > isets_; // Interval sets per state
|
| D | label-reachable.h | 46 typedef typename IntervalSet<L>::Interval Interval;
58 vector< IntervalSet<L> > *IntervalSets() { return &isets_; } in IntervalSets()
108 vector<IntervalSet <L> > isets_; // Interval sets per state.
150 typedef typename IntervalSet<Label>::Interval Interval;
275 vector< IntervalSet<Label> > &isets = *data_->IntervalSets(); in Reach()
283 vector< IntervalSet<Label> > &isets = *data_->IntervalSets(); in ReachFinal()
305 vector< IntervalSet<Label> > &isets = *data_->IntervalSets(); in Reach()
475 vector< IntervalSet<Label> > &isets = *data_->IntervalSets(); in FindIntervals()
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| D | LookaheadSet.java | 31 import org.antlr.misc.IntervalSet;
40 public IntervalSet tokenTypeSet;
43 tokenTypeSet = new IntervalSet(); in LookaheadSet()
52 tokenTypeSet = IntervalSet.of(atom); in LookaheadSet()
87 tokenTypeSet = (IntervalSet)tokenTypeSet.subtract(IntervalSet.of(a)); in remove()
|
| D | LL1DFA.java | 31 import org.antlr.misc.IntervalSet;
76 MultiMap<IntervalSet, Integer> edgeMap) in LL1DFA() argument
87 IntervalSet edge = (IntervalSet)it.next(); in LL1DFA()
140 protected Label getLabelForSet(IntervalSet edgeSet) { in getLabelForSet()
|
| D | Label.java | 31 import org.antlr.misc.IntervalSet;
132 this.labelSet = IntervalSet.of(INVALID); in Label()
150 l.labelSet = new IntervalSet(); in clone()
161 labelSet = IntervalSet.of(label); in add()
220 return IntervalSet.of(label); in getSet()
|
| 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();
|
| D | LL1Analyzer.java | 32 import org.antlr.misc.IntervalSet;
188 look = new LookaheadSet(IntervalSet.COMPLETE_SET); in LOOK()
207 return new LookaheadSet(IntervalSet.COMPLETE_SET); in _FIRST()
|
| /external/clang/test/SemaTemplate/ |
| 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; in int40()
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| D | Grammar.java | 1206 List<IntervalSet> edges = new ArrayList<IntervalSet>(); in createLL_1_LookaheadDFA()
1209 edges.add((IntervalSet)s.tokenTypeSet); in createLL_1_LookaheadDFA()
1211 List<IntervalSet> disjoint = makeEdgeSetsDisjoint(edges); in createLL_1_LookaheadDFA()
1214 MultiMap<IntervalSet, Integer> edgeMap = new MultiMap<IntervalSet, Integer>(); in createLL_1_LookaheadDFA()
1216 IntervalSet ds = (IntervalSet) disjoint.get(i); in createLL_1_LookaheadDFA()
1246 protected List<IntervalSet> makeEdgeSetsDisjoint(List<IntervalSet> edges) { in makeEdgeSetsDisjoint()
1247 OrderedHashSet<IntervalSet> disjointSets = new OrderedHashSet<IntervalSet>(); in makeEdgeSetsDisjoint()
1251 IntervalSet t = (IntervalSet) edges.get(e); in makeEdgeSetsDisjoint()
1257 IntervalSet remainder = t; // remainder starts out as whole set to add in makeEdgeSetsDisjoint()
1260 IntervalSet s_i = (IntervalSet)disjointSets.get(i); in makeEdgeSetsDisjoint()
[all …]
|
| D | RandomPhrase.java | 35 import org.antlr.misc.IntervalSet;
129 IntervalSet typeSet = (IntervalSet)label.getSet(); in getTokenType()
|
| D | Interpreter.java | 32 import org.antlr.misc.IntervalSet;
359 new MismatchedSetException(((IntervalSet)label.getSet()).toRuntimeBitSet(), in parseEngine()
|
| D | NFAFactory.java | 32 import org.antlr.misc.IntervalSet;
166 Label label = new Label(IntervalSet.of(a, b)); in build_Range()
|
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/ |
| 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/antlr3/org/antlr/grammar/v3/ |
| 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.getCharVa…
|
| /external/llvm/lib/CodeGen/ |
| D | RegAllocPBQP.cpp | 289 typedef std::set<IntervalInfo, decltype(&lowestEndPoint)> IntervalSet; in apply() typedef
292 IntervalSet Active(lowestEndPoint); in apply()
309 IntervalSet::iterator RetireItr = Active.begin(); in apply()
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
| D | CodeGenerator.java | 759 if ( !(set instanceof IntervalSet) ) { in genSetExpr()
762 IntervalSet iset = (IntervalSet)set; in genSetExpr()
|
| /external/antlr/antlr-3.4/runtime/C/ |
| D | README | 422 * Fixed bug in IntervalSet.and: it returned the same empty set all the time
1819 * two hideous bug fixes in the IntervalSet, which made analysis go wrong
|
| /external/antlr/antlr-3.4/tool/ |
| D | CHANGES.txt | 1992 * Fixed bug in IntervalSet.and: it returned the same empty set all the time
3389 * two hideous bug fixes in the IntervalSet, which made analysis go wrong
|
| /external/antlr/antlr-3.4/lib/ |
| D | antlr-3.4-complete.jar | META-INF/
META-INF/MANIFEST.MF
org/
org/antlr/
org/ ... |