/external/apache-commons-math/src/main/java/org/apache/commons/math/ode/ |
H A D | MultistepIntegrator.java | 73 private FirstOrderIntegrator starter; field in class:MultistepIntegrator 92 * <p>The default starter integrator is set to the {@link 123 starter = new DormandPrince853Integrator(minStep, maxStep, 139 * <p>The default starter integrator is set to the {@link 162 starter = new DormandPrince853Integrator(minStep, maxStep, 177 * Get the starter integrator. 178 * @return starter integrator 181 return starter; 185 * Set the starter integrator. 186 * <p>The various step and event handlers for this starter integrato [all...] |
/external/harfbuzz_ng/src/ |
H A D | hb-ot-shape-normalize.cc | 375 unsigned int starter = 0; local 382 /* We don't try to compose a non-mark character with it's preceding starter. 388 if (/* If there's anything between the starter and this char, they should have CCC 390 (starter == buffer->out_len - 1 || 394 buffer->out_info[starter].codepoint, 404 buffer->merge_out_clusters (starter, buffer->out_len); 406 /* Modify starter and carry on. */ 407 buffer->out_info[starter].codepoint = composed; 408 buffer->out_info[starter].glyph_index() = glyph; 409 _hb_glyph_info_set_unicode_props (&buffer->out_info[starter], buffe [all...] |
/external/mockito/src/test/java/org/mockito/internal/stubbing/ |
H A D | InvocationContainerImplTest.java | 47 final CountDownLatch starter = new CountDownLatch(200); 52 starter.await(); //NOPMD 68 starter.countDown();
|
/external/jmdns/src/javax/jmdns/impl/ |
H A D | DNSTaskStarter.java | 128 DNSTaskStarter starter = _instances.get(jmDNSImpl); 129 if (starter == null) { 131 starter = _instances.get(jmDNSImpl); 133 return starter;
|
/external/skia/src/pathops/ |
H A D | SkPathOpsSimplify.cpp | 49 } while (!simple->isClosed() && (!unsortable || !start->starter(end)->done())); 51 SkOpSpan* spanStart = start->starter(end); 119 } while (!simple->isClosed() && (!unsortable || !start->starter(end)->done())); 121 SkOpSpan* spanStart = start->starter(end);
|
H A D | SkOpSegment.cpp | 165 FAIL_IF(start->starter(end)->alreadyAdded()); 425 int testWinding = angle->starter()->windSum(); 433 baseAngle = SK_MinS32 != angle->starter()->windSum() ? angle : nullptr; 436 if (baseAngle && SK_MinS32 == firstAngle->starter()->windSum()) { 452 int testWinding = angle->starter()->windSum(); 459 baseAngle = SK_MinS32 != angle->starter()->windSum() ? angle : nullptr; 463 return start->starter(end)->windSum(); 533 SkOpSpan* startSpan = start->starter(end); 551 markDone(start->starter(end)); 557 markDone(start->starter(en [all...] |
H A D | SkPathOpsOp.cpp | 74 if (!first && (sortable || start->starter(end)->windSum() != SK_MinS32)) { 145 } while (!simple->isClosed() && (!unsortable || !start->starter(end)->done())); 147 SkOpSpan* spanStart = start->starter(end);
|
H A D | SkOpAngle.h | 88 SkOpSpan* starter();
|
H A D | SkOpSpan.h | 162 const SkOpPtT* starter(const SkOpPtT* end) const { function in class:SkOpPtT 342 const SkOpSpan* starter(const SkOpSpanBase* end) const { function in class:SkOpSpanBase 347 SkOpSpan* starter(SkOpSpanBase* end) { function in class:SkOpSpanBase 353 SkOpSpan* starter(SkOpSpanBase** endPtr) { function in class:SkOpSpanBase
|
H A D | SkOpCoincidence.cpp | 822 (void) this->addIfMissing(ocs->starter(oce), ics->starter(ice), 833 (void) this->addIfMissing(ocs->starter(oce), ios->starter(ioe), 845 (void) this->addIfMissing(oos->starter(ooe), ics->starter(ice), 859 (void) this->addIfMissing(oos->starter(ooe), ios->starter(ioe), 879 if (!s1->starter(e1)->span()->upCast()->windValue()) { 884 if (!s1->starter(e [all...] |
H A D | SkPathOpsCommon.cpp | 71 SkOpSpan* lesser = startSpan->starter(endSpan); 150 if (!first && (sortable || start->starter(end)->windSum() != SK_MinS32)) {
|
H A D | SkPathOpsDebug.cpp | 1357 const SkOpSpan* minSpan = next->start()->starter(next->end()); 1923 this->debugAddIfMissing(log, ocs->starter(oce), ics->starter(ice), 1934 this->debugAddIfMissing(log, ocs->starter(oce), ios->starter(ioe), 1946 this->debugAddIfMissing(log, oos->starter(ooe), ics->starter(ice), 1960 this->debugAddIfMissing(log, oos->starter(ooe), ios->starter(ioe), 2662 const SkOpPtT* start = base->ptT()->starter(spanEn [all...] |
H A D | SkOpSpan.cpp | 413 const SkOpPtT* start = base->ptT()->starter(spanEnd->ptT());
|
/external/skqp/src/pathops/ |
H A D | SkPathOpsSimplify.cpp | 49 } while (!simple->isClosed() && (!unsortable || !start->starter(end)->done())); 51 SkOpSpan* spanStart = start->starter(end); 119 } while (!simple->isClosed() && (!unsortable || !start->starter(end)->done())); 121 SkOpSpan* spanStart = start->starter(end);
|
H A D | SkOpSegment.cpp | 165 FAIL_IF(start->starter(end)->alreadyAdded()); 425 int testWinding = angle->starter()->windSum(); 433 baseAngle = SK_MinS32 != angle->starter()->windSum() ? angle : nullptr; 436 if (baseAngle && SK_MinS32 == firstAngle->starter()->windSum()) { 452 int testWinding = angle->starter()->windSum(); 459 baseAngle = SK_MinS32 != angle->starter()->windSum() ? angle : nullptr; 463 return start->starter(end)->windSum(); 533 SkOpSpan* startSpan = start->starter(end); 551 markDone(start->starter(end)); 557 markDone(start->starter(en [all...] |
H A D | SkPathOpsOp.cpp | 74 if (!first && (sortable || start->starter(end)->windSum() != SK_MinS32)) { 145 } while (!simple->isClosed() && (!unsortable || !start->starter(end)->done())); 147 SkOpSpan* spanStart = start->starter(end);
|
H A D | SkOpAngle.h | 88 SkOpSpan* starter();
|
H A D | SkOpSpan.h | 162 const SkOpPtT* starter(const SkOpPtT* end) const { function in class:SkOpPtT 342 const SkOpSpan* starter(const SkOpSpanBase* end) const { function in class:SkOpSpanBase 347 SkOpSpan* starter(SkOpSpanBase* end) { function in class:SkOpSpanBase 353 SkOpSpan* starter(SkOpSpanBase** endPtr) { function in class:SkOpSpanBase
|
H A D | SkOpCoincidence.cpp | 822 (void) this->addIfMissing(ocs->starter(oce), ics->starter(ice), 833 (void) this->addIfMissing(ocs->starter(oce), ios->starter(ioe), 845 (void) this->addIfMissing(oos->starter(ooe), ics->starter(ice), 859 (void) this->addIfMissing(oos->starter(ooe), ios->starter(ioe), 879 if (!s1->starter(e1)->span()->upCast()->windValue()) { 884 if (!s1->starter(e [all...] |
H A D | SkPathOpsCommon.cpp | 71 SkOpSpan* lesser = startSpan->starter(endSpan); 150 if (!first && (sortable || start->starter(end)->windSum() != SK_MinS32)) {
|
H A D | SkPathOpsDebug.cpp | 1357 const SkOpSpan* minSpan = next->start()->starter(next->end()); 1923 this->debugAddIfMissing(log, ocs->starter(oce), ics->starter(ice), 1934 this->debugAddIfMissing(log, ocs->starter(oce), ios->starter(ioe), 1946 this->debugAddIfMissing(log, oos->starter(ooe), ics->starter(ice), 1960 this->debugAddIfMissing(log, oos->starter(ooe), ios->starter(ioe), 2662 const SkOpPtT* start = base->ptT()->starter(spanEn [all...] |
/external/icu/android_icu4j/src/main/java/android/icu/impl/ |
H A D | Normalizer2Impl.java | 589 // starter's compositions list, and the other characters in 598 // not a segment starter if it occurs in a decomposition or has cc!=0 1850 * Bit 0 set if the composite is a forward-combining starter 1938 * a composition may contain at most one more code unit than the original starter, 1949 int starter, pRemove; 1956 // Some of the following variables are not used until we have a forward-combining starter 1958 compositionsList=-1; // used as indicator for whether we have a forward-combining starter 1959 starter=-1; 1970 // we have seen a starter that combines forward and 1979 char prev=(char)(sb.charAt(starter) [all...] |
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
H A D | Normalizer2Impl.java | 587 // starter's compositions list, and the other characters in 596 // not a segment starter if it occurs in a decomposition or has cc!=0 1848 * Bit 0 set if the composite is a forward-combining starter 1936 * a composition may contain at most one more code unit than the original starter, 1947 int starter, pRemove; 1954 // Some of the following variables are not used until we have a forward-combining starter 1956 compositionsList=-1; // used as indicator for whether we have a forward-combining starter 1957 starter=-1; 1968 // we have seen a starter that combines forward and 1977 char prev=(char)(sb.charAt(starter) [all...] |
/external/icu/icu4c/source/tools/gennorm2/ |
H A D | n2builder.cpp | 219 return FALSE; // no starter 223 // One-way mapping where after the last starter is at least one combining mark 227 // the starter or composite does not combine-forward with a following combining mark. 230 UChar32 starter=buffer.charAt(lastStarterIndex); local 231 if(lastStarterIndex==0 && norms.combinesBack(starter)) { 232 // The last starter is at the beginning of the mapping and combines backward. 235 if(Hangul::isJamoL(starter) || 236 (Hangul::isJamoV(starter) && 249 starter=c; 254 const Norm *starterNorm=norms.getNorm(starter); [all...] |
/external/icu/icu4c/source/common/ |
H A D | normalizer2impl.cpp | 1010 * Bit 0 set if the composite is a forward-combining starter 1101 * a composition may contain at most one more code unit than the original starter, 1112 UChar *starter, *pRemove, *q, *r; 1119 // Some of the following variables are not used until we have a forward-combining starter 1121 compositionsList=NULL; // used as indicator for whether we have a forward-combining starter 1122 starter=NULL; 1131 // we have seen a starter that combines forward and 1140 UChar prev=(UChar)(*starter-Hangul::JAMO_L_BASE); 1152 *starter=syllable; 1175 // The starter an [all...] |