\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.6.1 - dD Geometry Kernel
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
List of all members
Kernel_d::Linear_rank_d Concept Reference
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). More...
 

Member Function Documentation

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\).
Requires:
The value type of ForwardIterator is Kernel_d::Vector_d.