mirror of https://github.com/CGAL/cgal
stylistic changes
This commit is contained in:
parent
4d012423ea
commit
32a3325f07
|
|
@ -6,18 +6,25 @@ Computes whether the given univariate polynomial is square free.
|
|||
\ccRefines
|
||||
\ccc{AdaptableUnaryFunction}
|
||||
|
||||
\ccTypes
|
||||
\ccThree{typedef AlgebraicKernel_d_1::Polynomial_1}{argument_type+}{}
|
||||
\ccTypedef{typedef bool result_type;}{}
|
||||
\ccGlue
|
||||
\ccTypedef{typedef AlgebraicKernel_d_1::Polynomial_1 argument_type;}{}
|
||||
|
||||
A model of this type must provide:
|
||||
|
||||
\ccOperations
|
||||
\ccCreationVariable{fo}
|
||||
\ccThree{xxxxxxxxxxx}{xxxxxxxxxxx}{}
|
||||
\ccThree{xxxxxxxxxxx}{xxxxxxxxxxxxxxxxxxxxxxxxxxxx}{}
|
||||
|
||||
\ccMethod{bool
|
||||
operator()(AlgebraicKernel_d_1::Polynomial_1 p);}
|
||||
{}
|
||||
\ccMethod{result_type operator()(argument_type p);}
|
||||
{Returns true if \ccc{p} is square free.}
|
||||
|
||||
%\ccHasModels
|
||||
%\ccSeeAlso
|
||||
\ccSeeAlso
|
||||
\ccRefIdfierPage{AlgebraicKernel_d_1::MakeSquareFree_1}\\
|
||||
\ccRefIdfierPage{AlgebraicKernel_d_1::SquareFreeFactorize_1}\\
|
||||
|
||||
\end{ccRefConcept}
|
||||
|
||||
|
|
|
|||
|
|
@ -6,17 +6,24 @@ Returns a square free part of a univariate polynomial.
|
|||
\ccRefines
|
||||
\ccc{AdaptableUnaryFunction}
|
||||
|
||||
\ccTypes
|
||||
\ccThree{typedef AlgebraicKernel_d_1::Polynomial_1}{argument_type+}{}
|
||||
\ccTypedef{typedef AlgebraicKernel_d_1::Polynomial_1 result_type;}{}
|
||||
\ccGlue
|
||||
\ccTypedef{typedef AlgebraicKernel_d_1::Polynomial_1 argument_type;}{}
|
||||
|
||||
\ccOperations
|
||||
\ccCreationVariable{fo}
|
||||
\ccThree{xxxxxxxxxxx}{xxxxxxxxxxx}{}
|
||||
\ccThree{xxxxxxxxxxx}{xxxxxxxxxxxxxxxxxxxxxxxxxxxx}{}
|
||||
|
||||
A model \ccVar\ of this type must provide:
|
||||
|
||||
\ccMethod{AlgebraicKernel_d_1::Polynomial_1
|
||||
operator()(AlgebraicKernel_d_1::Polynomial_1 p);}
|
||||
\ccMethod{result_type operator()(argument_type p);}
|
||||
{}
|
||||
|
||||
%\ccHasModels
|
||||
%\ccSeeAlso
|
||||
\ccSeeAlso
|
||||
\ccRefIdfierPage{AlgebraicKernel_d_1::IsSquareFree_1}\\
|
||||
\ccRefIdfierPage{AlgebraicKernel_d_1::SquareFreeFactorize_1}\\
|
||||
|
||||
\end{ccRefConcept}
|
||||
|
|
|
|||
|
|
@ -17,18 +17,26 @@ The constant factor $a$ is not computed.
|
|||
\ccRefines
|
||||
\ccc{AdaptableBinaryFunction}
|
||||
|
||||
\ccTypes
|
||||
\ccThree{typedef AlgebraicKernel_d_1::Polynomial_1}{argument_type+}{}
|
||||
\ccTypedef{typedef int result_type;}{}
|
||||
\ccGlue
|
||||
\ccTypedef{typedef AlgebraicKernel_d_1::Polynomial_1 first_argument_type;}{}
|
||||
|
||||
\ccOperations
|
||||
\ccSetThreeColumns{xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx}{xxx}{}
|
||||
\ccCreationVariable{fo}
|
||||
|
||||
\ccMethod{template < class OutputIterator >
|
||||
int
|
||||
operator()(AlgebraicKernel_d_1::Polynomial_1,
|
||||
operator()(first_argument_type p,
|
||||
OutputIterator res);}
|
||||
{Copies in the output iterator the factors of a square-free
|
||||
factorization of \ccc{p}, with their multiplicity, as objects of type
|
||||
\ccc{std::pair< AlgebraicKernel_d_1::Polynomial_1, int>}.}
|
||||
\ccc{std::pair<AlgebraicKernel_d_1::Polynomial_1, int>}.}
|
||||
|
||||
\ccSeeAlso
|
||||
\ccRefIdfierPage{AlgebraicKernel_d_1::IsSquareFree_1}\\
|
||||
\ccRefIdfierPage{AlgebraicKernel_d_1::MakeSquareFree_1}\\
|
||||
|
||||
\end{ccRefConcept}
|
||||
|
|
|
|||
Loading…
Reference in New Issue