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

Mael review part 4

This commit is contained in:
POUGET Marc 2025-01-07 17:21:25 +01:00
parent 97520fc4b5
commit c7498783f6
5 changed files with 8 additions and 31 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
Hyperbolic_surface_triangulation_2/doc/Hyperbolic_surface_triangulation_2/CGAL/Hyperbolic_surface_triangulation_2.h
View File

@ -81,11 +81,6 @@ public:
*/
Hyperbolic_surface_triangulation_2(const Hyperbolic_fundamental_domain_2<Traits>& domain);
/*!
Constructor from a decorated combinatorial map.
*/
Hyperbolic_surface_triangulation_2(Combinatorial_map_with_cross_ratios& cmap);
/*!
Constructor from a decorated combinatorial map and an anchor.
*/
@ -104,8 +99,6 @@ public:
/// @{
/*!
returns the decorated combinatorial map.
\pre <code> is_valid() </code>
*/
Combinatorial_map_with_cross_ratios& combinatorial_map();
@ -121,14 +114,7 @@ public:
\pre <code> is_valid() && has_anchor() </code>
*/
Anchor& anchor();
/*!
returns the anchor.
\pre <code> is_valid() && has_anchor() </code>
*/
const Anchor& anchor() const;
Anchor& anchor() const;
/// @}

14
Hyperbolic_surface_triangulation_2/include/CGAL/Hyperbolic_surface_triangulation_2.h
View File

@ -72,7 +72,7 @@ public:
Hyperbolic_surface_triangulation_2() {};
Hyperbolic_surface_triangulation_2(const Hyperbolic_fundamental_domain_2<Traits>& domain);
Hyperbolic_surface_triangulation_2(Combinatorial_map_with_cross_ratios& cmap);
// Hyperbolic_surface_triangulation_2(Combinatorial_map_with_cross_ratios& cmap);
Hyperbolic_surface_triangulation_2(Combinatorial_map_with_cross_ratios& cmap, Anchor& anchor);
//Hyperbolic_surface_triangulation_2& operator=(Hyperbolic_surface_triangulation_2&& other);
@ -81,7 +81,7 @@ public:
Combinatorial_map_with_cross_ratios& combinatorial_map();
bool has_anchor() const;
Anchor& anchor();
const Anchor& anchor() const;
Anchor& anchor() const;
void to_stream(std::ostream& s) const;
void from_stream(std::istream& s);
@ -203,10 +203,10 @@ Hyperbolic_surface_triangulation_2<Traits,Attributes>::Hyperbolic_surface_triang
_has_anchor = true;
}
template<class Traits, class Attributes>
Hyperbolic_surface_triangulation_2<Traits, Attributes>::Hyperbolic_surface_triangulation_2(Combinatorial_map_with_cross_ratios& cmap){
copy_from(cmap);
}
/* template<class Traits, class Attributes> */
/* Hyperbolic_surface_triangulation_2<Traits, Attributes>::Hyperbolic_surface_triangulation_2(Combinatorial_map_with_cross_ratios& cmap){ */
/* copy_from(cmap); */
/* } */
template<class Traits, class Attributes>
Hyperbolic_surface_triangulation_2<Traits, Attributes>::Hyperbolic_surface_triangulation_2(Combinatorial_map_with_cross_ratios& cmap, Anchor& anchor){
@ -245,7 +245,7 @@ Hyperbolic_surface_triangulation_2<Traits, Attributes>::anchor() {
}
template<class Traits, class Attributes>
const typename Hyperbolic_surface_triangulation_2<Traits, Attributes>::Anchor&
typename Hyperbolic_surface_triangulation_2<Traits, Attributes>::Anchor&
Hyperbolic_surface_triangulation_2<Traits, Attributes>::anchor() const {
return _anchor;
}

3
Hyperbolic_surface_triangulation_2/test/Hyperbolic_surface_triangulation_2/hs_test_circular_kernel.cpp
View File

@ -27,9 +27,6 @@ int main() {
assert( triangulation0.is_valid() );
Triangulation triangulation1 = Triangulation(triangulation0.combinatorial_map());
assert( ! triangulation1.has_anchor() );
Triangulation triangulation (triangulation0);
assert( triangulation.has_anchor() );

3
Hyperbolic_surface_triangulation_2/test/Hyperbolic_surface_triangulation_2/hs_test_lazy_exact_nt.cpp
View File

@ -25,9 +25,6 @@ int main() {
assert( triangulation0.is_valid() );
Triangulation triangulation1 = Triangulation(triangulation0.combinatorial_map());
assert( ! triangulation1.has_anchor() );
Triangulation triangulation (triangulation0);
assert( triangulation.has_anchor() );

3
Hyperbolic_surface_triangulation_2/test/Hyperbolic_surface_triangulation_2/hs_test_triangulation.cpp
View File

@ -42,9 +42,6 @@ int main() {
assert( triangulation0.is_valid() );
Triangulation triangulation1 = Triangulation(triangulation0.combinatorial_map());
assert( ! triangulation1.has_anchor() );
Triangulation triangulation (triangulation0);
assert( triangulation.has_anchor() );