From 18b8db4e20ccfcd0db5b94a53387a5dea1105d5b Mon Sep 17 00:00:00 2001 From: Andreas Fabri Date: Wed, 3 Oct 2012 06:59:53 +0000 Subject: [PATCH] i.e.; linking --- .../CGAL/Sorted_matrix_search_traits_adaptor.h | 6 +++--- .../doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h | 2 +- .../doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h | 2 +- 3 files changed, 5 insertions(+), 5 deletions(-) diff --git a/Matrix_search/doc/Matrix_search/CGAL/Sorted_matrix_search_traits_adaptor.h b/Matrix_search/doc/Matrix_search/CGAL/Sorted_matrix_search_traits_adaptor.h index 3ecdc88e140..0d01ef1970a 100644 --- a/Matrix_search/doc/Matrix_search/CGAL/Sorted_matrix_search_traits_adaptor.h +++ b/Matrix_search/doc/Matrix_search/CGAL/Sorted_matrix_search_traits_adaptor.h @@ -6,12 +6,12 @@ namespace CGAL { The class `Sorted_matrix_search_traits_adaptor` can be used 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 -\requires `M` is a model for `BasicMatrix` -\requires `F` defines a copy constructor and a monotone `bool operator()( const Value&)`. +\tparam `M` must be a model for `BasicMatrix` +\tparam `F` must define a copy constructor and a monotone `bool operator()( const Value&)`. */ template< typename F, typename M > diff --git a/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h b/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h index e5b3d5e5de0..391f49b5df3 100644 --- a/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h +++ b/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h @@ -7,7 +7,7 @@ The concept `MonotoneMatrixSearchTraits` is a refinement of `BasicMatrix` and defines types and operations needed to compute the maxima for all rows of a totally monotone matrix using -the function `monotone_matrix_search`. +the function `CGAL::monotone_matrix_search`. ### Notes ### diff --git a/Matrix_search/doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h b/Matrix_search/doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h index e0781adadda..e0f1f037bb6 100644 --- a/Matrix_search/doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h +++ b/Matrix_search/doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h @@ -6,7 +6,7 @@ The concept `SortedMatrixSearchTraits` defines types and operations needed to compute the smallest entry in a set of sorted matrices that fulfills a certain feasibility criterion using the function -`sorted_matrix_search`. +`CGAL::sorted_matrix_search`. \hasModel `CGAL::Sorted_matrix_search_traits_adaptor`