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

member function arr -> arrangement_2

This commit is contained in:
Michael Hemmer 2014-09-18 16:20:20 +02:00
parent c32e648edf
commit 9cb350eeed
6 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
Visibility_2/doc/Visibility_2/Concepts/Visibility_2.h
View File

@ -105,7 +105,7 @@ Detaches the arrangement from the visibility object it is currently attached to
/*!
Access to the attached arrangement
*/
const Arrangement_2& arr() const;
const Arrangement_2& arrangement_2() const;
/*!
Computes the visibility region for the given query point `q` in the
@ -120,7 +120,7 @@ must be mutual convertible to Visibility_2::Traits_2.
\param q is the query point
\param f is the face of the arrangement in which the visibility region is computed
\param out_arr is the output arrangement
\pre `f` is a face of `this->arr()`
\pre `f` is a face of `this->arrangement_2()`
\pre `q` is in the interior of the given face `f`
\return the face handle to the face in `out_arr` that represents interior of the visibility region
*/
@ -143,7 +143,7 @@ must be mutual convertible to Visibility_2::Traits_2.
\param q is the query point
\param e the halfedge on which `q` is located
\param out_arr is the output arrangement
\pre `e` is a halfedge of `this->arr()`
\pre `e` is a halfedge of `this->arrangement_2()`
\pre `q` is on `e`
\pre `q` equals to `e->target()->point()` if `q` is an endpoint of `e`
\return a handle to the face in `out_arr` that represents the interior of the visibility region

2
Visibility_2/include/CGAL/Preprocessed_rotational_sweep_visibility_2.h
View File

@ -70,7 +70,7 @@ public:
p_arr = NULL;
}
Input_Arrangement_2 arr() {
Input_Arrangement_2 arrangement_2()() {
return *p_arr;
}

2
Visibility_2/include/CGAL/Rotational_sweep_visibility_2.h
View File

@ -397,7 +397,7 @@ void detach() {
geom_traits = NULL;
}
const Arrangement_2& arr() {
const Arrangement_2& arrangement_2() {
return *p_arr;
}

2
Visibility_2/include/CGAL/Simple_polygon_visibility_2.h
View File

@ -105,7 +105,7 @@ public:
}
/*! Getter method for the input arrangement*/
const Arrangement_2& arr() {
const Arrangement_2& arrangement_2() {
return *p_arr;
}

2
Visibility_2/include/CGAL/Triangular_expansion_visibility_2.h
View File

@ -103,7 +103,7 @@ public:
p_cdt = boost::shared_ptr<CDT>();
}
const Arrangement_2& arr() {
const Arrangement_2& arrangement_2() {
return *p_arr;
}

2
Visibility_2/test/Visibility_2/include/CGAL/test_model_methods.h
View File

@ -48,7 +48,7 @@ void test_model_methods_for_arr(
assert(false == visibility.is_attached());
visibility.attach(arr);
assert(true == visibility.is_attached());
assert(true == (CGAL::test_are_equal(arr,visibility.arr())));
assert(true == (CGAL::test_are_equal(arr,visibility.arrangement_2())));
Visibility_arrangement_2 arr_out;
Visibility_arrangement_2 arr_out_check;