Go to the source code of this file.
◆ bit_reduce()
      
        
          | void bit_reduce  | 
          ( | 
          poly &  | 
          f,  | 
        
        
           | 
           | 
          ring  | 
          r  | 
        
        
           | 
          ) | 
           |  | 
        
      
 
Definition at line 15 of file digitech.cc.
   16{
   21  {
   24 
   28    {
   32 
   33    }
   35    int pseudo_len=0;
   38  }
   39 
   40  int len=0;
   41  poly erg;
   45}
static int max(int a, int b)
 
void kBucketClear(kBucket_pt bucket, poly *p, int *length)
 
void kBucketDestroy(kBucket_pt *bucket_pt)
 
void kBucketInit(kBucket_pt bucket, poly lm, int length)
 
kBucket_pt kBucketCreate(const ring bucket_ring)
Creation/Destruction of buckets.
 
void kBucket_Add_q(kBucket_pt bucket, poly q, int *l)
Add to Bucket a poly ,i.e. Bpoly == q+Bpoly.
 
gmp_float exp(const gmp_float &a)
 
static unsigned long p_SetExp(poly p, const unsigned long e, const unsigned long iBitmask, const int VarOffset)
set a single variable exponent @Note: VarOffset encodes the position in p->exp
 
static void p_Setm(poly p, const ring r)
 
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent @Note: the integer VarOffset encodes:
 
static short rVar(const ring r)
#define rVar(r) (r->N)
 
 
 
 
◆ uni_subst_bits()
      
        
          | poly uni_subst_bits  | 
          ( | 
          poly  | 
          outer_uni,  | 
        
        
           | 
           | 
          poly  | 
          inner_multi,  | 
        
        
           | 
           | 
          ring  | 
          r  | 
        
        
           | 
          ) | 
           |  | 
        
      
 
Definition at line 47 of file digitech.cc.
   48{
   50  
   52  poly* potences=(poly*) 
omAlloc((d_max+1)*
sizeof(poly));
 
   56  {
   59  }
   60 
   64 
   65 
   67  {
   70    int pseudo_len=0;
   74  }
   75 
   76  
   78  {
   80  }
   82  int len=0;
   83  poly erg;
   86  return(erg);
   87}
void bit_reduce(poly &f, ring r)
 
STATIC_INST_VAR ideal zero_ideal
 
poly p_ISet(long i, const ring r)
returns the poly representing the integer i
 
static poly p_Mult_nn(poly p, number n, const ring r)
 
static void p_Delete(poly *p, const ring r)
 
static poly pp_Mult_qq(poly p, poly q, const ring r)
 
ideal idInit(int idsize, int rank)
initialise an ideal / module
 
 
 
 
◆ zero_ideal