#include "config.h"
#include "cf_assert.h"
#include "cf_defs.h"
#include "canonicalform.h"
#include "cf_map.h"
#include "cf_algorithm.h"
#include "FLINTconvert.h"
Go to the source code of this file.
◆ compareFactors()
◆ sortCFFList()
Definition at line 25 of file fac_sqrfree.cc.
26{
28
33
34
35 while (
I.hasItem() ) {
36 f =
I.getItem().factor();
37 exp =
I.getItem().exp();
39 while (
I.hasItem() &&
I.getItem().exp() ==
exp ) {
40 f *=
I.getItem().factor();
42 }
44 }
45
47}
void sort(int(*)(const T &, const T &))
static int compareFactors(const CFFactor &f, const CFFactor &g)
gmp_float exp(const gmp_float &a)
◆ sqrfPart()
squarefree part of a poly
- Parameters
-
Definition at line 115 of file fac_sqrfree.cc.
116{
118 return F;
124 for (;
i <=
A.level();
i++)
125 {
127 break;
128 }
129
136 for (;
i <=
A.level();
i++)
137 {
139 {
144 break;
150 }
151 }
154}
CanonicalForm compress(const CanonicalForm &f, CFMap &m)
CanonicalForm compress ( const CanonicalForm & f, CFMap & m )
factory's class for variables
const Variable & v
< [in] a sqrfree bivariate poly
bool isZero(const CFArray &A)
checks if entries of A are zero
◆ sqrFreeZ()
Definition at line 49 of file fac_sqrfree.cc.
50{
55 {
58 }
59 else
60 {
65 }
74 while ( c.degree(
v) != 0 )
75 {
78 {
80 {
84 }
86 z= -z;
88 }
91 }
93 {
95 {
99 }
103 }
104 if ( !
cont.isOne() )
105 {
109 }
111 return F;
112}
CanonicalForm bCommonDen(const CanonicalForm &f)
CanonicalForm bCommonDen ( const CanonicalForm & f )
static const int SW_RATIONAL
set to 1 for computations over Q
const CanonicalForm int const CFList const Variable & y
CFFList sqrFreeZ(const CanonicalForm &a)
template List< Variable > Union(const List< Variable > &, const List< Variable > &)
int status int void * buf