[BACK]Return to gr.c CVS log [TXT][DIR] Up to [local] / OpenXM_contrib2 / asir2018 / builtin

Diff for /OpenXM_contrib2/asir2018/builtin/gr.c between version 1.4 and 1.5

version 1.4, 2020/02/22 06:23:35 version 1.5, 2020/10/06 06:31:19
Line 45 
Line 45 
  * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,   * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
  * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.   * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
  *   *
  * $OpenXM: OpenXM_contrib2/asir2018/builtin/gr.c,v 1.3 2020/02/03 05:51:52 noro Exp $   * $OpenXM: OpenXM_contrib2/asir2018/builtin/gr.c,v 1.4 2020/02/22 06:23:35 noro Exp $
 */  */
 #include "ca.h"  #include "ca.h"
 #include "parse.h"  #include "parse.h"
Line 380  void dp_gr_main(LIST f,LIST v,Num homo,int modular,int
Line 380  void dp_gr_main(LIST f,LIST v,Num homo,int modular,int
       } else        } else
         break;          break;
     }      }
     if ( modular )      if ( modular ) {
       if ( modular > 1 ) {        if ( modular > 1 ) {
         *rp = 0; return;          *rp = 0; return;
       } else        } else
         m = get_lprime(++mindex);          m = get_lprime(++mindex);
       }
     makesubst(vc,&subst);      makesubst(vc,&subst);
     psn = length(s);      psn = length(s);
     for ( i = psn; i < pslen; i++ ) {      for ( i = psn; i < pslen; i++ ) {
Line 721  NODE gb_f4(NODE f)
Line 722  NODE gb_f4(NODE f)
     rank = generic_gauss_elim(mat,&nm,&dn,&rind,&cind);      rank = generic_gauss_elim(mat,&nm,&dn,&rind,&cind);
 #endif  #endif
     if ( DP_Print )      if ( DP_Print )
       fprintf(asir_out,"done rank = %d\n",rank,row,col);        fprintf(asir_out,"done rank = %d\n",rank);
     for ( i = 0; i < rank; i++ ) {      for ( i = 0; i < rank; i++ ) {
       for ( k = 0; k < nred; k++ )        for ( k = 0; k < nred; k++ )
         if ( !cmpdl(nv,at[rind[i]],ht[k]) )          if ( !cmpdl(nv,at[rind[i]],ht[k]) )
Line 946  NODE gb_f4_mod(NODE f,int m)
Line 947  NODE gb_f4_mod(NODE f,int m)
     init_eg(&eg_split_elim2); add_eg(&eg_split_elim2,&tmp0,&tmp1);      init_eg(&eg_split_elim2); add_eg(&eg_split_elim2,&tmp0,&tmp1);
   
     if ( DP_Print ) {      if ( DP_Print ) {
       fprintf(asir_out,"done rank = %d\n",rank,row,col);        fprintf(asir_out,"done rank = %d\n",rank);
       print_eg("Symb",&eg_split_symb);        print_eg("Symb",&eg_split_symb);
       print_eg("Conv",&eg_split_conv);        print_eg("Conv",&eg_split_conv);
       print_eg("Elim1",&eg_split_elim1);        print_eg("Elim1",&eg_split_elim1);
Line 1134  NODE gb_f4_mod_old(NODE f,int m)
Line 1135  NODE gb_f4_mod_old(NODE f,int m)
     init_eg(&eg_split_elim2); add_eg(&eg_split_elim2,&tmp0,&tmp1);      init_eg(&eg_split_elim2); add_eg(&eg_split_elim2,&tmp0,&tmp1);
   
     if ( DP_Print ) {      if ( DP_Print ) {
       fprintf(asir_out,"done rank = %d\n",rank,row,col);        fprintf(asir_out,"done rank = %d\n",rank);
       print_eg("Symb",&eg_split_symb);        print_eg("Symb",&eg_split_symb);
       print_eg("Elim1",&eg_split_elim1);        print_eg("Elim1",&eg_split_elim1);
       print_eg("Elim2",&eg_split_elim2);        print_eg("Elim2",&eg_split_elim2);
Line 1236  void printsubst(NODE s)
Line 1237  void printsubst(NODE s)
   fputc('[',asir_out);    fputc('[',asir_out);
   while ( s ) {    while ( s ) {
     printv(CO,(V)BDY(s)); s = NEXT(s);      printv(CO,(V)BDY(s)); s = NEXT(s);
     fprintf(asir_out,"->%d",ZTOS((Q)BDY(s)));      fprintf(asir_out,"->%ld",ZTOS((Q)BDY(s)));
     if ( NEXT(s) ) {      if ( NEXT(s) ) {
       fputc(',',asir_out); s = NEXT(s);        fputc(',',asir_out); s = NEXT(s);
     } else      } else
Line 1379  NODE /* of DP */ NODE_sortb_insert( DP newdp, NODE /* 
Line 1380  NODE /* of DP */ NODE_sortb_insert( DP newdp, NODE /* 
     NEXT(newnd) = last;      NEXT(newnd) = last;
     return newnd;      return newnd;
   }    }
   for ( ; p = NEXT(last); last = p )    for ( ; (p = NEXT(last)) != 0; last = p )
     if ( sgn*(*cmpfun)( nv, newdl, BDY((DP) BDY(p))->dl ) > 0 ) break;      if ( sgn*(*cmpfun)( nv, newdl, BDY((DP) BDY(p))->dl ) > 0 ) break;
   if ( p ) NEXT(NEXT(last) = newnd) = p;    if ( p ) NEXT(NEXT(last) = newnd) = p;
   else NEXT(last) = newnd;    else NEXT(last) = newnd;
Line 1407  NODE /* of index */ NODE_sortbi_insert( int newdpi, NO
Line 1408  NODE /* of index */ NODE_sortbi_insert( int newdpi, NO
     NEXT(newnd) = last;      NEXT(newnd) = last;
     return newnd;      return newnd;
   }    }
   for ( ; p = NEXT(last); last = p )    for ( ; (p = NEXT(last)) != 0; last = p )
     if ( sgn*(*cmpfun)( nv, newdl, psh[(long)BDY(p)] ) > 0 ) break;      if ( sgn*(*cmpfun)( nv, newdl, psh[(long)BDY(p)] ) > 0 ) break;
   if ( p ) NEXT(NEXT(last) = newnd) = p;    if ( p ) NEXT(NEXT(last) = newnd) = p;
   else NEXT(last) = newnd;    else NEXT(last) = newnd;
Line 1705  DP_pairs minp( DP_pairs d, DP_pairs *prest )
Line 1706  DP_pairs minp( DP_pairs d, DP_pairs *prest )
   }    }
   for ( lcm = m->lcm, s = m->sugar, ml = 0, l = m; p; p = NEXT(l = p) )    for ( lcm = m->lcm, s = m->sugar, ml = 0, l = m; p; p = NEXT(l = p) )
     if ( NoSugar ? (*cmpfun)( nv, lcm, p->lcm ) >= 0 :      if ( NoSugar ? (*cmpfun)( nv, lcm, p->lcm ) >= 0 :
          (s > p->sugar || s == p->sugar && (*cmpfun)( nv, lcm, p->lcm ) >= 0) )           (s > p->sugar || (s == p->sugar && (*cmpfun)( nv, lcm, p->lcm ) >= 0)) )
       ml = l,  lcm = (m = p)->lcm,  s = p->sugar;        ml = l,  lcm = (m = p)->lcm,  s = p->sugar;
   if ( !ml ) *prest = NEXT(m);    if ( !ml ) *prest = NEXT(m);
   else {    else {
Line 1969  DP_pairs updpairs( DP_pairs d, NODE /* of index */ g, 
Line 1970  DP_pairs updpairs( DP_pairs d, NODE /* of index */ g, 
     dd = d1;      dd = d1;
   dl1 = DPPlength(dd); NDP += (dl-dl1);    dl1 = DPPlength(dd); NDP += (dl-dl1);
   if ( !(nd = d) ) return dd;    if ( !(nd = d) ) return dd;
   while ( nd = NEXT(d1 = nd) ) ;    while ( (nd = NEXT(d1 = nd)) != 0 ) ;
   NEXT(d1) = dd;    NEXT(d1) = dd;
   return d;    return d;
 }  }
Line 2107  DP_pairs criterion_F( DP_pairs d1 )
Line 2108  DP_pairs criterion_F( DP_pairs d1 )
   
   for ( head = last = 0, p = d1; NEXT(p); ) {    for ( head = last = 0, p = d1; NEXT(p); ) {
     s = (r = w = collect_pairs_of_hdlcm( p, &rest ))->sugar;      s = (r = w = collect_pairs_of_hdlcm( p, &rest ))->sugar;
     while ( w = NEXT(w) )      while ( (w = NEXT(w)) != 0 )
       if ( !do_weyl && criterion_2( w->dp1, w->dp2 ) ) {        if ( !do_weyl && criterion_2( w->dp1, w->dp2 ) ) {
         r = w;          r = w;
         break;          break;
Legend:
Removed from v.1.4  
changed lines
  Added in v.1.5
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>