| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| SimplifyFindTop_Test.cpp | 36 bool done, unsortable = false; local
38 findSortableTop(contourList, index, end, bestXY, unsortable, done, true);
|
| Intersections.h | 106 bool unsortable() const { function in class:Intersections
|
| SimplifyFindNext_Test.cpp | 38 bool unsortable = false; local
40 nextStart, nextEnd, unsortable);
|
| ShapeOps.cpp | 135 bool unsortable = false; local
157 if (!unsortable && current->done()) {
161 SkASSERT(unsortable || !current->done());
165 unsortable, op, xorMask, xorOpMask);
167 if (!unsortable && simple.hasMove()
184 } while (!simple.isClosed() && ((!unsortable)
187 SkASSERT(unsortable);
|
| Simplify.cpp | 666 bool fUnsortableStart; // set when start is part of an unsortable pair
667 bool fUnsortableEnd; // set when end is part of an unsortable pair
745 // See general unsortable comment below. This case can happen when
783 // is to mark the edges as unsortable, exclude them from this and
926 SkDebugf("%s unsortable [%d] (%1.9g,%1.9g) [%d] (%1.9g,%1.9g)\n", __FUNCTION__,
943 SkDebugf("%s all tiny unsortable [%d] (%1.9g,%1.9g) [%d] (%1.9g,%1.9g)\n", __FUNCTION__,
966 bool unsortable() const { function
[all...] |
| /external/skia/experimental/Intersection/ |
| SimplifyFindTop_Test.cpp | 36 bool done, unsortable = false; local
38 findSortableTop(contourList, index, end, bestXY, unsortable, done, true);
|
| Intersections.h | 106 bool unsortable() const { function in class:Intersections
|
| SimplifyFindNext_Test.cpp | 38 bool unsortable = false; local
40 nextStart, nextEnd, unsortable);
|
| ShapeOps.cpp | 135 bool unsortable = false; local
157 if (!unsortable && current->done()) {
161 SkASSERT(unsortable || !current->done());
165 unsortable, op, xorMask, xorOpMask);
167 if (!unsortable && simple.hasMove()
184 } while (!simple.isClosed() && ((!unsortable)
187 SkASSERT(unsortable);
|
| Simplify.cpp | 666 bool fUnsortableStart; // set when start is part of an unsortable pair
667 bool fUnsortableEnd; // set when end is part of an unsortable pair
745 // See general unsortable comment below. This case can happen when
783 // is to mark the edges as unsortable, exclude them from this and
926 SkDebugf("%s unsortable [%d] (%1.9g,%1.9g) [%d] (%1.9g,%1.9g)\n", __FUNCTION__,
943 SkDebugf("%s all tiny unsortable [%d] (%1.9g,%1.9g) [%d] (%1.9g,%1.9g)\n", __FUNCTION__,
966 bool unsortable() const { function
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkPathOpsSimplify.cpp | 14 bool unsortable = false; local
41 if (!unsortable && current->done()) {
44 SkASSERT(unsortable || !current->done());
48 &unsortable);
50 if (!unsortable && simple->hasMove()
67 } while (!simple->isClosed() && (!unsortable
70 // SkASSERT(unsortable || simple->isEmpty());
108 bool unsortable = false; local
113 if (!unsortable && current->done()) {
117 SkASSERT(unsortable || !current->done())
[all...] |
| SkPathOpsOp.cpp | 124 bool unsortable = false; local
158 if (!unsortable && current->done()) {
161 SkASSERT(unsortable || !current->done());
165 &unsortable, op, xorMask, xorOpMask);
167 if (!unsortable && simple->hasMove()
189 } while (!simple->isClosed() && (!unsortable
194 if (!unsortable && !simple->isEmpty()) {
195 unsortable = current->checkSmall(min);
|
| /external/skia/src/pathops/ |
| SkPathOpsSimplify.cpp | 14 bool unsortable = false; local
41 if (!unsortable && current->done()) {
44 SkASSERT(unsortable || !current->done());
48 &unsortable);
50 if (!unsortable && simple->hasMove()
67 } while (!simple->isClosed() && (!unsortable
70 // SkASSERT(unsortable || simple->isEmpty());
108 bool unsortable = false; local
113 if (!unsortable && current->done()) {
117 SkASSERT(unsortable || !current->done())
[all...] |
| SkPathOpsOp.cpp | 124 bool unsortable = false; local
158 if (!unsortable && current->done()) {
161 SkASSERT(unsortable || !current->done());
165 &unsortable, op, xorMask, xorOpMask);
167 if (!unsortable && simple->hasMove()
189 } while (!simple->isClosed() && (!unsortable
194 if (!unsortable && !simple->isEmpty()) {
195 unsortable = current->checkSmall(min);
|
