Definition at line 74 of file fglmzero.cc.
◆ idealFunctionals()
idealFunctionals::idealFunctionals |
( |
int |
blockSize, |
|
|
int |
numFuncs |
|
) |
| |
◆ ~idealFunctionals()
idealFunctionals::~idealFunctionals |
( |
| ) |
|
Definition at line 115 of file fglmzero.cc.
116{
119 int row;
125 for ( row= colp->
size-1, elemp= colp->
elems; row >= 0; row--, elemp++ )
128 }
129 }
131 }
134}
#define omFreeSize(addr, size)
◆ addCols()
Definition at line 241 of file fglmzero.cc.
242{
248 int vsize =
v.size();
249
251 for (
k= 1, colp=
func[var-1];
k <= vsize;
k++, colp++ ) {
254 for (
l= colp->
size-1, elemp= colp->
elems;
l >= 0;
l--, elemp++ ) {
256 number newelem=
nAdd(
result.getconstelem( elemp->
row ), temp );
260 }
261 }
262 }
264}
const Variable & v
< [in] a sqrfree bivariate poly
#define fglmASSERT(ignore1, ignore2)
◆ dimen()
int idealFunctionals::dimen |
( |
| ) |
const |
|
inline |
◆ endofConstruction()
void idealFunctionals::endofConstruction |
( |
| ) |
|
◆ grow()
matHeader * idealFunctionals::grow |
( |
int |
var | ) |
|
|
private |
Definition at line 177 of file fglmzero.cc.
178{
184 }
187}
#define omReallocSize(addr, o_size, size)
◆ insertCols() [1/2]
Definition at line 210 of file fglmzero.cc.
211{
212
213 fglmASSERT( 0 < divisors[0] && divisors[0] <=
_nfunc,
"wrong number of divisors" );
219 if ( numElems > 0 ) {
221 for (
k= 1,
l= 1, elemp= elems;
k <= numElems;
k++, elemp++ ) {
226 }
227 }
228 else
230 for (
k= divisors[0];
k > 0;
k-- ) {
233 colp->
size= numElems;
237 }
238}
int numNonZeroElems() const
number getconstelem(int i) const
matHeader * grow(int var)
◆ insertCols() [2/2]
void idealFunctionals::insertCols |
( |
int * |
divisors, |
|
|
int |
to |
|
) |
| |
Definition at line 190 of file fglmzero.cc.
191{
192 fglmASSERT( 0 < divisors[0] && divisors[0] <=
_nfunc,
"wrong number of divisors" );
198 for (
k= divisors[0];
k > 0;
k-- ) {
205 }
206}
◆ map()
void idealFunctionals::map |
( |
ring |
source | ) |
|
Definition at line 143 of file fglmzero.cc.
144{
145
146 int var, col, row;
149 number newelem;
150
155
157 for ( var= 0; var <
_nfunc; var ++ ) {
158 for ( col= 0, colp=
func[var]; col <
_size; col++, colp++ ) {
160 for ( row= colp->
size-1, elemp= colp->
elems; row >= 0;
161 row--, elemp++ )
162 {
165 elemp->
elem= newelem;
166 }
167 }
168 }
169 temp[ perm[var+1]-1 ]=
func[var];
170 }
174}
static FORCE_INLINE nMapFunc n_SetMap(const coeffs src, const coeffs dst)
set the mapping function pointers for translating numbers from src to dst
number(* nMapFunc)(number a, const coeffs src, const coeffs dst)
maps "a", which lives in src, into dst
void maFindPerm(char const *const *const preim_names, int preim_n, char const *const *const preim_par, int preim_p, char const *const *const names, int n, char const *const *const par, int nop, int *perm, int *par_perm, n_coeffType ch)
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
◆ multiply()
Definition at line 267 of file fglmzero.cc.
268{
275 for (
k= 1, colp=
func[var-1];
k <=
_size;
k++, colp++ ) {
278 for (
l= colp->
size-1, elemp= colp->
elems;
l >= 0;
l--, elemp++ ) {
280 number newelem=
nAdd(
result.getconstelem( elemp->
row ), temp );
284 }
285 }
286 }
288}
◆ _block
int idealFunctionals::_block |
|
private |
◆ _max
int idealFunctionals::_max |
|
private |
◆ _nfunc
int idealFunctionals::_nfunc |
|
private |
◆ _size
int idealFunctionals::_size |
|
private |
◆ currentSize
int* idealFunctionals::currentSize |
|
private |
◆ func
The documentation for this class was generated from the following file: