Lines Matching defs:const
32 static int compute_side(const SkPoint& p0, const SkVector& v, const SkPoint& p) {
43 int SkGetPolygonWinding(const SkPoint* polygonVerts, int polygonSize) {
64 bool compute_offset_vector(const SkPoint& p0, const SkPoint& p1, SkScalar offset, int side,
83 static inline bool zero_length(const SkPoint& v, SkScalar vdotv) {
92 static bool compute_intersection(const OffsetSegment& s0, const OffsetSegment& s1,
94 const SkVector& v0 = s0.fV;
95 const SkVector& v1 = s1.fV;
182 bool SkIsConvexPolygon(const SkPoint* polygonVerts, int polygonSize) {
251 bool checkIntersection(const OffsetEdge* that,
269 SkScalar computeCrossingDistance(const OffsetEdge* that) {
270 const OffsetSegment& s0 = this->fOffset;
271 const OffsetSegment& s1 = that->fOffset;
272 const SkVector& v0 = s0.fV;
273 const SkVector& v1 = s1.fV;
297 static void remove_node(const OffsetEdge* node, OffsetEdge** head) {
320 bool SkInsetConvexPolygon(const SkPoint* inputPolygonVerts, int inputPolygonSize,
472 bool SkComputeRadialSteps(const SkVector& v1, const SkVector& v2, SkScalar offset,
474 const SkScalar kRecipPixelsPerArcSegment = 0.25f;
509 static bool left(const SkPoint& p0, const SkPoint& p1) {
514 static bool right(const SkPoint& p0, const SkPoint& p1) {
519 static bool Left(const Vertex& qv0, const Vertex& qv1) {
538 ActiveEdge(const SkPoint& p0, const SkVector& v, uint16_t index0, uint16_t index1)
552 bool aboveIfLeft(const ActiveEdge* that) const {
553 const SkPoint& p0 = this->fSegment.fP0;
554 const SkPoint& q0 = that->fSegment.fP0;
557 const SkVector& v = this->fSegment.fV;
558 const SkVector& w = that->fSegment.fV;
606 bool above(const ActiveEdge* that) const {
607 const SkPoint& p0 = this->fSegment.fP0;
608 const SkPoint& q0 = that->fSegment.fP0;
616 bool intersect(const SkPoint& q0, const SkVector& w, uint16_t index0, uint16_t index1) const {
624 const SkPoint& p0 = this->fSegment.fP0;
625 const SkVector& v = this->fSegment.fV;
655 bool intersect(const ActiveEdge* edge) {
659 bool lessThan(const ActiveEdge* that) const {
666 bool equals(uint16_t index0, uint16_t index1) const {
691 bool insert(const SkPoint& p0, const SkPoint& p1, uint16_t index0, uint16_t index1) {
801 bool replace(const SkPoint& p0, const SkPoint& p1, const SkPoint& p2,
860 bool remove(const SkPoint& p0, const SkPoint& p1, uint16_t index0, uint16_t index1) {
973 ActiveEdge * allocate(const SkPoint& p0, const SkPoint& p1, uint16_t index0, uint16_t index1) {
985 static bool IsRed(const ActiveEdge* node) {
1008 static int VerifyTree(const ActiveEdge* tree) {
1013 const ActiveEdge* left = tree->fChild[0];
1014 const ActiveEdge* right = tree->fChild[1];
1066 bool SkIsSimplePolygon(const SkPoint* polygon, int polygonSize) {
1105 const Vertex& v = vertexQueue.peek();
1149 const SkPoint& endpoint0, const SkPoint& endpoint1,
1156 static bool is_reflex_vertex(const SkPoint* inputPolygonVerts, int winding, SkScalar offset,
1165 bool SkOffsetSimplePolygon(const SkPoint* inputPolygonVerts, int inputPolygonSize,
1166 const SkRect& bounds, SkScalar offset,
1454 static void compute_triangle_bounds(const SkPoint& p0, const SkPoint& p1, const SkPoint& p2,
1467 static bool point_in_triangle(const SkPoint& p0, const SkPoint& p1, const SkPoint& p2,
1468 const SkPoint& p) {
1495 bool init(const SkRect& bounds, int vertexCount) {
1537 bool checkTriangle(const SkPoint& p0, const SkPoint& p1, const SkPoint& p2,
1538 uint16_t ignoreIndex0, uint16_t ignoreIndex1) const {
1570 int hash(TriangulationVertex* vert) const {
1587 static void reclassify_vertex(TriangulationVertex* p, const SkPoint* polygonVerts,
1602 bool SkTriangulateSimplePolygon(const SkPoint* polygonVerts, uint16_t* indexMap, int polygonSize,
1837 bool SkIsPolyConvex_experimental(const SkPoint pts[], int count) {