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

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Type Requirements

Class CGAL::Dynamic_matrix< M >
  `M` is a model for `BasicMatrix`.
Member CGAL::monotone_matrix_search (const Matrix &m, RandomAccessIC t, const Compare_strictly &compare_strictly=less< Matrix::Value >())

  `Matrix` is a model for `MonotoneMatrixSearchTraits`.

  Value type of `RandomAccessIC` is `int`.

  If `compare_strictly` is defined, it is an adaptable binary function: `Matrix::Value` \( \times\) `Matrix::Value` \( \rightarrow\) `bool` describing a strict (non-reflexive) total ordering on `Matrix::Value`.

Member CGAL::sorted_matrix_search (RandomAccessIterator f, RandomAccessIterator l, const Traits &t)

  `Traits` is a model for `SortedMatrixSearchTraits`.

  Value type of `RandomAccessIterator` is `Traits::Matrix`.