|
CGAL 6.0 - dD Geometry Kernel
|
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). | |
| int Kernel_d::Linear_rank_d::operator() | ( | ForwardIterator | first, |
| ForwardIterator | last | ||
| ) |
computes the linear rank of the vectors in A = tuple [first,last).
| ForwardIterator | has Kernel_d::Vector_d as value type. |