Wed, 31 Dec 2014 06:09:35 +0100
Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.
michael@0 | 1 | /* |
michael@0 | 2 | * Copyright 2012 Google Inc. |
michael@0 | 3 | * |
michael@0 | 4 | * Use of this source code is governed by a BSD-style license that can be |
michael@0 | 5 | * found in the LICENSE file. |
michael@0 | 6 | */ |
michael@0 | 7 | #ifndef SkOpSpan_DEFINED |
michael@0 | 8 | #define SkOpSpan_DEFINED |
michael@0 | 9 | |
michael@0 | 10 | #include "SkPoint.h" |
michael@0 | 11 | |
michael@0 | 12 | class SkOpSegment; |
michael@0 | 13 | |
michael@0 | 14 | struct SkOpSpan { |
michael@0 | 15 | SkOpSegment* fOther; |
michael@0 | 16 | SkPoint fPt; // computed when the curves are intersected |
michael@0 | 17 | double fT; |
michael@0 | 18 | double fOtherT; // value at fOther[fOtherIndex].fT |
michael@0 | 19 | int fOtherIndex; // can't be used during intersection |
michael@0 | 20 | int fWindSum; // accumulated from contours surrounding this one. |
michael@0 | 21 | int fOppSum; // for binary operators: the opposite winding sum |
michael@0 | 22 | int fWindValue; // 0 == canceled; 1 == normal; >1 == coincident |
michael@0 | 23 | int fOppValue; // normally 0 -- when binary coincident edges combine, opp value goes here |
michael@0 | 24 | bool fDone; // if set, this span to next higher T has been processed |
michael@0 | 25 | bool fUnsortableStart; // set when start is part of an unsortable pair |
michael@0 | 26 | bool fUnsortableEnd; // set when end is part of an unsortable pair |
michael@0 | 27 | bool fSmall; // if set, consecutive points are almost equal |
michael@0 | 28 | bool fTiny; // if set, span may still be considered once for edge following |
michael@0 | 29 | bool fLoop; // set when a cubic loops back to this point |
michael@0 | 30 | |
michael@0 | 31 | #ifdef SK_DEBUG |
michael@0 | 32 | void dump() const; |
michael@0 | 33 | #endif |
michael@0 | 34 | }; |
michael@0 | 35 | |
michael@0 | 36 | #endif |