| OLD | NEW | 
|     1 /* |     1 /* | 
|     2  * Copyright 2014 Google Inc. |     2  * Copyright 2014 Google Inc. | 
|     3  * |     3  * | 
|     4  * Use of this source code is governed by a BSD-style license that can be |     4  * Use of this source code is governed by a BSD-style license that can be | 
|     5  * found in the LICENSE file. |     5  * found in the LICENSE file. | 
|     6  */ |     6  */ | 
 |     7 #ifndef SkPathOpsTSect_DEFINED | 
 |     8 #define SkPathOpsTSect_DEFINED | 
|     7  |     9  | 
|     8 #include "SkChunkAlloc.h" |    10 #include "SkChunkAlloc.h" | 
|     9 #include "SkPathOpsBounds.h" |    11 #include "SkPathOpsBounds.h" | 
|    10 #include "SkPathOpsRect.h" |    12 #include "SkPathOpsRect.h" | 
|    11 #include "SkIntersections.h" |    13 #include "SkIntersections.h" | 
|    12 #include "SkTSort.h" |    14 #include "SkTSort.h" | 
|    13  |    15  | 
|    14 #ifdef SK_DEBUG |    16 #ifdef SK_DEBUG | 
|    15 typedef uint8_t SkOpDebugBool; |    17 typedef uint8_t SkOpDebugBool; | 
|    16 #else |    18 #else | 
| (...skipping 2217 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
|  2234         } else if (intersections->isCoincident(index + 1)) { |  2236         } else if (intersections->isCoincident(index + 1)) { | 
|  2235             intersections->removeOne(index + 1); |  2237             intersections->removeOne(index + 1); | 
|  2236             --last; |  2238             --last; | 
|  2237         } else { |  2239         } else { | 
|  2238             intersections->setCoincident(index++); |  2240             intersections->setCoincident(index++); | 
|  2239         } |  2241         } | 
|  2240         intersections->setCoincident(index); |  2242         intersections->setCoincident(index); | 
|  2241     } |  2243     } | 
|  2242     SkASSERT(intersections->used() <= TCurve::kMaxIntersections); |  2244     SkASSERT(intersections->used() <= TCurve::kMaxIntersections); | 
|  2243 } |  2245 } | 
 |  2246  | 
 |  2247 #endif | 
| OLD | NEW |