Changeset 5cecde in git for dyn_modules/syzextra/syzextra.h

Timestamp:

Aug 2, 2012, 9:58:56 PM (11 years ago)

Author:

Oleksandr Motsak <motsak@…>

Branches:

(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'c987db42cd2ec943b97ac5746c99892ceddf909c')

Children:

e98c64edd3cf15f4e5d15991052a7bbcbb1184a5

Parents:

495328d14a955b215ad10b598e995ab522243881

git-author:

Oleksandr Motsak <motsak@mathematik.uni-kl.de>2012-08-02 21:58:56+02:00

git-committer:

Oleksandr Motsak <motsak@mathematik.uni-kl.de>2014-05-07 04:41:46+02:00

Message:

Totally bitmasked: CReducerFinder: FindReducer uses syz_checker.IsDivisible()

File:

• dyn_modules/syzextra/syzextra.h (modified) (7 diffs)

dyn_modules/syzextra/syzextra.h

@@ -95 +95 @@
 {
   public:
-    CLCM(const SchreyerSyzygyComputation& data);
+    CLCM(const ideal& L, const SchreyerSyzygyComputationFlags& flags);
 
     bool Check(const poly m) const;
     
   private:
-    const SchreyerSyzygyComputation& m_data;
-
     bool m_compute;
+
+    const unsigned int m_N; ///< number of ring variables
 };
 
@@ -130 +130 @@
     
   public:
-
     /// goes over all leading terms
-    CReducerFinder(const SchreyerSyzygyComputation& data);
+    CReducerFinder(const ideal L, const SchreyerSyzygyComputationFlags& flags);
+
+    void Initialize(const ideal L);
 
     ~CReducerFinder();
 
     // TODO: save shortcut (syz: |-.->) LM(LM(m) * "t") -> syz?    
-    poly FindReducer(const poly product, const poly syzterm) const;
+    poly FindReducer(const poly product, const poly syzterm, const CReducerFinder& checker) const;
+
+    bool IsDivisible(const poly q) const;
+
+    bool IsNonempty() const { return (m_hash.size() > 0); }
 
   private:
-    const SchreyerSyzygyComputation& m_data;
+    ideal m_L; ///< only for debug
 
     CReducersHash m_hash; // can also be replaced with a vector indexed by components
@@ -169 +174 @@
         m_idLeads(idLeads), m_idTails(idTails), 
         m_syzLeads(NULL), m_syzTails(NULL), m_LS(NULL),
-        m_lcm(*this), m_div(*this)
+        m_lcm(m_idLeads, setting), m_div(m_idLeads, setting), m_checker(NULL, setting)
     {
     }
-
 
     /// Construct a global object for given input data (separated into leads & tails)
@@ -178 +182 @@
         SchreyerSyzygyComputationFlags(setting),
         m_idLeads(idLeads), m_idTails(idTails), 
-        m_syzLeads(NULL), m_syzTails(NULL), m_LS(syzLeads), 
-        m_lcm(*this), m_div(*this)
+        m_syzLeads(syzLeads), m_syzTails(NULL), m_LS(syzLeads), 
+        m_lcm(m_idLeads, setting), m_div(m_idLeads, setting), m_checker(NULL, setting)
     {
+      if( __TAILREDSYZ__ && syzLeads != NULL )
+        m_checker.Initialize(syzLeads);
     }
 
@@ -214 +220 @@
     /// just for testing via the wrapper below
     inline poly _FindReducer(const poly product, const poly syzterm) const
-        { return m_div.FindReducer(product, syzterm); }  
+        { return m_div.FindReducer(product, syzterm, m_checker); }  
     
   protected:
@@ -240 +246 @@
     ideal m_syzTails;
 
-    /*mutable?*/ ideal m_LS; ///< leading syzygy terms used for reducing syzygy tails
-
     /// Bitmask for variables occuring in leading terms
     const CLCM m_lcm;
@@ -247 +251 @@
     /// Divisor finder
     const CReducerFinder m_div;
+
+    /// for checking tail-terms and makeing them irreducible (wrt m_LS!)
+    CReducerFinder m_checker;
+
+    /*mutable?*/ ideal m_LS; ///< leading syzygy terms used for reducing syzygy tails
 };