#include <Concepts/Kernel--Linear_rank_d.h>
|
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). More...
|
| |
◆ 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
-