| /external/antlr/tool/src/main/java/org/antlr/analysis/ |
| D | Transition.java | 37 public class Transition implements Comparable<Transition> { 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
73 Transition other = (Transition)o; in equals()
79 public int compareTo(Transition other) { in compareTo()
|
| D | NFAState.java | 48 public Transition[] transition = new Transition[MAX_TRANSITIONS];
118 public void addTransition(Transition e) { in addTransition()
143 public void setTransition0(Transition e) { in setTransition0()
153 public Transition transition(int i) { in transition()
|
| 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);
177 public Transition transition(int i) { in transition()
187 public void addTransition(Transition t) { in addTransition()
195 transitions.add( new Transition(label, target) ); in addTransition()
199 public Transition getTransition(int trans) { in getTransition()
|
| D | DFA.java | 504 Transition edge = s.transition(j);
555 Transition edge = s.transition(j);
594 Transition edge = s.transition(j);
628 Transition edge = 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 | 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 | 267 Map<Integer, Transition> targetToLabelMap = new HashMap<Integer, Transition>(); in findNewDFAStatesAndAddDFATransitions()
411 Map<Integer, Transition> targetToLabelMap) in addTransition()
418 Transition oldTransition = 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 | DFAOptimizer.java | 192 Transition edge = d.transition(i); in optimizeExitBranches()
221 Transition edge = d.transition(i); in optimizeEOTBranches()
|
| D | RuleClosureTransition.java | 38 public class RuleClosureTransition extends Transition {
|
| /external/icu/icu4c/source/i18n/ |
| D | rbtz.cpp | 28 struct Transition { struct
275 Transition *trst = (Transition*)uprv_malloc(sizeof(Transition)); in complete()
309 Transition *final0 = (Transition*)uprv_malloc(sizeof(Transition)); in complete()
314 Transition *final1 = (Transition*)uprv_malloc(sizeof(Transition)); in complete()
438 UDate tstart = getTransitionTime((Transition*)fHistoricTransitions->elementAt(0), in getOffsetInternal()
444 UDate tend = getTransitionTime((Transition*)fHistoricTransitions->elementAt(idx), in getOffsetInternal()
453 rule = ((Transition*)fHistoricTransitions->elementAt(idx))->to; in getOffsetInternal()
458 if (date >= getTransitionTime((Transition*)fHistoricTransitions->elementAt(idx), in getOffsetInternal()
464 rule = ((Transition*)fHistoricTransitions->elementAt(idx))->to; in getOffsetInternal()
651 Transition *trs = (Transition*)fHistoricTransitions->orphanElementAt(0); in deleteTransitions()
[all …]
|
| /external/antlr/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()
326 Transition toEnd = new Transition(label, end); in build_EOFState()
675 Transition e = new Transition(label,right); in build_Wildcard()
727 Transition e = new Transition(label,b); in transitionBetweenStates()
|
| D | RandomPhrase.java | 34 import org.antlr.analysis.Transition;
97 Transition t0 = state.transition[0]; in randomPhrase()
122 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 | DOTGenerator.java | 133 Transition edge = s.transition(i); in walkCreatingDFADOT()
208 Transition edge = s.transition(i); in walkRuleNFACreatingDOT()
284 protected String getEdgeLabel(Transition edge) { in getEdgeLabel()
|
| D | FASerializer.java | 124 Transition edge = s.transition(i); in walkFANormalizingStateNumbers()
152 Transition edge = s.transition(i); in walkSerializingFA()
|
| D | Interpreter.java | 301 Transition trans = s.transition[0]; in parseEngine()
400 Transition eotTransition = null; in predict()
409 Transition t = s.transition(i); in predict()
|
| /external/icu/icu4c/source/tools/tzcode/ |
| D | tz2icu.cpp | 124 struct Transition { struct
127 Transition(int64_t _time, int32_t _type) { in Transition() function
165 vector<Transition> transitions;
380 info.transitions.push_back(Transition(transitionTimes[i], transitionTypes[i])); in readzoneinfo()
387 vector<Transition>::iterator itr = info.transitions.begin(); in readzoneinfo()
388 info.transitions.insert(itr, Transition(LOWEST_TIME32, transitionTypes[minidx])); in readzoneinfo()
396 info.transitions.push_back(Transition(transitionTimes[i], transitionTypes[i])); in readzoneinfo()
445 vector<Transition>::iterator itr = info.transitions.begin(); in readzoneinfo()
446 info.transitions.insert(itr, Transition(LOWEST_TIME32, initialTypeIdx)); in readzoneinfo()
1029 vector<Transition>::const_iterator trn; in print()
[all …]
|
| /external/autotest/server/site_tests/network_WiFi_RoamFT/ |
| D | control.PSK | 14 key management suite (i.e. WPA-PSK with Fast BSS Transition) in full view of the
15 DUT. Fast BSS Transition is part of the 802.11r protocol, which describes a
|
| D | control.EAP | 14 key management suite (i.e. WPA-EAP with Fast BSS Transition) in full view of the
15 DUT. Fast BSS Transition is part of the 802.11r protocol, which describes a
|
| /external/selinux/python/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.
|
| /external/icu/icu4c/source/i18n/unicode/ |
| D | rbtz.h | 28 struct Transition;
318 UDate getTransitionTime(Transition* transition, UBool local,
|
| /external/antlr/tool/src/main/java/org/antlr/codegen/ |
| D | ACyclicDFACodeGenerator.java | 99 Transition edge = s.transition(i); in walkFixedDFAGeneratingStateMachine()
173 Transition predEdge = EOTTarget.transition(i); in walkFixedDFAGeneratingStateMachine()
|
| /external/v8/tools/ |
| D | trace-maps-processor.py | 37 class Transition(object): class
83 targets[to_map] = Transition(from_map, to_map, reason)
|
| /external/cros/system_api/dbus/power_manager/ |
| D | backlight.proto | 23 enum Transition { enum
29 optional Transition transition = 2;
|