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

/external/bison/src/
H A Dstate.h56 Each transition structure describes the possible transitions out
58 contains a vector of numbers of the states that transitions can go
63 deletes transitions by having them point to zero.
118 } transitions; typedef in typeref:struct:__anon335
165 struct state *transitions_to (transitions *shifts, symbol_number sym);
202 transitions *transitions; member in struct:state
226 /* Set the transitions of STATE. */
/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/icu4c/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/libxml2/
H A Dxmlregexp.c315 int transcount; /* the number of chars in char counted transitions */
457 int *transitions; local
467 * 3/ build a table state x atom for the transitions
539 transitions = (int *) xmlMalloc((nbstates + 1) *
541 if (transitions == NULL) {
548 memset(transitions, 0, (nbstates + 1) * (nbatoms + 1) * sizeof(int));
566 transitions[stateno * (nbatoms + 1)] = state->type;
586 * if the same atom can generate transitions to 2 different
590 prev = transitions[stateno * (nbatoms + 1) + atomno + 1];
601 xmlFree(transitions);
[all...]
/external/webkit/Source/WebCore/rendering/style/
H A DRenderStyle.h750 const AnimationList* transitions() const { return rareNonInheritedData->m_transitions.get(); } function in class:WebCore::RenderStyle
758 // return the first found Animation (including 'all' transitions)
/external/v8/src/
H A Dobjects.cc1554 // Element transitions are stored in the descriptor for property "", which is
1638 // then transitions are not added to it, so we are done.
1784 // All calls to ReplaceSlowProperty have had all transitions removed.
1809 // Do not add transitions to the map of "new Object()".
2493 // where map transitions and null descriptors are handled.
2930 // Neither properties nor transitions found.
3058 // Neither properties nor transitions found.
4756 // Don't copy descriptors, so map transitions always remain a forest.
4759 // collector relies on being able to reverse pointers from transitions
4890 // An iterator over all map transitions i
8620 int transitions = NumberOfProtoTransitions() + 1; local
[all...]
/external/zxing/core/
H A Dcore.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/zxing/ com/google/zxing/aztec/ ...
/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/ ...

Completed in 230 milliseconds