78 typedef std::stack <sBucket_pt>
Base;
91 push ( _CreateBucket(
r) );
99 _DestroyBucket( top() );
119 bt = _CreateBucket(
r);
129 assume( _IsBucketEmpty(bt) );
130 assume(
r == _GetBucketRing(bt) );
139 assume( _IsBucketEmpty(bt) );
140 assume( m_ring == _GetBucketRing(bt) );
164 static ring _GetBucketRing(
const Bucket& bt);
166 static bool _IsBucketEmpty(
const Bucket& bt);
170 static Bucket _CreateBucket(
const ring
r);
174 static void _DestroyBucket(Bucket & bt);
275 bool CheckLT(
const ideal & L )
const;
279 unsigned long sev()
const;
280 unsigned int label()
const;
283 inline unsigned long sev()
const {
return m_sev; };
288 const unsigned long m_sev;
298 const poly m_lt_copy;
350 void DebugPrint()
const;
383 typedef std::map<TCacheKey, TCacheValue, CCacheCompare>
TP2PCache;
430 if (syzLeads !=
NULL)
619 return syz.
ReduceTerm(multiplier, term4reduction, syztermCheck);
Computation attribute storage.
CCacheCompare(const ring &r)
SchreyerSyzygyComputation(const ideal idLeads, const ideal idTails, const ideal syzLeads, const SchreyerSyzygyComputationFlags setting)
Construct a global object for given input data (separated into leads & tails)
const unsigned int m_label
index in the main L[] + 1
int OPT__SYZNUMBER
Syzygy level (within a resolution)
std::stack< sBucket_pt > Base
CCacheCompare(const CCacheCompare &lhs)
ideal m_syzLeads
output (syzygy) leading terms (+2nd terms?)
poly SchreyerSyzygyNF(const poly syz_lead, poly syz_2=NULL) const
Main HybridNF == 1: poly reduce + LOT + LCM?
const int OPT__HYBRIDNF
Use the usual NF's S-poly reduction while dropping lower order terms 2 means - smart selection! ...
const int OPT__SYZCHECK
CheckSyzygyProperty: TODO.
const ideal m_idLeads
input leading terms
SBucketFactory(const ring r)
ideal id_Copy(ideal h1, const ring r)
copy an ideal
void nextSyzygyLayer() const
const poly m_lt
the leading term itself L[label-1]
CReducerFinder(const ideal L, const SchreyerSyzygyComputationFlags &flags)
goes over all leading terms
std::vector< const CLeadingTerm * > TReducers
poly FindReducer(const poly multiplier, const poly monom, const poly syzterm, const CReducerFinder &checker) const
ideal m_LS
leading syzygy terms used for reducing syzygy tails
unsigned long sev() const
void PrintStats() const
print statistics about the used heuristics
ideal m_syzTails
output (syzygy) tails
#define UNLIKELY(expression)
#define LIKELY(expression)
kBucket_pt m_spoly_bucket
for S-Polynomial reductions
const int OPT__DEBUG
output all the intermediate states
CReducerFinder m_checker
for checking tail-terms and makeing them irreducible (wrt m_LS!)
~SchreyerSyzygyComputation()
Destructor should not destruct the resulting m_syzLeads, m_syzTails.
#define BEGIN_NAMESPACE_SINGULARXX
Bucket getBucket(const ring r, const bool remove=true)
ideal Compute2LeadingSyzygyTerms()
leading + second terms
poly ReduceTerm(poly multiplier, poly term4reduction, poly syztermCheck) const
TODO: save shortcut (syz: |-.->) LM(m) * "t" -> ? ???
const int OPT__TAILREDSYZ
Reduce syzygy tails wrt the leading syzygy terms.
void ComputeSyzygy()
The main driver function: computes.
poly TraverseNF(const poly syz_lead, const poly syz_2=NULL) const
CLCM(const ideal &L, const SchreyerSyzygyComputationFlags &flags)
bool CheckLT(const ideal &L) const
#define END_NAMESPACE_SINGULARXX
const bool OPT__PROT
TEST_OPT_PROT.
bool DivisibilityCheck(const poly multiplier, const poly t, const unsigned long not_sev, const ring r) const
as DivisibilityCheck(multiplier * t, ...) for monomial 'm' and a module term 't'
void CleanUp()
Clean up all the accumulated data.
void operator=(const CLeadingTerm &)
poly TraverseTail(poly multiplier, const int tail) const
High level caching function!!!
void operator=(const CReducerFinder &)
void SetUpTailTerms()
Convert the given ideal of tails into the internal representation (with reducers!) Preprocess m_idTai...
void ComputeLeadingSyzygyTerms(bool bComputeSecondTerms=true)
Computes Syz(leads) or only LEAD of it. The result is stored into m_syzLeads.
bool operator()(const TCacheKey &l, const TCacheKey &r) const
const CReducerFinder m_div
Divisor finder.
ideal Compute1LeadingSyzygyTerms()
just leading terms
void ReadOffResult(ideal &syzL, ideal &syzT)
Read off the results while detaching them from this object NOTE: no copy!
void Initialize(const ideal L)
const unsigned int m_N
number of ring variables
const unsigned long m_sev
not short exp. vector
bool Check(const poly m) const
poly _FindReducer(const poly product, const poly syzterm) const
just for testing via the wrapper below
std::map< TComponentKey, TReducers > CReducersHash
The following sip_sideal structure has many different uses thoughout Singular. Basic use-cases for it...
SchreyerSyzygyComputationFlags(idhdl rootRingHdl)
const int OPT__TREEOUTPUT
output lifting tree
poly ComputeImage(poly multiplier, const int tail) const
low level computation...
const ring m_rBaseRing
global base ring
SBucketFactory m_sum_bucket_factory
TODO: look into m_idTailTerms!!!!!!!!!!!!!!!!!!!!!!!! map? heaps???
void putBucket(const Bucket &bt, const bool replace=false)
unsigned int label() const
unsigned long m_stat[9]
Statistics: 0..3: as in SetUpTailTerms()::PreProcessTerm() // TODO!!?? 4: number of terms discarded d...
bool IsDivisible(const poly q) const
SchreyerSyzygyComputation(const ideal idLeads, const ideal idTails, const SchreyerSyzygyComputationFlags setting)
Construct a global object for given input data (separated into leads & tails)
const int OPT__IGNORETAILS
ignore tails and compute the pure Schreyer frame
CCacheCompare & operator=(const CCacheCompare &lhs)
const CLCM m_lcm
Bitmask for variables occuring in leading terms.
SchreyerSyzygyComputationFlags(const SchreyerSyzygyComputationFlags &attr)
Computing syzygies after Schreyer.
const ideal m_idTails
input tails
int status int void size_t count int const void size_t count const char int flags
int PreProcessTerm(const poly t, CReducerFinder &syzChecker) const
is the term to be "preprocessed" as lower order term or lead to only reducible syzygies...
const int OPT__NOCACHING
no caching/stores/lookups