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

Unify wording

This commit is contained in:
Andreas Fabri 2019-05-25 10:13:56 +02:00
parent f954b00063
commit 0ed700b30c
2 changed files with 13 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_2.h
View File

@ -691,17 +691,19 @@ Equivalent to `insert(p)`.
Vertex_handle push_back(const Point& p);
/*!
Inserts the points in the range `[first,last)` in the given order.
Returns the number of inserted points.
\pre The `value_type` of `InputIterator` is `Point`.
Inserts the points in the range `[first,last)` in the given order,
and returns the number of inserted points.
\tparam PointInputIterator must be an input iterator with value type `Point`.
*/
template < class InputIterator >
template < class PointInputIterator >
std::ptrdiff_t
insert(InputIterator first, InputIterator last);
insert(PointInputIterator first, PointInputIterator last);
/*!
inserts the points in the iterator range `[first,last)` in the given order. Returns the number of inserted points.
inserts the points in the iterator range `[first,last)` in the given order,
and returns the number of inserted points.
Given a pair `(p,i)`, the vertex `v` storing `p` also stores `i`, that is
`v.point() == p` and `v.info() == i`. If several pairs have the same point,

12
Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h
View File

@ -905,10 +905,9 @@ Vertex_handle insert(const Point & p, Locate_type lt,
Cell_handle loc, int li, int lj);
/*!
Inserts the points in the range `[first,last)`. Returns the number of inserted points.
Note that this function is not guaranteed to insert the points
following the order of `InputIterator`.
\tparam PointInputIterator must be an input iterator with value type `Point`.
Inserts the points in the range `[first,last)` in the given order,
and returns the number of inserted points.
*/
template < class PointInputIterator >
std::ptrdiff_t
@ -916,9 +915,8 @@ insert(PointInputIterator first, PointInputIterator last);
/*!
Inserts the points in the iterator range `[first,last)`.
Returns the number of inserted points.
Inserts the points following the order of `PointWithInfoInputIterator`.
Inserts the points in the iterator range `[first,last)` in the given order,
and returns the number of inserted points.
Given a pair `(p,i)`, the vertex `v` storing `p` also stores `i`, that is
`v.point() == p` and `v.info() == i`. If several pairs have the same point,