45 for (
int i= 0;
i <
l.length();
i++,
k++)
52 ASSERT (
j > 1,
"j > 1 expected" );
82 if (degPat.
find ((*
this)[
i]))
117 pos= (*this).find (d - (*
this)[
i]);
This file provides a class to handle degree patterns.
#define ASSERT(expression, message)
#define GaloisFieldDomain
Interface to generate InternalCF's over various domains from intrinsic types or mpz_t's.
Iterators for CanonicalForm's.
class to iterate through CanonicalForm's
DegreePattern provides a functionality to create, intersect and refine degree patterns.
struct DegreePattern::Pattern * m_data
int find(const int x) const
find an element x
void intersect(const DegreePattern °Pat)
intersect two degree patterns
int getLength() const
getter
void refine()
Refine a degree pattern. Assumes that (*this)[0]:= d is the degree of the poly to be factored....
void init(int n)
initialise a DegreePattern
DegreePattern()
default constructor
factory's class for variables
some useful template functions.
template CanonicalForm tmin(const CanonicalForm &, const CanonicalForm &)
Operations in GF, where GF is a finite field of size less than 2^16 represented by a root of Conway p...
static BOOLEAN length(leftv result, leftv arg)
int status int void size_t count
int status int void * buf