| /external/v8/tools/ |
| trace-maps-processor.py | 23 transitions = {} variable
66 if from_map not in transitions:
67 transitions[from_map] = {}
68 targets = transitions[from_map]
124 if m in transitions:
125 for t in transitions[m]:
126 PlainPrint(t, indent + " ", transitions[m][t].reason)
130 if m not in transitions: return 0
131 return len(transitions[m])
136 if m in transitions
[all...] |
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/util/ |
| UnicodeMap.java | 52 private int[] transitions; field in class:UnicodeMap
70 transitions = new int[] {0,0x110000,0,0,0,0,0,0,0,0};
89 if (transitions[i] != that.transitions[i]) return false;
108 result = 37*result + transitions[i];
120 that.transitions = (int[]) transitions.clone();
132 || length > transitions.length
133 || transitions.length != values.length) {
144 if (transitions[0] != 0 || transitions[length-1] != 0x110000)
[all...] |
| /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();
131 || length > transitions.length
132 || transitions.length != values.length) {
143 if (transitions[0] != 0 || transitions[length-1] != 0x110000)
[all...] |
| /external/v8/src/ |
| transitions.cc | 5 #include "src/transitions.h"
8 #include "src/transitions-inl.h"
21 // If the map doesn't have any transitions at all yet, install the new one.
173 TransitionArray* transitions = TransitionArray::cast(raw_transitions); local
174 int transition = transitions->Search(kind, name, attributes);
176 return transitions->GetTarget(transition);
186 TransitionArray* transitions = TransitionArray::cast(raw_transitions); local
187 int transition = transitions->SearchSpecial(name);
189 return transitions->GetTarget(transition);
228 TransitionArray* transitions = TransitionArray::cast(raw_transitions) local
284 FixedArray* transitions = GetPrototypeTransitions(map); local
306 int transitions = NumberOfPrototypeTransitions(*cache) + 1; local
352 TransitionArray* transitions = TransitionArray::cast(raw_transitions); local
436 TransitionArray* transitions = TransitionArray::cast(map->raw_transitions()); local
468 TransitionArray* transitions = TransitionArray::cast(raw_transitions); local
[all...] |
| transitions-inl.h | 8 #include "src/transitions.h"
40 void TransitionArray::SetPrototypeTransitions(FixedArray* transitions) {
41 DCHECK(transitions->IsFixedArray());
42 set(kPrototypeTransitionsIndex, transitions);
164 // Transitions are allowed only for the last added property.
|
| transitions.h | 18 // TransitionArrays are fixed arrays used to hold map transitions for property,
19 // constant, and element changes. "Simple" transitions storing only a single
22 // prototype transitions and multiple property transitons. The details related
23 // to property transitions are accessed in the descriptor array of the target
28 // and handles the distinction between simple and full transitions storage.
31 // [0] Smi(0) or fixed array of prototype transitions
32 // [1] Number of transitions
34 // [2 + number of transitions * kTransitionSize]: start of slack
91 // ===== PROTOTYPE TRANSITIONS =====
94 // order not to multiply maps unnecessarily we store these as transitions i
[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:__anon6637
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...] |
| /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/pdfium/xfa/src/fxbarcode/datamatrix/ |
| BC_DataMatrixDetector.cpp | 60 CFX_PtrArray transitions;
local
61 transitions.Add(TransitionsBetween(pointA, pointB));
62 transitions.Add(TransitionsBetween(pointA, pointC));
63 transitions.Add(TransitionsBetween(pointB, pointD));
64 transitions.Add(TransitionsBetween(pointC, pointD));
65 BC_FX_PtrArray_Sort(transitions, &ResultPointsAndTransitionsComparator);
66 delete ((CBC_ResultPointsAndTransitions*)transitions[2]);
67 delete ((CBC_ResultPointsAndTransitions*)transitions[3]);
69 (CBC_ResultPointsAndTransitions*)transitions[0];
71 (CBC_ResultPointsAndTransitions*)transitions[1];
[all...] |
| BC_DataMatrixDetector.h | 19 int32_t transitions) {
22 m_transitions = transitions;
|
| /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-460917.js | 10 // Emit a load that transitions a1 to FAST_ELEMENTS.
|
| 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...] |
| /libcore/luni/src/test/java/libcore/java/util/ |
| SimpleTimeZoneTest.java | 78 * Check that the DST transitions in the supplied {@link TimeZone} are as expected for
185 * Check that the DST transitions in the supplied {@link TimeZone} are as expected for
208 long[] transitions = new long[2]; local
240 transitions[0] = entryPoint;
241 transitions[1] = exitPoint;
242 return transitions;
267 // Find the DST transitions instants.
|
| /external/v8/src/compiler/ |
| access-info.h | 45 MapTransitionList& transitions() { return transitions_; } function in class:v8::internal::compiler::final
46 MapTransitionList const& transitions() const { return transitions_; } function in class:v8::internal::compiler::final
|
| /packages/services/Telecomm/tests/src/com/android/server/telecom/tests/ |
| CallAudioModeStateMachineTest.java | 430 "Foreground call transitions from sim to voip",
449 "Foreground call transitions from voip to sim",
|
