Searched defs:lesser (Results 1 - 8 of 8) sorted by relevance

/external/chromium_org/third_party/skia/experimental/Intersection/
H A DSimplifyAngle_Test.cpp92 SimplifyAngleTest::Angle lesser, greater; local
97 lesser.set(segPtr[index].pts, segPtr[index].verb, NULL, index, next, dummy);
102 bool result = lesser < greater;
253 SimplifyAngleTest::Angle lesser, greater;
258 lesser.set(segPtr[index].pts, segPtr[index].verb, 0, index, next, dummy); // FIXME: segPtr[index].ts[0], segPtr[index].ts[1]);
263 bool result = lesser < greater;
295 SimplifyAngleTest::Angle lesser, greater;
303 lesser.set(segPtr[index].pts, segPtr[index].verb, use1 ? &segOne : &segTwo, index, next, dummy);
306 bool result = lesser < greater;
/external/skia/experimental/Intersection/
H A DSimplifyAngle_Test.cpp92 SimplifyAngleTest::Angle lesser, greater; local
97 lesser.set(segPtr[index].pts, segPtr[index].verb, NULL, index, next, dummy);
102 bool result = lesser < greater;
253 SimplifyAngleTest::Angle lesser, greater;
258 lesser.set(segPtr[index].pts, segPtr[index].verb, 0, index, next, dummy); // FIXME: segPtr[index].ts[0], segPtr[index].ts[1]);
263 bool result = lesser < greater;
295 SimplifyAngleTest::Angle lesser, greater;
303 lesser.set(segPtr[index].pts, segPtr[index].verb, use1 ? &segOne : &segTwo, index, next, dummy);
306 bool result = lesser < greater;
/external/chromium_org/third_party/skia/src/pathops/
H A DSkOpSegment.h147 int lesser = SkMin32(angle->start(), angle->end());
148 return fTs[lesser].fOppSum;
156 int lesser = SkMin32(angle->start(), angle->end()); local
157 return fTs[lesser].fOppValue;
296 bool betweenTs(int lesser, double testT, int greater) const;
H A DSkPathOpsCommon.cpp202 int lesser = SkMin32(*tIndex, *endIndex); local
203 const SkOpSpan& nextSpan = segment->span(lesser);
H A DSkOpSegment.cpp47 int lesser = index; local
48 while (--lesser >= 0
49 && (precisely_negative(referenceT - fTs[lesser].fT) || fTs[lesser].fTiny)) {
50 if (const SkOpAngle* result = activeAngleOther(lesser, start, end, done, sortable)) {
1273 // the lesser
1495 bool SkOpSegment::betweenTs(int lesser, double testT, int greater) const {
1496 if (lesser > greater) {
1497 SkTSwap<int>(lesser, greater);
1499 return approximately_between(fTs[lesser]
[all...]
/external/skia/src/pathops/
H A DSkOpSegment.h147 int lesser = SkMin32(angle->start(), angle->end());
148 return fTs[lesser].fOppSum;
156 int lesser = SkMin32(angle->start(), angle->end()); local
157 return fTs[lesser].fOppValue;
294 bool betweenTs(int lesser, double testT, int greater) const;
H A DSkOpSegment.cpp47 int lesser = index; local
48 while (--lesser >= 0
49 && (precisely_negative(referenceT - fTs[lesser].fT) || fTs[lesser].fTiny)) {
50 if (const SkOpAngle* result = activeAngleOther(lesser, start, end, done, sortable)) {
1240 // the lesser
1428 bool SkOpSegment::betweenTs(int lesser, double testT, int greater) const {
1429 if (lesser > greater) {
1430 SkTSwap<int>(lesser, greater);
1432 return approximately_between(fTs[lesser]
[all...]
H A DSkPathOpsCommon.cpp202 int lesser = SkMin32(*tIndex, *endIndex); local
203 const SkOpSpan& nextSpan = segment->span(lesser);

Completed in 6017 milliseconds