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

polish Profiling Tools ...

This commit is contained in:
Andreas Fabri 2012-11-22 12:07:12 +01:00
parent c0a82ae2d5
commit 008ba8a171
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Miscellany/doc/Miscellany/CGAL/Union_find.h
View File

@ -99,13 +99,13 @@ containing `x` and returns a handle to it.
handle make_set(const T& x);
/*!
same as `make_set(x)`.
same as `make_set()`.
*/
handle push_back(const T& x) ;
/*!
inserts the range of values referenced by `[first,beyond)`.
\cgalRequires value type of `Forward_iterator` is `T`.
\tparam Forward_iterator must be a forward iterator with value type `T`.
*/
template <class Forward_iterator> void
insert(Forward_iterator first, Forward_iterator beyond) ;

2
Miscellany/doc/Miscellany/CGAL/Unique_hash_map.h
View File

@ -30,7 +30,7 @@ rehashing when set to the number of expected elements in the map.
The design is derived from the \stl `hash_map` and the \leda type
`map`. Its specialization on insertion only and unique hash values
allow for a more time- and space-efficient implementation, see also
[\cite mn-lpcgc-00 Chapter 5. This implementation makes also use
\cite mn-lpcgc-00, Chapter 5. This implementation makes also use
of sentinels that lead to defined keys that have not been inserted.
*/