Changeset 4ca3e3 in git
- Timestamp:
- Nov 22, 2012, 10:23:41 PM (10 years ago)
- Branches:
- (u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')
- Children:
- 0838d710f21ee145215f88504c839b88bfd566bd
- Parents:
- 7eaf722febee351de63ee153106d9bb44f37c045
- git-author:
- Oleksandr Motsak <motsak@mathematik.uni-kl.de>2012-11-22 22:23:41+01:00
- git-committer:
- Oleksandr Motsak <motsak@mathematik.uni-kl.de>2014-05-07 04:41:48+02:00
- Location:
- dyn_modules/syzextra
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
dyn_modules/syzextra/syzextra.cc
r7eaf72 r4ca3e3 254 254 assume( t != NULL ); 255 255 256 if( __DEBUG__ & &__TAILREDSYZ__ )256 if( __DEBUG__ & __TAILREDSYZ__ ) 257 257 assume( !IsDivisible(t) ); // each input term should NOT be in <L> 258 258 … … 295 295 { 296 296 #ifndef NDEBUG 297 if( __DEBUG__ | |0)297 if( __DEBUG__ | 0) 298 298 { 299 299 PrintS("CReducerFinder::PreProcessTerm, 't' is NOT co-prime with the following leading term: \n"); … … 349 349 350 350 #ifndef NDEBUG 351 if( __DEBUG__ | |0)351 if( __DEBUG__ | 0) 352 352 { 353 353 PrintS("SchreyerSyzygyComputation::SetUpTailTerms(): Tails: \n"); … … 387 387 388 388 #ifndef NDEBUG 389 if( TEST_OPT_PROT | |1)389 if( TEST_OPT_PROT | 1) 390 390 Print(" **!!** SchreyerSyzygyComputation::SetUpTailTerms()::PreProcessing(): X: {c: %lu, C: %lu, P: %lu} + %lu\n", pp[1], pp[2], pp[3], pp[0]); 391 391 #endif 392 392 393 393 #ifndef NDEBUG 394 if( __DEBUG__ | |0)394 if( __DEBUG__ | 0) 395 395 { 396 396 PrintS("SchreyerSyzygyComputation::SetUpTailTerms(): Preprocessed Tails: \n"); … … 748 748 { 749 749 #ifndef NDEBUG 750 if( TEST_OPT_PROT | |1)750 if( TEST_OPT_PROT | 1) 751 751 { 752 752 t = getTimer(); r = getRTimer(); … … 756 756 ComputeLeadingSyzygyTerms( __LEAD2SYZ__ && !__IGNORETAILS__ ); // 2 terms OR 1 term! 757 757 #ifndef NDEBUG 758 if( TEST_OPT_PROT | |1)758 if( TEST_OPT_PROT | 1) 759 759 { 760 760 t = getTimer() - t; r = getRTimer() - r; … … 782 782 { 783 783 #ifndef NDEBUG 784 if( TEST_OPT_PROT | |1 )784 if( TEST_OPT_PROT | 1 ) 785 785 { 786 786 t = getTimer(); r = getRTimer(); … … 791 791 SetUpTailTerms(); 792 792 #ifndef NDEBUG 793 if( TEST_OPT_PROT | |1)793 if( TEST_OPT_PROT | 1) 794 794 { 795 795 t = getTimer() - t; r = getRTimer() - r; … … 801 801 802 802 #ifndef NDEBUG 803 if( TEST_OPT_PROT | |1)803 if( TEST_OPT_PROT | 1) 804 804 { 805 805 t = getTimer(); r = getRTimer(); … … 839 839 840 840 #ifndef NDEBUG 841 if( TEST_OPT_PROT | |1)841 if( TEST_OPT_PROT | 1) 842 842 { 843 843 t = getTimer() - t; r = getRTimer() - r; … … 1284 1284 const poly m_product; 1285 1285 const unsigned long m_not_sev; 1286 const unsignedlong m_comp;1286 const long m_comp; 1287 1287 1288 1288 CReducerFinder::CReducersHash::const_iterator m_itr; … … 1425 1425 for( CReducersHash::const_iterator it = m_hash.begin(); it != m_hash.end(); it++) 1426 1426 { 1427 Print("Hash Key: % d, Values: \n", it->first);1427 Print("Hash Key: %ld, Values: \n", it->first); 1428 1428 const TReducers& reducers = it->second; 1429 1429 … … 1442 1442 assume( p_sev == p_GetShortExpVector(p, r) ); 1443 1443 1444 Print("L[%d]: ", k); dPrint(p, r, r, 0); Print("SEV: % dl\n", p_sev);1444 Print("L[%d]: ", k); dPrint(p, r, r, 0); Print("SEV: %ld\n", p_sev); 1445 1445 } 1446 1446 } … … 1455 1455 const poly m_multiplier, m_term; 1456 1456 const unsigned long m_not_sev; 1457 const unsignedlong m_comp;1457 const long m_comp; 1458 1458 1459 1459 CReducerFinder::CReducersHash::const_iterator m_itr; -
dyn_modules/syzextra/syzextra.h
r7eaf72 r4ca3e3 23 23 #include "singularxx_defs.h" 24 24 25 struct spolyrec; 26 typedef struct spolyrec polyrec; 27 typedef polyrec * poly; 28 29 struct ip_sring; 30 typedef struct ip_sring * ring; 31 32 struct sip_sideal; 33 typedef struct sip_sideal * ideal; 34 35 class idrec; 36 typedef idrec * idhdl; 25 struct spolyrec; typedef struct spolyrec polyrec; typedef polyrec* poly; 26 struct ip_sring; typedef struct ip_sring* ring; typedef struct ip_sring const* const_ring; 27 28 struct sip_sideal; typedef struct sip_sideal * ideal; 29 class idrec; typedef idrec * idhdl; 30 31 class sBucket; typedef sBucket* sBucket_pt; 32 class kBucket; typedef kBucket* kBucket_pt; 33 37 34 38 35 BEGIN_NAMESPACE_SINGULARXX BEGIN_NAMESPACE(SYZEXTRA) … … 206 203 SchreyerSyzygyComputationFlags(setting), 207 204 m_idLeads(idLeads), m_idTails(id_Copy(idTails, setting.m_rBaseRing)), 208 m_syzLeads(NULL), m_syzTails(NULL), m_LS(NULL), 209 m_lcm(m_idLeads, setting), m_div(m_idLeads, setting), m_checker(NULL, setting) 205 m_syzLeads(NULL), m_syzTails(NULL), 206 m_LS(NULL), m_lcm(m_idLeads, setting), 207 m_div(m_idLeads, setting), m_checker(NULL, setting), 208 m_sum_bucket(NULL), m_spoly_bucket(NULL) 210 209 { 211 210 } … … 215 214 SchreyerSyzygyComputationFlags(setting), 216 215 m_idLeads(idLeads), m_idTails(id_Copy(idTails, setting.m_rBaseRing)), 217 m_syzLeads(syzLeads), m_syzTails(NULL), m_LS(syzLeads), 218 m_lcm(m_idLeads, setting), m_div(m_idLeads, setting), m_checker(NULL, setting) 216 m_syzLeads(syzLeads), m_syzTails(NULL), 217 m_LS(syzLeads), m_lcm(m_idLeads, setting), 218 m_div(m_idLeads, setting), m_checker(NULL, setting), 219 m_sum_bucket(NULL), m_spoly_bucket(NULL) 219 220 { 220 221 if( __TAILREDSYZ__ && !__IGNORETAILS__) … … 291 292 /// output (syzygy) tails 292 293 ideal m_syzTails; 294 295 /*mutable?*/ ideal m_LS; ///< leading syzygy terms used for reducing syzygy tails 296 293 297 294 298 /// Bitmask for variables occuring in leading terms … … 300 304 /// for checking tail-terms and makeing them irreducible (wrt m_LS!) 301 305 CReducerFinder m_checker; 302 303 /*mutable?*/ ideal m_LS; ///< leading syzygy terms used for reducing syzygy tails304 306 305 307 /*
Note: See TracChangeset
for help on using the changeset viewer.