Ignore:
Timestamp:
Sep 22, 2016, 3:41:32 PM (8 years ago)
Author:
Hans Schoenemann <hannes@…>
Branches:
(u'spielwiese', '6e5adcba05493683b94648c659a729c189812c77')
Children:
4ef909357cd2764e39044e78dc5f8f271de19c21
Parents:
c4ea0bb97e0fcd6d7e4ea58106ce9935683b32de6c086a438d710cf8f1f5eac494377370eacf969c
git-author:
Hans Schoenemann <hannes@mathematik.uni-kl.de>2016-09-22 15:41:32+02:00
git-committer:
GitHub <noreply@github.com>2016-09-22 15:41:32+02:00
Message:
Merge pull request #789 from adipopescu/Reduce_Bound

Reduce bound
File:
1 edited

Legend:

Unmodified
Added
Removed
  • Singular/dyn_modules/syzextra/syzextra.cc

    r6c086a4 r750069  
    166166    pNext(s) = NULL;
    167167
    168     if( !n_IsZero( p_GetCoeff(s, R), R) )
     168    if( !n_IsZero( pGetCoeff(s), R->cf) )
    169169    {
    170170      const int i = p_GetComp(s, R) - 1;
     
    480480
    481481    poly m = p_LmInit(p, r);
    482     p_SetCoeff0(m, n_Copy(p_GetCoeff(p, r), r), r);
     482    p_SetCoeff0(m, n_Copy(pGetCoeff(p), r->cf), r);
    483483
    484484    if( bSetZeroComp )
     
    647647      {
    648648        poly ss = p_LmInit(t, r);
    649         p_SetCoeff0(ss, n_Init(1, r), r); // for delete & printout only!...
     649        p_SetCoeff0(ss, n_Init(1, r->cf), r); // for delete & printout only!...
    650650        p_SetComp(ss, (*vit)->label() + 1, r); // coeff?
    651651        p_Setm(ss, r);
     
    16401640       p_Test(multiplier, r);
    16411641
    1642        if( !n_Equal( pGetCoeff(multiplier), pGetCoeff(itr->first), r) ) // normalize coeffs!?
     1642       if( !n_Equal( pGetCoeff(multiplier), pGetCoeff(itr->first), r->cf) ) // normalize coeffs!?
    16431643       {
    1644          number n = n_Div( pGetCoeff(multiplier), pGetCoeff(itr->first), r); // new number
     1644         number n = n_Div( pGetCoeff(multiplier), pGetCoeff(itr->first), r->cf); // new number
    16451645
    16461646         if( UNLIKELY( OPT__TREEOUTPUT ) )
    16471647         {
    16481648           StringSetS("");
    1649            n_Write(n, r);
     1649           n_Write(n, r->cf);
    16501650           char* s = StringEndS();
    16511651           Print("\"recale\": \"%s\", ", s);
     
    16561656
    16571657         p = p_Mult_nn(p, n, r); // !
    1658          n_Delete(&n, r);
     1658         n_Delete(&n, r->cf);
    16591659       } else
    16601660         if( UNLIKELY( OPT__PROT ) ) ++ m_stat[6]; // PrintS("l"); // lookup no rescale
     
    22162216//  assume ( !n_IsZero( p_GetCoeff(product, r), r ) );
    22172217
    2218   assume ( !n_IsZero( p_GetCoeff(lt(), r), r ) );
     2218  assume ( !n_IsZero( pGetCoeff(lt()), r->cf ) );
    22192219  assume( sev() == p_GetShortExpVector(lt(), r) );
    22202220
     
    22382238bool CLeadingTerm::DivisibilityCheck(const poly m, const poly t, const unsigned long not_sev, const ring r) const
    22392239{
    2240   assume ( !n_IsZero( p_GetCoeff(lt(), r), r ) );
     2240  assume ( !n_IsZero( pGetCoeff(lt()), r->cf ) );
    22412241  assume( sev() == p_GetShortExpVector(lt(), r) );
    22422242
    22432243  assume( m != NULL );
    22442244  assume( t != NULL );
    2245   assume ( !n_IsZero( p_GetCoeff(m, r), r ) );
    2246   assume ( !n_IsZero( p_GetCoeff(t, r), r ) );
     2245  assume ( !n_IsZero( pGetCoeff(m), r->cf ) );
     2246  assume ( !n_IsZero( pGetCoeff(t), r->cf ) );
    22472247
    22482248// assume( p_GetComp(m, r) == 0 );
     
    25212521      assume( m != NULL );
    25222522      assume( t != NULL );
    2523       assume ( !n_IsZero( p_GetCoeff(m, m_rBaseRing), m_rBaseRing ) );
    2524       assume ( !n_IsZero( p_GetCoeff(t, m_rBaseRing), m_rBaseRing ) );
     2523      assume ( !n_IsZero( pGetCoeff(m), m_rBaseRing->cf ) );
     2524      assume ( !n_IsZero( pGetCoeff(t), m_rBaseRing->cf ) );
    25252525
    25262526      p_Test(m, m_rBaseRing);
     
    27052705    }
    27062706
    2707     number n = n_Mult( p_GetCoeff(multiplier, r), p_GetCoeff(t, r), r);
     2707    number n = n_Mult( pGetCoeff(multiplier), pGetCoeff(t), r->cf);
    27082708
    27092709#if NODIVISION
    27102710    // we assume all leading coeffs to be 1!
    2711     assume( n_IsOne(p_GetCoeff(p, r), r->cf) );
     2711    assume( n_IsOne(pGetCoeff(p), r->cf) );
    27122712#else
    2713     if( !n_IsOne( p_GetCoeff(p, r), r ) )
    2714       n = n_Div(n, p_GetCoeff(p, r), r);
    2715 #endif
    2716 
    2717     p_SetCoeff0(q, n_InpNeg(n, r), r);
     2713    if( !n_IsOne( pGetCoeff(p), r ) )
     2714      n = n_Div(n, pGetCoeff(p), r->cf);
     2715#endif
     2716
     2717    p_SetCoeff0(q, n_InpNeg(n, r->cf), r);
    27182718//    n_Delete(&n, r);
    27192719
     
    29212921#if NODIVISION
    29222922    assume( n_IsOne(p_GetCoeff(p, r), r->cf) );
    2923     p_SetCoeff0(q, n_InpNeg( n_Copy(p_GetCoeff(product, r), r), r), r);
     2923    p_SetCoeff0(q, n_InpNeg( n_Copy(pGetCoeff(product), r->cf), r->cf), r);
    29242924#else
    2925     p_SetCoeff0(q, n_InpNeg( n_Div( p_GetCoeff(product, r), p_GetCoeff(p, r), r), r), r);
     2925    p_SetCoeff0(q, n_InpNeg( n_Div( pGetCoeff(product), p_GetCoeff(p), r->cf), r->cf), r);
    29262926#endif
    29272927
Note: See TracChangeset for help on using the changeset viewer.