Changeset 74eafe in git


Ignore:
Timestamp:
Aug 23, 2016, 4:02:50 PM (7 years ago)
Author:
Andreas Steenpass <steenpass@…>
Branches:
(u'spielwiese', '828514cf6e480e4bafc26df99217bf2a1ed1ef45')
Children:
5919a799e459e136540ea8fd2aa47140e794f72a
Parents:
836c32b3197962be95ef162f975a4a1adc2142c2
git-author:
Andreas Steenpass <steenpass@mathematik.uni-kl.de>2016-08-23 16:02:50+02:00
git-committer:
Andreas Steenpass <steenpass@mathematik.uni-kl.de>2017-12-15 12:17:07+01:00
Message:
chg: move IsDivisible
File:
1 edited

Legend:

Unmodified
Added
Removed
  • kernel/GBEngine/syz4.cc

    r836c32 r74eafe  
    327327}
    328328
    329 bool IsDivisible(const CReducersHash_test *C, const poly product);
     329bool IsDivisible(const CReducersHash_test *C, const poly product)
     330{
     331    CReducersHash_test::const_iterator m_itr
     332        = C->find(p_GetComp(product, currRing));
     333    if (m_itr == C->end()) {
     334        return false;
     335    }
     336    TReducers_test::const_iterator m_current = (m_itr->second).begin();
     337    TReducers_test::const_iterator m_finish  = (m_itr->second).end();
     338    const unsigned long m_not_sev = ~p_GetShortExpVector(product, currRing);
     339    for ( ; m_current != m_finish; ++m_current) {
     340        if (p_LmShortDivisibleByNoComp((*m_current)->lt, (*m_current)->sev,
     341            product, m_not_sev, currRing)) {
     342            return true;
     343        }
     344    }
     345    return false;
     346}
     347
    330348
    331349poly FindReducer(const poly multiplier, const poly t, const poly syzterm,
     
    371389  p_LmFree(q, r);
    372390  return NULL;
    373 }
    374 
    375 bool IsDivisible(const CReducersHash_test *C, const poly product)
    376 {
    377     CReducersHash_test::const_iterator m_itr
    378         = C->find(p_GetComp(product, currRing));
    379     if (m_itr == C->end()) {
    380         return false;
    381     }
    382     TReducers_test::const_iterator m_current = (m_itr->second).begin();
    383     TReducers_test::const_iterator m_finish  = (m_itr->second).end();
    384     const unsigned long m_not_sev = ~p_GetShortExpVector(product, currRing);
    385     for ( ; m_current != m_finish; ++m_current) {
    386         if (p_LmShortDivisibleByNoComp((*m_current)->lt, (*m_current)->sev,
    387             product, m_not_sev, currRing)) {
    388             return true;
    389         }
    390     }
    391     return false;
    392391}
    393392
Note: See TracChangeset for help on using the changeset viewer.