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

Fix some bad links

This commit is contained in:
Mael Rouxel-Labbé 2019-03-15 21:14:17 +01:00
parent a6af52755a
commit 61b0be45eb
2 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
Triangulation_2/doc/Triangulation_2/CGAL/Regular_triangulation_2.h
View File

@ -242,7 +242,7 @@ before the insertions (it may be negative due to hidden points).
Note that this function is not guaranteed to insert the weighted points Note that this function is not guaranteed to insert the weighted points
following the order of `InputIterator`, as `spatial_sort()` following the order of `InputIterator`, as `spatial_sort()`
is used to improve efficiency. is used to improve efficiency.
\tparam InputIterator must be an input iterator with the value type `Weighted_point`. \tparam InputIterator must be an input iterator with the value type \link Regular_triangulation_2::Weighted_point `Weighted_point` \endlink.
*/ */
template < class InputIterator > template < class InputIterator >
std::ptrdiff_t std::ptrdiff_t
@ -260,8 +260,8 @@ Given a pair `(p,i)`, the vertex `v` storing `p` also stores `i`, that is
only one vertex is created, one of the objects of type `Vertex::Info` will be stored in the vertex. only one vertex is created, one of the objects of type `Vertex::Info` will be stored in the vertex.
\pre `Vertex` must be model of the concept `TriangulationVertexBaseWithInfo_2`. \pre `Vertex` must be model of the concept `TriangulationVertexBaseWithInfo_2`.
\tparam WeightedPointWithInfoInputIterator must be an input iterator with value type `std::pair<Weighted_point,Vertex::Info>`. \tparam WeightedPointWithInfoInputIterator must be an input iterator with value type
`std::pair<%Weighted_point,Vertex::Info>`.
*/ */
template < class WeightedPointWithInfoInputIterator > template < class WeightedPointWithInfoInputIterator >
std::ptrdiff_t std::ptrdiff_t

4
Triangulation_3/doc/Triangulation_3/CGAL/Regular_triangulation_3.h
View File

@ -103,7 +103,7 @@ Regular_triangulation_3(const Regular_triangulation_3 & rt1);
Equivalent to constructing an empty triangulation with the optional Equivalent to constructing an empty triangulation with the optional
traits class argument and calling `insert(first,last)`. traits class argument and calling `insert(first,last)`.
If parallelism is enabled, the points will be inserted in parallel. If parallelism is enabled, the points will be inserted in parallel.
\tparam InputIterator must be an input iterator with value type `Weighted_point`. \tparam InputIterator must be an input iterator with value type \link Regular_triangulation_3::Weighted_point `Weighted_point` \endlink.
*/ */
template < class InputIterator > template < class InputIterator >
Regular_triangulation_3 (InputIterator first, InputIterator last, Regular_triangulation_3 (InputIterator first, InputIterator last,
@ -176,7 +176,7 @@ following the order of `InputIterator`, as `spatial_sort()`
is used to improve efficiency. is used to improve efficiency.
If parallelism is enabled, the points will be inserted in parallel. If parallelism is enabled, the points will be inserted in parallel.
\tparam InputIterator must be an input iterator with value type `Weighted_point`. \tparam InputIterator must be an input iterator with value type \link Regular_triangulation_3::Weighted_point `Weighted_point` \endlink.
*/ */
template < class InputIterator > template < class InputIterator >
std::ptrdiff_t std::ptrdiff_t