/external/icu/icu4c/source/tools/toolutil/ |
D | ucmstate.cpp | 188 ucm_addState(UCMStates *states, const char *s) { in ucm_addState() argument 191 if(states->countStates==MBCS_MAX_STATE_COUNT) { in ucm_addState() 196 error=parseState(s, states->stateTable[states->countStates], in ucm_addState() 197 &states->stateFlags[states->countStates]); in ucm_addState() 203 ++states->countStates; in ucm_addState() 209 UCMStates *states; in ucm_parseHeaderLine() local 213 states=&ucm->states; in ucm_parseHeaderLine() 267 states->conversionType=UCNV_DBCS; in ucm_parseHeaderLine() 269 states->conversionType = UCNV_SBCS; in ucm_parseHeaderLine() 271 states->conversionType = UCNV_MBCS; in ucm_parseHeaderLine() [all …]
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/util/ |
D | OpenIntToDoubleHashMap.java | 77 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 …]
|
D | OpenIntToFieldHashMap.java | 83 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/libxml2/ |
D | testAutomata.c | 37 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 …]
|
D | pattern.c | 114 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 …]
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/ode/events/ |
D | CombinedEventsManager.java | 42 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/ |
D | es31fSamplerStateQueryTests.cpp | 116 } 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 …]
|
D | es31fTextureStateQueryTests.cpp | 134 } 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/deqp/android/cts/nyc/src/ |
D | vk-master.txt | 5029 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_never 5030 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_less 5031 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_equal 5032 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_less_or_equal 5033 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_greater 5034 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_not_equal 5035 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_greater_or_equal 5036 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_always 5037 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_zero.comp_never 5038 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_zero.comp_less [all …]
|
/external/deqp/external/vulkancts/mustpass/1.0.0/src/ |
D | master.txt | 7494 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_never 7495 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_less 7496 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_equal 7497 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_less_or_equal 7498 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_greater 7499 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_not_equal 7500 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_greater_or_equal 7501 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_always 7502 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_zero.comp_never 7503 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_zero.comp_less [all …]
|
/external/deqp/external/vulkancts/mustpass/1.0.0/ |
D | vk-default.txt | 7494 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_never 7495 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_less 7496 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_equal 7497 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_less_or_equal 7498 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_greater 7499 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_not_equal 7500 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_greater_or_equal 7501 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_always 7502 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_zero.comp_never 7503 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_zero.comp_less [all …]
|
/external/deqp/android/cts/nyc/ |
D | vk-master.txt | 7501 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_never 7502 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_less 7503 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_equal 7504 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_less_or_equal 7505 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_greater 7506 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_not_equal 7507 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_greater_or_equal 7508 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_keep.comp_always 7509 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_zero.comp_never 7510 dEQP-VK.pipeline.stencil.format.s8_uint.states.fail_keep.pass_keep.dfail_zero.comp_less [all …]
|
/external/tensorflow/tensorflow/python/keras/layers/ |
D | convolutional_recurrent.py | 181 self.states = None 356 initial_state = self.states 363 if len(initial_state) != len(self.states): 364 raise ValueError('Layer has ' + str(len(self.states)) + 378 def step(inputs, states): argument 379 constants = states[-self._num_constants:] 380 states = states[:-self._num_constants] 381 return self.cell.call(inputs, states, constants=constants, 384 def step(inputs, states): argument 385 return self.cell.call(inputs, states, **kwargs) [all …]
|
D | recurrent.py | 117 def call(self, inputs, states, constants=None, **kwargs): argument 121 nested_states = nest.pack_sequence_as(state_size, nest.flatten(states)) 125 for cell, states in zip(self.cells, nested_states): 126 states = states if nest.is_sequence(states) else [states] 129 states = states[0] if len(states) == 1 and is_tf_rnn_cell else states 131 inputs, states = cell.call(inputs, states, constants=constants, 134 inputs, states = cell.call(inputs, states, **kwargs) 135 new_nested_states.append(states) 414 def states(self): member in RNN 420 @states.setter [all …]
|
/external/icu/icu4c/source/common/ |
D | rbbicst.pl | 33 $states{"pop"} = 255; # Add the "pop" to the list of defined state names. 66 if ($states{$state_name} != 0) { 69 $states{$state_name} = $num_states; 191 $states{"exit"} = 0; # Predefined state name, terminates state machine. 193 if ($states{$state_dest_state[$state]} == 0 && $state_dest_state[$state] ne "exit") { 197 if ($state_push_state[$state] ne "" && $states{$state_push_state[$state]} == 0) { 306 print " $states{$state_dest_state[$state]},"; 313 print " $states{$state_push_state[$state]},"; 415 print " $states{$state_dest_state[$state]},"; 422 print " $states{$state_push_state[$state]},";
|
/external/icu/icu4c/source/i18n/ |
D | regexcst.pl | 32 $states{"pop"} = 255; # Add the "pop" to the list of defined state names. 65 if ($states{$state_name} != 0) { 68 $states{$state_name} = $num_states; 190 $states{"exit"} = 0; # Predefined state name, terminates state machine. 192 if ($states{$state_dest_state[$state]} == 0 && $state_dest_state[$state] ne "exit") { 196 if ($state_push_state[$state] ne "" && $states{$state_push_state[$state]} == 0) { 291 print " $states{$state_dest_state[$state]},"; 298 print " $states{$state_push_state[$state]},";
|
/external/deqp/modules/gles3/functional/ |
D | es3fTextureStateQueryTests.cpp | 90 } 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()
|
D | es3fSamplerStateQueryTests.cpp | 78 } 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/snakeyaml/src/main/java/org/yaml/snakeyaml/parser/ |
D | ParserImpl.java | 125 private final ArrayStack<Production> states; field in ParserImpl 138 states = new ArrayStack<Production>(100); in ParserImpl() 201 states.push(new ParseDocumentEnd()); in produce() 231 states.push(new ParseDocumentEnd()); in produce() 237 if (!states.isEmpty()) { in produce() 238 throw new YAMLException("Unexpected end of stream. States left: " + states); in produce() 274 state = states.pop(); in produce() 378 state = states.pop(); in parseNode() 444 state = states.pop(); in parseNode() 470 state = states.pop(); in parseNode() [all …]
|
/external/python/cpython2/Demo/tkinter/ttk/ |
D | widget_state.py | 4 states = ['active', 'disabled', 'focus', 'pressed', 'selected', variable 7 for state in states[:]: 8 states.append("!" + state) 11 nostate = states[len(states) // 2:] 50 goodstates = [state for state in newstates if state in states]
|
/external/icu/icu4c/source/tools/makeconv/ |
D | makeconv.cpp | 487 staticData->maxBytesPerChar=(int8_t)data->ucm->states.maxCharLength; in readHeader() 488 staticData->minBytesPerChar=(int8_t)data->ucm->states.minCharLength; in readHeader() 489 staticData->conversionType=data->ucm->states.conversionType; in readHeader() 537 if(data->ucm->states.outputType<0) { in readHeader() 538 data->ucm->states.outputType=(int8_t)data->ucm->states.maxCharLength-1; in readHeader() 581 baseStates=&data->ucm->states; in readFile() 632 UCMStates *states, *baseStates; in createConverter() local 646 states=&data->ucm->states; in createConverter() 671 !ucm_checkBaseExt(states, data->ucm->base, data->ucm->ext, data->ucm->ext, FALSE) in createConverter() 741 baseStates=&baseData.ucm->states; in createConverter() [all …]
|
/external/mesa3d/src/intel/vulkan/tests/ |
D | state_pool_test_helper.h | 41 struct anv_state states[chunk_size]; in alloc_states() local 47 states[i] = anv_state_pool_alloc(job->pool, 16, 16); in alloc_states() 48 memset(states[i].map, 139, 16); in alloc_states() 49 assert(states[i].offset != 0); in alloc_states() 53 anv_state_pool_free(job->pool, states[i]); in alloc_states()
|
/external/aac/libSBRenc/src/ |
D | resampler.cpp | 301 FDKmemclear(DownSampler->downFilter.states, in FDKaacEnc_InitDownsampler() 302 sizeof(DownSampler->downFilter.states)); in FDKaacEnc_InitDownsampler() 354 FIXP_BQS(*states)[2] = downFilter->states; in AdvanceFilter() local 371 state1 = states[0][s1]; in AdvanceFilter() 372 state2 = states[0][s2]; in AdvanceFilter() 379 state1b = states[i + 1][s1]; in AdvanceFilter() 380 state2b = states[i + 1][s2]; in AdvanceFilter() 386 states[i + 1][s2] = y << 1; in AdvanceFilter() 388 states[i][s2] = input << 1; in AdvanceFilter()
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
D | RBBITableBuilder.java | 895 boolean findDuplicateState(RBBIRuleBuilder.IntPair states) { 899 for (; states.first<numStates-1; ++states.first) { 900 RBBIStateDescriptor firstSD = fDStates.get(states.first); 901 for (states.second=states.first+1; states.second<numStates; ++states.second) { 902 RBBIStateDescriptor duplSD = fDStates.get(states.second); 913 ((firstVal == states.first || firstVal == states.second) && 914 (duplVal == states.first || duplVal == states.second)))) { 934 boolean findDuplicateSafeState(RBBIRuleBuilder.IntPair states) { 937 for (; states.first<numStates-1; ++states.first) { 938 short[] firstRow = fSafeTable.get(states.first); [all …]
|
/external/icu/android_icu4j/src/main/java/android/icu/text/ |
D | RBBITableBuilder.java | 896 boolean findDuplicateState(RBBIRuleBuilder.IntPair states) { 900 for (; states.first<numStates-1; ++states.first) { 901 RBBIStateDescriptor firstSD = fDStates.get(states.first); 902 for (states.second=states.first+1; states.second<numStates; ++states.second) { 903 RBBIStateDescriptor duplSD = fDStates.get(states.second); 914 ((firstVal == states.first || firstVal == states.second) && 915 (duplVal == states.first || duplVal == states.second)))) { 935 boolean findDuplicateSafeState(RBBIRuleBuilder.IntPair states) { 938 for (; states.first<numStates-1; ++states.first) { 939 short[] firstRow = fSafeTable.get(states.first); [all …]
|