CGAL 4.7 - Monotone and Sorted Matrix Search
SortedMatrixSearchTraits Concept Reference

## Definition

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 CGAL::sorted_matrix_search.

Has Models:
CGAL::Sorted_matrix_search_traits_adaptor<F,M>
CGAL::sorted_matrix_search()
BasicMatrix

## Types

typedef unspecified_type Matrix
The class used for representing matrices. More...

typedef Matrix::Value Value
The class used for representing the matrix elements.

typedef unspecified_type Compare_strictly
An adaptable binary function class: Value $$\times$$ Value $$\rightarrow$$ bool defining a non-reflexive total order on Value. More...

typedef unspecified_type Compare_non_strictly
An adaptable binary function class: Value $$\times$$ Value $$\rightarrow$$ bool defining the reflexive total order on Value corresponding to Compare_strictly.

## 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)
The predicate to determine whether an element a is feasible. More...

## Member Typedef Documentation

An adaptable binary function class: Value $$\times$$ Value $$\rightarrow$$ bool defining a non-reflexive total order on Value.

This determines the direction of the search.

The class used for representing matrices.

It has to be a model for BasicMatrix.

## Member Function Documentation

 bool SortedMatrixSearchTraits::is_feasible ( const Value & a)

The predicate to determine whether an element a is feasible.

It has to be monotone in the sense that compare(a, b) and is_feasible(a) imply is_feasible(b).