/external/apache-commons-math/src/main/java/org/apache/commons/math/ode/ |
D | MultistepIntegrator.java | 73 private FirstOrderIntegrator starter; field in MultistepIntegrator 123 starter = new DormandPrince853Integrator(minStep, maxStep, in MultistepIntegrator() 162 starter = new DormandPrince853Integrator(minStep, maxStep, in MultistepIntegrator() 181 return starter; in getStarterIntegrator() 192 this.starter = starterIntegrator; in setStarterIntegrator() 218 starter.clearEventHandlers(); in start() 219 starter.clearStepHandlers(); in start() 222 starter.addStepHandler(new NordsieckInitializer(y0.length)); in start() 226 starter.integrate(new CountingDifferentialEquations(y0.length), in start() 236 starter.clearStepHandlers(); in start()
|
/external/libcap/psx/ |
D | psx.c | 433 psx_starter_t *starter = data; in _psx_start_fn() local 434 pthread_sigmask(SIG_SETMASK, &starter->sigbits, NULL); in _psx_start_fn() 435 void *(*fn)(void *) = starter->fn; in _psx_start_fn() 436 void *arg = starter->arg; in _psx_start_fn() 438 memset(data, 0, sizeof(*starter)); in _psx_start_fn() 456 psx_starter_t *starter = calloc(1, sizeof(psx_starter_t)); in __wrap_pthread_create() local 457 starter->fn = start_routine; in __wrap_pthread_create() 458 starter->arg = arg; in __wrap_pthread_create() 467 pthread_sigmask(SIG_UNBLOCK, &sigbit, &starter->sigbits); in __wrap_pthread_create() 480 int ret = __real_pthread_create(thread, attr, _psx_start_fn, starter); in __wrap_pthread_create() [all …]
|
/external/harfbuzz_ng/src/ |
D | hb-ot-shape-normalize.cc | 429 unsigned int starter = 0; in _hb_ot_shape_normalize() local 442 (starter == buffer->out_len - 1 || in _hb_ot_shape_normalize() 446 buffer->out_info[starter].codepoint, in _hb_ot_shape_normalize() 456 buffer->merge_out_clusters (starter, buffer->out_len); in _hb_ot_shape_normalize() 459 buffer->out_info[starter].codepoint = composed; in _hb_ot_shape_normalize() 460 buffer->out_info[starter].glyph_index() = glyph; in _hb_ot_shape_normalize() 461 _hb_glyph_info_set_unicode_props (&buffer->out_info[starter], buffer); in _hb_ot_shape_normalize() 471 starter = buffer->out_len - 1; in _hb_ot_shape_normalize()
|
/external/mockito/src/test/java/org/mockito/internal/stubbing/ |
D | InvocationContainerImplTest.java | 48 final CountDownLatch starter = new CountDownLatch(200); in doShouldBeThreadSafe() local 53 starter.await(); //NOPMD in doShouldBeThreadSafe() 69 starter.countDown(); in doShouldBeThreadSafe()
|
/external/skia/src/pathops/ |
D | SkOpSegment.cpp | 168 const SkOpSpan* spanStart = start->starter(end); in addCurveTo() 443 int testWinding = angle->starter()->windSum(); in computeSum() 451 baseAngle = SK_MinS32 != angle->starter()->windSum() ? angle : nullptr; in computeSum() 454 if (baseAngle && SK_MinS32 == firstAngle->starter()->windSum()) { in computeSum() 470 int testWinding = angle->starter()->windSum(); in computeSum() 477 baseAngle = SK_MinS32 != angle->starter()->windSum() ? angle : nullptr; in computeSum() 481 return start->starter(end)->windSum(); in computeSum() 552 SkOpSpan* startSpan = start->starter(end); in findNextOp() 570 markDone(start->starter(end)); in findNextOp() 576 markDone(start->starter(end)); in findNextOp() [all …]
|
D | SkPathOpsSimplify.cpp | 49 } while (!writer->isClosed() && (!unsortable || !start->starter(end)->done())); in bridgeWinding() 51 SkOpSpan* spanStart = start->starter(end); in bridgeWinding() 126 } while (!writer->isClosed() && (!unsortable || !start->starter(end)->done())); in bridgeXor() 128 SkOpSpan* spanStart = start->starter(end); in bridgeXor()
|
D | SkOpCoincidence.cpp | 843 FAIL_IF(!this->addIfMissing(ocs->starter(oce), ics->starter(ice), in addMissing() 854 FAIL_IF(!this->addIfMissing(ocs->starter(oce), ios->starter(ioe), in addMissing() 866 FAIL_IF(!this->addIfMissing(oos->starter(ooe), ics->starter(ice), in addMissing() 880 FAIL_IF(!this->addIfMissing(oos->starter(ooe), ios->starter(ioe), in addMissing() 900 if (!s1->starter(e1)->span()->upCast()->windValue()) { in addOverlap() 905 if (!s1->starter(e1)->span()->upCast()->windValue()) { in addOverlap() 913 if (!s2->starter(e2)->span()->upCast()->windValue()) { in addOverlap() 918 if (!s2->starter(e2)->span()->upCast()->windValue()) { in addOverlap() 1032 FAIL_IF(start != start->starter(end)); in apply() 1042 SkASSERT(oStart == oStart->starter(oEnd)); in apply()
|
D | SkOpSpan.h | 162 const SkOpPtT* starter(const SkOpPtT* end) const { in starter() function 347 const SkOpSpan* starter(const SkOpSpanBase* end) const { in starter() function 352 SkOpSpan* starter(SkOpSpanBase* end) { in starter() function 358 SkOpSpan* starter(SkOpSpanBase** endPtr) { in starter() function
|
D | SkPathOpsOp.cpp | 81 if (!first && (sortable || start->starter(end)->windSum() != SK_MinS32)) { in findChaseOp() 163 } while (!writer->isClosed() && (!unsortable || !start->starter(end)->done())); in bridgeOp() 165 SkOpSpan* spanStart = start->starter(end); in bridgeOp()
|
D | SkPathOpsCommon.cpp | 51 SkOpSpan* lesser = startSpan->starter(endSpan); in AngleWinding() 130 if (!first && (sortable || start->starter(end)->windSum() != SK_MinS32)) { in FindChase()
|
D | SkOpAngle.h | 88 SkOpSpan* starter();
|
/external/skqp/src/pathops/ |
D | SkOpSegment.cpp | 168 const SkOpSpan* spanStart = start->starter(end); in addCurveTo() 443 int testWinding = angle->starter()->windSum(); in computeSum() 451 baseAngle = SK_MinS32 != angle->starter()->windSum() ? angle : nullptr; in computeSum() 454 if (baseAngle && SK_MinS32 == firstAngle->starter()->windSum()) { in computeSum() 470 int testWinding = angle->starter()->windSum(); in computeSum() 477 baseAngle = SK_MinS32 != angle->starter()->windSum() ? angle : nullptr; in computeSum() 481 return start->starter(end)->windSum(); in computeSum() 552 SkOpSpan* startSpan = start->starter(end); in findNextOp() 570 markDone(start->starter(end)); in findNextOp() 576 markDone(start->starter(end)); in findNextOp() [all …]
|
D | SkPathOpsSimplify.cpp | 49 } while (!writer->isClosed() && (!unsortable || !start->starter(end)->done())); in bridgeWinding() 51 SkOpSpan* spanStart = start->starter(end); in bridgeWinding() 126 } while (!writer->isClosed() && (!unsortable || !start->starter(end)->done())); in bridgeXor() 128 SkOpSpan* spanStart = start->starter(end); in bridgeXor()
|
D | SkOpCoincidence.cpp | 843 FAIL_IF(!this->addIfMissing(ocs->starter(oce), ics->starter(ice), in addMissing() 854 FAIL_IF(!this->addIfMissing(ocs->starter(oce), ios->starter(ioe), in addMissing() 866 FAIL_IF(!this->addIfMissing(oos->starter(ooe), ics->starter(ice), in addMissing() 880 FAIL_IF(!this->addIfMissing(oos->starter(ooe), ios->starter(ioe), in addMissing() 900 if (!s1->starter(e1)->span()->upCast()->windValue()) { in addOverlap() 905 if (!s1->starter(e1)->span()->upCast()->windValue()) { in addOverlap() 913 if (!s2->starter(e2)->span()->upCast()->windValue()) { in addOverlap() 918 if (!s2->starter(e2)->span()->upCast()->windValue()) { in addOverlap() 1032 FAIL_IF(start != start->starter(end)); in apply() 1042 SkASSERT(oStart == oStart->starter(oEnd)); in apply()
|
D | SkOpSpan.h | 162 const SkOpPtT* starter(const SkOpPtT* end) const { in starter() function 347 const SkOpSpan* starter(const SkOpSpanBase* end) const { in starter() function 352 SkOpSpan* starter(SkOpSpanBase* end) { in starter() function 358 SkOpSpan* starter(SkOpSpanBase** endPtr) { in starter() function
|
D | SkPathOpsOp.cpp | 81 if (!first && (sortable || start->starter(end)->windSum() != SK_MinS32)) { in findChaseOp() 163 } while (!writer->isClosed() && (!unsortable || !start->starter(end)->done())); in bridgeOp() 165 SkOpSpan* spanStart = start->starter(end); in bridgeOp()
|
D | SkPathOpsCommon.cpp | 51 SkOpSpan* lesser = startSpan->starter(endSpan); in AngleWinding() 130 if (!first && (sortable || start->starter(end)->windSum() != SK_MinS32)) { in FindChase()
|
D | SkOpAngle.h | 88 SkOpSpan* starter();
|
/external/kotlinx.coroutines/kotlinx-coroutines-core/jvm/test/ |
D | JobActivationStressTest.kt | 54 val starter = scope.launch { in <lambda>() constant 59 joinAll(d, canceller, starter) in <lambda>()
|
/external/icu/android_icu4j/src/main/java/android/icu/impl/ |
D | Normalizer2Impl.java | 1967 int starter, pRemove; in recompose() local 1977 starter=-1; in recompose() 1997 char prev=(char)(sb.charAt(starter)-Hangul.JAMO_L_BASE); in recompose() 2009 sb.setCharAt(starter, syllable); in recompose() 2038 sb.setCharAt(starter, UTF16.getLeadSurrogate(composite)); in recompose() 2039 sb.setCharAt(starter+1, UTF16.getTrailSurrogate(composite)); in recompose() 2041 sb.setCharAt(starter, (char)c); in recompose() 2042 sb.deleteCharAt(starter+1); in recompose() 2052 sb.setCharAt(starter, UTF16.getLeadSurrogate(composite)); in recompose() 2053 sb.insert(starter+1, UTF16.getTrailSurrogate(composite)); in recompose() [all …]
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
D | Normalizer2Impl.java | 1958 int starter, pRemove; in recompose() local 1968 starter=-1; in recompose() 1988 char prev=(char)(sb.charAt(starter)-Hangul.JAMO_L_BASE); in recompose() 2000 sb.setCharAt(starter, syllable); in recompose() 2029 sb.setCharAt(starter, UTF16.getLeadSurrogate(composite)); in recompose() 2030 sb.setCharAt(starter+1, UTF16.getTrailSurrogate(composite)); in recompose() 2032 sb.setCharAt(starter, (char)c); in recompose() 2033 sb.deleteCharAt(starter+1); in recompose() 2043 sb.setCharAt(starter, UTF16.getLeadSurrogate(composite)); in recompose() 2044 sb.insert(starter+1, UTF16.getTrailSurrogate(composite)); in recompose() [all …]
|
/external/icu/icu4c/source/tools/gennorm2/ |
D | n2builder.cpp | 231 UChar32 starter=buffer.charAt(lastStarterIndex); in mappingHasCompBoundaryAfter() local 232 if(lastStarterIndex==0 && norms.combinesBack(starter)) { in mappingHasCompBoundaryAfter() 236 if(Hangul::isJamoL(starter) || in mappingHasCompBoundaryAfter() 237 (Hangul::isJamoV(starter) && in mappingHasCompBoundaryAfter() 250 starter=c; in mappingHasCompBoundaryAfter() 255 const Norm *starterNorm=norms.getNorm(starter); in mappingHasCompBoundaryAfter() 269 norms.getNormRef(c).combinesBack && (starter=starterNorm->combine(c))>=0) { in mappingHasCompBoundaryAfter() 271 starterNorm=norms.getNorm(starter); in mappingHasCompBoundaryAfter()
|
/external/icu/icu4c/source/common/ |
D | normalizer2impl.cpp | 1093 UChar *starter, *pRemove, *q, *r; in recompose() local 1103 starter=NULL; in recompose() 1121 UChar prev=(UChar)(*starter-Hangul::JAMO_L_BASE); in recompose() 1133 *starter=syllable; in recompose() 1164 starter[0]=U16_LEAD(composite); in recompose() 1165 starter[1]=U16_TRAIL(composite); in recompose() 1167 *starter=(UChar)composite; in recompose() 1171 q=starter+1; in recompose() 1182 ++starter; // temporarily increment for the loop boundary in recompose() 1185 while(starter<q) { in recompose() [all …]
|
/external/tensorflow/tensorflow/lite/g3doc/models/text_classification/ |
D | overview.md | 26 the TensorFlow Lite APIs, you can download our starter text classification 30 starter model</a>
|
/external/tensorflow/tensorflow/lite/g3doc/models/recommendation/ |
D | overview.md | 20 the TensorFlow Lite APIs, you can download our starter recommendation model. 23 starter model</a>
|