summaryrefslogtreecommitdiffstats
path: root/src/3rdparty/assimp/contrib/poly2tri/poly2tri/sweep/sweep_context.h
diff options
context:
space:
mode:
Diffstat (limited to 'src/3rdparty/assimp/contrib/poly2tri/poly2tri/sweep/sweep_context.h')
-rw-r--r--src/3rdparty/assimp/contrib/poly2tri/poly2tri/sweep/sweep_context.h32
1 files changed, 16 insertions, 16 deletions
diff --git a/src/3rdparty/assimp/contrib/poly2tri/poly2tri/sweep/sweep_context.h b/src/3rdparty/assimp/contrib/poly2tri/poly2tri/sweep/sweep_context.h
index 1010c0e8a..ba0d06581 100644
--- a/src/3rdparty/assimp/contrib/poly2tri/poly2tri/sweep/sweep_context.h
+++ b/src/3rdparty/assimp/contrib/poly2tri/poly2tri/sweep/sweep_context.h
@@ -52,47 +52,47 @@ class SweepContext {
public:
/// Constructor
-SweepContext(std::vector<Point*> polyline);
+SweepContext(const std::vector<Point*>& polyline);
/// Destructor
~SweepContext();
void set_head(Point* p1);
-Point* head();
+Point* head() const;
void set_tail(Point* p1);
-Point* tail();
+Point* tail() const;
-int point_count();
+size_t point_count() const;
-Node& LocateNode(Point& point);
+Node& LocateNode(const Point& point);
void RemoveNode(Node* node);
-void CreateAdvancingFront(std::vector<Node*> nodes);
+void CreateAdvancingFront(const std::vector<Node*>& nodes);
/// Try to map a node to all sides of this triangle that don't have a neighbor
void MapTriangleToNodes(Triangle& t);
void AddToMap(Triangle* triangle);
-Point* GetPoint(const int& index);
+Point* GetPoint(size_t index);
Point* GetPoints();
void RemoveFromMap(Triangle* triangle);
-void AddHole(std::vector<Point*> polyline);
+void AddHole(const std::vector<Point*>& polyline);
void AddPoint(Point* point);
-AdvancingFront* front();
+AdvancingFront* front() const;
void MeshClean(Triangle& triangle);
-std::vector<Triangle*> GetTriangles();
-std::list<Triangle*> GetMap();
+std::vector<Triangle*> &GetTriangles();
+std::list<Triangle*> &GetMap();
std::vector<Edge*> edge_list;
@@ -147,16 +147,16 @@ Point* tail_;
Node *af_head_, *af_middle_, *af_tail_;
void InitTriangulation();
-void InitEdges(std::vector<Point*> polyline);
+void InitEdges(const std::vector<Point*>& polyline);
};
-inline AdvancingFront* SweepContext::front()
+inline AdvancingFront* SweepContext::front() const
{
return front_;
}
-inline int SweepContext::point_count()
+inline size_t SweepContext::point_count() const
{
return points_.size();
}
@@ -166,7 +166,7 @@ inline void SweepContext::set_head(Point* p1)
head_ = p1;
}
-inline Point* SweepContext::head()
+inline Point* SweepContext::head() const
{
return head_;
}
@@ -176,7 +176,7 @@ inline void SweepContext::set_tail(Point* p1)
tail_ = p1;
}
-inline Point* SweepContext::tail()
+inline Point* SweepContext::tail() const
{
return tail_;
}