| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| H A D | Helpers.java | 186 T lesser = valuesInExpectedOrder.get(j);
187 assertTrue(comparator + ".compare(" + lesser + ", " + t + ")",
188 comparator.compare(lesser, t) < 0);
209 T lesser = valuesInExpectedOrder.get(j);
210 assertTrue(lesser + ".compareTo(" + t + ')', lesser.compareTo(t) < 0);
211 assertFalse(lesser.equals(t));
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| H A D | 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;
|
| H A D | Simplify.cpp | 1292 int lesser = index;
1293 while (--lesser >= 0 && equalPoints(index, lesser)) {
1294 if (activeAngleOther(lesser, done, angles)) {
1298 lesser = index;
1303 } while (++index < fTs.count() && equalPoints(index, lesser));
1980 // the lesser
2085 bool betweenTs(int lesser, double testT, int greater) {
2086 if (lesser > greater) {
2087 SkTSwap<int>(lesser, greate
[all...] |
| /external/skia/experimental/Intersection/ |
| H A D | 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;
|
| H A D | Simplify.cpp | 1292 int lesser = index;
1293 while (--lesser >= 0 && equalPoints(index, lesser)) {
1294 if (activeAngleOther(lesser, done, angles)) {
1298 lesser = index;
1303 } while (++index < fTs.count() && equalPoints(index, lesser));
1980 // the lesser
2085 bool betweenTs(int lesser, double testT, int greater) {
2086 if (lesser > greater) {
2087 SkTSwap<int>(lesser, greate
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| H A D | 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;
294 bool betweenTs(int lesser, double testT, int greater) const;
|
| H A D | 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)) {
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 D | SkPathOpsCommon.cpp | 202 int lesser = SkMin32(*tIndex, *endIndex); local
203 const SkOpSpan& nextSpan = segment->span(lesser);
|
| /external/skia/src/pathops/ |
| H A D | 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;
294 bool betweenTs(int lesser, double testT, int greater) const;
|
| H A D | 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)) {
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 D | SkPathOpsCommon.cpp | 202 int lesser = SkMin32(*tIndex, *endIndex); local
203 const SkOpSpan& nextSpan = segment->span(lesser);
|