MonotoneMatrixSearchTraits


begin of advanced section  advanced  begin of advanced section

Definition

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.

Types

MonotoneMatrixSearchTraits::Value
The type of a matrix entry.

Operations

int m.number_of_columns () const returns the number of columns.

int m.number_of_rows () const returns the number of rows.

Entry m.operator() ( int row, int column) const
returns the entry at position (row, column).
Precondition: 
0 row < number_of_rows() and
0 column < number_of_columns().

void m.replace_column ( int old, int new)
replace column old with column number new.
Precondition: 
0 old, new < number_of_columns().

Matrix* m.extract_all_even_rows () const returns a new Matrix consisting of all rows of m with even index, (i.e. first row is row 0 of m, second row is row 2 of m etc.).
Precondition: number_of_rows() > 0.

void m.shrink_to_quadratic_size () deletes the rightmost columns, such that m becomes quadratic.
Precondition: 
number_of_columns() greater or equal number_of_rows().
Postcondition: 
number_of_rows() == number_of_columns().

Notes

Has Models

CGAL::Dynamic_matrix<M>

See Also

CGAL::monotone_matrix_search

end of advanced section  advanced  end of advanced section