\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.13 - Monotone and Sorted Matrix Search
CGAL::Sorted_matrix_search_traits_adaptor< F, M > Class Template Reference

#include <CGAL/Sorted_matrix_search_traits_adaptor.h>


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.

Is Model Of:
Template Parameters
Mmust be a model for BasicMatrix
Fmust define a copy constructor and a monotone bool operator()( const Value&).


 Sorted_matrix_search_traits_adaptor (const F &m)
 initializes t to use m for feasibility testing.


typedef M Matrix
 typedef to M.
typedef Matrix::Value Value
 typedef to Matrix::Value.
typedef std::less< ValueCompare_strictly
 typedef to std::less<Value>.
typedef std::less_equal< ValueCompare_non_strictly
 typedef to std::less_equal<Value>.


Compare_strictly compare_strictly () const
 returns the Compare_strictly object to be used for the search.
Compare_non_strictly compare_non_strictly () const
 returns the Compare_non_strictly object to be used for the search.
bool is_feasible (const Value &a)
 uses the feasibility test given during creation.