[BACK]Return to datatype.h CVS log [TXT][DIR] Up to [local] / OpenXM / src / kan96xx / Kan

Diff for /OpenXM/src/kan96xx/Kan/datatype.h between version 1.4 and 1.12

version 1.4, 2003/06/26 08:14:46 version 1.12, 2006/12/21 05:29:49
Line 1 
Line 1 
 /* $OpenXM: OpenXM/src/kan96xx/Kan/datatype.h,v 1.3 2002/09/08 10:49:49 takayama Exp $ */  /* $OpenXM: OpenXM/src/kan96xx/Kan/datatype.h,v 1.11 2005/06/16 06:54:55 takayama Exp $ */
 #include "gmp.h"  #include "gmp.h"
   
 /* GC */  /* GC */
Line 29  void KSstop();
Line 29  void KSstop();
                         must be larger than AGLIMIT. They are automatically                          must be larger than AGLIMIT. They are automatically
                         determined by the value of AGLIMIT. */                          determined by the value of AGLIMIT. */
   
   #define LARGE_NEGATIVE_NUMBER (-0x7fffffff)  /* for 32 bit */
   
 typedef struct listPoly *   POLY;  typedef struct listPoly *   POLY;
 typedef struct monomial *   MONOMIAL;  typedef struct monomial *   MONOMIAL;
Line 63  struct ring {
Line 64  struct ring {
   int cc;    int cc;
   char **x;    char **x;
   char **D;    char **D;
     char **Dsmall;
   int *order;   /* [i][j] ---> [i*2*N+j] */    int *order;   /* [i][j] ---> [i*2*N+j] */
   int orderMatrixSize;    int orderMatrixSize;
   int *from;    int *from;
Line 75  struct ring {
Line 77  struct ring {
   char *name;    char *name;
   int weightedHomogenization;    int weightedHomogenization;
   int degreeShiftSize;    int degreeShiftSize;
     int degreeShiftN;
   int *degreeShift;    int *degreeShift;
     int partialEcart;
     int *partialEcartGlobalVarX;
   
   /* To be used. */
     void *ringInInputForm;
 };  };
   
   
Line 159  struct polySet {
Line 167  struct polySet {
   int *mark;          /* if (mark[i]), then syz[i] is simplified. */    int *mark;          /* if (mark[i]), then syz[i] is simplified. */
   int *serial;        /* serial[i]=k ===> g[i] is input[k] */    int *serial;        /* serial[i]=k ===> g[i] is input[k] */
   int size;           /* size of this set. i.e., g[0], g[1], ..., g[size-1] */    int size;           /* size of this set. i.e., g[0], g[1], ..., g[size-1] */
   int lim;    int lim;
     POLY *gh;           /* gh[i] = homogenize(g[i]) for ecart division */
     int *gen;           /* gen[i] == 1 --> given generators */
     POLY *gmod;         /* gmod = g mod p for TraceLift. */
 };  };
   
 struct pair {  struct pair {
Line 177  struct gradedPolySet {
Line 188  struct gradedPolySet {
   struct polySet **polys;  /* polys[0]: grade=0, polys[1]:grade=1, ... */    struct polySet **polys;  /* polys[0]: grade=0, polys[1]:grade=1, ... */
   int maxGrade;            /* maximal grade in this set */    int maxGrade;            /* maximal grade in this set */
   int lim;    int lim;
     int gb;  /* it is gb or not. */
     int reduced; /* it is reduced gb or not. */
 };  };
   
 struct gradedPairs {  struct gradedPairs {
Legend:
Removed from v.1.4  
changed lines
  Added in v.1.12
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>