2010-12-22 21:39:39 +00:00
|
|
|
/*
|
|
|
|
Copyright 2010 Google Inc.
|
|
|
|
|
|
|
|
Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
you may not use this file except in compliance with the License.
|
|
|
|
You may obtain a copy of the License at
|
|
|
|
|
|
|
|
http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
|
|
|
|
Unless required by applicable law or agreed to in writing, software
|
|
|
|
distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
See the License for the specific language governing permissions and
|
|
|
|
limitations under the License.
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
#ifndef GrPath_DEFINED
|
|
|
|
#define GrPath_DEFINED
|
|
|
|
|
|
|
|
#include "GrPathSink.h"
|
|
|
|
#include "GrPathIter.h"
|
|
|
|
#include "GrTDArray.h"
|
|
|
|
#include "GrPoint.h"
|
|
|
|
|
|
|
|
class GrPath : public GrPathSink {
|
|
|
|
public:
|
|
|
|
GrPath();
|
|
|
|
GrPath(const GrPath&);
|
|
|
|
explicit GrPath(GrPathIter&);
|
|
|
|
virtual ~GrPath();
|
|
|
|
|
2011-03-04 20:29:08 +00:00
|
|
|
GrConvexHint getConvexHint() const { return fConvexHint; }
|
|
|
|
void setConvexHint(GrConvexHint hint) { fConvexHint = hint; }
|
2010-12-22 21:39:39 +00:00
|
|
|
|
|
|
|
void resetFromIter(GrPathIter*);
|
|
|
|
|
2011-03-03 13:54:13 +00:00
|
|
|
bool operator ==(const GrPath& path) const;
|
|
|
|
bool operator !=(const GrPath& path) const { return !(*this == path); }
|
2010-12-22 21:39:39 +00:00
|
|
|
// overrides from GrPathSink
|
|
|
|
|
|
|
|
virtual void moveTo(GrScalar x, GrScalar y);
|
|
|
|
virtual void lineTo(GrScalar x, GrScalar y);
|
|
|
|
virtual void quadTo(GrScalar x0, GrScalar y0, GrScalar x1, GrScalar y1);
|
|
|
|
virtual void cubicTo(GrScalar x0, GrScalar y0, GrScalar x1, GrScalar y1,
|
|
|
|
GrScalar x2, GrScalar y2);
|
|
|
|
virtual void close();
|
|
|
|
|
2011-03-04 22:27:10 +00:00
|
|
|
/**
|
|
|
|
* Offset the path by (tx, ty), adding tx to the horizontal position
|
|
|
|
* and adds ty to the vertical position of every point.
|
|
|
|
*/
|
|
|
|
void offset(GrScalar tx, GrScalar ty);
|
|
|
|
|
2010-12-22 21:39:39 +00:00
|
|
|
class Iter : public GrPathIter {
|
|
|
|
public:
|
2011-03-04 20:29:08 +00:00
|
|
|
/**
|
|
|
|
* Creates an uninitialized iterator
|
|
|
|
*/
|
|
|
|
Iter();
|
|
|
|
|
2010-12-22 21:39:39 +00:00
|
|
|
Iter(const GrPath& path);
|
|
|
|
|
|
|
|
// overrides from GrPathIter
|
2011-03-04 20:29:08 +00:00
|
|
|
virtual GrPathCmd next(GrPoint points[]);
|
|
|
|
virtual GrConvexHint convexHint() const;
|
|
|
|
virtual GrPathCmd next();
|
2010-12-22 21:39:39 +00:00
|
|
|
virtual void rewind();
|
2011-03-04 20:29:08 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Sets iterator to begining of path
|
|
|
|
*/
|
|
|
|
void reset(const GrPath& path);
|
2010-12-22 21:39:39 +00:00
|
|
|
private:
|
2011-03-04 20:29:08 +00:00
|
|
|
const GrPath* fPath;
|
2010-12-22 21:39:39 +00:00
|
|
|
GrPoint fLastPt;
|
2011-03-04 20:29:08 +00:00
|
|
|
int fCmdIndex;
|
2010-12-22 21:39:39 +00:00
|
|
|
int fPtIndex;
|
|
|
|
};
|
|
|
|
|
2011-03-04 20:29:08 +00:00
|
|
|
static void ConvexUnitTest();
|
|
|
|
|
2010-12-22 21:39:39 +00:00
|
|
|
private:
|
|
|
|
|
2011-03-04 20:29:08 +00:00
|
|
|
GrTDArray<GrPathCmd> fCmds;
|
2010-12-22 21:39:39 +00:00
|
|
|
GrTDArray<GrPoint> fPts;
|
2011-03-04 20:29:08 +00:00
|
|
|
GrConvexHint fConvexHint;
|
2010-12-22 21:39:39 +00:00
|
|
|
|
|
|
|
// this ensures we have a moveTo at the start of each contour
|
|
|
|
inline void ensureMoveTo();
|
|
|
|
|
2011-03-04 20:29:08 +00:00
|
|
|
bool wasLastVerb(GrPathCmd cmd) const {
|
|
|
|
int count = fCmds.count();
|
|
|
|
return count > 0 && cmd == fCmds[count - 1];
|
2010-12-22 21:39:39 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
friend class Iter;
|
2011-01-25 19:05:12 +00:00
|
|
|
|
|
|
|
typedef GrPathSink INHERITED;
|
2010-12-22 21:39:39 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|