songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

changed int to size_t for pairings

This commit is contained in:
POUGET Marc 2025-03-18 10:38:56 +01:00
parent 388cf8bb54
commit 49230bdd5b
2 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
Triangulation_on_hyperbolic_surface_2/include/CGAL/Hyperbolic_fundamental_domain_2.h
View File

@ -43,7 +43,7 @@ public:
Hyperbolic_fundamental_domain_2(PointRange & vertices, PairingRange & pairings) Hyperbolic_fundamental_domain_2(PointRange & vertices, PairingRange & pairings)
{ {
_vertices = std::vector<Point>(vertices.begin(), vertices.end()); _vertices = std::vector<Point>(vertices.begin(), vertices.end());
_pairings = std::vector<int>(pairings.begin(), pairings.end()); _pairings = std::vector<std::size_t>(pairings.begin(), pairings.end());
} }
// returns the number of vertices (equivalently, the number of sides) // returns the number of vertices (equivalently, the number of sides)
@ -65,7 +65,7 @@ public:
private: private:
std::vector<Point> _vertices; std::vector<Point> _vertices;
std::vector<int> _pairings; std::vector<std::size_t> _pairings;
}; };
//template<class Traits> std::ostream& operator<<(std::ostream& s, const Hyperbolic_fundamental_domain_2<Traits>& domain); //template<class Traits> std::ostream& operator<<(std::ostream& s, const Hyperbolic_fundamental_domain_2<Traits>& domain);
@ -197,7 +197,7 @@ is_valid()const
} }
for (std::size_t k=0; k<n; ++k) { for (std::size_t k=0; k<n; ++k) {
std::size_t paired_side = _pairings[k]; std::size_t paired_side = _pairings[k];
if ((paired_side<0) || (paired_side>=n)) { if (paired_side>=n) {
return false; return false;
} }
if (already_paired[paired_side]) { if (already_paired[paired_side]) {

2
Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_domain.cpp
View File

@ -39,7 +39,7 @@ int main()
vertices.push_back(z6); vertices.push_back(z6);
vertices.push_back(z7); vertices.push_back(z7);
std::vector<int> pairings; std::vector<std::size_t> pairings;
for (std::size_t k=0; k<8; ++k) { for (std::size_t k=0; k<8; ++k) {
pairings.push_back((k+4)%8); pairings.push_back((k+4)%8);
} }