| /external/skia/include/private/ |
| H A D | SkTArray.h | 179 void* newT = this->push_back_raw(1); local
180 return *new (newT) T;
187 void* newT = this->push_back_raw(1); local
188 return *new (newT) T(t);
195 void* newT = this->push_back_raw(1); local
196 return *new (newT) T(std::move(t));
203 void* newT = this->push_back_raw(1); local
204 return *new (newT) T(std::forward<Args>(args)...);
|
| /external/skia/tests/ |
| H A D | PathOpsCubicLineIntersectionIdeas.cpp | 221 double newT = binary_search(cubic, step, pt, t, &iters); local
222 if (newT >= 0) {
223 diff = fabs(t - newT);
269 double newT = binary_search(cubic, 0.1, pt, t, &iters);
270 return newT;
277 double newT = testOneFailure(failure);
278 SkASSERT_RELEASE(newT >= 0);
285 double newT = testOneFailure(failure);
286 SkASSERT_RELEASE(newT >= 0);
|
| H A D | PathOpsTestCommon.cpp | 56 double newT = start + (index / parts) * (end - start); local
57 if (newT > 0 && newT < 1) {
58 ts->push_back(newT);
|
| /external/skqp/include/private/ |
| H A D | SkTArray.h | 179 void* newT = this->push_back_raw(1); local
180 return *new (newT) T;
187 void* newT = this->push_back_raw(1); local
188 return *new (newT) T(t);
195 void* newT = this->push_back_raw(1); local
196 return *new (newT) T(std::move(t));
203 void* newT = this->push_back_raw(1); local
204 return *new (newT) T(std::forward<Args>(args)...);
|
| /external/skqp/tests/ |
| H A D | PathOpsCubicLineIntersectionIdeas.cpp | 221 double newT = binary_search(cubic, step, pt, t, &iters); local
222 if (newT >= 0) {
223 diff = fabs(t - newT);
269 double newT = binary_search(cubic, 0.1, pt, t, &iters);
270 return newT;
277 double newT = testOneFailure(failure);
278 SkASSERT_RELEASE(newT >= 0);
285 double newT = testOneFailure(failure);
286 SkASSERT_RELEASE(newT >= 0);
|
| H A D | PathOpsTestCommon.cpp | 56 double newT = start + (index / parts) * (end - start); local
57 if (newT > 0 && newT < 1) {
58 ts->push_back(newT);
|
| /external/skia/tools/ |
| H A D | sk_tool_utils.cpp | 272 SkScalar newL = r.fLeft, newT = r.fTop, newR = r.fRight, newB = r.fBottom; local
279 newT = SkTMax(newT, r.fTop + radii.fY - p.fY);
287 newT = SkTMax(newT, r.fTop + radii.fY - p.fY);
306 return SkRect::MakeLTRB(newL, newT, newR, newB);
|
| /external/skqp/tools/ |
| H A D | sk_tool_utils.cpp | 332 SkScalar newL = r.fLeft, newT = r.fTop, newR = r.fRight, newB = r.fBottom; local
339 newT = SkTMax(newT, r.fTop + radii.fY - p.fY);
347 newT = SkTMax(newT, r.fTop + radii.fY - p.fY);
366 return SkRect::MakeLTRB(newL, newT, newR, newB);
|
| /external/skia/src/pathops/ |
| H A D | SkOpSegment.cpp | 224 bool SkOpSegment::addExpanded(double newT, const SkOpSpanBase* test, bool* startOver) { argument
225 if (this->contains(newT)) {
229 FAIL_IF(!between(0, newT, 1));
230 SkOpPtT* newPtT = this->addT(newT);
235 newPtT->fPt = this->ptAtT(newT);
466 bool SkOpSegment::contains(double newT) const {
469 if (spanBase->ptT()->contains(this, newT)) {
|
| /external/skqp/src/pathops/ |
| H A D | SkOpSegment.cpp | 224 bool SkOpSegment::addExpanded(double newT, const SkOpSpanBase* test, bool* startOver) { argument
225 if (this->contains(newT)) {
229 FAIL_IF(!between(0, newT, 1));
230 SkOpPtT* newPtT = this->addT(newT);
235 newPtT->fPt = this->ptAtT(newT);
466 bool SkOpSegment::contains(double newT) const {
469 if (spanBase->ptT()->contains(this, newT)) {
|
| /external/clang/lib/Sema/ |
| H A D | SemaDeclObjC.cpp | 622 ObjCObjectPointerTypeLoc newT local
624 newT.setStarLoc(starLoc);
|
| /external/annotation-tools/annotation-file-utilities/ |
| H A D | annotation-file-utilities.jar | META-INF/ META-INF/MANIFEST.MF annotations/ annotations/el/ annotations/field/ annotations/io/ annotations/io/classfile/ ... |