| reed@google.com | ac10a2d | 2010-12-22 21:39:39 +0000 | [diff] [blame] | 1 | /* |
| 2 | Copyright 2010 Google Inc. |
| 3 | |
| 4 | Licensed under the Apache License, Version 2.0 (the "License"); |
| 5 | you may not use this file except in compliance with the License. |
| 6 | You may obtain a copy of the License at |
| 7 | |
| 8 | http://www.apache.org/licenses/LICENSE-2.0 |
| 9 | |
| 10 | Unless required by applicable law or agreed to in writing, software |
| 11 | distributed under the License is distributed on an "AS IS" BASIS, |
| 12 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 13 | See the License for the specific language governing permissions and |
| 14 | limitations under the License. |
| 15 | */ |
| 16 | |
| 17 | |
| 18 | #ifndef GrPath_DEFINED |
| 19 | #define GrPath_DEFINED |
| 20 | |
| 21 | #include "GrPathSink.h" |
| 22 | #include "GrPathIter.h" |
| 23 | #include "GrTDArray.h" |
| 24 | #include "GrPoint.h" |
| 25 | |
| 26 | class GrPath : public GrPathSink { |
| 27 | public: |
| 28 | GrPath(); |
| 29 | GrPath(const GrPath&); |
| 30 | explicit GrPath(GrPathIter&); |
| 31 | virtual ~GrPath(); |
| 32 | |
| 33 | GrPathIter::ConvexHint getConvexHint() const { return fConvexHint; } |
| 34 | void setConvexHint(GrPathIter::ConvexHint hint) { fConvexHint = hint; } |
| 35 | |
| 36 | void resetFromIter(GrPathIter*); |
| 37 | |
| bsalomon@google.com | d302f14 | 2011-03-03 13:54:13 +0000 | [diff] [blame^] | 38 | bool operator ==(const GrPath& path) const; |
| 39 | bool operator !=(const GrPath& path) const { return !(*this == path); } |
| reed@google.com | ac10a2d | 2010-12-22 21:39:39 +0000 | [diff] [blame] | 40 | // overrides from GrPathSink |
| 41 | |
| 42 | virtual void moveTo(GrScalar x, GrScalar y); |
| 43 | virtual void lineTo(GrScalar x, GrScalar y); |
| 44 | virtual void quadTo(GrScalar x0, GrScalar y0, GrScalar x1, GrScalar y1); |
| 45 | virtual void cubicTo(GrScalar x0, GrScalar y0, GrScalar x1, GrScalar y1, |
| 46 | GrScalar x2, GrScalar y2); |
| 47 | virtual void close(); |
| 48 | |
| 49 | class Iter : public GrPathIter { |
| 50 | public: |
| 51 | Iter(const GrPath& path); |
| 52 | |
| 53 | // overrides from GrPathIter |
| 54 | virtual Command next(GrPoint points[]); |
| bsalomon@google.com | d302f14 | 2011-03-03 13:54:13 +0000 | [diff] [blame^] | 55 | virtual ConvexHint convexHint() const; |
| reed@google.com | ac10a2d | 2010-12-22 21:39:39 +0000 | [diff] [blame] | 56 | virtual Command next(); |
| 57 | virtual void rewind(); |
| 58 | private: |
| 59 | const GrPath& fPath; |
| 60 | GrPoint fLastPt; |
| 61 | int fVerbIndex; |
| 62 | int fPtIndex; |
| 63 | }; |
| 64 | |
| 65 | private: |
| 66 | enum Verb { |
| 67 | kMove, kLine, kQuad, kCubic, kClose |
| 68 | }; |
| 69 | |
| 70 | GrTDArray<uint8_t> fVerbs; |
| 71 | GrTDArray<GrPoint> fPts; |
| 72 | GrPathIter::ConvexHint fConvexHint; |
| 73 | |
| 74 | // this ensures we have a moveTo at the start of each contour |
| 75 | inline void ensureMoveTo(); |
| 76 | |
| 77 | bool wasLastVerb(Verb verb) const { |
| 78 | int count = fVerbs.count(); |
| 79 | return count > 0 && verb == fVerbs[count - 1]; |
| 80 | } |
| 81 | |
| 82 | friend class Iter; |
| reed@google.com | c921843 | 2011-01-25 19:05:12 +0000 | [diff] [blame] | 83 | |
| 84 | typedef GrPathSink INHERITED; |
| reed@google.com | ac10a2d | 2010-12-22 21:39:39 +0000 | [diff] [blame] | 85 | }; |
| 86 | |
| 87 | #endif |
| 88 | |