CGAL 5.0 - Algebraic Kernel: AlgebraicKernel_d_1::IsSquareFree_1 Concept Reference

Loading [MathJax]/extensions/TeX/newcommand.js

$\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 5.0 - Algebraic Kernel

•All Classes Namespaces Files Functions Variables Typedefs Enumerations Friends Modules Pages

Definition

Computes whether the given univariate polynomial is square free.

Refines:: AdaptableUnaryFunction

See also: AlgebraicKernel_d_1::MakeSquareFree_1; AlgebraicKernel_d_1::SquareFreeFactorize_1

Types
A model of this type must provide:
typedef bool	result_type

typedef AlgebraicKernel_d_1::Polynomial_1	argument_type

Operations
result_type	operator() (argument_type p)
	Returns true if $p$ is square free.