CGAL 6.2 - dD Geometry Kernel

Loading...
Searching...
No Matches
List of all members
Kernel_d::Linear_rank_d Concept Reference
Reference Manual » Kernel Concept

## Definition

## Operations
A model of this concept must provide:
template<class ForwardIterator >
int | operator() (ForwardIterator first, ForwardIterator last)
| computes the linear rank of the vectors in `A = tuple [first,last)`.

## Member Function Documentation

## ◆ operator()()

template<class ForwardIterator >

int Kernel_d::Linear_rank_d::operator() | ( | ForwardIterator | first,
|  | ForwardIterator | last
| ) |  |

computes the linear rank of the vectors in `A = tuple [first,last)`.

Precondition
  \( A\) contains vectors of the same dimension \( d\).

Template Parameters

  ForwardIterator | has `Kernel_d::Vector_d` as value type.