Public Member Functions | Private Attributes
CDivisorEnumerator Class Reference

TODO: More...

Public Member Functions

 CDivisorEnumerator (const CReducerFinder &self, const poly product)
 
bool Reset ()
 
const CLeadingTermCurrent () const
 
bool MoveNext ()
 
- Public Member Functions inherited from SchreyerSyzygyComputationFlags
 SchreyerSyzygyComputationFlags (idhdl rootRingHdl)
 
 SchreyerSyzygyComputationFlags (const SchreyerSyzygyComputationFlags &attr)
 
void nextSyzygyLayer () const
 

Private Attributes

const CReducerFinderm_reds
 
const poly m_product
 
const unsigned long m_not_sev
 
const long m_comp
 
CReducerFinder::CReducersHash::const_iterator m_itr
 
CReducerFinder::TReducers::const_iterator m_current
 
CReducerFinder::TReducers::const_iterator m_finish
 
bool m_active
 

Additional Inherited Members

- Data Fields inherited from SchreyerSyzygyComputationFlags
const int OPT__DEBUG
 output all the intermediate states More...
 
const int OPT__LEAD2SYZ
 ? More...
 
const int OPT__TAILREDSYZ
 Reduce syzygy tails wrt the leading syzygy terms. More...
 
const int OPT__HYBRIDNF
 Use the usual NF's S-poly reduction while dropping lower order terms 2 means - smart selection! More...
 
const int OPT__IGNORETAILS
 ignore tails and compute the pure Schreyer frame More...
 
int OPT__SYZNUMBER
 Syzygy level (within a resolution) More...
 
const int OPT__TREEOUTPUT
 output lifting tree More...
 
const int OPT__SYZCHECK
 CheckSyzygyProperty: TODO. More...
 
const bool OPT__PROT
 TEST_OPT_PROT. More...
 
const int OPT__NOCACHING
 no caching/stores/lookups More...
 
const ring m_rBaseRing
 global base ring More...
 

Detailed Description

TODO:

Definition at line 2268 of file syzextra.cc.

Constructor & Destructor Documentation

◆ CDivisorEnumerator()

CDivisorEnumerator::CDivisorEnumerator ( const CReducerFinder self,
const poly  product 
)
inline

TODO: m_L should stay the same!!!

Definition at line 2282 of file syzextra.cc.

2282  :
2284  m_reds(self),
2285  m_product(product),
2287  m_comp(p_GetComp(product, m_rBaseRing)),
2288  m_itr(), m_current(), m_finish(),
2289  m_active(false)
2290  {
2291  assume( m_comp >= 0 );
2292  assume( m_reds.m_L != NULL ); /// TODO: m_L should stay the same!!!
2293 
2294  assume( product != NULL ); // may have no coeff yet :(
2295 // assume ( !n_IsZero( p_GetCoeff(product, m_rBaseRing), m_rBaseRing ) );
2296 #ifndef SING_NDEBUG
2297  if( OPT__DEBUG ) m_reds.Verify();
2298 #endif
2299  }
#define p_GetComp(p, r)
Definition: monomials.h:72
const poly m_product
Definition: syzextra.cc:2272
const int OPT__DEBUG
output all the intermediate states
Definition: syzextra.h:205
CReducerFinder::TReducers::const_iterator m_current
Definition: syzextra.cc:2277
CReducerFinder::TReducers::const_iterator m_finish
Definition: syzextra.cc:2277
const CReducerFinder & m_reds
Definition: syzextra.cc:2271
unsigned long p_GetShortExpVector(const poly p, const ring r)
Definition: p_polys.cc:4635
#define NULL
Definition: omList.c:10
const unsigned long m_not_sev
Definition: syzextra.cc:2273
SchreyerSyzygyComputationFlags(idhdl rootRingHdl)
Definition: syzextra.cc:2032
const ring m_rBaseRing
global base ring
Definition: syzextra.h:242
ideal m_L
only for debug
Definition: syzextra.h:355
CReducerFinder::CReducersHash::const_iterator m_itr
Definition: syzextra.cc:2276
assume(R !=NULL)
const long m_comp
Definition: syzextra.cc:2274

Member Function Documentation

◆ Current()

const CLeadingTerm& CDivisorEnumerator::Current ( ) const
inline

Definition at line 2322 of file syzextra.cc.

2323  {
2324  assume( m_active );
2325  assume( m_current != m_finish );
2326 
2327  return *(*m_current);
2328  }
CReducerFinder::TReducers::const_iterator m_current
Definition: syzextra.cc:2277
CReducerFinder::TReducers::const_iterator m_finish
Definition: syzextra.cc:2277
assume(R !=NULL)

◆ MoveNext()

bool CDivisorEnumerator::MoveNext ( )
inline

Definition at line 2330 of file syzextra.cc.

2331  {
2332  assume( m_current != m_finish );
2333 
2334  if( m_active )
2335  ++m_current;
2336  else
2337  m_active = true; // for Current()
2338 
2339  // looking for the next good entry
2340  for( ; m_current != m_finish; ++m_current )
2341  {
2342  assume( Current().CheckLT( m_reds.m_L ) );
2343 
2344  if( Current().DivisibilityCheck(m_product, m_not_sev, m_rBaseRing) )
2345  {
2346 #ifndef SING_NDEBUG
2347  if( OPT__DEBUG )
2348  {
2349  Print("CDivisorEnumerator::MoveNext::est LS: q is divisible by LS[%d] !:((, diviser is: ", 1 + Current().label());
2350  dPrint(Current().lt(), m_rBaseRing, m_rBaseRing, 0);
2351  }
2352 #endif
2353 // m_active = true;
2354  assume( Current().CheckLT( m_reds.m_L ) );
2355  return true;
2356  }
2357  assume( Current().CheckLT( m_reds.m_L ) );
2358  }
2359 
2360  // the end... :(
2361  assume( m_current == m_finish );
2362 
2363  m_active = false;
2364  return false;
2365  }
const CLeadingTerm & Current() const
Definition: syzextra.cc:2322
#define Print
Definition: emacs.cc:83
const poly m_product
Definition: syzextra.cc:2272
const int OPT__DEBUG
output all the intermediate states
Definition: syzextra.h:205
CReducerFinder::TReducers::const_iterator m_current
Definition: syzextra.cc:2277
CReducerFinder::TReducers::const_iterator m_finish
Definition: syzextra.cc:2277
const CReducerFinder & m_reds
Definition: syzextra.cc:2271
const unsigned long m_not_sev
Definition: syzextra.cc:2273
const ring m_rBaseRing
global base ring
Definition: syzextra.h:242
ideal m_L
only for debug
Definition: syzextra.h:355
void dPrint(const ideal id, const ring lmRing=currRing, const ring tailRing=currRing, const int nTerms=0)
prints an ideal, optionally with details
assume(R !=NULL)

◆ Reset()

bool CDivisorEnumerator::Reset ( )
inline

Definition at line 2301 of file syzextra.cc.

2302  {
2303  m_active = false;
2304 
2305  m_itr = m_reds.m_hash.find(m_comp);
2306 
2307  if( m_itr == m_reds.m_hash.end() )
2308  return false;
2309 
2310  assume( m_itr->first == m_comp );
2311 
2312  m_current = (m_itr->second).begin();
2313  m_finish = (m_itr->second).end();
2314 
2315  if (m_current == m_finish)
2316  return false;
2317 
2318 // m_active = true;
2319  return true;
2320  }
CReducersHash m_hash
Definition: syzextra.h:357
CReducerFinder::TReducers::const_iterator m_current
Definition: syzextra.cc:2277
CReducerFinder::TReducers::const_iterator m_finish
Definition: syzextra.cc:2277
const CReducerFinder & m_reds
Definition: syzextra.cc:2271
CReducerFinder::CReducersHash::const_iterator m_itr
Definition: syzextra.cc:2276
assume(R !=NULL)
const long m_comp
Definition: syzextra.cc:2274

Field Documentation

◆ m_active

bool CDivisorEnumerator::m_active
private

Definition at line 2279 of file syzextra.cc.

◆ m_comp

const long CDivisorEnumerator::m_comp
private

Definition at line 2274 of file syzextra.cc.

◆ m_current

CReducerFinder::TReducers::const_iterator CDivisorEnumerator::m_current
private

Definition at line 2277 of file syzextra.cc.

◆ m_finish

CReducerFinder::TReducers::const_iterator CDivisorEnumerator::m_finish
private

Definition at line 2277 of file syzextra.cc.

◆ m_itr

CReducerFinder::CReducersHash::const_iterator CDivisorEnumerator::m_itr
private

Definition at line 2276 of file syzextra.cc.

◆ m_not_sev

const unsigned long CDivisorEnumerator::m_not_sev
private

Definition at line 2273 of file syzextra.cc.

◆ m_product

const poly CDivisorEnumerator::m_product
private

Definition at line 2272 of file syzextra.cc.

◆ m_reds

const CReducerFinder& CDivisorEnumerator::m_reds
private

Definition at line 2271 of file syzextra.cc.


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