permlib
0.2.6
Library for permutation computations
|
a list of linear forms More...
#include <linear_form_list.h>
Public Member Functions | |
template<typename Z > | |
Z | evaluate (const LinearForm &l, bool moduloPrime=true) const |
evaluates this invariant at a given (bit)set | |
void | add (const LinearForm &l) |
adds a linear form to the list | |
unsigned long | size () const |
number of elements in the list (equals the polynomial degree) |
a list of linear forms
For invariants generated by Dade's algorithm we store them as product of linear forms. The factors make up the list.
Z permlib::LinearFormList::evaluate | ( | const LinearForm & | l, |
bool | moduloPrime = true |
||
) | const |
evaluates this invariant at a given (bit)set
Data type of Z must support 64-bit multiplication. If moduloPrime is set additionally modulo operation is required.
l | the set to evaluate |
moduloPrime | if set, result is evaluated modulo 0xFFFFFFFBUL, the largest 32-bit prime |