Searched refs:states (Results 1 - 25 of 160) sorted by relevance

1234567

/external/libxml2/
H A Ddbgen.pl14 @states = ("AL", "AK", "AZ", "AR", "CA", "CO", "CT", "DE", "FL", "GA",
28 $state = $states [($i / 100) % 50];
H A Ddbgenattr.pl14 @states = ("AL", "AK", "AZ", "AR", "CA", "CO", "CT", "DE", "FL", "GA",
28 $state = $states [($i / 100) % 50];
H A DtestAutomata.c37 xmlAutomataStatePtr states[1000]; local
42 states[i] = NULL;
58 states[0] = xmlAutomataGetInitState(am);
59 if (states[0] == NULL) {
88 if (states[from] == NULL)
89 states[from] = xmlAutomataNewState(am);
97 if (states[to] == NULL)
98 states[to] = xmlAutomataNewState(am);
100 xmlAutomataNewTransition(am, states[from], states[t
[all...]
H A Dpattern.c111 int nbState; /* number of states in the automata */
112 int maxState; /* allocated number of states */
114 int *states; /* the array of step indexes */ member in struct:_xmlStreamCtxt
150 xmlStepStatePtr states; member in struct:_xmlStepStates
464 xmlPatPushState(xmlStepStates *states, int step, xmlNodePtr node) { argument
465 if ((states->states == NULL) || (states->maxstates <= 0)) {
466 states->maxstates = 4;
467 states
501 xmlStepStates states = {0, 0, NULL}; /* // may require backtrack */ local
[all...]
/external/icu/icu4c/source/tools/toolutil/
H A Ducmstate.c154 /* adjust "final valid" states according to the state flags */
186 ucm_addState(UCMStates *states, const char *s) { argument
189 if(states->countStates==MBCS_MAX_STATE_COUNT) {
190 fprintf(stderr, "ucm error: too many states (maximum %u)\n", MBCS_MAX_STATE_COUNT);
194 error=parseState(s, states->stateTable[states->countStates],
195 &states->stateFlags[states->countStates]);
201 ++states->countStates;
207 UCMStates *states; local
332 sumUpStates(UCMStates *states) argument
424 ucm_processStates(UCMStates *states, UBool ignoreSISOCheck) argument
614 compactToUnicode2(UCMStates *states, uint16_t **pUnicodeCodeUnits, _MBCSToUFallback *toUFallbacks, int32_t countToUFallbacks, UBool verbose) argument
840 findUnassigned(UCMStates *states, uint16_t *unicodeCodeUnits, _MBCSToUFallback *toUFallbacks, int32_t countToUFallbacks, int32_t state, int32_t offset, uint32_t b) argument
897 compactToUnicodeHelper(UCMStates *states, uint16_t *unicodeCodeUnits, _MBCSToUFallback *toUFallbacks, int32_t countToUFallbacks) argument
923 ucm_optimizeStates(UCMStates *states, uint16_t **pUnicodeCodeUnits, _MBCSToUFallback *toUFallbacks, int32_t countToUFallbacks, UBool verbose) argument
972 ucm_countChars(UCMStates *states, const uint8_t *bytes, int32_t length) argument
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/ode/events/
H A DCombinedEventsManager.java41 /** Events states. */
42 private final List<EventState> states; field in class:CombinedEventsManager
54 states = new ArrayList<EventState>();
72 states.add(new EventState(handler, maxCheckInterval,
84 for (EventState state : states) {
95 states.clear();
99 * @return a collection of the events states
103 return states;
110 return states.isEmpty();
129 if (states
[all...]
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/dot/
H A Ddot.stg33 dfa(decisionRanks,states,edges,rankdir,startState,useBox) ::= <<
37 <states; separator="\n">
42 nfa(decisionRanks,states,edges,rankdir,startState) ::= <<
46 <states; separator="\n">
51 decision_rank(states) ::= <<
52 {rank=same; rankdir=TB; <states; separator="; ">}
/external/jmonkeyengine/engine/src/core/com/jme3/app/state/
H A DAppStateManager.java69 * List holding the attached app states that are pending
71 * the running app states.
76 * Holds the active states once they are initialized.
78 private final SafeArrayList<AppState> states = new SafeArrayList<AppState>(AppState.class); field in class:AppStateManager
81 * List holding the detached app states that are pending
87 // synchronized separately.... but always on the states list. This
99 synchronized (states){
105 synchronized (states){
111 synchronized (states){
112 return states
[all...]
/external/icu/icu4c/source/i18n/
H A Dregexcst.pl30 $states{"pop"} = 255; # Add the "pop" to the list of defined state names.
63 if ($states{$state_name} != 0) {
66 $states{$state_name} = $num_states;
162 # We read all states first, before writing anything, so that the state numbers
163 # for the destination states are all available to be written.
185 # Check that all of the destination states have been defined
188 $states{"exit"} = 0; # Predefined state name, terminates state machine.
190 if ($states{$state_dest_state[$state]} == 0 && $state_dest_state[$state] ne "exit") {
194 if ($state_push_state[$state] ne "" && $states{$state_push_state[$state]} == 0) {
278 print " {doNOP, 0, 0, 0, TRUE}\n"; # State 0 is a dummy. Real states star
[all...]
/external/deqp/modules/gles31/functional/
H A Des31fSamplerStateQueryTests.cpp116 } states[] = local
170 for (int stateNdx = 0; stateNdx < DE_LENGTH_OF_ARRAY(states); ++stateNdx)
173 if (!states[stateNdx].newInGLES31)
176 if (isExtendedParamQuery(states[stateNdx].tester))
181 std::string() + states[stateNdx].name + verifierSuffix,
182 states[stateNdx].desc,
184 states[stateNdx].tester));
186 else if (isIsVectorQuery(states[stateNdx].tester))
190 std::string() + states[stateNdx].name + verifierSuffix,
191 states[stateNd
[all...]
H A Des31fTextureStateQueryTests.cpp134 } states[] = local
215 for (int stateNdx = 0; stateNdx < DE_LENGTH_OF_ARRAY(states); ++stateNdx)
217 if (!isLegalTesterForTarget(textureTargets[targetNdx].target, states[stateNdx].tester))
220 // for old targets, check only new states
221 if (!textureTargets[targetNdx].newInGLES31 && !states[stateNdx].newInGLES31)
224 if (isExtendedParamQuery(states[stateNdx].tester))
229 std::string() + states[stateNdx].name + verifierSuffix,
230 states[stateNdx].desc,
233 states[stateNdx].tester));
235 else if (isIsVectorQuery(states[stateNd
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/util/
H A DOpenIntToDoubleHashMap.java77 private byte[] states; field in class:OpenIntToDoubleHashMap
124 states = new byte[capacity];
139 states = new byte[length];
140 System.arraycopy(source.states, 0, states, 0, length);
186 if (states[index] == FREE) {
191 for (int perturb = perturb(hash); states[index] != FREE; perturb >>= PERTURB_SHIFT) {
216 if (states[index] == FREE) {
221 for (int perturb = perturb(hash); states[index] != FREE; perturb >>= PERTURB_SHIFT) {
259 return findInsertionIndex(keys, states, ke
270 findInsertionIndex(final int[] keys, final byte[] states, final int key, final int mask) argument
[all...]
H A DOpenIntToFieldHashMap.java83 private byte[] states; field in class:OpenIntToFieldHashMap
135 states = new byte[capacity];
151 states = new byte[length];
152 System.arraycopy(source.states, 0, states, 0, length);
198 if (states[index] == FREE) {
203 for (int perturb = perturb(hash); states[index] != FREE; perturb >>= PERTURB_SHIFT) {
228 if (states[index] == FREE) {
233 for (int perturb = perturb(hash); states[index] != FREE; perturb >>= PERTURB_SHIFT) {
271 return findInsertionIndex(keys, states, ke
282 findInsertionIndex(final int[] keys, final byte[] states, final int key, final int mask) argument
[all...]
/external/deqp/modules/gles3/functional/
H A Des3fSamplerStateQueryTests.cpp78 } states[] = local
91 for (int stateNdx = 0; stateNdx < DE_LENGTH_OF_ARRAY(states); ++stateNdx)
95 std::string() + states[stateNdx].name + getVerifierSuffix(verifier),
96 states[stateNdx].desc,
98 states[stateNdx].tester)));
H A Des3fTextureStateQueryTests.cpp90 } states[] = local
119 for (int stateNdx = 0; stateNdx < DE_LENGTH_OF_ARRAY(states); ++stateNdx)
121 if (!isLegalTesterForTarget(textureTargets[targetNdx].target, states[stateNdx].tester))
126 std::string() + textureTargets[targetNdx].name + "_" + states[stateNdx].name + getVerifierSuffix(verifier),
127 states[stateNdx].desc,
130 states[stateNdx].tester)));
/external/icu/icu4c/source/common/
H A Drbbicst.pl29 $states{"pop"} = 255; # Add the "pop" to the list of defined state names.
62 if ($states{$state_name} != 0) {
65 $states{$state_name} = $num_states;
161 # We read all states first, before writing anything, so that the state numbers
162 # for the destination states are all available to be written.
184 # Check that all of the destination states have been defined
187 $states{"exit"} = 0; # Predefined state name, terminates state machine.
189 if ($states{$state_dest_state[$state]} == 0 && $state_dest_state[$state] ne "exit") {
193 if ($state_push_state[$state] ne "" && $states{$state_push_state[$state]} == 0) {
302 print " $states{
[all...]
/external/jmonkeyengine/engine/src/test/jme3test/input/combomoves/
H A DComboMove.java67 private List<ComboMoveState> states = new ArrayList<ComboMoveState>(); field in class:ComboMove
125 states.add(new ComboMoveState(pressed, unpressed, timeElapsed));
132 return states.get(num);
136 return states.size();
/external/autotest/client/cros/cellular/
H A Dair_state_verifier.py13 def AssertDataStatusIn(self, states):
14 """Assert that the device's status is in states.
16 states: Collection of states
/external/robolectric/v1/src/test/java/com/xtremelabs/robolectric/shadows/
H A DStateListDrawableTest.java24 int[] states = {R.attr.state_pressed};
25 stateListDrawable.addState(states, drawable);
28 Drawable drawableForState = shadow.getDrawableForState(states);
/external/bison/src/
H A Dstate.h35 state 0 and NSTATES is the number of states. (FIXME: This sentence
51 lookahead token alone). When the states are generated, these
56 contains a vector of numbers of the states that transitions can go
57 to. The accessing_symbol fields of those states' cores say what
68 states should explicitly be errors (for implementing %nonassoc).
91 | Numbering states. |
114 state *states[1]; member in struct:__anon654
119 TRANSITIONS->states[Num]? Can be a token (amongst which the error
123 (Transitions->states[Num]->accessing_symbol)
125 /* Is the TRANSITIONS->states[Nu
[all...]
H A Dstate.c44 transitions *res = xmalloc (offsetof (transitions, states) + states_size);
46 memcpy (res->states, the_states, states_size);
64 return shifts->states[j];
169 transitions_new (s->transitions->num, s->transitions->states);
303 /* Initial capacity of states hash table. */
308 /* Two states are equal if they have the same core items. */
349 | Create the states hash table. |
364 | Free the states hash table, not the states. |
407 | Record S and all states reachabl
452 state **states = NULL; variable
[all...]
/external/aac/libSBRenc/src/
H A Dresampler.cpp314 FDKmemclear(DownSampler->downFilter.states, sizeof(DownSampler->downFilter.states));
374 FIXP_BQS (*states)[2] = downFilter->states;
393 state1 = states[0][s1];
394 state2 = states[0][s2];
401 /* Load merged states (from next section) */
402 state1b = states[i+1][s1];
403 state2b = states[i+1][s2];
409 states[
[all...]
H A Dresampler.h108 FIXP_BQS states[MAXNR_SECTIONS+1][2]; /*! state buffer */ member in struct:__anon432
/external/autotest/client/cros/
H A Dkernel_config.py47 states = []
50 states.append("unset")
52 states.append(state)
54 (name, value, '|'.join(states)))
/external/v8/src/compiler/
H A Dbytecode-graph-builder.cc30 void BindAccumulator(Node* node, FrameStateBeforeAndAfter* states = nullptr);
32 FrameStateBeforeAndAfter* states = nullptr);
34 FrameStateBeforeAndAfter* states = nullptr);
35 void RecordAfterState(Node* node, FrameStateBeforeAndAfter* states);
97 // Helper for generating frame states for before and after a bytecode.
263 Node* node, FrameStateBeforeAndAfter* states) {
264 if (states) {
265 states->AddToNode(node, OutputFrameStateCombine::PokeAt(0));
273 FrameStateBeforeAndAfter* states) {
275 if (states) {
262 BindAccumulator( Node* node, FrameStateBeforeAndAfter* states) argument
271 BindRegister( interpreter::Register the_register, Node* node, FrameStateBeforeAndAfter* states) argument
283 BindRegistersToProjections( interpreter::Register first_reg, Node* node, FrameStateBeforeAndAfter* states) argument
298 RecordAfterState( Node* node, FrameStateBeforeAndAfter* states) argument
[all...]

Completed in 620 milliseconds

1234567