 |
My Project
debian-1:4.1.1-p2+ds-4build2
|
Go to the documentation of this file.
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]);
class to iterate through CanonicalForm's
static BOOLEAN length(leftv result, leftv arg)
void init(int n)
initialise a DegreePattern
#define GaloisFieldDomain
#define ASSERT(expression, message)
int status int void * buf
struct DegreePattern::Pattern * m_data
void intersect(const DegreePattern °Pat)
intersect two degree patterns
template CanonicalForm tmin(const CanonicalForm &, const CanonicalForm &)
DegreePattern()
default constructor
int getLength() const
getter
factory's class for variables
int status int void size_t count
int find(const int x) const
find an element x
void refine()
Refine a degree pattern. Assumes that (*this)[0]:= d is the degree of the poly to be factored....