\( \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.8 - Monotone and Sorted Matrix Search

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
List of all members
CGAL::Sorted_matrix_search_traits_adaptor< F, M > Class Template Reference
Monotone and Sorted Matrix Search Reference

`#include <CGAL/Sorted_matrix_search_traits_adaptor.h>`

## Definition

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:
  `SortedMatrixSearchTraits`

Template Parameters

  M | must be a model for `BasicMatrix`
  F | must define a copy constructor and a monotone `bool operator()( const Value&)`.

## Creation
| Sorted_matrix_search_traits_adaptor (const F &m)
| initializes `t` to use `m` for feasibility testing.

## Types
typedef M | Matrix
| typedef to `M`.
typedef Matrix::Value | Value
| typedef to `Matrix::Value`.
typedef std::less< Value > | Compare_strictly
| typedef to `std::less<Value>`.
typedef std::less_equal< Value > | Compare_non_strictly
| typedef to `std::less_equal<Value>`.

## Operations
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.