My Project
|
definition of class CFMap. More...
#include "config.h"
#include "canonicalform.h"
#include "cf_map.h"
#include "cf_iter.h"
#include "templates/ftmpl_functions.h"
Go to the source code of this file.
Functions | |
static int | cmpfunc (const MapPair &p1, const MapPair &p2) |
static int cmpfunc ( const MapPair & p1, const MapPair & p2 ) More... | |
static void | insfunc (MapPair &orgp, const MapPair &newp) |
static void insfunc ( MapPair & orgp, const MapPair & newp ) More... | |
static CanonicalForm | subsrec (const CanonicalForm &f, const MPListIterator &i) |
static CanonicalForm subsrec ( const CanonicalForm & f, const MPListIterator & i ) More... | |
CanonicalForm | compress (const CanonicalForm &f, CFMap &m) |
CanonicalForm compress ( const CanonicalForm & f, CFMap & m ) More... | |
void | compress (const CFArray &a, CFMap &M, CFMap &N) |
void compress ( const CFArray & a, CFMap & M, CFMap & N ) More... | |
static void | optvalues (const int *df, const int *dg, const int n, int &p1, int &pe) |
void | compress (const CanonicalForm &f, const CanonicalForm &g, CFMap &M, CFMap &N) |
void compress ( const CanonicalForm & f, const CanonicalForm & g, CFMap & M, CFMap & N ) More... | |
CanonicalForm compress | ( | const CanonicalForm & | f, |
CFMap & | m | ||
) |
CanonicalForm compress ( const CanonicalForm & f, CFMap & m )
compress() - compress the canonical form f.
Compress the polynomial f such that the levels of its polynomial variables are ordered without any gaps starting from level 1. Return the compressed polynomial and a map m to undo the compression. That is, if f' = compress(f, m), than f = m(f').
Definition at line 210 of file cf_map.cc.
void compress | ( | const CanonicalForm & | f, |
const CanonicalForm & | g, | ||
CFMap & | M, | ||
CFMap & | N | ||
) |
void compress ( const CanonicalForm & f, const CanonicalForm & g, CFMap & M, CFMap & N )
compress() - compress the variables occurring in f and g with respect to optimal variables
Compress the polynomial variables occurring in f and g so that the levels of variables common to f and g are ordered without any gaps starting from level 1, whereas the variables occuring in only one of f or g are moved to levels higher than the levels of the common variables. Return the CFMap M to realize the compression and its inverse, the CFMap N. N needs only variables common to f and g.
Definition at line 349 of file cf_map.cc.
void compress ( const CFArray & a, CFMap & M, CFMap & N )
compress() - compress the variables occuring in an a.
Compress the polynomial variables occuring in a so that their levels are ordered without any gaps starting from level 1. Return the CFMap M to realize the compression and its inverse, the CFMap N. Note that if you compress a member of a using M the result of the compression is not necessarily compressed, since the map is constructed using all variables occuring in a.
Definition at line 245 of file cf_map.cc.
|
static |
static CanonicalForm subsrec ( const CanonicalForm & f, const MPListIterator & i )
subsrec() - recursively apply the substitutions in i to f.
Substitutes algebraic variables, too. The substituted expression are not subject to further substitutions.
Used by: CFMap::operator ()().
Definition at line 136 of file cf_map.cc.