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

Diff for /OpenXM_contrib2/asir2000/builtin/gf.c between version 1.5 and 1.7

version 1.5, 2001/05/09 01:41:41 version 1.7, 2001/06/25 04:11:41
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/asir2000/builtin/gf.c,v 1.4 2000/08/22 05:03:57 noro Exp $   * $OpenXM: OpenXM_contrib2/asir2000/builtin/gf.c,v 1.6 2001/06/25 01:35:20 noro Exp $
 */  */
 #include "ca.h"  #include "ca.h"
 #include "parse.h"  #include "parse.h"
Line 74  void pwr_mod(P,P,V,P,int,N,P *);
Line 74  void pwr_mod(P,P,V,P,int,N,P *);
 void rem_mod(P,P,V,P,int,P *);  void rem_mod(P,P,V,P,int,P *);
   
 void Pnullspace(),Pgcda_mod(),Pftest(),Presfmain(),Ppwr_mod(),Puhensel();  void Pnullspace(),Pgcda_mod(),Pftest(),Presfmain(),Ppwr_mod(),Puhensel();
   void Psfuhensel();
   
 void Pnullspace_ff();  void Pnullspace_ff();
   
Line 83  void Plinear_form_to_vect(),Pvect_to_linear_form();
Line 84  void Plinear_form_to_vect(),Pvect_to_linear_form();
 void solve_linear_equation_gf2n(GF2N **,int,int,int *);  void solve_linear_equation_gf2n(GF2N **,int,int,int *);
 void linear_form_to_array(P,VL,int,Num *);  void linear_form_to_array(P,VL,int,Num *);
 void array_to_linear_form(Num *,VL,int,P *);  void array_to_linear_form(Num *,VL,int,P *);
   void sfuhensel(P,V,V,NODE *);
   
 extern int current_ff;  extern int current_ff;
   
Line 95  struct ftab gf_tab[] = {
Line 97  struct ftab gf_tab[] = {
         {"resfmain",Presfmain,4},          {"resfmain",Presfmain,4},
         {"pwr_mod",Ppwr_mod,6},          {"pwr_mod",Ppwr_mod,6},
         {"uhensel",Puhensel,4},          {"uhensel",Puhensel,4},
           {"sfuhensel",Psfuhensel,3},
         {0,0,0},          {0,0,0},
 };  };
   
Line 174  NODE *rp;
Line 177  NODE *rp;
         v = VR(f);          v = VR(f);
         for ( i = nf-1, top = 0; i >= 0; i-- ) {          for ( i = nf-1, top = 0; i >= 0; i-- ) {
                 lumtop(v,mod,bound,rlist->c[i],&s);                  lumtop(v,mod,bound,rlist->c[i],&s);
                   MKNODE(t,s,top); top = t;
           }
           *rp = top;
   }
   
   void Psfuhensel(arg,rp)
   NODE arg;
   LIST *rp;
   {
           P f;
           V x,y;
           NODE r;
   
           f = (P)ARG0(arg);
           x = VR((P)ARG1(arg));
           y = VR((P)ARG2(arg));
           sfuhensel(f,x,y,&r);
           MKLIST(*rp,r);
   }
   
   void sfuhensel(f,x,y,rp)
   P f;
   V x,y;
   NODE *rp;
   {
           ML lift;
           int i;
           P s;
           NODE t,top;
   
           sfhensel(5,f,x,&lift);
           for ( i = lift->n-1, top = 0; i >= 0; i-- ) {
                   sfbmtop(CO,lift->bound,lift->c[i],x,y,&s);
                 MKNODE(t,s,top); top = t;                  MKNODE(t,s,top); top = t;
         }          }
         *rp = top;          *rp = top;
Legend:
Removed from v.1.5  
changed lines
  Added in v.1.7
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>