mirror of https://github.com/CGAL/cgal
Fix some warnings
This commit is contained in:
parent
c97ce3ee55
commit
cec7c3dccc
|
|
@ -217,13 +217,13 @@ public:
|
|||
* \param position_vectors the vector of vector of signs. Each vector of positions describes a component.
|
||||
* \sa `Sign`
|
||||
*/
|
||||
Implicit_multi_domain_to_labeling_function_wrapper (const Function_vector& vf, const std::vector<std::vector<Sign> >& vps)
|
||||
: funcs(vf), bmasks(vps.size(), Bmask(funcs.size() * 2, false))
|
||||
Implicit_multi_domain_to_labeling_function_wrapper (const Function_vector& implicit_functions, const std::vector<std::vector<Sign> >& position_vectors)
|
||||
: funcs(implicit_functions), bmasks(position_vectors.size(), Bmask(funcs.size() * 2, false))
|
||||
{
|
||||
CGAL_assertion(funcs.size() != 0);
|
||||
|
||||
std::size_t mask_index = 0;
|
||||
for (std::vector<std::vector<Sign> >::const_iterator mask_iter = vps.begin(), mask_end_iter = vps.end();
|
||||
for (std::vector<std::vector<Sign> >::const_iterator mask_iter = position_vectors.begin(), mask_end_iter = position_vectors.end();
|
||||
mask_iter != mask_end_iter;
|
||||
++mask_iter)
|
||||
{
|
||||
|
|
@ -251,8 +251,8 @@ public:
|
|||
*
|
||||
* Position vectors are built automatically so that the union of components equals the union of the functions.
|
||||
*/
|
||||
Implicit_multi_domain_to_labeling_function_wrapper (const Function_vector& vf)
|
||||
: funcs(vf)
|
||||
Implicit_multi_domain_to_labeling_function_wrapper (const Function_vector& implicit_functions)
|
||||
: funcs(implicit_functions)
|
||||
{
|
||||
CGAL_assertion(funcs.size() != 0);
|
||||
|
||||
|
|
@ -282,13 +282,13 @@ public:
|
|||
* \param implicit_functions the vector of implicit functions.
|
||||
* \param position_strings the vector of strings. The strings contained in this vector must contain '+' or '-' only. Each string (vector of positions) describes a component.
|
||||
*/
|
||||
Implicit_multi_domain_to_labeling_function_wrapper (const Function_vector& vf, const std::vector<std::string>& vps)
|
||||
: funcs(vf), bmasks(vps.size(), Bmask(funcs.size() * 2, false))
|
||||
Implicit_multi_domain_to_labeling_function_wrapper (const Function_vector& implicit_functions, const std::vector<std::string>& position_strings)
|
||||
: funcs(implicit_functions), bmasks(position_strings.size(), Bmask(funcs.size() * 2, false))
|
||||
{
|
||||
CGAL_assertion(funcs.size() != 0);
|
||||
|
||||
std::size_t mask_index = 0;
|
||||
for (std::vector<std::string>::const_iterator mask_iter = vps.begin(), mask_end_iter = vps.end();
|
||||
for (std::vector<std::string>::const_iterator mask_iter = position_strings.begin(), mask_end_iter = position_strings.end();
|
||||
mask_iter != mask_end_iter;
|
||||
++mask_iter)
|
||||
{
|
||||
|
|
|
|||
|
|
@ -355,9 +355,9 @@ public:
|
|||
|
||||
|
||||
/**
|
||||
* Constructs a set of \ccc{n} points on the surface, and output them to
|
||||
* the output iterator \ccc{pts} whose value type is required to be
|
||||
* \ccc{std::pair<Points_3, Index>}.
|
||||
* Constructs a set of `n points on the surface, and output them to
|
||||
* the output iterator `pts` whose value type is required to be
|
||||
* `std::pair<Points_3, Index>`.
|
||||
*/
|
||||
struct Construct_initial_points
|
||||
{
|
||||
|
|
@ -386,9 +386,9 @@ public:
|
|||
|
||||
|
||||
/**
|
||||
* Returns true if point~\ccc{p} is in the domain. If \ccc{p} is in the
|
||||
* Returns true if point `p` is in the domain. If `p` is in the
|
||||
* domain, the parameter index is set to the index of the subdomain
|
||||
* including $p$. It is set to the default value otherwise.
|
||||
* including `p`. It is set to the default value otherwise.
|
||||
*/
|
||||
struct Is_in_domain
|
||||
{
|
||||
|
|
@ -411,12 +411,12 @@ public:
|
|||
typedef boost::mpl::vector<Segment_3, Ray_3, Line_3> Allowed_query_types;
|
||||
|
||||
/**
|
||||
* Returns true is the element \ccc{type} intersect properly any of the
|
||||
* Returns true is the element `type` intersect properly any of the
|
||||
* surface patches describing the either the domain boundary or some
|
||||
* subdomain boundary.
|
||||
* \ccc{Type} is either \ccc{Segment_3}, \ccc{Ray_3} or \ccc{Line_3}.
|
||||
* `Type` is either `Segment_3`, `Ray_3` or `Line_3`.
|
||||
* Parameter index is set to the index of the intersected surface patch
|
||||
* if \ccc{true} is returned and to the default \ccc{Surface_patch_index}
|
||||
* if `true` is returned and to the default `Surface_patch_index`
|
||||
* value otherwise.
|
||||
*/
|
||||
struct Do_intersect_surface
|
||||
|
|
@ -452,12 +452,12 @@ public:
|
|||
}
|
||||
|
||||
/**
|
||||
* Returns a point in the intersection of the primitive \ccc{type}
|
||||
* Returns a point in the intersection of the primitive `type`
|
||||
* with some boundary surface.
|
||||
* \ccc{Type1} is either \ccc{Segment_3}, \ccc{Ray_3} or \ccc{Line_3}.
|
||||
* The integer \ccc{dimension} is set to the dimension of the lowest
|
||||
* `Type1` is either `Segment_3`, `Ray_3` or `Line_3`.
|
||||
* The integer `dimension` is set to the dimension of the lowest
|
||||
* dimensional face in the input complex containing the returned point, and
|
||||
* \ccc{index} is set to the index to be stored at a mesh vertex lying
|
||||
* `index` is set to the index to be stored at a mesh vertex lying
|
||||
* on this face.
|
||||
*/
|
||||
struct Construct_intersection
|
||||
|
|
|
|||
Loading…
Reference in New Issue