/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
D | Transition.java | 37 public class Transition implements Comparable { class 44 public Transition(Label label, State target) { in Transition() method in Transition 49 public Transition(int label, State target) { in Transition() method in Transition 71 Transition other = (Transition)o; in equals() 77 Transition other = (Transition)o; in compareTo()
|
D | NFAState.java | 48 public Transition[] transition = new Transition[MAX_TRANSITIONS]; 116 public void addTransition(Transition e) { in addTransition() 141 public void setTransition0(Transition e) { in setTransition0() 150 public Transition transition(int i) { in transition()
|
D | DFAOptimizer.java | 192 Transition edge = (Transition) d.transition(i); in optimizeExitBranches() 221 Transition edge = (Transition) d.transition(i); in optimizeEOTBranches()
|
D | DFA.java | 504 Transition edge = (Transition) s.transition(j); 555 Transition edge = (Transition) s.transition(j); 594 Transition edge = (Transition) s.transition(j); 628 Transition edge = (Transition) s.transition(j); 790 Transition t = d.transition(i); 832 Transition t = d.transition(i); 856 Transition t = d.transition(i); 877 Transition t = d.transition(i); 944 Transition t = d.transition(i);
|
D | LL1Analyzer.java | 218 Transition transition0 = s.transition[0]; in _FIRST() 270 Transition transition1 = s.transition[1]; in _FIRST() 314 Transition transition0 = s.transition[0]; in _detectConfoundingPredicates() 375 Transition transition1 = s.transition[1]; in _detectConfoundingPredicates() 410 Transition transition0 = s.transition[0]; in _getPredicates() 441 Transition transition1 = s.transition[1]; in _getPredicates()
|
D | State.java | 43 public abstract void addTransition(Transition e); in addTransition() 45 public abstract Transition transition(int i); in transition()
|
D | DFAState.java | 77 protected List<Transition> transitions = 78 new ArrayList<Transition>(INITIAL_NUM_TRANSITIONS); 176 public Transition transition(int i) { in transition() 177 return (Transition)transitions.get(i); in transition() 184 public void addTransition(Transition t) { in addTransition() 192 transitions.add( new Transition(label, target) ); in addTransition() 196 public Transition getTransition(int trans) { in getTransition()
|
D | MachineProbe.java | 64 Transition e = startState.getTransition(i); in getAnyDFAPathToTarget() 87 Transition e = d.getTransition(j); in getEdgeLabels() 128 Transition t = p.transition(j); in getGrammarLocationsForInputSequence()
|
D | NFAToDFAConverter.java | 418 Transition oldTransition = (Transition)targetToLabelMap.get(tI); in addTransition() 441 Transition trans = d.getTransition(transitionIndex); in addTransition() 635 Transition transition0 = p.transition[0]; in closure() 762 Transition transition1 = p.transition[1]; in closure() 866 Transition edge = p.transition[0]; in reach() 924 Transition edge = p.transition[0]; in convertToEOTAcceptState()
|
D | RuleClosureTransition.java | 38 public class RuleClosureTransition extends Transition {
|
/external/icu/icu4c/source/i18n/ |
D | rbtz.cpp | 26 struct Transition { struct 273 Transition *trst = (Transition*)uprv_malloc(sizeof(Transition)); in complete() 307 Transition *final0 = (Transition*)uprv_malloc(sizeof(Transition)); in complete() 312 Transition *final1 = (Transition*)uprv_malloc(sizeof(Transition)); in complete() 436 UDate tstart = getTransitionTime((Transition*)fHistoricTransitions->elementAt(0), in getOffsetInternal() 442 UDate tend = getTransitionTime((Transition*)fHistoricTransitions->elementAt(idx), in getOffsetInternal() 451 rule = ((Transition*)fHistoricTransitions->elementAt(idx))->to; in getOffsetInternal() 456 if (date >= getTransitionTime((Transition*)fHistoricTransitions->elementAt(idx), in getOffsetInternal() 462 rule = ((Transition*)fHistoricTransitions->elementAt(idx))->to; in getOffsetInternal() 649 Transition *trs = (Transition*)fHistoricTransitions->orphanElementAt(0); in deleteTransitions() [all …]
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
D | NFAFactory.java | 92 Transition t = s.transition[0]; in optimizeAlternative() 142 Transition e = new Transition(label,right); in build_Set() 167 Transition e = new Transition(label,right); in build_Range() 239 Transition e = new RuleClosureTransition(refDef,ruleStart,right); in build_RuleRef() 267 Transition e = new Transition(new PredicateLabel(pred), right); in build_SemanticPredicate() 281 Transition e = new Transition(new ActionLabel(action), right); in build_Action() 327 Transition toEnd = new Transition(label, end); in build_EOFState() 677 Transition e = new Transition(label,right); in build_Wildcard() 729 Transition e = new Transition(label,b); in transitionBetweenStates()
|
D | FASerializer.java | 124 Transition edge = (Transition) s.transition(i); in walkFANormalizingStateNumbers() 152 Transition edge = (Transition) s.transition(i); in walkSerializingFA()
|
D | DOTGenerator.java | 133 Transition edge = (Transition) s.transition(i); in walkCreatingDFADOT() 208 Transition edge = (Transition) s.transition(i); in walkRuleNFACreatingDOT() 284 protected String getEdgeLabel(Transition edge) { in getEdgeLabel()
|
D | RandomPhrase.java | 34 import org.antlr.analysis.Transition; 96 Transition t0 = state.transition[0]; in randomPhrase() 121 Transition t = altStartState.transition[0]; in randomPhrase()
|
D | GrammarSanity.java | 32 import org.antlr.analysis.Transition; 104 Transition t0 = s.transition[0]; in traceStatesLookingForLeftRecursion() 147 Transition t1 = s.transition[1]; in traceStatesLookingForLeftRecursion()
|
D | Interpreter.java | 299 Transition trans = s.transition[0]; in parseEngine() 398 Transition eotTransition = null; in predict() 407 Transition t = s.transition(i); in predict()
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
D | ACyclicDFACodeGenerator.java | 99 Transition edge = (Transition) s.transition(i); in walkFixedDFAGeneratingStateMachine() 172 Transition predEdge = (Transition)EOTTarget.transition(i); in walkFixedDFAGeneratingStateMachine()
|
/external/icu/icu4c/source/tools/tzcode/ |
D | tz2icu.cpp | 123 struct Transition { struct 126 Transition(int64_t _time, int32_t _type) { in Transition() function 164 vector<Transition> transitions; 379 info.transitions.push_back(Transition(transitionTimes[i], transitionTypes[i])); in readzoneinfo() 386 vector<Transition>::iterator itr = info.transitions.begin(); in readzoneinfo() 387 info.transitions.insert(itr, Transition(LOWEST_TIME32, transitionTypes[minidx])); in readzoneinfo() 395 info.transitions.push_back(Transition(transitionTimes[i], transitionTypes[i])); in readzoneinfo() 444 vector<Transition>::iterator itr = info.transitions.begin(); in readzoneinfo() 445 info.transitions.insert(itr, Transition(LOWEST_TIME32, initialTypeIdx)); in readzoneinfo() 1032 vector<Transition>::const_iterator trn; in print() [all …]
|
/external/guava/guava/src/com/google/common/util/concurrent/ |
D | AbstractService.java | 100 private final Transition startup = new Transition(); 101 private final Transition shutdown = new Transition(); 511 private class Transition extends AbstractFuture<State> {
|
/external/skia/src/animator/ |
D | SkDisplayApply.h | 26 enum Transition { enum 89 Transition transition;
|
/external/selinux/policycoreutils/sepolicy/sepolicy/help/ |
D | transition_file.txt | 13 File Transition Rules can be written to create all objects of a particular class, or specific to a … 15 You need to build a policy module if you want to add additional File Transition Rules.
|
D | transition_from_boolean.txt | 6 Transition rules are either always allowed or can be turned on and off based on the boolean setting…
|
/external/icu/icu4c/source/i18n/unicode/ |
D | rbtz.h | 26 struct Transition; 316 UDate getTransitionTime(Transition* transition, UBool local,
|
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
D | DFA.as | 103 if ( eot[s]>=0 ) { // EOT Transition to accept state? 121 if ( eot[s]>=0 ) { // EOT Transition? 127 if ( c==TokenConstants.EOF && eof[s]>=0 ) { // EOF Transition to accept state?
|