CGAL 4.7 - 2D and 3D Linear Geometry Kernel: Kernel::LessX_2 Concept Reference

$\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.7 - 2D and 3D Linear Geometry Kernel

•All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages

CGAL 4.7 - 2D and 3D Linear Geometry Kernel

Definition

Refines:: AdaptableFunctor (with two arguments)

See Also: CGAL::compare_x()

Operations
A model of this concept must provide:
bool	operator() (const Kernel::Point_2 &p, const Kernel::Point_2 &q)
	returns true iff the $x$ -coordinate of `p` is smaller than the $x$ -coordinate of `q`.