HomeSort by relevance Sort by last modified time
    Searched defs:lesser (Results 1 - 4 of 4) sorted by null

  /external/chromium_org/third_party/skia/experimental/Intersection/
SimplifyAngle_Test.cpp 92 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/
SkOpSegment.h 147 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;
SkOpSegment.cpp 47 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)) {
    [all...]
SkPathOpsCommon.cpp 202 int lesser = SkMin32(*tIndex, *endIndex); local
203 const SkOpSpan& nextSpan = segment->span(lesser);

Completed in 46 milliseconds