c0bd9f9fe5
Current strategy: everything from the top Things to look at first are the manual changes: - added tools/rewrite_includes.py - removed -Idirectives from BUILD.gn - various compile.sh simplifications - tweak tools/embed_resources.py - update gn/find_headers.py to write paths from the top - update gn/gn_to_bp.py SkUserConfig.h layout so that #include "include/config/SkUserConfig.h" always gets the header we want. No-Presubmit: true Change-Id: I73a4b181654e0e38d229bc456c0d0854bae3363e Reviewed-on: https://skia-review.googlesource.com/c/skia/+/209706 Commit-Queue: Mike Klein <mtklein@google.com> Reviewed-by: Hal Canary <halcanary@google.com> Reviewed-by: Brian Osman <brianosman@google.com> Reviewed-by: Florin Malita <fmalita@chromium.org>
147 lines
5.1 KiB
C++
147 lines
5.1 KiB
C++
/*
|
|
* Copyright 2018 Google Inc.
|
|
*
|
|
* Use of this source code is governed by a BSD-style license that can be
|
|
* found in the LICENSE file.
|
|
*/
|
|
|
|
#ifndef SkContourMeasure_DEFINED
|
|
#define SkContourMeasure_DEFINED
|
|
|
|
#include "include/core/SkPath.h"
|
|
#include "include/core/SkRefCnt.h"
|
|
#include "include/private/SkNoncopyable.h"
|
|
#include "include/private/SkTDArray.h"
|
|
|
|
struct SkConic;
|
|
|
|
class SK_API SkContourMeasure : public SkRefCnt {
|
|
public:
|
|
/** Return the length of the contour.
|
|
*/
|
|
SkScalar length() const { return fLength; }
|
|
|
|
/** Pins distance to 0 <= distance <= length(), and then computes the corresponding
|
|
* position and tangent.
|
|
*/
|
|
bool SK_WARN_UNUSED_RESULT getPosTan(SkScalar distance, SkPoint* position,
|
|
SkVector* tangent) const;
|
|
|
|
enum MatrixFlags {
|
|
kGetPosition_MatrixFlag = 0x01,
|
|
kGetTangent_MatrixFlag = 0x02,
|
|
kGetPosAndTan_MatrixFlag = kGetPosition_MatrixFlag | kGetTangent_MatrixFlag
|
|
};
|
|
|
|
/** Pins distance to 0 <= distance <= getLength(), and then computes
|
|
the corresponding matrix (by calling getPosTan).
|
|
Returns false if there is no path, or a zero-length path was specified, in which case
|
|
matrix is unchanged.
|
|
*/
|
|
bool SK_WARN_UNUSED_RESULT getMatrix(SkScalar distance, SkMatrix* matrix,
|
|
MatrixFlags flags = kGetPosAndTan_MatrixFlag) const;
|
|
|
|
/** Given a start and stop distance, return in dst the intervening segment(s).
|
|
If the segment is zero-length, return false, else return true.
|
|
startD and stopD are pinned to legal values (0..getLength()). If startD > stopD
|
|
then return false (and leave dst untouched).
|
|
Begin the segment with a moveTo if startWithMoveTo is true
|
|
*/
|
|
bool SK_WARN_UNUSED_RESULT getSegment(SkScalar startD, SkScalar stopD, SkPath* dst,
|
|
bool startWithMoveTo) const;
|
|
|
|
/** Return true if the contour is closed()
|
|
*/
|
|
bool isClosed() const { return fIsClosed; }
|
|
|
|
private:
|
|
struct Segment {
|
|
SkScalar fDistance; // total distance up to this point
|
|
unsigned fPtIndex; // index into the fPts array
|
|
unsigned fTValue : 30;
|
|
unsigned fType : 2; // actually the enum SkSegType
|
|
// See SkPathMeasurePriv.h
|
|
|
|
SkScalar getScalarT() const;
|
|
|
|
static const Segment* Next(const Segment* seg) {
|
|
unsigned ptIndex = seg->fPtIndex;
|
|
do {
|
|
++seg;
|
|
} while (seg->fPtIndex == ptIndex);
|
|
return seg;
|
|
}
|
|
|
|
};
|
|
|
|
const SkTDArray<Segment> fSegments;
|
|
const SkTDArray<SkPoint> fPts; // Points used to define the segments
|
|
|
|
const SkScalar fLength;
|
|
const bool fIsClosed;
|
|
|
|
SkContourMeasure(SkTDArray<Segment>&& segs, SkTDArray<SkPoint>&& pts,
|
|
SkScalar length, bool isClosed);
|
|
~SkContourMeasure() override {}
|
|
|
|
const Segment* distanceToSegment(SkScalar distance, SkScalar* t) const;
|
|
|
|
friend class SkContourMeasureIter;
|
|
};
|
|
|
|
class SK_API SkContourMeasureIter : SkNoncopyable {
|
|
public:
|
|
SkContourMeasureIter();
|
|
/**
|
|
* Initialize the Iter with a path.
|
|
* The parts of the path that are needed are copied, so the client is free to modify/delete
|
|
* the path after this call.
|
|
*/
|
|
SkContourMeasureIter(const SkPath& path, bool forceClosed, SkScalar resScale = 1);
|
|
~SkContourMeasureIter();
|
|
|
|
/**
|
|
* Reset the Iter with a path.
|
|
* The parts of the path that are needed are copied, so the client is free to modify/delete
|
|
* the path after this call.
|
|
*/
|
|
void reset(const SkPath& path, bool forceClosed, SkScalar resScale = 1);
|
|
|
|
/**
|
|
* Iterates through contours in path, returning a contour-measure object for each contour
|
|
* in the path. Returns null when it is done.
|
|
*
|
|
* This only returns non-zero length contours, where a contour is the segments between
|
|
* a kMove_Verb and either ...
|
|
* - the next kMove_Verb
|
|
* - kClose_Verb (1 or more)
|
|
* - kDone_Verb
|
|
* If it encounters a zero-length contour, it is skipped.
|
|
*/
|
|
sk_sp<SkContourMeasure> next();
|
|
|
|
private:
|
|
SkPath::RawIter fIter;
|
|
SkPath fPath;
|
|
SkScalar fTolerance;
|
|
bool fForceClosed;
|
|
|
|
// temporary
|
|
SkTDArray<SkContourMeasure::Segment> fSegments;
|
|
SkTDArray<SkPoint> fPts; // Points used to define the segments
|
|
|
|
SkContourMeasure* buildSegments();
|
|
|
|
SkScalar compute_line_seg(SkPoint p0, SkPoint p1, SkScalar distance, unsigned ptIndex);
|
|
SkScalar compute_quad_segs(const SkPoint pts[3], SkScalar distance,
|
|
int mint, int maxt, unsigned ptIndex);
|
|
SkScalar compute_conic_segs(const SkConic& conic, SkScalar distance,
|
|
int mint, const SkPoint& minPt,
|
|
int maxt, const SkPoint& maxPt,
|
|
unsigned ptIndex);
|
|
SkScalar compute_cubic_segs(const SkPoint pts[4], SkScalar distance,
|
|
int mint, int maxt, unsigned ptIndex);
|
|
};
|
|
|
|
#endif
|