phynexis-deps/cgal
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Remove the last remnants of \require and turn them into \requires

Browse Source
This commit is contained in:
Philipp Möller
2012-10-01 14:56:32 +00:00
parent b240d7e8d5
commit 33cd9af6cd
17 changed files with 42 additions and 37 deletions
Download Patch File Download Diff File Expand all files Collapse all files
Spatial_sorting/doc/Spatial_sorting/CGAL/Hilbert_sort_2.h
+1 -1
View File
@@ -32,7 +32,7 @@ Hilbert_sort_2(const Traits &traits = Traits());
/*!
sorts the range [`begin`, `end`).
\require `RandomAccessIterator::value_type` equals to `Traits::Point_2`.
\requires `RandomAccessIterator::value_type` equals to `Traits::Point_2`.
*/
template <class RandomAccessIterator> void operator() (RandomAccessIterator begin, RandomAccessIterator end) const;
Spatial_sorting/doc/Spatial_sorting/CGAL/Hilbert_sort_3.h
+1 -1
View File
@@ -31,7 +31,7 @@ Hilbert_sort_3(const Traits &traits = Traits());
/*!
sorts the range [`begin`, `end`).
\require `RandomAccessIterator::value_type` equals to `Traits::Point_3`.
\requires `RandomAccessIterator::value_type` equals to `Traits::Point_3`.
*/
template <class RandomAccessIterator> void operator() (RandomAccessIterator begin, RandomAccessIterator end) const;
Spatial_sorting/doc/Spatial_sorting/CGAL/Hilbert_sort_d.h
+1 -1
View File
@@ -31,7 +31,7 @@ Hilbert_sort_d(const Traits &traits = Traits());
/*!
sorts the range [`begin`, `end`).
\require `RandomAccessIterator::value_type` equals to `Traits::Point_d`.
\requires `RandomAccessIterator::value_type` equals to `Traits::Point_d`.
*/
template <class RandomAccessIterator> void operator() (RandomAccessIterator begin, RandomAccessIterator end) const;
Spatial_sorting/doc/Spatial_sorting/CGAL/Multiscale_sort.h
+1 -1
View File
@@ -31,7 +31,7 @@ Multiscale_sort (const Sort &sort = Sort(), std::ptrdiff_t threshold = 1, double
/*!
sorts the range [`begin`, `end`).
\require `Sort::operator()(RandomAccessIterator begin, RandomAccessIterator end)` is defined.
\requires `Sort::operator()(RandomAccessIterator begin, RandomAccessIterator end)` is defined.
*/
template <class RandomAccessIterator> void operator() (RandomAccessIterator begin, RandomAccessIterator end) const;