| /external/icu/icu4j/main/tests/framework/src/com/ibm/icu/dev/util/ |
| UnicodeMap.java | 51 private int[] transitions; field in class:UnicodeMap
69 transitions = new int[] {0,0x110000,0,0,0,0,0,0,0,0};
88 if (transitions[i] != that.transitions[i]) return false;
107 result = 37*result + transitions[i];
119 that.transitions = (int[]) transitions.clone();
130 || length > transitions.length
131 || transitions.length != values.length) {
142 if (transitions[0] != 0 || transitions[length-1] != 0x110000)
[all...] |
| /external/v8/src/ |
| transitions.cc | 8 #include "src/transitions-inl.h"
67 DCHECK(!containing_map->transitions()->IsFullTransitionArray());
68 int nof = containing_map->transitions()->number_of_transitions();
73 int new_nof = containing_map->transitions()->number_of_transitions();
79 containing_map->transitions(), kSimpleTransitionIndex, 0);
83 containing_map->transitions()->back_pointer_storage());
96 int number_of_transitions = map->transitions()->number_of_transitions();
99 int insertion_index = map->transitions()->Search(*name);
109 TransitionArray* array = map->transitions();
|
| transitions-inl.h | 8 #include "src/transitions.h"
68 void TransitionArray::SetPrototypeTransitions(FixedArray* transitions,
71 DCHECK(transitions->IsFixedArray());
73 WRITE_FIELD(this, kPrototypeTransitionsOffset, transitions);
75 heap, this, kPrototypeTransitionsOffset, transitions, mode);
|
| objects-printer.cc | 346 TransitionArray* transitions = map()->transitions();
347 for (int i = 0; i < transitions->number_of_transitions(); i++) {
348 Name* key = transitions->GetKey(i);
356 << ElementsKindToString(transitions->GetTarget(i)->elements_kind())
361 switch (transitions->GetTargetDetails(i).type()) {
457 os << "\n - transitions: " << Brief(transitions());
[all...] |
| /external/bison/src/ |
| state.c | 40 static transitions *
44 transitions *res = xmalloc (offsetof (transitions, states) + states_size);
57 transitions_to (transitions *shifts, symbol_number sym)
70 | Error transitions. |
141 res->transitions = NULL;
168 res->transitions =
169 transitions_new (s->transitions->num, s->transitions->states);
191 free (s->transitions);
[all...] |
| state.h | 54 Each transition structure describes the possible transitions out
56 contains a vector of numbers of the states that transitions can go
61 deletes transitions by having them point to zero.
108 | Transitions. |
115 } transitions; typedef in typeref:struct:__anon4737
119 TRANSITIONS->states[Num]? Can be a token (amongst which the error
122 #define TRANSITION_SYMBOL(Transitions, Num) \
123 (Transitions->states[Num]->accessing_symbol)
125 /* Is the TRANSITIONS->states[Num] a shift? (as opposed to gotos). */
127 #define TRANSITION_IS_SHIFT(Transitions, Num)
202 transitions *transitions; member in struct:state
[all...] |
| lalr.c | 84 transitions *sp = states[s]->transitions;
118 transitions *sp = states[s]->transitions;
172 transitions *sp = states[stateno]->transitions;
243 s = transitions_to (s->transitions,
333 transitions *sp = s->transitions;
335 /* Transitions are only disabled during conflict resolution, and tha
[all...] |
| conflicts.c | 224 transitions *trans = s->transitions;
332 transitions *trans = s->transitions;
432 transitions *trans = s->transitions;
|
| graphviz.c | 92 FOR_EACH_SHIFT (s->transitions, n)
93 bitset_set (*no_reduce_set, TRANSITION_SYMBOL (s->transitions, n));
103 /* If no lookahead tokens were valid transitions, this reduction is
184 /* Build the lookahead tokens lists, one for enabled transitions and one
|
| print_graph.c | 142 transitions const *trans = s->transitions;
|
| ielr.c | 261 transitions *trans = states[to_state[i]]->transitions;
311 for (j = 0; j < states[i]->transitions->num; ++j)
312 ++predecessor_counts[states[i]->transitions->states[j]->number];
323 for (j = 0; j < states[i]->transitions->num; ++j)
325 state_number k = states[i]->transitions->states[j]->number;
829 for (i = 0; i < (*tp)->transitions->num; ++i)
831 state *t2 = (*tp)->transitions->states[i];
[all...] |
| print-xml.c | 127 transitions *trans = s->transitions;
139 xml_puts (out, level, "<transitions/>");
144 xml_puts (out, level, "<transitions>");
172 xml_puts (out, level, "</transitions>");
242 transitions *trans = s->transitions;
|
| print.c | 131 transitions *trans = s->transitions;
243 transitions *trans = s->transitions;
|
| /packages/apps/TvSettings/Settings/src/com/android/tv/settings/util/ |
| TransitionImage.java | 153 ArrayList<TransitionImage> transitions = new ArrayList<>(); local
156 return transitions;
160 transitions.add(image);
171 transitions.add(image);
175 return transitions;
178 public static void writeMultipleToIntent(List<TransitionImage> transitions, Intent intent) {
179 if (transitions == null || transitions.size() == 0) {
182 int size = transitions.size();
184 TransitionImage image = transitions.get(0)
[all...] |
| /frameworks/base/core/java/android/transition/ |
| TransitionUtils.java | 34 * Static utility methods for Transitions.
53 public static Transition mergeTransitions(Transition... transitions) {
56 for (int i = 0; i < transitions.length; i++) {
57 if (transitions[i] != null) {
68 return transitions[nonNullIndex];
72 for (int i = 0; i < transitions.length; i++) {
73 if (transitions[i] != null) {
74 transitionSet.addTransition(transitions[i]);
|
| /external/icu/icu4c/source/tools/tzcode/ |
| tz2icu.cpp | 157 // A collection of transitions from one ZoneType to another, together
159 // list of transitions between a smaller list of ZoneTypes.
164 vector<Transition> transitions; member in struct:ZoneInfo
362 // Build transitions vector out of corresponding times and types.
375 // transitions into zoneinfo.res, because data is limited to singed
379 info.transitions.push_back(Transition(transitionTimes[i], transitionTypes[i]));
384 // If there are any transitions before the 32bit minimum time,
386 vector<Transition>::iterator itr = info.transitions.begin();
387 info.transitions.insert(itr, Transition(LOWEST_TIME32, transitionTypes[minidx]));
395 info.transitions.push_back(Transition(transitionTimes[i], transitionTypes[i]))
[all...] |
| /external/v8/test/mjsunit/regress/ |
| regress-1493017.js | 29 // transitions do not show up as properties in for in.
43 // delete map transitions.
49 // Test that the deleted map transitions do not show up in for in.
|
| regress-crbug-122271.js | 30 // Tests that ElementsKind transitions and regular transitions don't
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| DFAState.java | 74 /** Track the transitions emanating from this DFA state. The List
77 protected List<Transition> transitions = field in class:DFAState
156 * can easily check for non-epsilon transitions because the only
159 * for all possible transitions. That is of the order: size(label space)
177 return (Transition)transitions.get(i);
181 return transitions.size();
185 transitions.add(t);
192 transitions.add( new Transition(label, target) );
193 return transitions.size()-1;
197 return transitions.get(trans)
[all...] |
| /frameworks/opt/timezonepicker/src/com/android/timezonepicker/ |
| TimeZoneInfo.java | 203 int[] transitions = null; local
205 transitions = new int[NUM_OF_TRANSITIONS];
211 transitions[numOfTransitions++] = objTransitions[i];
217 return transitions;
337 " same dst, same transitions:\n" + this.toString() + "\n" + other.toString());
|
| /external/v8/test/mjsunit/ |
| elements-transition-hoisting.js | 31 // Ensure that ElementsKind transitions in various situations are hoisted (or
36 // Make sure that a simple elements array transitions inside a loop before
59 // transitions in a loop still get hoisted in a way that doesn't generate a
117 // the transitioned map for the check and all transitions that they depend
128 // transitions in the loop can also be hoisted.
234 // prevent the influence of allocation-sites, which learn from transitions.
|
| elements-kind.js | 134 // Make sure the element kind transitions from smi when a non-smi is stored.
247 // Test crankshafted transitions SMI->FAST and DOUBLE->FAST.
308 // Elements_kind transitions for arrays.
310 // A map can have three different elements_kind transitions: SMI->DOUBLE,
|
| /external/v8/src/heap/ |
| objects-visiting-inl.h | 315 // When map collection is enabled we have to mark through map's transitions
604 // inside its transitions array is marked. Skip recording the back
608 // Treat pointers in the transitions array as weak and also mark that
613 TransitionArray* transitions = map->transitions(); local
614 MarkTransitionArray(heap, transitions);
644 // Mark the pointer fields of the Map. Since the transitions array has
655 Heap* heap, TransitionArray* transitions) {
656 if (!StaticVisitor::MarkObjectWithoutPush(heap, transitions)) return;
658 // Simple transitions do not have keys nor prototype transitions
[all...] |
| /external/v8/test/webkit/ |
| dfg-put-by-id-prototype-check.js | 25 "Tests that the DFG CFA is not overzealous in removing prototype structure checks for put_by_id transitions."
|
| /cts/tools/dasm/src/java_cup/ |
| lalr_state.java | 9 * A state consists of an LALR item set and a set of transitions to other
138 /** List of transitions out of this state. */
141 /** List of transitions out of this state. */
142 public lalr_transition transitions() {return _transitions;} method in class:lalr_state
237 * it attempts to extend the machine by creating transitions out of
432 * are indexed by terminal symbols and correspond to either transitions
436 * reduce-goto table is indexed by non terminals and represents transitions
511 for (lalr_transition trans=transitions(); trans!=null; trans=trans.next())
738 /* do the transitions */
739 for (tr = transitions(); tr != null; tr = tr.next()
[all...] |
