![]() |
#include <kernel/mod2.h>
#include <omalloc/omalloc.h>
#include <misc/intvec.h>
#include <misc/options.h>
#include <polys/monomials/p_polys.h>
#include <polys/kbuckets.h>
#include <kernel/structs.h>
#include <kernel/ideals.h>
#include <kernel/GBEngine/syz.h>
#include <kernel/GBEngine/kutil.h>
#include <kernel/GBEngine/kstd1.h>
#include <kernel/polys.h>
#include "myNF.h"
#include <polys/nc/sca.h>
#include <polys/nc/nc.h>
#include <kernel/GBEngine/nc.h>
Go to the source code of this file.
Macros | |
#define | PLURAL_INTERNAL_DECLARATIONS 1 |
Functions | |
BEGIN_NAMESPACE () static poly redNFLength(poly h | |
reduction procedure for the normal form, which uses pLength instead of pSize! More... | |
int int kStrategy strat | if (h==NULL) return NULL |
if (0 > strat->sl) | |
LObject | P (h) |
P | SetShortExpVector () |
kBucketInit (P.bucket, P.p, pLength(P.p)) | |
kbTest (P.bucket) | |
if (TEST_OPT_DEBUG) | |
if (j >=0) | |
pNormalize (P.p) | |
poly | kNF2Length (ideal F, ideal Q, poly q, kStrategy strat, int lazyReduce) |
END_NAMESPACE BEGIN_NAMESPACE_SINGULARXX | BEGIN_NAMESPACE (NF) poly kNFLength(ideal F |
if (rIsSCA(currRing)) | |
if ((idIs0(F))&&(Q==NULL)) | |
if (rHasLocalOrMixedOrdering(currRing)==-1) res | |
delete (strat) | |
if (pp!=p) p_Delete(&pp | |
Variables | |
int & | max_ind =strat->sl |
int int | nonorm |
int | j |
P | bucket = kBucketCreate(currRing) |
BOOLEAN | is_ring = rField_is_Ring(currRing) |
loop | |
else | |
kBucketDestroy & | P |
return P | p |
END_NAMESPACE BEGIN_NAMESPACE_SINGULARXX ideal | Q |
END_NAMESPACE BEGIN_NAMESPACE_SINGULARXX ideal poly int | syzComp = syzComp |
END_NAMESPACE BEGIN_NAMESPACE_SINGULARXX ideal poly int int | lazyReduce |
poly | pp = p |
kStrategy | strat =new skStrategy |
strat | ak = si_max(id_RankFreeModule(F, currRing),pMaxComp(p)) |
poly | res =kNF2Length(F,Q,pp,strat,lazyReduce) |
currRing | |
Widely used global variable which specifies the current polynomial ring for Singular interpreter and legacy implementatins. : one should avoid using it in newer designs, for example due to possible problems in parallelization with threads. More... | |
BEGIN_NAMESPACE | ( | ) |
reduction procedure for the normal form, which uses pLength instead of pSize!
END_NAMESPACE BEGIN_NAMESPACE_SINGULARXX BEGIN_NAMESPACE | ( | NF | ) |
delete | ( | strat | ) |
if | ( | 0 | , |
strat-> | sl | ||
) |
if | ( | TEST_OPT_DEBUG | ) |
if | ( | j >= | 0 | ) |
Definition at line 100 of file myNF.cc.
Definition at line 299 of file myNF.cc.
if | ( | rHasLocalOrMixedOrdering(currRing) | = =-1 | ) |
if | ( | pp! | = p | ) |
kbTest | ( | P. | bucket | ) |
Definition at line 212 of file myNF.cc.
pNormalize | ( | P. | p | ) |
P SetShortExpVector | ( | ) |
P bucket = kBucketCreate(currRing) |
currRing |
else |
BOOLEAN is_ring = rField_is_Ring(currRing) |
END_NAMESPACE BEGIN_NAMESPACE_SINGULARXX ideal poly int int lazyReduce |
loop |
else res =kNF2Length(F,Q,pp,strat,lazyReduce) |
kStrategy strat =new skStrategy |