CGAL 5.1 - dD Geometry Kernel
Kernel_d::Linear_rank_d Class Reference

#include <Concepts/Kernel--Linear_rank_d.h>

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). More...
 

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
ForwardIteratorhas Kernel_d::Vector_d as value type.