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
4.0 KiB
C++
147 lines
4.0 KiB
C++
/*
|
|
* Copyright 2012 Google Inc.
|
|
*
|
|
* Use of this source code is governed by a BSD-style license that can be
|
|
* found in the LICENSE file.
|
|
*/
|
|
#ifndef SkOpAngle_DEFINED
|
|
#define SkOpAngle_DEFINED
|
|
|
|
#include "src/pathops/SkLineParameters.h"
|
|
#include "src/pathops/SkPathOpsCurve.h"
|
|
#if DEBUG_ANGLE
|
|
#include "include/core/SkString.h"
|
|
#endif
|
|
|
|
class SkOpContour;
|
|
class SkOpPtT;
|
|
class SkOpSegment;
|
|
class SkOpSpanBase;
|
|
class SkOpSpan;
|
|
|
|
class SkOpAngle {
|
|
public:
|
|
enum IncludeType {
|
|
kUnaryWinding,
|
|
kUnaryXor,
|
|
kBinarySingle,
|
|
kBinaryOpp,
|
|
};
|
|
|
|
const SkOpAngle* debugAngle(int id) const;
|
|
const SkOpCoincidence* debugCoincidence() const;
|
|
SkOpContour* debugContour(int id) const;
|
|
|
|
int debugID() const {
|
|
return SkDEBUGRELEASE(fID, -1);
|
|
}
|
|
|
|
#if DEBUG_SORT
|
|
void debugLoop() const;
|
|
#endif
|
|
|
|
#if DEBUG_ANGLE
|
|
bool debugCheckCoincidence() const { return fCheckCoincidence; }
|
|
void debugCheckNearCoincidence() const;
|
|
SkString debugPart() const;
|
|
#endif
|
|
const SkOpPtT* debugPtT(int id) const;
|
|
const SkOpSegment* debugSegment(int id) const;
|
|
int debugSign() const;
|
|
const SkOpSpanBase* debugSpan(int id) const;
|
|
void debugValidate() const;
|
|
void debugValidateNext() const; // in debug builds, verify that angle loop is uncorrupted
|
|
double distEndRatio(double dist) const;
|
|
// available to testing only
|
|
void dump() const;
|
|
void dumpCurves() const;
|
|
void dumpLoop() const;
|
|
void dumpOne(bool functionHeader) const;
|
|
void dumpTo(const SkOpSegment* fromSeg, const SkOpAngle* ) const;
|
|
void dumpTest() const;
|
|
|
|
SkOpSpanBase* end() const {
|
|
return fEnd;
|
|
}
|
|
|
|
bool insert(SkOpAngle* );
|
|
SkOpSpanBase* lastMarked() const;
|
|
bool loopContains(const SkOpAngle* ) const;
|
|
int loopCount() const;
|
|
|
|
SkOpAngle* next() const {
|
|
return fNext;
|
|
}
|
|
|
|
SkOpAngle* previous() const;
|
|
SkOpSegment* segment() const;
|
|
void set(SkOpSpanBase* start, SkOpSpanBase* end);
|
|
|
|
void setLastMarked(SkOpSpanBase* marked) {
|
|
fLastMarked = marked;
|
|
}
|
|
|
|
SkOpSpanBase* start() const {
|
|
return fStart;
|
|
}
|
|
|
|
SkOpSpan* starter();
|
|
|
|
bool tangentsAmbiguous() const {
|
|
return fTangentsAmbiguous;
|
|
}
|
|
|
|
bool unorderable() const {
|
|
return fUnorderable;
|
|
}
|
|
|
|
private:
|
|
bool after(SkOpAngle* test);
|
|
void alignmentSameSide(const SkOpAngle* test, int* order) const;
|
|
bool checkCrossesZero() const;
|
|
bool checkParallel(SkOpAngle* );
|
|
bool computeSector();
|
|
int convexHullOverlaps(const SkOpAngle* );
|
|
bool endToSide(const SkOpAngle* rh, bool* inside) const;
|
|
bool endsIntersect(SkOpAngle* );
|
|
int findSector(SkPath::Verb verb, double x, double y) const;
|
|
SkOpGlobalState* globalState() const;
|
|
int lineOnOneSide(const SkDPoint& origin, const SkDVector& line, const SkOpAngle* test,
|
|
bool useOriginal) const;
|
|
int lineOnOneSide(const SkOpAngle* test, bool useOriginal);
|
|
int linesOnOriginalSide(const SkOpAngle* test);
|
|
bool merge(SkOpAngle* );
|
|
double midT() const;
|
|
bool midToSide(const SkOpAngle* rh, bool* inside) const;
|
|
bool oppositePlanes(const SkOpAngle* rh) const;
|
|
int orderable(SkOpAngle* rh); // false == this < rh ; true == this > rh; -1 == unorderable
|
|
void setSector();
|
|
void setSpans();
|
|
bool tangentsDiverge(const SkOpAngle* rh, double s0xt0);
|
|
|
|
SkDCurve fOriginalCurvePart; // the curve from start to end
|
|
SkDCurveSweep fPart; // the curve from start to end offset as needed
|
|
double fSide;
|
|
SkLineParameters fTangentHalf; // used only to sort a pair of lines or line-like sections
|
|
SkOpAngle* fNext;
|
|
SkOpSpanBase* fLastMarked;
|
|
SkOpSpanBase* fStart;
|
|
SkOpSpanBase* fEnd;
|
|
SkOpSpanBase* fComputedEnd;
|
|
int fSectorMask;
|
|
int8_t fSectorStart; // in 32nds of a circle
|
|
int8_t fSectorEnd;
|
|
bool fUnorderable;
|
|
bool fComputeSector;
|
|
bool fComputedSector;
|
|
bool fCheckCoincidence;
|
|
bool fTangentsAmbiguous;
|
|
SkDEBUGCODE(int fID);
|
|
|
|
friend class PathOpsAngleTester;
|
|
};
|
|
|
|
|
|
|
|
#endif
|