#include <earcut.hpp>
Classes | |
struct | Node |
class | ObjectPool |
Public Member Functions | |
template<typename Polygon > | |
void | operator() (const Polygon &points) |
Public Attributes | |
std::vector< N > | indices |
std::size_t | vertices = 0 |
Private Member Functions | |
double | area (const Node *p, const Node *q, const Node *r) const |
Node * | cureLocalIntersections (Node *start) |
void | earcutLinked (Node *ear, int pass=0) |
void | eliminateHole (Node *hole, Node *outerNode) |
template<typename Polygon > | |
Node * | eliminateHoles (const Polygon &points, Node *outerNode) |
bool | equals (const Node *p1, const Node *p2) |
Node * | filterPoints (Node *start, Node *end=nullptr) |
Node * | findHoleBridge (Node *hole, Node *outerNode) |
Node * | getLeftmost (Node *start) |
void | indexCurve (Node *start) |
template<typename Point > | |
Node * | insertNode (std::size_t i, const Point &p, Node *last) |
bool | intersects (const Node *p1, const Node *q1, const Node *p2, const Node *q2) |
bool | intersectsPolygon (const Node *a, const Node *b) |
bool | isEar (Node *ear) |
bool | isEarHashed (Node *ear) |
bool | isValidDiagonal (Node *a, Node *b) |
template<typename Ring > | |
Node * | linkedList (const Ring &points, const bool clockwise) |
bool | locallyInside (const Node *a, const Node *b) |
bool | middleInside (const Node *a, const Node *b) |
bool | pointInTriangle (double ax, double ay, double bx, double by, double cx, double cy, double px, double py) const |
void | removeNode (Node *p) |
Node * | sortLinked (Node *list) |
void | splitEarcut (Node *start) |
Node * | splitPolygon (Node *a, Node *b) |
int32_t | zOrder (const double x_, const double y_) |
Private Attributes | |
bool | hashing |
double | inv_size = 0 |
double | maxX |
double | maxY |
double | minX |
double | minY |
ObjectPool< Node > | nodes |
Definition at line 23 of file earcut.hpp.
|
private |
Definition at line 657 of file earcut.hpp.
|
private |
Definition at line 368 of file earcut.hpp.
|
private |
Definition at line 250 of file earcut.hpp.
|
private |
Definition at line 448 of file earcut.hpp.
|
private |
Definition at line 422 of file earcut.hpp.
|
private |
Definition at line 663 of file earcut.hpp.
|
private |
Definition at line 225 of file earcut.hpp.
|
private |
Definition at line 459 of file earcut.hpp.
|
private |
Definition at line 628 of file earcut.hpp.
|
private |
Definition at line 519 of file earcut.hpp.
|
private |
Definition at line 743 of file earcut.hpp.
|
private |
Definition at line 669 of file earcut.hpp.
|
private |
Definition at line 678 of file earcut.hpp.
|
private |
Definition at line 305 of file earcut.hpp.
|
private |
Definition at line 325 of file earcut.hpp.
|
private |
Definition at line 650 of file earcut.hpp.
|
private |
Definition at line 187 of file earcut.hpp.
|
private |
Definition at line 691 of file earcut.hpp.
|
private |
Definition at line 699 of file earcut.hpp.
void mapbox::detail::Earcut< N >::operator() | ( | const Polygon & | points | ) |
Definition at line 132 of file earcut.hpp.
|
private |
Definition at line 642 of file earcut.hpp.
|
private |
Definition at line 761 of file earcut.hpp.
|
private |
Definition at line 540 of file earcut.hpp.
|
private |
Definition at line 394 of file earcut.hpp.
|
private |
Definition at line 719 of file earcut.hpp.
|
private |
Definition at line 607 of file earcut.hpp.
|
private |
Definition at line 84 of file earcut.hpp.
std::vector<N> mapbox::detail::Earcut< N >::indices |
Definition at line 25 of file earcut.hpp.
|
private |
Definition at line 87 of file earcut.hpp.
|
private |
Definition at line 85 of file earcut.hpp.
|
private |
Definition at line 86 of file earcut.hpp.
|
private |
Definition at line 85 of file earcut.hpp.
|
private |
Definition at line 86 of file earcut.hpp.
|
private |
Definition at line 128 of file earcut.hpp.
std::size_t mapbox::detail::Earcut< N >::vertices = 0 |
Definition at line 26 of file earcut.hpp.