Searched defs:transitions (Results 1 - 25 of 30) sorted by relevance

12

/external/pdfium/xfa/src/fxbarcode/datamatrix/
H A DBC_DataMatrixDetector.h19 int32_t transitions) {
22 m_transitions = transitions;
17 CBC_ResultPointsAndTransitions(CBC_ResultPoint* from, CBC_ResultPoint* to, int32_t transitions) argument
H A DBC_DataMatrixDetector.cpp60 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[
[all...]
/external/v8/tools/
H A Dtrace-maps-processor.py23 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/bison/src/
H A Dstate.h54 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.
115 } transitions; typedef in typeref:struct:__anon654
162 struct state *transitions_to (transitions *shifts, symbol_number sym);
202 transitions *transitions; member in struct:state
234 /* Set the transitions of STATE. */
/external/v8/src/
H A Dtransitions-inl.h8 #include "src/transitions.h"
40 void TransitionArray::SetPrototypeTransitions(FixedArray* transitions) { argument
41 DCHECK(transitions->IsFixedArray());
42 set(kPrototypeTransitionsIndex, transitions);
H A Dtransitions.cc5 #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.
174 TransitionArray* transitions = TransitionArray::cast(raw_transitions); local
175 int transition = transitions->Search(kind, name, attributes);
177 return transitions->GetTarget(transition);
187 TransitionArray* transitions = TransitionArray::cast(raw_transitions); local
188 int transition = transitions->SearchSpecial(name);
190 return transitions->GetTarget(transition);
230 TransitionArray* transitions local
286 FixedArray* transitions = GetPrototypeTransitions(map); local
308 int transitions = NumberOfPrototypeTransitions(*cache) + 1; local
354 TransitionArray* transitions = TransitionArray::cast(raw_transitions); local
405 ZapTransitionArray(TransitionArray* transitions) argument
437 TransitionArray* transitions = TransitionArray::cast(map->raw_transitions()); local
469 TransitionArray* transitions = TransitionArray::cast(raw_transitions); local
493 CheckNewTransitionsAreConsistent( Handle<Map> map, TransitionArray* old_transitions, Object* transitions) argument
[all...]
H A Dobjects-debug.cc1191 // Duplicate entries are not allowed for non-property transitions.
1216 // Simple and non-existent transitions are always sorted.
1228 Object* transitions = map->raw_transitions(); local
1229 for (int i = 0; i < TransitionArray::NumberOfTransitions(transitions); ++i) {
1230 Map* target = TransitionArray::GetTarget(transitions, i);
H A Dobjects-printer.cc518 os << "\n - transitions #" << nof_transitions << ": "
577 if (i == kPrototypeTransitionsIndex) os << " (prototype transitions)";
578 if (i == kTransitionLengthIndex) os << " (number of transitions)";
1343 void TransitionArray::PrintTransitions(std::ostream& os, Object* transitions, argument
1345 int num_transitions = NumberOfTransitions(transitions);
1350 Name* key = GetKey(transitions, i);
1351 Map* target = GetTarget(transitions, i);
1391 Object* transitions = map()->raw_transitions(); local
1392 int num_transitions = TransitionArray::NumberOfTransitions(transitions);
1394 os << "\n - transitions";
[all...]
H A Dobjects.cc3446 Object* transitions = raw_transitions();
3447 int num_transitions = TransitionArray::NumberOfTransitions(transitions);
3449 TransitionArray::GetTarget(transitions, i)->DeprecateTransitionTree();
3581 Object* transitions = current->raw_transitions(); local
3582 int num_transitions = TransitionArray::NumberOfTransitions(transitions);
3584 Map* target = TransitionArray::GetTarget(transitions, i);
4189 // could be inserted regardless of whether transitions array is full or not.
4270 // Try to follow existing elements kind transitions.
4935 // replay the property transitions that does not involve instance rewriting
5055 // Reuse map transitions fo
8803 Object* transitions = map->raw_transitions(); local
[all...]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
H A DDFAState.java74 /** 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
[all...]
/external/v8/src/compiler/
H A Daccess-info.h45 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
/external/ImageMagick/MagickCore/
H A Dsplay-tree.c1018 *transitions;
1024 transitions=(unsigned char *) AcquireQuantumMemory((size_t) splay_tree->nodes,
1025 sizeof(*transitions));
1026 if ((nodes == (NodeInfo **) NULL) || (transitions == (unsigned char *) NULL))
1031 transitions[0]=(unsigned char) LeftTransition;
1035 transition=(TransitionType) transitions[i];
1040 transitions[i]=(unsigned char) DownTransition;
1045 transitions[i]=(unsigned char) LeftTransition;
1050 transitions[i]=(unsigned char) UpTransition;
1055 transitions[
1001 *transitions; local
[all...]
/external/icu/android_icu4j/src/main/tests/android/icu/dev/util/
H A DUnicodeMap.java52 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[
[all...]
/external/icu/icu4j/main/tests/framework/src/com/ibm/icu/dev/util/
H A DUnicodeMap.java51 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[
[all...]
/external/icu/icu4c/source/tools/tzcode/
H A Dtz2icu.cpp157 // 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
[all...]
/external/v8/src/profiler/
H A Dheap-snapshot-generator.cc1264 TransitionArray* transitions = local
1266 int transitions_entry = GetEntry(transitions)->index();
1269 if (transitions->HasPrototypeTransitions()) {
1271 transitions->GetPrototypeTransitions();
1273 TagObject(prototype_transitions, "(prototype transitions");
1274 SetInternalReference(transitions, transitions_entry,
1277 // TODO(alph): transitions keys are strong links.
1278 MarkAsWeakContainer(transitions);
1281 TagObject(transitions, "(transition array)");
1282 SetInternalReference(map, entry, "transitions", transition
[all...]
/external/libxml2/
H A Dxmlregexp.c319 int transcount; /* the number of chars in char counted transitions */
461 int *transitions; local
471 * 3/ build a table state x atom for the transitions
543 transitions = (int *) xmlMalloc((nbstates + 1) *
545 if (transitions == NULL) {
552 memset(transitions, 0, (nbstates + 1) * (nbatoms + 1) * sizeof(int));
570 transitions[stateno * (nbatoms + 1)] = state->type;
590 * if the same atom can generate transitions to 2 different
594 prev = transitions[stateno * (nbatoms + 1) + atomno + 1];
605 xmlFree(transitions);
[all...]
/external/v8/src/heap/
H A Dmark-compact.cc318 // The slots that become invalid due to runtime transitions are
2550 Map* map, TransitionArray* transitions, DescriptorArray* descriptors) {
2551 int num_transitions = transitions->number_of_entries();
2554 // Compact all live transitions to the left.
2556 Map* target = transitions->GetTarget(i);
2565 Name* key = transitions->GetKey(i);
2566 transitions->SetKey(transition_index, key);
2567 Object** key_slot = transitions->GetKeySlot(transition_index);
2568 RecordSlot(transitions, key_slot, key);
2570 transitions
2549 CompactTransitionArray( Map* map, TransitionArray* transitions, DescriptorArray* descriptors) argument
[all...]
/external/zxing/core/
H A Dcore.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/zxing/ com/google/zxing/oned/ ...
/external/robolectric/v3/libs/
H A Dvtd-xml-2.11.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/ximpleware/ com/ximpleware/extended/ com/ximpleware/extended/parser/ ...
/external/antlr/antlr-3.4/lib/
H A Dantlr-3.4-complete.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ...
/external/libgdx/backends/gdx-backends-gwt/libs/
H A Dgwt-user.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/gwt/ com/google/gwt/activity/ ...
/external/robolectric/v3/runtime/
H A Dandroid-all-5.0.0_r2-robolectric-1.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/android/ com/google/android/collect/ ...
H A Dandroid-all-5.1.1_r9-robolectric-1.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/android/ com/google/android/collect/ ...
H A Dandroid-all-4.4_r1-robolectric-1.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/android/ com/google/android/collect/ ...

Completed in 948 milliseconds

12