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

i.e.; linking

This commit is contained in:
Andreas Fabri 2012-10-03 06:59:53 +00:00
parent 8362a1a452
commit 18b8db4e20
3 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
Matrix_search/doc/Matrix_search/CGAL/Sorted_matrix_search_traits_adaptor.h
View File

@ -6,12 +6,12 @@ namespace CGAL {
The class `Sorted_matrix_search_traits_adaptor` can be used The class `Sorted_matrix_search_traits_adaptor` can be used
as an adaptor to create sorted matrix search traits classes for as an adaptor to create sorted matrix search traits classes for
arbitrary feasibility test and matrix classes `F` resp. `M`. arbitrary feasibility test and matrix classes `F` resp.\ `M`.
\models ::SortedMatrixSearchTraits \models ::SortedMatrixSearchTraits
\requires `M` is a model for `BasicMatrix` \tparam `M` must be a model for `BasicMatrix`
\requires `F` defines a copy constructor and a monotone `bool operator()( const Value&)`. \tparam `F` must define a copy constructor and a monotone `bool operator()( const Value&)`.
*/ */
template< typename F, typename M > template< typename F, typename M >

2
Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h
View File

@ -7,7 +7,7 @@
The concept `MonotoneMatrixSearchTraits` is a refinement of The concept `MonotoneMatrixSearchTraits` is a refinement of
`BasicMatrix` and defines types and operations needed to `BasicMatrix` and defines types and operations needed to
compute the maxima for all rows of a totally monotone matrix using compute the maxima for all rows of a totally monotone matrix using
the function `monotone_matrix_search`. the function `CGAL::monotone_matrix_search`.
### Notes ### ### Notes ###

2
Matrix_search/doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h
View File

@ -6,7 +6,7 @@
The concept `SortedMatrixSearchTraits` defines types and operations The concept `SortedMatrixSearchTraits` defines types and operations
needed to compute the smallest entry in a set of sorted matrices needed to compute the smallest entry in a set of sorted matrices
that fulfills a certain feasibility criterion using the function that fulfills a certain feasibility criterion using the function
`sorted_matrix_search`. `CGAL::sorted_matrix_search`.
\hasModel `CGAL::Sorted_matrix_search_traits_adaptor<F,M>` \hasModel `CGAL::Sorted_matrix_search_traits_adaptor<F,M>`