\( \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.11.2 - dD Geometry Kernel
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
List of all members
Kernel_d::Less_or_equal_lexicographically_d Concept Reference
Kernel Concept

Definition

Operations

A model of this concept must provide:

bool operator() (const Kernel_d::Point_d &p, const Kernel_d::Point_d &q)
 returns true iff \( p\) is lexicographically smaller than \( q\) with respect to Cartesian lexicographic order of points or equal to \( q\). More...
 

Member Function Documentation

bool Kernel_d::Less_or_equal_lexicographically_d::operator() ( const Kernel_d::Point_d &  p,
const Kernel_d::Point_d &  q 
)

returns true iff \( p\) is lexicographically smaller than \( q\) with respect to Cartesian lexicographic order of points or equal to \( q\).

Precondition
p and q have the same dimension.