1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
|
/*
* Copyright 2009 The Android Open Source Project
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#ifndef SkEdgeClipper_DEFINED
#define SkEdgeClipper_DEFINED
#include "SkPath.h"
/** This is basically an iterator. It is initialized with an edge and a clip,
and then next() is called until it returns kDone_Verb.
*/
class SkEdgeClipper {
public:
SkEdgeClipper(bool canCullToTheRight) : fCanCullToTheRight(canCullToTheRight) {}
bool clipLine(SkPoint p0, SkPoint p1, const SkRect& clip);
bool clipQuad(const SkPoint pts[3], const SkRect& clip);
bool clipCubic(const SkPoint pts[4], const SkRect& clip);
SkPath::Verb next(SkPoint pts[]);
bool canCullToTheRight() const { return fCanCullToTheRight; }
private:
SkPoint* fCurrPoint;
SkPath::Verb* fCurrVerb;
const bool fCanCullToTheRight;
enum {
kMaxVerbs = 18, // max curvature in X and Y split cubic into 9 pieces, * (line + cubic)
kMaxPoints = 54 // 2 lines + 1 cubic require 6 points; times 9 pieces
};
SkPoint fPoints[kMaxPoints];
SkPath::Verb fVerbs[kMaxVerbs];
void clipMonoQuad(const SkPoint srcPts[3], const SkRect& clip);
void clipMonoCubic(const SkPoint srcPts[4], const SkRect& clip);
void appendLine(SkPoint p0, SkPoint p1);
void appendVLine(SkScalar x, SkScalar y0, SkScalar y1, bool reverse);
void appendQuad(const SkPoint pts[3], bool reverse);
void appendCubic(const SkPoint pts[4], bool reverse);
};
#ifdef SK_DEBUG
void sk_assert_monotonic_x(const SkPoint pts[], int count);
void sk_assert_monotonic_y(const SkPoint pts[], int count);
#else
#define sk_assert_monotonic_x(pts, count)
#define sk_assert_monotonic_y(pts, count)
#endif
#endif
|
