/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
H A D | ANTLRDFA.h | 40 const int **transition; variable
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
H A D | ANTLRDFA.h | 40 const int **transition; variable
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
H A D | ANTLRDFA.h | 40 const int **transition; variable
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
H A D | ANTLRDFA.h | 40 const int **transition; variable 77 @property const int **transition; variable
|
/external/antlr/antlr-3.4/runtime/C/include/ |
H A D | antlr3cyclicdfa.h | 83 const ANTLR3_INT32 * const * const transition; member in struct:ANTLR3_CYCLIC_DFA_struct
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
H A D | State.java | 45 public abstract Transition transition(int i); method in class:State
|
H A D | NFAState.java | 48 public Transition[] transition = new Transition[MAX_TRANSITIONS]; field in class:NFAState 100 /** Is this state the sole target of an EOT transition? */ 118 throw new IllegalArgumentException("You can't add a null transition"); 120 if ( numTransitions>transition.length ) { 121 throw new IllegalArgumentException("You can only have "+transition.length+" transitions"); 124 transition[numTransitions] = e; 139 * transition another state has. 143 throw new IllegalArgumentException("You can't use a solitary null transition"); 145 transition[0] = e; 146 transition[ 150 public Transition transition(int i) { method in class:NFAState [all...] |
H A D | DFAState.java | 157 * transition that could be a valid label is transition(0). When we 176 public Transition transition(int i) { method in class:DFAState 188 /** Add a transition from this state to target with label. Return 189 * the transition number from 0..n-1. 218 * transition labels so we can simply walk it later rather than doing a 243 if ( state.transition[0] != null ) { 244 Label label = state.transition[0].label; 250 if ( state.transition[1] ==null ) { 279 * the set of all possible transition label [all...] |
H A D | DFA.java | 171 /** Map an edge transition table to a unique set number; ordered so 173 * and then ref them from within the transition[][] table. Like this 188 /** The unique edge transition class number; every time we see a new 191 * some of the big edge transition tables are seen about 57 times. 195 /* This DFA can be converted to a transition[state][char] table and 214 public Vector transition; field in class:DFA 330 if ( transition==null || transition.size()==0 ) { 333 List encoded = new ArrayList(transition.size()); 334 // walk Vector<Vector<FormattedInteger>> which is the transition[][] tabl [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
H A D | DFA.cs | 41 /** <summary>A DFA implemented as a set of transition tables.</summary> 62 protected short[][] transition; field in class:Antlr.Runtime.DFA 139 // look for a normal char transition 143 int snext = transition[s][c - min[s]]; // move to next state 146 // was in range but not a normal transition 153 Console.Error.WriteLine( "EOT transition" ); 173 Console.Error.WriteLine( "EOT transition" ); 191 for ( int p = 0; p < transition[s].Length; p++ ) 193 Console.Error.Write( transition[s][p] + " " );
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
H A D | DFA.java | 30 /** A DFA implemented as a set of transition tables. 48 protected short[][] transition; field in class:DFA 96 // look for a normal char transition 99 int snext = transition[s][c-min[s]]; // move to next state 101 // was in range but not a normal transition 106 if ( debug ) System.err.println("EOT transition"); 124 if ( debug ) System.err.println("EOT transition"); 139 for (int p=0; p<transition[s].length; p++) { 140 System.err.print(transition[s][p]+" ");
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
H A D | DFA.cs | 40 /** <summary>A DFA implemented as a set of transition tables.</summary> 67 protected short[][] transition; field in class:Antlr.Runtime.DFA 117 // look for a normal char transition 120 int snext = transition[s][c - min[s]]; // move to next state 122 // was in range but not a normal transition 128 Console.Error.WriteLine("EOT transition"); 147 Console.Error.WriteLine("EOT transition"); 163 for (int p = 0; p < transition[s].Length; p++) { 164 Console.Error.Write(transition[s][p] + " ");
|
/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
H A D | ConstrainedConjGrad.h | 135 bool transition = false; local 144 transition = true; 162 if (iter.noiseLevel() > 0 && transition) std::cerr << "CCG: transition\n"; 163 if (transition || iter.first()) gamma = 0.0;
|
/external/libopus/silk/ |
H A D | enc_API.c | 157 opus_int transition, curr_block, tot_blocks; local 177 /* Mono -> Stereo transition: init state of second channel and stereo state */ 193 transition = (encControl->payloadSize_ms != psEnc->state_Fxx[ 0 ].sCmn.PacketSize_ms) || (psEnc->nChannelsInternal != encControl->nChannelsInternal); 244 if( psEnc->state_Fxx[n].sCmn.first_frame_after_reset || transition ) {
|
/external/v8/src/ |
H A D | transitions.h | 20 // property transition are stored inline (i.e. the target map is stored 21 // directly); otherwise a full transition array is used that has 24 // map. In the case of a simple transition, the key is also read from the 33 // [2] First transition 37 // Insert a new transition into |map|'s transition array, extending it 47 if (Map* transition = SearchTransition(*map, kind, *name, attributes)) { 48 return handle(transition); 64 // transition (because it's either uninitialized, or has been cleared). 86 // The size of transition array 270 GetSimpleTargetDetails(Map* transition) argument 274 GetSimpleTransitionKey(Map* transition) argument [all...] |
H A D | map-updater.cc | 176 // attributes stays unchanged) it's fine to transition from None to anything 280 Map* transition = TransitionArray::SearchTransition( local 282 if (transition == NULL) break; 283 Handle<Map> tmp_map(transition, isolate_); 356 // Find the last compatible target map in the transition tree. 359 Map* transition = TransitionArray::SearchTransition( local 361 if (transition == NULL) break; 362 Handle<Map> tmp_map(transition, isolate_); 588 // Invalidate a transition target at |key|. 596 // If |maybe_transition| is not NULL then the transition arra [all...] |
H A D | transitions.cc | 34 // If the map has a simple transition, check if it should be overwritten. 112 // The map's transition array may have shrunk during the allocation above as 175 int transition = transitions->Search(kind, name, attributes); local 176 if (transition == kNotFound) return nullptr; 177 return transitions->GetTarget(transition); 188 int transition = transitions->SearchSpecial(name); local 189 if (transition == kNotFound) return NULL; 190 return transitions->GetTarget(transition); 299 // Don't cache prototype transition if this map is either shared, or a map of 497 // This function only handles full transition array 523 SearchDetails(int transition, PropertyKind kind, PropertyAttributes attributes, int* out_insertion_index) argument [all...] |
H A D | lookup.cc | 375 Handle<Map> transition = Map::TransitionToDataProperty( local 378 transition_ = transition; 380 if (transition->is_dictionary_map()) { 385 property_details_ = transition->GetLastDescriptorDetails(); 399 Handle<Map> transition = transition_map(); local 400 bool simple_transition = transition->GetBackPointer() == receiver->map(); 401 JSObject::MigrateToMap(receiver, transition); 404 int number = transition->LastAdded(); 406 property_details_ = transition->GetLastDescriptorDetails();
|
/external/ImageMagick/MagickCore/ |
H A D | splay-tree.c | 1015 transition; 1035 transition=(TransitionType) transitions[i]; 1036 switch (transition) 998 transition; local
|
/external/toybox/toys/posix/ |
H A D | ls.c | 243 unsigned long transition; local 267 transition = widecols * columns; 268 if (ul < transition) { 273 ul -= transition;
|
/external/libopus/src/ |
H A D | opus_decoder.c | 220 int transition=0; local 310 transition = 1; 318 if (transition && mode == MODE_CELT_ONLY) 455 transition = 0; 461 if (transition && mode != MODE_CELT_ONLY) 546 if (transition) 556 /* Not enough time to do a clean transition, but we do it anyway 560 transition it pretty silly in the first place */
|
/external/selinux/python/sepolicy/ |
H A D | sepolicy.py | 458 def transition(args): function 459 from sepolicy.transition import setrans 465 trans = parser.add_parser("transition", 466 help=_('query SELinux Policy to see how a source process domain can transition to the target process domain')) 473 trans.set_defaults(func=transition) 603 help=_("Enter SELinux user(s) which will transition to this domain")) 606 help=_("Enter SELinux role(s) to which the administror domain will transition"))
|
/external/v8/src/compiler/ |
H A D | load-elimination.cc | 676 ElementsTransition transition = ElementsTransitionOf(node->op()); local 678 Handle<Map> source_map(transition.source()); 679 Handle<Map> target_map(transition.target()); 699 switch (transition.mode()) { 976 ElementsTransition transition = ElementsTransitionOf(current->op()); local 980 !ZoneHandleSet<Map>(transition.target())
|
H A D | simplified-operator.cc | 330 size_t hash_value(ElementsTransition transition) { argument 331 return base::hash_combine(static_cast<uint8_t>(transition.mode()), 332 transition.source().address(), 333 transition.target().address()); 336 std::ostream& operator<<(std::ostream& os, ElementsTransition transition) { argument 337 switch (transition.mode()) { 339 return os << "fast-transition from " << Brief(*transition.source()) 340 << " to " << Brief(*transition.target()); 342 return os << "slow-transition fro 798 TransitionElementsKind( ElementsTransition transition) argument [all...] |
/external/icu/icu4c/source/i18n/ |
H A D | olsontz.cpp | 187 // Type map data must be of the same size as the transition count 239 // historic transition data or finalZone to be used. In an 471 // quick zone transition checking. 488 // Before the first transition time 496 int64_t transition = transitionTimeInSeconds(transIdx); local 498 if (local && (sec >= (transition - MAX_OFFSET_SECONDS))) { 509 // Positive transition, which makes a non-existing local time range 512 transition += offsetBefore; 515 transition += offsetAfter; 517 transition 582 double transition = (double)transitionTimeInSeconds(i); local [all...] |