| /external/skia/gm/ |
| degeneratesegments.cpp | 36 static SkPoint AddMove(SkPath& path, SkPoint& startPt) {
37 SkPoint moveToPt = startPt + SkPoint::Make(0, 10*SK_Scalar1);
42 static SkPoint AddMoveClose(SkPath& path, SkPoint& startPt) {
43 SkPoint moveToPt = startPt + SkPoint::Make(0, 10*SK_Scalar1);
49 static SkPoint AddDegenLine(SkPath& path, SkPoint& startPt) {
50 path.lineTo(startPt);
51 return startPt;
54 static SkPoint AddMoveDegenLine(SkPath& path, SkPoint& startPt) {
55 SkPoint moveToPt = startPt + SkPoint::Make(0, 10*SK_Scalar1);
61 static SkPoint AddMoveDegenLineClose(SkPath& path, SkPoint& startPt) {
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkOpContour.cpp | 98 const SkPoint& startPt = coincidence.fPts[startSwapped];
100 || thisOne.isMissing(startT, startPt) || other.isMissing(oEndT, startPt)) {
101 thisOne.addTPair(startT, &other, oEndT, true, startPt);
109 const SkPoint& startPt = coincidence.fPts[startSwapped];
111 || thisOne.isMissing(startT, startPt) || other.isMissing(oStartT, startPt)) {
112 thisOne.addTPair(startT, &other, oStartT, true, startPt);
245 const SkPoint* startPt = &coincidence.fPts[0];
250 SkTSwap<const SkPoint*>(startPt, endPt)
[all...] |
| SkOpSegment.h | 245 void addTCancel(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
246 void addTCoincident(const SkPoint& startPt, const SkPoint& endPt, double endT,
258 int step, SkPoint* startPt, SkPoint* endPt, double* endT) const;
342 void addCancelOutsides(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
343 void addCoinOutsides(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
391 const SkPoint& startPt);
392 static void TrackOutside(SkTArray<SkPoint, true>* outsideTs, const SkPoint& startPt);
|
| SkIntersections.cpp | 156 void SkIntersections::remove(double one, double two, const SkDPoint& startPt,
160 || startPt.approximatelyEqual(fPt[index])
|
| SkOpSegment.cpp | 215 void SkOpSegment::addCancelOutsides(const SkPoint& startPt, const SkPoint& endPt,
223 } while (startPt != fTs[tIndex].fPt && tIndex < tCount);
232 SkASSERT(fTs[tIndex].fT < 1 || startPt != *nextPt);
233 } while (startPt == *nextPt);
292 void SkOpSegment::addCoinOutsides(const SkPoint& startPt, const SkPoint& endPt,
294 // walk this to startPt
295 // walk other to startPt
301 } while (startPt != fTs[tIndex].fPt);
304 } while (startPt != other->fTs[oIndex].fPt);
306 addTPair(fTs[tIndex].fT, other, other->fTs[oIndex].fT, false, startPt);
[all...] |
| SkIntersections.h | 270 // void remove(double one, double two, const SkDPoint& startPt, const SkDPoint& endPt);
|
| /external/skia/src/pathops/ |
| SkOpContour.cpp | 98 const SkPoint& startPt = coincidence.fPts[startSwapped];
100 || thisOne.isMissing(startT, startPt) || other.isMissing(oEndT, startPt)) {
101 thisOne.addTPair(startT, &other, oEndT, true, startPt);
109 const SkPoint& startPt = coincidence.fPts[startSwapped];
111 || thisOne.isMissing(startT, startPt) || other.isMissing(oStartT, startPt)) {
112 thisOne.addTPair(startT, &other, oStartT, true, startPt);
245 const SkPoint* startPt = &coincidence.fPts[0];
250 SkTSwap<const SkPoint*>(startPt, endPt)
[all...] |
| SkOpSegment.h | 245 void addTCancel(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
246 void addTCoincident(const SkPoint& startPt, const SkPoint& endPt, double endT,
258 int step, SkPoint* startPt, SkPoint* endPt, double* endT) const;
342 void addCancelOutsides(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
343 void addCoinOutsides(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
391 const SkPoint& startPt);
392 static void TrackOutside(SkTArray<SkPoint, true>* outsideTs, const SkPoint& startPt);
|
| SkIntersections.cpp | 156 void SkIntersections::remove(double one, double two, const SkDPoint& startPt,
160 || startPt.approximatelyEqual(fPt[index])
|
| SkOpSegment.cpp | 215 void SkOpSegment::addCancelOutsides(const SkPoint& startPt, const SkPoint& endPt,
223 } while (startPt != fTs[tIndex].fPt && tIndex < tCount);
232 SkASSERT(fTs[tIndex].fT < 1 || startPt != *nextPt);
233 } while (startPt == *nextPt);
292 void SkOpSegment::addCoinOutsides(const SkPoint& startPt, const SkPoint& endPt,
294 // walk this to startPt
295 // walk other to startPt
301 } while (startPt != fTs[tIndex].fPt);
304 } while (startPt != other->fTs[oIndex].fPt);
306 addTPair(fTs[tIndex].fT, other, other->fTs[oIndex].fT, false, startPt);
[all...] |
| SkIntersections.h | 270 // void remove(double one, double two, const SkDPoint& startPt, const SkDPoint& endPt);
|
| /external/jmonkeyengine/engine/src/test/jme3test/bullet/ |
| TestBrickWall.java | 141 float startpt = bLength / 4;
local
145 Vector3f vt = new Vector3f(i * bLength * 2 + startpt, bHeight + height, 0);
148 startpt = -startpt;
|
| TestRagdollCharacter.java | 150 float startpt = bLength / 4; local
154 Vector3f ori = new Vector3f(i * bLength * 2 + startpt, bHeight + height, -10);
165 startpt = -startpt;
|
| TestWalkingChar.java | 172 float startpt = bLength / 4 - xOff; local
178 Vector3f vt = new Vector3f(i * bLength * 2 + startpt, bHeight + height, zOff);
181 startpt = -startpt;
|
| /external/jmonkeyengine/engine/src/test/jme3test/helloworld/ |
| HelloPhysics.java | 169 float startpt = brickLength / 4;
local
174 new Vector3f(i * brickLength * 2 + startpt, brickHeight + height, 0);
177 startpt = -startpt;
|
| /external/skia/tests/ |
| PathOpsAngleTest.cpp | 209 SkPoint startPt;
242 SkOpSegment* seg, int* ts, const SkPoint& startPt) {
245 bool useIntersectPt = startPt.fX != 0 || startPt.fY != 0;
247 start = startPt;
323 setup(set, idx, &seg, ts, test.startPt);
|
