| /external/skia/tests/ |
| D | PathOpsCubicLineIntersectionIdeas.cpp | 219 double newT = binary_search(cubic, step, pt, t, &iters); in DEF_TEST() local
265 double newT = binary_search(cubic, 0.1, pt, t, &iters); in testOneFailure() local
273 double newT = testOneFailure(failure); in DEF_TEST() local
281 double newT = testOneFailure(failure); in DEF_TEST() local
|
| /external/chromium_org/third_party/skia/tests/ |
| D | PathOpsCubicLineIntersectionIdeas.cpp | 219 double newT = binary_search(cubic, step, pt, t, &iters); in DEF_TEST() local
265 double newT = binary_search(cubic, 0.1, pt, t, &iters); in testOneFailure() local
273 double newT = testOneFailure(failure); in DEF_TEST() local
281 double newT = testOneFailure(failure); in DEF_TEST() local
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| D | SkIntersectionHelper.h | 45 int addT(const SkIntersectionHelper& other, const SkPoint& pt, double newT) { in addT()
49 int addSelfT(const SkPoint& pt, double newT) { in addSelfT()
|
| D | SkOpContour.h | 80 int addT(int segIndex, SkOpContour* other, int otherIndex, const SkPoint& pt, double newT) { in addT()
85 int addSelfT(int segIndex, const SkPoint& pt, double newT) { in addSelfT()
|
| D | SkDCubicToQuads.cpp | 107 double newT = start + (index / parts) * (end - start); in addTs() local
|
| D | SkPathOpsCubic.cpp | 158 double newT = binarySearch(min, max, axisIntercept, xAxis); in searchRoots() local
|
| D | SkOpSegment.cpp | 552 int SkOpSegment::addT(SkOpSegment* other, const SkPoint& pt, double newT) { in addT()
812 int SkOpSegment::addSelfT(const SkPoint& pt, double newT) { in addSelfT()
973 void SkOpSegment::alignSpan(const SkPoint& newPt, double newT, const SkOpSegment* other, in alignSpan()
|
| /external/skia/src/pathops/ |
| D | SkIntersectionHelper.h | 45 int addT(const SkIntersectionHelper& other, const SkPoint& pt, double newT) { in addT()
49 int addSelfT(const SkPoint& pt, double newT) { in addSelfT()
|
| D | SkOpContour.h | 80 int addT(int segIndex, SkOpContour* other, int otherIndex, const SkPoint& pt, double newT) { in addT()
85 int addSelfT(int segIndex, const SkPoint& pt, double newT) { in addSelfT()
|
| D | SkDCubicToQuads.cpp | 107 double newT = start + (index / parts) * (end - start); in addTs() local
|
| D | SkPathOpsCubic.cpp | 158 double newT = binarySearch(min, max, axisIntercept, xAxis); in searchRoots() local
|
| D | SkOpSegment.cpp | 548 int SkOpSegment::addT(SkOpSegment* other, const SkPoint& pt, double newT) { in addT()
804 int SkOpSegment::addSelfT(const SkPoint& pt, double newT) { in addSelfT()
940 void SkOpSegment::alignSpan(const SkPoint& newPt, double newT, const SkOpSegment* other, in alignSpan()
|
| /external/chromium_org/third_party/skia/include/core/ |
| D | SkTArray.h | 181 T* newT = reinterpret_cast<T*>(this->push_back_raw(1)); in push_back() local
190 T* newT = reinterpret_cast<T*>(this->push_back_raw(1)); in push_back() local
|
| /external/skia/include/core/ |
| D | SkTArray.h | 181 T* newT = reinterpret_cast<T*>(this->push_back_raw(1)); in push_back() local
190 T* newT = reinterpret_cast<T*>(this->push_back_raw(1)); in push_back() local
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| D | CubicToQuadratics.cpp | 133 double newT = start + (index / parts) * (end - start); in addTs() local
|
| D | Simplify.cpp | 1673 int addT(Segment* other, const SkPoint& pt, double& newT) { in addT()
1910 int addSelfT(Segment* other, const SkPoint& pt, double& newT) { in addSelfT()
1917 int addUnsortableT(Segment* other, bool start, const SkPoint& pt, double& newT) { in addUnsortableT()
4556 int addT(int segIndex, Contour* other, int otherIndex, const SkPoint& pt, double& newT) { in addT()
4561 int addSelfT(int segIndex, Contour* other, int otherIndex, const SkPoint& pt, double& newT) { in addSelfT()
4567 const SkPoint& pt, double& newT) { in addUnsortableT()
5254 int addT(const Work& other, const SkPoint& pt, double& newT) { in addT()
5258 int addSelfT(const Work& other, const SkPoint& pt, double& newT) { in addSelfT()
5262 int addUnsortableT(const Work& other, bool start, const SkPoint& pt, double& newT) { in addUnsortableT()
|
| /external/skia/experimental/Intersection/ |
| D | CubicToQuadratics.cpp | 133 double newT = start + (index / parts) * (end - start); in addTs() local
|
| D | Simplify.cpp | 1673 int addT(Segment* other, const SkPoint& pt, double& newT) { in addT()
1910 int addSelfT(Segment* other, const SkPoint& pt, double& newT) { in addSelfT()
1917 int addUnsortableT(Segment* other, bool start, const SkPoint& pt, double& newT) { in addUnsortableT()
4556 int addT(int segIndex, Contour* other, int otherIndex, const SkPoint& pt, double& newT) { in addT()
4561 int addSelfT(int segIndex, Contour* other, int otherIndex, const SkPoint& pt, double& newT) { in addSelfT()
4567 const SkPoint& pt, double& newT) { in addUnsortableT()
5254 int addT(const Work& other, const SkPoint& pt, double& newT) { in addT()
5258 int addSelfT(const Work& other, const SkPoint& pt, double& newT) { in addSelfT()
5262 int addUnsortableT(const Work& other, bool start, const SkPoint& pt, double& newT) { in addUnsortableT()
|