Home
last modified time | relevance | path

Searched refs:states (Results 1 – 25 of 265) sorted by relevance

1234567891011

/external/icu/icu4c/source/tools/toolutil/
Ducmstate.c186 ucm_addState(UCMStates *states, const char *s) { in ucm_addState() argument
189 if(states->countStates==MBCS_MAX_STATE_COUNT) { in ucm_addState()
194 error=parseState(s, states->stateTable[states->countStates], in ucm_addState()
195 &states->stateFlags[states->countStates]); in ucm_addState()
201 ++states->countStates; in ucm_addState()
207 UCMStates *states; in ucm_parseHeaderLine() local
211 states=&ucm->states; in ucm_parseHeaderLine()
265 states->conversionType=UCNV_DBCS; in ucm_parseHeaderLine()
267 states->conversionType = UCNV_SBCS; in ucm_parseHeaderLine()
269 states->conversionType = UCNV_MBCS; in ucm_parseHeaderLine()
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math/util/
DOpenIntToDoubleHashMap.java77 private byte[] states; field in OpenIntToDoubleHashMap
124 states = new byte[capacity]; in OpenIntToDoubleHashMap()
139 states = new byte[length]; in OpenIntToDoubleHashMap()
140 System.arraycopy(source.states, 0, states, 0, length); in OpenIntToDoubleHashMap()
186 if (states[index] == FREE) { in get()
191 for (int perturb = perturb(hash); states[index] != FREE; perturb >>= PERTURB_SHIFT) { in get()
216 if (states[index] == FREE) { in containsKey()
221 for (int perturb = perturb(hash); states[index] != FREE; perturb >>= PERTURB_SHIFT) { in containsKey()
259 return findInsertionIndex(keys, states, key, mask); in findInsertionIndex()
270 private static int findInsertionIndex(final int[] keys, final byte[] states, in findInsertionIndex() argument
[all …]
DOpenIntToFieldHashMap.java83 private byte[] states; field in OpenIntToFieldHashMap
135 states = new byte[capacity]; in OpenIntToFieldHashMap()
151 states = new byte[length]; in OpenIntToFieldHashMap()
152 System.arraycopy(source.states, 0, states, 0, length); in OpenIntToFieldHashMap()
198 if (states[index] == FREE) { in get()
203 for (int perturb = perturb(hash); states[index] != FREE; perturb >>= PERTURB_SHIFT) { in get()
228 if (states[index] == FREE) { in containsKey()
233 for (int perturb = perturb(hash); states[index] != FREE; perturb >>= PERTURB_SHIFT) { in containsKey()
271 return findInsertionIndex(keys, states, key, mask); in findInsertionIndex()
282 private static int findInsertionIndex(final int[] keys, final byte[] states, in findInsertionIndex() argument
[all …]
/external/jmonkeyengine/engine/src/core/com/jme3/app/state/
DAppStateManager.java78 private final SafeArrayList<AppState> states = new SafeArrayList<AppState>(AppState.class); field in AppStateManager
99 synchronized (states){ in getInitializing()
105 synchronized (states){ in getTerminating()
111 synchronized (states){ in getStates()
112 return states.getArray(); in getStates()
125 synchronized (states){ in attach()
126 if (!states.contains(state) && !initializing.contains(state)){ in attach()
144 synchronized (states){ in detach()
145 if (states.contains(state)){ in detach()
147 states.remove(state); in detach()
[all …]
/external/libxml2/
DtestAutomata.c37 xmlAutomataStatePtr states[1000]; in testRegexpFile() local
42 states[i] = NULL; in testRegexpFile()
58 states[0] = xmlAutomataGetInitState(am); in testRegexpFile()
59 if (states[0] == NULL) { in testRegexpFile()
88 if (states[from] == NULL) in testRegexpFile()
89 states[from] = xmlAutomataNewState(am); in testRegexpFile()
97 if (states[to] == NULL) in testRegexpFile()
98 states[to] = xmlAutomataNewState(am); in testRegexpFile()
100 xmlAutomataNewTransition(am, states[from], states[to], in testRegexpFile()
112 if (states[from] == NULL) in testRegexpFile()
[all …]
Dpattern.c114 int *states; /* the array of step indexes */ member
150 xmlStepStatePtr states; member
464 xmlPatPushState(xmlStepStates *states, int step, xmlNodePtr node) { in xmlPatPushState() argument
465 if ((states->states == NULL) || (states->maxstates <= 0)) { in xmlPatPushState()
466 states->maxstates = 4; in xmlPatPushState()
467 states->nbstates = 0; in xmlPatPushState()
468 states->states = xmlMalloc(4 * sizeof(xmlStepState)); in xmlPatPushState()
470 else if (states->maxstates <= states->nbstates) { in xmlPatPushState()
473 tmp = (xmlStepStatePtr) xmlRealloc(states->states, in xmlPatPushState()
474 2 * states->maxstates * sizeof(xmlStepState)); in xmlPatPushState()
[all …]
Drelaxng.c374 xmlRelaxNGStatesPtr states; /* the accumulated state list */ member
1055 xmlRelaxNGStatesPtr states, in xmlRelaxNGAddStatesUniq() argument
1061 if (states->nbState >= states->maxState) { in xmlRelaxNGAddStatesUniq()
1065 size = states->maxState * 2; in xmlRelaxNGAddStatesUniq()
1066 tmp = (xmlRelaxNGValidStatePtr *) xmlRealloc(states->tabState, in xmlRelaxNGAddStatesUniq()
1074 states->tabState = tmp; in xmlRelaxNGAddStatesUniq()
1075 states->maxState = size; in xmlRelaxNGAddStatesUniq()
1077 states->tabState[states->nbState++] = state; in xmlRelaxNGAddStatesUniq()
1093 xmlRelaxNGStatesPtr states, in xmlRelaxNGAddStates() argument
1098 if (state == NULL || states == NULL) { in xmlRelaxNGAddStates()
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math/ode/events/
DCombinedEventsManager.java42 private final List<EventState> states; field in CombinedEventsManager
54 states = new ArrayList<EventState>(); in CombinedEventsManager()
72 states.add(new EventState(handler, maxCheckInterval, in addEventHandler()
84 for (EventState state : states) { in getEventsHandlers()
95 states.clear(); in clearEventsHandlers()
103 return states; in getEventsStates()
110 return states.isEmpty(); in isEmpty()
129 if (states.isEmpty()) { in evaluateStep()
139 for (EventState state : states) { in evaluateStep()
148 for (EventState state : states) { in evaluateStep()
[all …]
/external/deqp/modules/gles31/functional/
Des31fSamplerStateQueryTests.cpp116 } states[] = in init() local
170 for (int stateNdx = 0; stateNdx < DE_LENGTH_OF_ARRAY(states); ++stateNdx) in init()
173 if (!states[stateNdx].newInGLES31) in init()
176 if (isExtendedParamQuery(states[stateNdx].tester)) in init()
181 std::string() + states[stateNdx].name + verifierSuffix, in init()
182 states[stateNdx].desc, in init()
184 states[stateNdx].tester)); in init()
186 else if (isIsVectorQuery(states[stateNdx].tester)) in init()
190 std::string() + states[stateNdx].name + verifierSuffix, in init()
191 states[stateNdx].desc, in init()
[all …]
Des31fTextureStateQueryTests.cpp134 } states[] = in init() local
215 for (int stateNdx = 0; stateNdx < DE_LENGTH_OF_ARRAY(states); ++stateNdx) in init()
217 if (!isLegalTesterForTarget(textureTargets[targetNdx].target, states[stateNdx].tester)) in init()
221 if (!textureTargets[targetNdx].newInGLES31 && !states[stateNdx].newInGLES31) in init()
224 if (isExtendedParamQuery(states[stateNdx].tester)) in init()
229 std::string() + states[stateNdx].name + verifierSuffix, in init()
230 states[stateNdx].desc, in init()
233 states[stateNdx].tester)); in init()
235 else if (isIsVectorQuery(states[stateNdx].tester)) in init()
239 std::string() + states[stateNdx].name + verifierSuffix, in init()
[all …]
/external/icu/icu4c/source/common/
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;
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{$state_dest_state[$state]},";
309 print " $states{$state_push_state[$state]},";
409 print " $states{$state_dest_state[$state]},";
416 print " $states{$state_push_state[$state]},";
/external/icu/icu4c/source/i18n/
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;
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) {
287 print " $states{$state_dest_state[$state]},";
294 print " $states{$state_push_state[$state]},";
/external/bison/src/
Dstate.c44 transitions *res = xmalloc (offsetof (transitions, states) + states_size); in transitions_new()
46 memcpy (res->states, the_states, states_size); in transitions_new()
64 return shifts->states[j]; in transitions_to()
169 transitions_new (s->transitions->num, s->transitions->states); in state_new_isocore()
420 state_record_reachable_states (s->transitions->states[i], reachable); in state_record_reachable_states()
429 state_record_reachable_states (states[0], reachable); in state_remove_unreachable_states()
434 if (bitset_test (reachable, states[i]->number)) in state_remove_unreachable_states()
436 states[nstates_reachable] = states[i]; in state_remove_unreachable_states()
437 states[nstates_reachable]->number = nstates_reachable; in state_remove_unreachable_states()
442 state_free (states[i]); in state_remove_unreachable_states()
[all …]
Dielr.c112 for (rulep = derives[states[to_state[i]]->accessing_symbol in ielr_compute_internal_follow_edges()
203 if (states[i]->nitems > max_nitems) in ielr_compute_follow_kernel_items()
204 max_nitems = states[i]->nitems; in ielr_compute_follow_kernel_items()
211 size_t nitems = states[from_state[i]]->nitems; in ielr_compute_follow_kernel_items()
212 item_number *items = states[from_state[i]]->items; in ielr_compute_follow_kernel_items()
220 == states[to_state[i]]->accessing_symbol in ielr_compute_follow_kernel_items()
261 transitions *trans = states[to_state[i]]->transitions; in ielr_compute_always_follows()
311 for (j = 0; j < states[i]->transitions->num; ++j) in ielr_compute_predecessors()
312 ++predecessor_counts[states[i]->transitions->states[j]->number]; in ielr_compute_predecessors()
323 for (j = 0; j < states[i]->transitions->num; ++j) in ielr_compute_predecessors()
[all …]
Dlalr.c84 transitions *sp = states[s]->transitions; in set_goto_map()
118 transitions *sp = states[s]->transitions; in set_goto_map()
124 to_state[k] = sp->states[i]->number; in set_goto_map()
172 transitions *sp = states[stateno]->transitions; in initialize_F()
230 symbol_number symbol1 = states[to_state[i]]->accessing_symbol; in build_relations()
238 state *s = states[from_state[i]]; in build_relations()
384 state_lookahead_tokens_count (states[i], in initialize_LA()
397 state_lookahead_tokens_count (states[i], in initialize_LA()
401 states[i]->reductions->lookahead_tokens = pLA; in initialize_LA()
420 reductions *reds = states[i]->reductions; in lookahead_tokens_print()
[all …]
Dstate.h114 state *states[1]; member
123 (Transitions->states[Num]->accessing_symbol)
144 (Transitions->states[Num] = NULL)
147 (Transitions->states[Num] == NULL)
269 extern state **states;
/external/aac/libSBRenc/src/
Dresampler.cpp314 FDKmemclear(DownSampler->downFilter.states, sizeof(DownSampler->downFilter.states)); in FDKaacEnc_InitDownsampler()
374 FIXP_BQS (*states)[2] = downFilter->states; in AdvanceFilter() local
393 state1 = states[0][s1]; in AdvanceFilter()
394 state2 = states[0][s2]; in AdvanceFilter()
402 state1b = states[i+1][s1]; in AdvanceFilter()
403 state2b = states[i+1][s2]; in AdvanceFilter()
409 states[i+1][s2] = y<<1; in AdvanceFilter()
411 states[i][s2] = input<<1; in AdvanceFilter()
437 state1 = states[i][s1]; in AdvanceFilter()
438 state2 = states[i][s2]; in AdvanceFilter()
[all …]
/external/deqp/modules/gles3/functional/
Des3fTextureStateQueryTests.cpp90 } states[] = in init() local
119 for (int stateNdx = 0; stateNdx < DE_LENGTH_OF_ARRAY(states); ++stateNdx) in init()
121 if (!isLegalTesterForTarget(textureTargets[targetNdx].target, states[stateNdx].tester)) in init()
126 …std::string() + textureTargets[targetNdx].name + "_" + states[stateNdx].name + getVerifierSuffix(v… in init()
127 states[stateNdx].desc, in init()
130 states[stateNdx].tester))); in init()
Des3fSamplerStateQueryTests.cpp78 } states[] = in init() local
91 for (int stateNdx = 0; stateNdx < DE_LENGTH_OF_ARRAY(states); ++stateNdx) in init()
95 std::string() + states[stateNdx].name + getVerifierSuffix(verifier), in init()
96 states[stateNdx].desc, in init()
98 states[stateNdx].tester))); in init()
/external/icu/icu4c/source/tools/makeconv/
Dmakeconv.c493 staticData->maxBytesPerChar=(int8_t)data->ucm->states.maxCharLength; in readHeader()
494 staticData->minBytesPerChar=(int8_t)data->ucm->states.minCharLength; in readHeader()
495 staticData->conversionType=data->ucm->states.conversionType; in readHeader()
543 if(data->ucm->states.outputType<0) { in readHeader()
544 data->ucm->states.outputType=(int8_t)data->ucm->states.maxCharLength-1; in readHeader()
587 baseStates=&data->ucm->states; in readFile()
638 UCMStates *states, *baseStates; in createConverter() local
652 states=&data->ucm->states; in createConverter()
677 !ucm_checkBaseExt(states, data->ucm->base, data->ucm->ext, data->ucm->ext, FALSE) in createConverter()
747 baseStates=&baseData.ucm->states; in createConverter()
[all …]
Dgenmbcs.cpp197 sum=mbcsData->ucm->states.countToUCodeUnits; in MBCSStartMappings()
215 maxCharLength=mbcsData->ucm->states.maxCharLength; in MBCSStartMappings()
375 if(mbcsData->ucm->states.countStates==0) { in MBCSAddToUnicode()
381 if(length==2 && mbcsData->ucm->states.outputType==MBCS_OUTPUT_2_SISO) { in MBCSAddToUnicode()
391 entry=mbcsData->ucm->states.stateTable[state][bytes[i++]]; in MBCSAddToUnicode()
452 mbcsData->ucm->states.stateTable[state][bytes[i-1]]=entry; in MBCSAddToUnicode()
553 return (UBool)(1==ucm_countChars(&mbcsData->ucm->states, bytes, length)); in MBCSIsValid()
687 maxCharLength=mbcsData->ucm->states.maxCharLength; in MBCSAddFromUnicode()
689 if( mbcsData->ucm->states.outputType==MBCS_OUTPUT_2_SISO && in MBCSAddFromUnicode()
953 maxCharLength=mbcsData->ucm->states.maxCharLength; in MBCSAddTable()
[all …]
/external/jmonkeyengine/engine/src/test/jme3test/input/combomoves/
DComboMove.java67 private List<ComboMoveState> states = new ArrayList<ComboMoveState>(); field in ComboMove
125 states.add(new ComboMoveState(pressed, unpressed, timeElapsed)); in done()
132 return states.get(num); in getState()
136 return states.size(); in getNumStates()
/external/guava/guava/src/com/google/common/util/concurrent/
DServiceManager.java420 final Multiset<State> states = servicesByState.keys(); field in ServiceManager.ServiceManagerState
451 return states.count(RUNNING) == numberOfServices
452 || states.contains(STOPPING)
453 || states.contains(TERMINATED)
454 || states.contains(FAILED);
463 return states.count(TERMINATED) + states.count(FAILED) == numberOfServices;
588 states.size() - states.count(NEW) + states.count(STARTING)); in startupTimes()
661 if (states.count(RUNNING) == numberOfServices) { in transitionService()
665 } else if (states.count(TERMINATED) + states.count(FAILED) == numberOfServices) { in transitionService()
706 if (states.count(RUNNING) != numberOfServices) { in checkHealthy()
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/dot/
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/test/jme3test/app/
DTestIDList.java153 StateCol[] states = new StateCol[20]; in main() local
154 for (int i = 0; i < states.length; i++) in main()
155 states[i] = new StateCol(); in main()
159 for (int i = 0; i < states.length; i++){ in main()
160 setState(states[i]); in main()

1234567891011