permlib  0.2.6
Library for permutation computations
 All Classes Functions Variables Typedefs Enumerations Friends
Public Member Functions
permlib::LinearFormList Class Reference

a list of linear forms More...

#include <linear_form_list.h>

List of all members.

Public Member Functions

template<typename 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)

Detailed Description

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.


Member Function Documentation

template<typename Z >
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.

Parameters:
lthe set to evaluate
moduloPrimeif set, result is evaluated modulo 0xFFFFFFFBUL, the largest 32-bit prime
Returns:
returns the value of the invariant at $l or 1 if invariant is empty

The documentation for this class was generated from the following file: