Public Member Functions | Private Attributes
CDivisorEnumerator2 Class Reference

TODO: More...

Public Member Functions

 CDivisorEnumerator2 (const CReducerFinder &self, const poly m, const poly t)
 
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_multiplier
 
const poly m_term
 
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 2491 of file syzextra.cc.

Constructor & Destructor Documentation

◆ CDivisorEnumerator2()

CDivisorEnumerator2::CDivisorEnumerator2 ( const CReducerFinder self,
const poly  m,
const poly  t 
)
inline

Definition at line 2505 of file syzextra.cc.

2505  :
2507  m_reds(self),
2508  m_multiplier(m), m_term(t),
2511  m_itr(), m_current(), m_finish(),
2512  m_active(false)
2513  {
2514  assume( m_comp >= 0 );
2515  assume( m_reds.m_L != NULL );
2516  assume( m_multiplier != NULL );
2517  assume( m_term != NULL );
2518 
2519  assume( m != NULL );
2520  assume( t != NULL );
2521  assume ( !n_IsZero( pGetCoeff(m), m_rBaseRing->cf ) );
2522  assume ( !n_IsZero( pGetCoeff(t), m_rBaseRing->cf ) );
2523 
2524  p_Test(m, m_rBaseRing);
2525 
2526 // assume( p_GetComp(m_multiplier, m_rBaseRing) == 0 );
2527 #ifndef SING_NDEBUG
2528  if( OPT__DEBUG ) m_reds.Verify();
2529 #endif
2530  }
const unsigned long m_not_sev
Definition: syzextra.cc:2496
const CReducerFinder & m_reds
Definition: syzextra.cc:2494
CReducerFinder::TReducers::const_iterator m_current
Definition: syzextra.cc:2500
const long m_comp
Definition: syzextra.cc:2497
#define p_GetComp(p, r)
Definition: monomials.h:72
const poly m_term
Definition: syzextra.cc:2495
const int OPT__DEBUG
output all the intermediate states
Definition: syzextra.h:205
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy ...
Definition: monomials.h:51
CReducerFinder::CReducersHash::const_iterator m_itr
Definition: syzextra.cc:2499
int m
Definition: cfEzgcd.cc:119
static FORCE_INLINE BOOLEAN n_IsZero(number n, const coeffs r)
TRUE iff 'n' represents the zero element.
Definition: coeffs.h:468
#define p_Test(p, r)
Definition: p_polys.h:160
unsigned long p_GetShortExpVector(const poly p, const ring r)
Definition: p_polys.cc:4627
#define NULL
Definition: omList.c:10
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
const poly m_multiplier
Definition: syzextra.cc:2495
CReducerFinder::TReducers::const_iterator m_finish
Definition: syzextra.cc:2500
assume(R !=NULL)

Member Function Documentation

◆ Current()

const CLeadingTerm& CDivisorEnumerator2::Current ( ) const
inline

Definition at line 2552 of file syzextra.cc.

2553  {
2554  assume( m_active );
2555  assume( m_current != m_finish );
2556 
2557  return *(*m_current);
2558  }
CReducerFinder::TReducers::const_iterator m_current
Definition: syzextra.cc:2500
CReducerFinder::TReducers::const_iterator m_finish
Definition: syzextra.cc:2500
assume(R !=NULL)

◆ MoveNext()

bool CDivisorEnumerator2::MoveNext ( )
inline

Definition at line 2560 of file syzextra.cc.

2561  {
2562  assume( m_current != m_finish );
2563 
2564  if( m_active )
2565  ++m_current;
2566  else
2567  m_active = true;
2568 
2569 
2570  // looking for the next good entry
2571  for( ; m_current != m_finish; ++m_current )
2572  {
2573  assume( Current().CheckLT( m_reds.m_L ) );
2574 
2575  if( Current().DivisibilityCheck(m_multiplier, m_term, m_not_sev, m_rBaseRing) )
2576  {
2577 #ifndef SING_NDEBUG
2578  if( OPT__DEBUG )
2579  {
2580  Print("CDivisorEnumerator::MoveNext::est LS: q is divisible by LS[%d] !:((, diviser is: ", 1 + Current().label());
2581  dPrint(Current().lt(), m_rBaseRing, m_rBaseRing, 0);
2582  }
2583 #endif
2584 // m_active = true;
2585  assume( Current().CheckLT( m_reds.m_L ) );
2586  return true;
2587 
2588  }
2589  assume( Current().CheckLT( m_reds.m_L ) );
2590  }
2591 
2592  // the end... :(
2593  assume( m_current == m_finish );
2594 
2595  m_active = false;
2596  return false;
2597  }
const unsigned long m_not_sev
Definition: syzextra.cc:2496
const CReducerFinder & m_reds
Definition: syzextra.cc:2494
CReducerFinder::TReducers::const_iterator m_current
Definition: syzextra.cc:2500
#define Print
Definition: emacs.cc:83
const poly m_term
Definition: syzextra.cc:2495
const int OPT__DEBUG
output all the intermediate states
Definition: syzextra.h:205
const CLeadingTerm & Current() const
Definition: syzextra.cc:2552
const ring m_rBaseRing
global base ring
Definition: syzextra.h:242
ideal m_L
only for debug
Definition: syzextra.h:355
const poly m_multiplier
Definition: syzextra.cc:2495
CReducerFinder::TReducers::const_iterator m_finish
Definition: syzextra.cc:2500
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 CDivisorEnumerator2::Reset ( )
inline

Definition at line 2532 of file syzextra.cc.

2533  {
2534  m_active = false;
2535 
2536  m_itr = m_reds.m_hash.find(m_comp);
2537 
2538  if( m_itr == m_reds.m_hash.end() )
2539  return false;
2540 
2541  assume( m_itr->first == m_comp );
2542 
2543  m_current = (m_itr->second).begin();
2544  m_finish = (m_itr->second).end();
2545 
2546  if (m_current == m_finish)
2547  return false;
2548 
2549  return true;
2550  }
const CReducerFinder & m_reds
Definition: syzextra.cc:2494
CReducerFinder::TReducers::const_iterator m_current
Definition: syzextra.cc:2500
const long m_comp
Definition: syzextra.cc:2497
CReducerFinder::CReducersHash::const_iterator m_itr
Definition: syzextra.cc:2499
CReducersHash m_hash
Definition: syzextra.h:357
CReducerFinder::TReducers::const_iterator m_finish
Definition: syzextra.cc:2500
assume(R !=NULL)

Field Documentation

◆ m_active

bool CDivisorEnumerator2::m_active
private

Definition at line 2502 of file syzextra.cc.

◆ m_comp

const long CDivisorEnumerator2::m_comp
private

Definition at line 2497 of file syzextra.cc.

◆ m_current

CReducerFinder::TReducers::const_iterator CDivisorEnumerator2::m_current
private

Definition at line 2500 of file syzextra.cc.

◆ m_finish

CReducerFinder::TReducers::const_iterator CDivisorEnumerator2::m_finish
private

Definition at line 2500 of file syzextra.cc.

◆ m_itr

CReducerFinder::CReducersHash::const_iterator CDivisorEnumerator2::m_itr
private

Definition at line 2499 of file syzextra.cc.

◆ m_multiplier

const poly CDivisorEnumerator2::m_multiplier
private

Definition at line 2495 of file syzextra.cc.

◆ m_not_sev

const unsigned long CDivisorEnumerator2::m_not_sev
private

Definition at line 2496 of file syzextra.cc.

◆ m_reds

const CReducerFinder& CDivisorEnumerator2::m_reds
private

Definition at line 2494 of file syzextra.cc.

◆ m_term

const poly CDivisorEnumerator2::m_term
private

Definition at line 2495 of file syzextra.cc.


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