| /third_party/flutter/skia/tests/ |
| D | PathOpsCubicLineIntersectionIdeas.cpp | 221 double newT = binary_search(cubic, step, pt, t, &iters); in DEF_TEST() local
222 if (newT >= 0) { in DEF_TEST()
223 diff = fabs(t - newT); in DEF_TEST()
269 double newT = binary_search(cubic, 0.1, pt, t, &iters); in testOneFailure() local
270 return newT; in testOneFailure()
277 double newT = testOneFailure(failure); in DEF_TEST() local
278 SkASSERT_RELEASE(newT >= 0); in DEF_TEST()
285 double newT = testOneFailure(failure); in DEF_TEST() local
286 SkASSERT_RELEASE(newT >= 0); in DEF_TEST()
|
| D | PathOpsTestCommon.cpp | 59 double newT = start + (index / parts) * (end - start); in addTs() local
60 if (newT > 0 && newT < 1) { in addTs()
61 ts->push_back(newT); in addTs()
|
| /third_party/skia/tests/ |
| D | PathOpsCubicLineIntersectionIdeas.cpp | 221 double newT = binary_search(cubic, step, pt, t, &iters); in DEF_TEST() local
222 if (newT >= 0) { in DEF_TEST()
223 diff = fabs(t - newT); in DEF_TEST()
269 double newT = binary_search(cubic, 0.1, pt, t, &iters); in testOneFailure() local
270 return newT; in testOneFailure()
277 double newT = testOneFailure(failure); in DEF_TEST() local
278 SkASSERT_RELEASE(newT >= 0); in DEF_TEST()
285 double newT = testOneFailure(failure); in DEF_TEST() local
286 SkASSERT_RELEASE(newT >= 0); in DEF_TEST()
|
| D | PathOpsTestCommon.cpp | 60 double newT = start + (index / parts) * (end - start); in addTs() local
61 if (newT > 0 && newT < 1) { in addTs()
62 ts->push_back(newT); in addTs()
|
| /third_party/flutter/skia/include/private/ |
| D | SkTArray.h | 184 void* newT = this->push_back_raw(1); in push_back() local
185 return *new (newT) T; in push_back()
192 void* newT = this->push_back_raw(1); in push_back() local
193 return *new (newT) T(t); in push_back()
200 void* newT = this->push_back_raw(1); in push_back() local
201 return *new (newT) T(std::move(t)); in push_back()
208 void* newT = this->push_back_raw(1); in emplace_back() local
209 return *new (newT) T(std::forward<Args>(args)...); in emplace_back()
|
| /third_party/skia/include/private/ |
| D | SkTArray.h | 212 void* newT = this->push_back_raw(1); in push_back() local
213 return *new (newT) T; in push_back()
220 void* newT = this->push_back_raw(1); in push_back() local
221 return *new (newT) T(t); in push_back()
228 void* newT = this->push_back_raw(1); in push_back() local
229 return *new (newT) T(std::move(t)); in push_back()
236 void* newT = this->push_back_raw(1); in emplace_back() local
237 return *new (newT) T(std::forward<Args>(args)...); in emplace_back()
|
| /third_party/typescript/tests/ts_extra_tests/test_ts_cases/2.1/better_inference_for_literal_types/ |
| D | better_inference_for_literal_types_2.ts | 39 let newT: ReturnType<typeof test> = false; variable
40 Assert.isBoolean(newT);
|
| /third_party/skia/src/pathops/ |
| D | SkOpSegment.cpp | 229 bool SkOpSegment::addExpanded(double newT, const SkOpSpanBase* test, bool* startOver) { in addExpanded() argument
230 if (this->contains(newT)) { in addExpanded()
234 FAIL_IF(!between(0, newT, 1)); in addExpanded()
235 SkOpPtT* newPtT = this->addT(newT); in addExpanded()
240 newPtT->fPt = this->ptAtT(newT); in addExpanded()
484 bool SkOpSegment::contains(double newT) const { in contains()
487 if (spanBase->ptT()->contains(this, newT)) { in contains()
|
| D | SkPathOpsCubic.cpp | 356 double newT = binarySearch(min, max, axisIntercept, xAxis); in searchRoots() local
357 if (newT >= 0) { in searchRoots()
361 validRoots[validCount++] = newT; in searchRoots()
|
| D | SkOpSegment.h | 69 bool addExpanded(double newT, const SkOpSpanBase* test, bool* startOver);
|
| /third_party/flutter/skia/src/pathops/ |
| D | SkOpSegment.cpp | 229 bool SkOpSegment::addExpanded(double newT, const SkOpSpanBase* test, bool* startOver) { in addExpanded() argument
230 if (this->contains(newT)) { in addExpanded()
234 FAIL_IF(!between(0, newT, 1)); in addExpanded()
235 SkOpPtT* newPtT = this->addT(newT); in addExpanded()
240 newPtT->fPt = this->ptAtT(newT); in addExpanded()
484 bool SkOpSegment::contains(double newT) const { in contains()
487 if (spanBase->ptT()->contains(this, newT)) { in contains()
|
| D | SkPathOpsCubic.cpp | 354 double newT = binarySearch(min, max, axisIntercept, xAxis); in searchRoots() local
355 if (newT >= 0) { in searchRoots()
359 validRoots[validCount++] = newT; in searchRoots()
|
| D | SkOpSegment.h | 69 bool addExpanded(double newT, const SkOpSpanBase* test, bool* startOver);
|