My Project  UNKNOWN_GIT_VERSION
Data Structures | Macros | Typedefs | Enumerations | Functions
tgb_internal.h File Reference
#include "omalloc/omalloc.h"
#include <algorithm>
#include <vector>
#include <stdlib.h>
#include "misc/options.h"
#include "coeffs/modulop.h"
#include "polys/monomials/p_polys.h"
#include "polys/monomials/ring.h"
#include "polys/kbuckets.h"
#include "kernel/ideals.h"
#include "kernel/polys.h"
#include "kernel/GBEngine/kutil.h"
#include "kernel/GBEngine/kInline.h"
#include "kernel/GBEngine/kstd1.h"

Go to the source code of this file.

Data Structures

class  PolySimple
 
class  MonRedResNP< number_type >
 
struct  sorted_pair_node
 
struct  poly_list_node
 
struct  int_pair_node
 
struct  monom_poly
 
struct  mp_array_list
 
struct  poly_array_list
 
class  slimgb_alg
 
class  red_object
 
class  reduction_step
 makes on each red_object in a region a single_step More...
 
class  simple_reducer
 
struct  find_erg
 
class  NoroCacheNode
 
class  DenseRow
 
class  SparseRow< number_type >
 
class  DataNoroCacheNode< number_type >
 
class  TermNoroDataNode< number_type >
 
class  NoroCache< number_type >
 
class  CoefIdx< number_type >
 
class  ModPMatrixProxyOnArray< number_type >
 
class  ModPMatrixBackSubstProxyOnArray< number_type >
 

Macros

#define USE_NORO   1
 
#define FULLREDUCTIONS
 
#define REDTAIL_S
 
#define PAR_N   100
 
#define PAR_N_F4   5000
 
#define AC_NEW_MIN   2
 
#define AC_FLATTEN   1
 
#define NORO_CACHE   1
 
#define NORO_SPARSE_ROWS_PRE   1
 
#define NORO_NON_POLY   1
 
#define npInit   n_Init
 
#define npNeg   npNegM
 
#define npInvers   npInversM
 
#define npIsOne   npIsOne
 
#define npIsZero   npIsZeroM
 
#define npMult   npMult
 
#define slim_prec_cast(a)   (unsigned int) (unsigned long) (a)
 
#define F4mat_to_number_type(a)   (number_type) slim_prec_cast(a)
 

Typedefs

typedef unsigned short tgb_uint16
 
typedef unsigned char tgb_uint8
 
typedef unsigned int tgb_uint32
 

Enumerations

enum  calc_state { UNCALCULATED , HASTREP }
 

Functions

template<class len_type , class set_type >
int pos_helper (kStrategy strat, poly p, len_type len, set_type setL, polyset set)
 
void free_sorted_pair_node (sorted_pair_node *s, const ring r)
 
ideal do_t_rep_gb (ring r, ideal arg_I, int syz_comp, BOOLEAN F4_mode, int deg_pos)
 
void now_t_rep (const int &arg_i, const int &arg_j, slimgb_alg *c)
 
void clean_top_of_pair_list (slimgb_alg *c)
 
int slim_nsize (number n, ring r)
 
sorted_pair_nodequick_pop_pair (slimgb_alg *c)
 
sorted_pair_nodetop_pair (slimgb_alg *c)
 
sorted_pair_node ** add_to_basis_ideal_quotient (poly h, slimgb_alg *c, int *ip)
 
sorted_pair_node ** spn_merge (sorted_pair_node **p, int pn, sorted_pair_node **q, int qn, slimgb_alg *c)
 
int kFindDivisibleByInS_easy (kStrategy strat, const red_object &obj)
 
int tgb_pair_better_gen2 (const void *ap, const void *bp)
 
int kFindDivisibleByInS_easy (kStrategy strat, poly p, long sev)
 
template<class number_type >
SparseRow< number_type > * noro_red_to_non_poly_t (poly p, int &len, NoroCache< number_type > *cache, slimgb_alg *c)
 
template<class number_type >
MonRedResNP< number_type > noro_red_mon_to_non_poly (poly t, NoroCache< number_type > *cache, slimgb_alg *c)
 
template<class number_type >
SparseRow< number_type > * convert_to_sparse_row (number_type *temp_array, int temp_size, int non_zeros)
 
template<class number_type >
void add_coef_times_sparse (number_type *const temp_array, int, SparseRow< number_type > *row, number coef)
 
template<class number_type >
void add_coef_times_dense (number_type *const temp_array, int, const number_type *row, int len, number coef)
 
template<class number_type >
void add_dense (number_type *const temp_array, int, const number_type *row, int len)
 
template<class number_type >
void sub_dense (number_type *const temp_array, int, const number_type *row, int len)
 
template<class number_type >
void add_sparse (number_type *const temp_array, int, SparseRow< number_type > *row)
 
template<class number_type >
void sub_sparse (number_type *const temp_array, int, SparseRow< number_type > *row)
 
template<class number_type >
SparseRow< number_type > * noro_red_to_non_poly_dense (MonRedResNP< number_type > *mon, int len, NoroCache< number_type > *cache)
 
template<class number_type >
void write_coef_times_xx_idx_to_buffer (CoefIdx< number_type > *const pairs, int &pos, int *const idx_array, number_type *const coef_array, const int rlen, const number coef)
 
template<class number_type >
void write_coef_times_xx_idx_to_buffer_dense (CoefIdx< number_type > *const pairs, int &pos, number_type *const coef_array, const int rlen, const number coef)
 
template<class number_type >
void write_coef_idx_to_buffer_dense (CoefIdx< number_type > *const pairs, int &pos, number_type *const coef_array, const int rlen)
 
template<class number_type >
void write_minus_coef_idx_to_buffer_dense (CoefIdx< number_type > *const pairs, int &pos, number_type *const coef_array, const int rlen)
 
template<class number_type >
void write_coef_idx_to_buffer (CoefIdx< number_type > *const pairs, int &pos, int *const idx_array, number_type *const coef_array, const int rlen)
 
template<class number_type >
void write_minus_coef_idx_to_buffer (CoefIdx< number_type > *const pairs, int &pos, int *const idx_array, number_type *const coef_array, const int rlen)
 
template<class number_type >
SparseRow< number_type > * noro_red_to_non_poly_sparse (MonRedResNP< number_type > *mon, int len, NoroCache< number_type > *cache)
 
wlen_type pELength (poly p, ring r)
 
int terms_sort_crit (const void *a, const void *b)
 
template<class number_type >
void write_poly_to_row (number_type *row, poly h, poly *terms, int tn, ring r)
 
template<class number_type >
poly row_to_poly (number_type *row, poly *terms, int tn, ring r)
 
template<class number_type >
int modP_lastIndexRow (number_type *row, int ncols)
 
template<class number_type >
int term_nodes_sort_crit (const void *a, const void *b)
 
template<class number_type >
void simplest_gauss_modp (number_type *a, int nrows, int ncols)
 
template<class number_type >
void noro_step (poly *p, int &pn, slimgb_alg *c)
 

Data Structure Documentation

◆ sorted_pair_node

struct sorted_pair_node

Definition at line 158 of file tgb_internal.h.

Data Fields
int deg
wlen_type expected_length
int i
int j
poly lcm_of_lm

◆ poly_list_node

struct poly_list_node

Definition at line 182 of file tgb_internal.h.

Data Fields
poly_list_node * next
poly p

◆ int_pair_node

struct int_pair_node

Definition at line 188 of file tgb_internal.h.

Data Fields
int a
int b
int_pair_node * next

◆ monom_poly

struct monom_poly

Definition at line 194 of file tgb_internal.h.

Data Fields
poly f
poly m

◆ mp_array_list

struct mp_array_list

Definition at line 199 of file tgb_internal.h.

Data Fields
monom_poly * mp
mp_array_list * next
int size

◆ poly_array_list

struct poly_array_list

Definition at line 207 of file tgb_internal.h.

Data Fields
poly_array_list * next
poly * p
int size

◆ find_erg

struct find_erg

Definition at line 386 of file tgb_internal.h.

Data Fields
poly expand
int expand_length
BOOLEAN fromS
int reduce_by
int to_reduce_l
int to_reduce_u

◆ TermNoroDataNode

class TermNoroDataNode

template<class number_type>
class TermNoroDataNode< number_type >

Definition at line 583 of file tgb_internal.h.

Data Fields
DataNoroCacheNode< number_type > * node
poly t

Macro Definition Documentation

◆ AC_FLATTEN

#define AC_FLATTEN   1

Definition at line 23 of file tgb_internal.h.

◆ AC_NEW_MIN

#define AC_NEW_MIN   2

Definition at line 22 of file tgb_internal.h.

◆ F4mat_to_number_type

#define F4mat_to_number_type (   a)    (number_type) slim_prec_cast(a)

Definition at line 428 of file tgb_internal.h.

◆ FULLREDUCTIONS

#define FULLREDUCTIONS

Definition at line 15 of file tgb_internal.h.

◆ NORO_CACHE

#define NORO_CACHE   1

Definition at line 29 of file tgb_internal.h.

◆ NORO_NON_POLY

#define NORO_NON_POLY   1

Definition at line 31 of file tgb_internal.h.

◆ NORO_SPARSE_ROWS_PRE

#define NORO_SPARSE_ROWS_PRE   1

Definition at line 30 of file tgb_internal.h.

◆ npInit

#define npInit   n_Init

Definition at line 72 of file tgb_internal.h.

◆ npInvers

#define npInvers   npInversM

Definition at line 74 of file tgb_internal.h.

◆ npIsOne

#define npIsOne   npIsOne

Definition at line 75 of file tgb_internal.h.

◆ npIsZero

#define npIsZero   npIsZeroM

Definition at line 76 of file tgb_internal.h.

◆ npMult

#define npMult   npMult

Definition at line 78 of file tgb_internal.h.

◆ npNeg

#define npNeg   npNegM

Definition at line 73 of file tgb_internal.h.

◆ PAR_N

#define PAR_N   100

Definition at line 20 of file tgb_internal.h.

◆ PAR_N_F4

#define PAR_N_F4   5000

Definition at line 21 of file tgb_internal.h.

◆ REDTAIL_S

#define REDTAIL_S

Definition at line 19 of file tgb_internal.h.

◆ slim_prec_cast

#define slim_prec_cast (   a)    (unsigned int) (unsigned long) (a)

Definition at line 427 of file tgb_internal.h.

◆ USE_NORO

#define USE_NORO   1

Definition at line 10 of file tgb_internal.h.

Typedef Documentation

◆ tgb_uint16

typedef unsigned short tgb_uint16

Definition at line 429 of file tgb_internal.h.

◆ tgb_uint32

typedef unsigned int tgb_uint32

Definition at line 431 of file tgb_internal.h.

◆ tgb_uint8

typedef unsigned char tgb_uint8

Definition at line 430 of file tgb_internal.h.

Enumeration Type Documentation

◆ calc_state

enum calc_state
Enumerator
UNCALCULATED 
HASTREP 

Definition at line 325 of file tgb_internal.h.

326  {
327  UNCALCULATED,
328  HASTREP//,
329  //UNIMPORTANT,
330  //SOONTREP
331  };
@ UNCALCULATED
Definition: tgb_internal.h:327
@ HASTREP
Definition: tgb_internal.h:328

Function Documentation

◆ add_coef_times_dense()

template<class number_type >
void add_coef_times_dense ( number_type *const  temp_array,
int  ,
const number_type *  row,
int  len,
number  coef 
)

Definition at line 953 of file tgb_internal.h.

959 {
960  int j;
961  const number_type* const coef_array=row;
962  //int* const idx_array=row->idx_array;
963  //const int len=temp_size;
964  tgb_uint32 buffer[256];
965  const tgb_uint32 prime=n_GetChar(currRing->cf);
966  const tgb_uint32 c=F4mat_to_number_type(coef);
967  assume(!(npIsZero(coef,currRing->cf)));
968  for(j=0;j<len;j=j+256)
969  {
970  const int bound=std::min(j+256,len);
971  int i;
972  int bpos=0;
973  for(i=j;i<bound;i++)
974  {
975  buffer[bpos++]=coef_array[i];
976  }
977  int bpos_bound=bound-j;
978  for(i=0;i<bpos_bound;i++)
979  {
980  buffer[i]*=c;
981  }
982  for(i=0;i<bpos_bound;i++)
983  {
984  buffer[i]=buffer[i]%prime;
985  }
986  bpos=0;
987  for(i=j;i<bound;i++)
988  {
989  //int idx=idx_array[i];
990  assume(bpos<256);
991  //assume(!(npIsZero((number) buffer[bpos])));
992  STATISTIC(n_Add); temp_array[i]=F4mat_to_number_type(npAddM((number)(long) temp_array[i], (number)(long) buffer[bpos++],currRing->cf));
993  #ifndef SING_NDEBUG
994  assume(i<temp_size);
995  #endif
996  }
997 
998  }
999 }
int i
Definition: cfEzgcd.cc:125
static CanonicalForm bound(const CFMatrix &M)
Definition: cf_linsys.cc:460
static FORCE_INLINE number n_Add(number a, number b, const coeffs r)
return the sum of 'a' and 'b', i.e., a+b
Definition: coeffs.h:656
static FORCE_INLINE int n_GetChar(const coeffs r)
Return the characteristic of the coeff. domain.
Definition: coeffs.h:444
int j
Definition: facHensel.cc:105
static int min(int a, int b)
Definition: fast_mult.cc:268
#define assume(x)
Definition: mod2.h:390
static number npAddM(number a, number b, const coeffs r)
Definition: modulop.h:125
#define STATISTIC(f)
Definition: numstats.h:16
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
Definition: polys.cc:13
unsigned int tgb_uint32
Definition: tgb_internal.h:431
#define npIsZero
Definition: tgb_internal.h:76
#define F4mat_to_number_type(a)
Definition: tgb_internal.h:428

◆ add_coef_times_sparse()

template<class number_type >
void add_coef_times_sparse ( number_type *const  temp_array,
int  ,
SparseRow< number_type > *  row,
number  coef 
)

Definition at line 905 of file tgb_internal.h.

911 {
912  int j;
913  number_type* const coef_array=row->coef_array;
914  int* const idx_array=row->idx_array;
915  const int len=row->len;
916  tgb_uint32 buffer[256];
917  const tgb_uint32 prime=n_GetChar(currRing->cf);
918  const tgb_uint32 c=F4mat_to_number_type(coef);
919  assume(!(npIsZero(coef,currRing->cf)));
920  for(j=0;j<len;j=j+256)
921  {
922  const int bound=std::min(j+256,len);
923  int i;
924  int bpos=0;
925  for(i=j;i<bound;i++)
926  {
927  buffer[bpos++]=coef_array[i];
928  }
929  int bpos_bound=bound-j;
930  for(i=0;i<bpos_bound;i++)
931  {
932  buffer[i]*=c;
933  }
934  for(i=0;i<bpos_bound;i++)
935  {
936  buffer[i]=buffer[i]%prime;
937  }
938  bpos=0;
939  for(i=j;i<bound;i++)
940  {
941  int idx=idx_array[i];
942  assume(bpos<256);
943  assume(!(npIsZero((number)(long) buffer[bpos],currRing->cf)));
944  STATISTIC(n_Add); temp_array[idx]=F4mat_to_number_type(npAddM((number)(long) temp_array[idx], (number)(long) buffer[bpos++],currRing->cf));
945  #ifndef SING_NDEBUG
946  assume(idx<temp_size);
947  #endif
948  }
949 
950  }
951 }
number_type * coef_array
Definition: tgb_internal.h:518
int * idx_array
Definition: tgb_internal.h:517

◆ add_dense()

template<class number_type >
void add_dense ( number_type *const  temp_array,
int  ,
const number_type *  row,
int  len 
)

Definition at line 1001 of file tgb_internal.h.

1007 {
1008  //int j;
1009  //const number_type* const coef_array=row;
1010  //int* const idx_array=row->idx_array;
1011  //const int len=temp_size;
1012  //tgb_uint32 buffer[256];
1013  //const tgb_uint32 prime=npPrimeM;
1014  //const tgb_uint32 c=F4mat_to_number_type(coef);
1015 
1016  int i;
1017  for(i=0;i<len;i++)
1018  {
1019  STATISTIC(n_Add); temp_array[i]=F4mat_to_number_type(npAddM((number)(long) temp_array[i], (number)(long) row[i],currRing->cf));
1020  #ifndef SING_NDEBUG
1021  assume(i<temp_size);
1022  #endif
1023  }
1024 
1025 }

◆ add_sparse()

template<class number_type >
void add_sparse ( number_type *const  temp_array,
int  ,
SparseRow< number_type > *  row 
)

Definition at line 1055 of file tgb_internal.h.

1059 {
1060  int j;
1061 
1062  number_type* const coef_array=row->coef_array;
1063  int* const idx_array=row->idx_array;
1064  const int len=row->len;
1065  for(j=0;j<len;j++)
1066  {
1067  int idx=idx_array[j];
1068  STATISTIC(n_Add); temp_array[idx]=F4mat_to_number_type( (number_type)(long)npAddM((number) (long)temp_array[idx],(number)(long) coef_array[j],currRing->cf));
1069  #ifndef SING_NDEBUG
1070  assume(idx<temp_size);
1071  #endif
1072  }
1073 }

◆ add_to_basis_ideal_quotient()

sorted_pair_node** add_to_basis_ideal_quotient ( poly  h,
slimgb_alg c,
int *  ip 
)

Definition at line 1426 of file tgb.cc.

1428 {
1429  p_Test (h, c->r);
1430  assume (h != NULL);
1431  poly got = gcd_of_terms (h, c->r);
1432  if((got != NULL) && (TEST_V_UPTORADICAL))
1433  {
1434  poly copy = p_Copy (got, c->r);
1435  //p_wrp(got,c->r);
1436  BOOLEAN changed = monomial_root (got, c->r);
1437  if(changed)
1438  {
1439  poly div_by = pMDivide (copy, got);
1440  poly iter = h;
1441  while(iter)
1442  {
1443  pExpVectorSub (iter, div_by);
1444  pIter (iter);
1445  }
1446  p_Delete (&div_by, c->r);
1447  PrintS ("U");
1448  }
1449  p_Delete (&copy, c->r);
1450  }
1451 
1452 #define ENLARGE(pointer, type) pointer=(type*) omrealloc(pointer, c->array_lengths*sizeof(type))
1453 
1454 #define ENLARGE_ALIGN(pointer, type) {if(pointer)\
1455  pointer=(type*)omReallocAligned(pointer, c->array_lengths*sizeof(type));\
1456  else pointer=(type*)omAllocAligned(c->array_lengths*sizeof(type));}
1457 // BOOLEAN corr=lenS_correct(c->strat);
1458  int sugar;
1459  int ecart = 0;
1460  ++(c->n);
1461  ++(c->S->ncols);
1462  int i, j;
1463  i = c->n - 1;
1464  sorted_pair_node **nodes =
1465  (sorted_pair_node **) omalloc (sizeof (sorted_pair_node *) * i);
1466  int spc = 0;
1467  if(c->n > c->array_lengths)
1468  {
1469  c->array_lengths = c->array_lengths * 2;
1470  assume (c->array_lengths >= c->n);
1471  ENLARGE (c->T_deg, int);
1472  ENLARGE_ALIGN (c->tmp_pair_lm, poly);
1474 
1475  ENLARGE_ALIGN (c->short_Exps, long);
1476  ENLARGE (c->lengths, int);
1477 #ifndef HAVE_BOOST
1478 #ifndef USE_STDVECBOOL
1479 
1480  ENLARGE_ALIGN (c->states, char *);
1481 #endif
1482 #endif
1483  ENLARGE_ALIGN (c->gcd_of_terms, poly);
1484  //if (c->weighted_lengths!=NULL) {
1486  //}
1487  //ENLARGE_ALIGN(c->S->m,poly);
1488  }
1489  pEnlargeSet (&c->S->m, c->n - 1, 1);
1490  if(c->T_deg_full)
1491  ENLARGE (c->T_deg_full, int);
1492  sugar = c->T_deg[i] = c->pTotaldegree (h);
1493  if(c->T_deg_full)
1494  {
1495  sugar = c->T_deg_full[i] = c->pTotaldegree_full (h);
1496  ecart = sugar - c->T_deg[i];
1497  assume (ecart >= 0);
1498  }
1499  c->tmp_pair_lm[i] = pOne_Special (c->r);
1500 
1501  c->tmp_spn[i] = (sorted_pair_node *) omAlloc (sizeof (sorted_pair_node));
1502 
1503  c->lengths[i] = pLength (h);
1504 
1505  //necessary for correct weighted length
1506 
1508  {
1509  p_Cleardenom (h, c->r); //includes p_Content(h,c->r);
1510  }
1511  else
1512  pNorm (h);
1513  //pNormalize (h);
1514 
1515  c->weighted_lengths[i] = pQuality (h, c, c->lengths[i]);
1516  c->gcd_of_terms[i] = got;
1517 #ifdef HAVE_BOOST
1518  c->states.push_back (dynamic_bitset <> (i));
1519 
1520 #else
1521 #ifdef USE_STDVECBOOL
1522 
1523  c->states.push_back (vector < bool > (i));
1524 
1525 #else
1526  if(i > 0)
1527  c->states[i] = (char *) omAlloc (i * sizeof (char));
1528  else
1529  c->states[i] = NULL;
1530 #endif
1531 #endif
1532 
1533  c->S->m[i] = h;
1534  c->short_Exps[i] = p_GetShortExpVector (h, c->r);
1535 
1536 #undef ENLARGE
1537 #undef ENLARGE_ALIGN
1538  if(p_GetComp (h, currRing) <= c->syz_comp)
1539  {
1540  for(j = 0; j < i; j++)
1541  {
1542 
1543 
1544 #ifndef HAVE_BOOST
1545  c->states[i][j] = UNCALCULATED;
1546 #endif
1547  assume (p_LmDivisibleBy (c->S->m[i], c->S->m[j], c->r) ==
1548  p_LmShortDivisibleBy (c->S->m[i], c->short_Exps[i], c->S->m[j],
1549  ~(c->short_Exps[j]), c->r));
1550 
1551  if(__p_GetComp (c->S->m[i], c->r) != __p_GetComp (c->S->m[j], c->r))
1552  {
1553  //c->states[i][j]=UNCALCULATED;
1554  //WARNUNG: be careful
1555  continue;
1556  }
1557  else if((!c->nc) && (c->lengths[i] == 1) && (c->lengths[j] == 1))
1558  {
1559  c->states[i][j] = HASTREP;
1560  }
1561  else if(((!c->nc) || (c->is_homog && rIsSCA (c->r)))
1562  && (pHasNotCF (c->S->m[i], c->S->m[j])))
1563 // else if ((!(c->nc)) && (pHasNotCF(c->S->m[i],c->S->m[j])))
1564  {
1565  c->easy_product_crit++;
1566  c->states[i][j] = HASTREP;
1567  continue;
1568  }
1569  else
1571  (c->S->m[i], c->gcd_of_terms[i], c->S->m[j], c->gcd_of_terms[j],
1572  c))
1573  {
1574  c->states[i][j] = HASTREP;
1575  c->extended_product_crit++;
1576  //PrintS("E");
1577  }
1578  // if (c->states[i][j]==UNCALCULATED)
1579  // {
1580 
1581  if((TEST_V_FINDMONOM) && (!c->nc))
1582  {
1583  //PrintS("COMMU");
1584  // if (c->lengths[i]==c->lengths[j])
1585  // {
1586 // poly short_s=ksCreateShortSpoly(c->S->m[i],c->S->m[j],c->r);
1587 // if (short_s==NULL)
1588 // {
1589 // c->states[i][j]=HASTREP;
1590 // }
1591 // else
1592 // {
1593 // p_Delete(&short_s, currRing);
1594 // }
1595 // }
1596  if(c->lengths[i] + c->lengths[j] == 3)
1597  {
1598 
1599 
1600  poly short_s = ksCreateShortSpoly (c->S->m[i], c->S->m[j], c->r);
1601  if(short_s == NULL)
1602  {
1603  c->states[i][j] = HASTREP;
1604  }
1605  else
1606  {
1607  assume (pLength (short_s) == 1);
1608  if(TEST_V_UPTORADICAL)
1609  monomial_root (short_s, c->r);
1610  int iS = kFindDivisibleByInS_easy (c->strat, short_s,
1611  p_GetShortExpVector (short_s,
1612  c->r));
1613  if(iS < 0)
1614  {
1615  //PrintS("N");
1616  if(TRUE)
1617  {
1618  c->states[i][j] = HASTREP;
1619  add_later (short_s, "N", c);
1620  }
1621  else
1622  p_Delete (&short_s, currRing);
1623  }
1624  else
1625  {
1626  if(c->strat->lenS[iS] > 1)
1627  {
1628  //PrintS("O");
1629  if(TRUE)
1630  {
1631  c->states[i][j] = HASTREP;
1632  add_later (short_s, "O", c);
1633  }
1634  else
1635  p_Delete (&short_s, currRing);
1636  }
1637  else
1638  p_Delete (&short_s, currRing);
1639  c->states[i][j] = HASTREP;
1640  }
1641 
1642 
1643  }
1644  }
1645  }
1646  // if (short_s)
1647  // {
1648  assume (spc <= j);
1649  sorted_pair_node *s = c->tmp_spn[spc]; //(sorted_pair_node*) omalloc(sizeof(sorted_pair_node));
1650  s->i = si_max (i, j);
1651  s->j = si_min (i, j);
1652  assume (s->j == j);
1653  s->expected_length = pair_weighted_length (i, j, c); //c->lengths[i]+c->lengths[j]-2;
1654 
1655  poly lm = c->tmp_pair_lm[spc]; //=pOne_Special();
1656 
1657  pLcm (c->S->m[i], c->S->m[j], lm);
1658  pSetm (lm);
1659  p_Test (lm, c->r);
1660  s->deg = c->pTotaldegree (lm);
1661 
1662  if(c->T_deg_full) //Sugar
1663  {
1664  int t_i = c->T_deg_full[s->i] - c->T_deg[s->i];
1665  int t_j = c->T_deg_full[s->j] - c->T_deg[s->j];
1666  s->deg += si_max (t_i, t_j);
1667  //Print("\n max: %d\n",max(t_i,t_j));
1668  }
1669  p_Test (lm, c->r);
1670  s->lcm_of_lm = lm;
1671  // pDelete(&short_s);
1672  //assume(lm!=NULL);
1673  nodes[spc] = s;
1674  spc++;
1675 
1676  // }
1677  //else
1678  //{
1679  //c->states[i][j]=HASTREP;
1680  //}
1681  }
1682  } //if syz_comp end
1683 
1684  assume (spc <= i);
1685  //now ideal quotient crit
1686  qsort (nodes, spc, sizeof (sorted_pair_node *), iq_crit);
1687 
1688  sorted_pair_node **nodes_final =
1689  (sorted_pair_node **) omalloc (sizeof (sorted_pair_node *) * i);
1690  int spc_final = 0;
1691  j = 0;
1692  while(j < spc)
1693  {
1694  int lower = j;
1695  int upper;
1696  BOOLEAN has = FALSE;
1697  for(upper = lower + 1; upper < spc; upper++)
1698  {
1699  if(!pLmEqual (nodes[lower]->lcm_of_lm, nodes[upper]->lcm_of_lm))
1700  {
1701  break;
1702  }
1703  if(has_t_rep (nodes[upper]->i, nodes[upper]->j, c))
1704  has = TRUE;
1705  }
1706  upper = upper - 1;
1707  int z;
1708  assume (spc_final <= j);
1709  for(z = 0; z < spc_final; z++)
1710  {
1711  if(p_LmDivisibleBy
1712  (nodes_final[z]->lcm_of_lm, nodes[lower]->lcm_of_lm, c->r))
1713  {
1714  has = TRUE;
1715  break;
1716  }
1717  }
1718 
1719  if(has)
1720  {
1721  for(; lower <= upper; lower++)
1722  {
1723  //free_sorted_pair_node(nodes[lower],c->r);
1724  //omfree(nodes[lower]);
1725  nodes[lower] = NULL;
1726  }
1727  j = upper + 1;
1728  continue;
1729  }
1730  else
1731  {
1732  p_Test (nodes[lower]->lcm_of_lm, c->r);
1733  nodes[lower]->lcm_of_lm = pCopy (nodes[lower]->lcm_of_lm);
1734  assume (__p_GetComp (c->S->m[nodes[lower]->i], c->r) ==
1735  __p_GetComp (c->S->m[nodes[lower]->j], c->r));
1736  nodes_final[spc_final] =
1737  (sorted_pair_node *) omAlloc (sizeof (sorted_pair_node));
1738 
1739  *(nodes_final[spc_final++]) = *(nodes[lower]);
1740  //c->tmp_spn[nodes[lower]->j]=(sorted_pair_node*) omalloc(sizeof(sorted_pair_node));
1741  nodes[lower] = NULL;
1742  for(lower = lower + 1; lower <= upper; lower++)
1743  {
1744  // free_sorted_pair_node(nodes[lower],c->r);
1745  //omfree(nodes[lower]);
1746  nodes[lower] = NULL;
1747  }
1748  j = upper + 1;
1749  continue;
1750  }
1751  }
1752 
1753  // Print("i:%d,spc_final:%d",i,spc_final);
1754 
1755  assume (spc_final <= spc);
1756  omFree (nodes);
1757  nodes = NULL;
1758 
1759  add_to_reductors (c, h, c->lengths[c->n - 1], ecart, TRUE);
1760  //i=posInS(c->strat,c->strat->sl,h,0 ecart);
1761  if(!(c->nc))
1762  {
1763  if(c->lengths[c->n - 1] == 1)
1764  shorten_tails (c, c->S->m[c->n - 1]);
1765  }
1766  //you should really update c->lengths, c->strat->lenS, and the oder of polys in strat if you sort after lengths
1767 
1768  //for(i=c->strat->sl; i>0;i--)
1769  // if(c->strat->lenS[i]<c->strat->lenS[i-1]) printf("fehler bei %d\n",i);
1770  if(c->Rcounter > 50)
1771  {
1772  c->Rcounter = 0;
1773  cleanS (c->strat, c);
1774  }
1775 
1776 #ifdef HAVE_PLURAL
1777  // for SCA:
1778  // here write at the end of nodes_final[spc_final,...,spc_final+lmdeg-1]
1779  if(rIsSCA (c->r))
1780  {
1781  const poly pNext = pNext (h);
1782 
1783  if(pNext != NULL)
1784  {
1785  // for additional polynomials
1786  const unsigned int m_iFirstAltVar = scaFirstAltVar (c->r);
1787  const unsigned int m_iLastAltVar = scaLastAltVar (c->r);
1788 
1789  int N = // c->r->N;
1790  m_iLastAltVar - m_iFirstAltVar + 1; // should be enough
1791  // TODO: but we may also use got = gcd({m}_{m\in f}))!
1792 
1793  poly *array_arg = (poly *) omalloc (N * sizeof (poly)); // !
1794  int j = 0;
1795 
1796 
1797  for(unsigned short v = m_iFirstAltVar; v <= m_iLastAltVar; v++)
1798  // for all x_v | Ann(lm(h))
1799  if(p_GetExp (h, v, c->r)) // TODO: use 'got' here!
1800  {
1801  assume (p_GetExp (h, v, c->r) == 1);
1802 
1803  poly p = sca_pp_Mult_xi_pp (v, pNext, c->r); // x_v * h;
1804 
1805  if(p != NULL) // if (x_v * h != 0)
1806  array_arg[j++] = p;
1807  } // for all x_v | Ann(lm(h))
1808 
1809  c->introduceDelayedPairs (array_arg, j);
1810 
1811  omFree (array_arg); // !!!
1812  }
1813 // PrintS("Saturation - done!!!\n");
1814  }
1815 #endif // if SCAlgebra
1816 
1817 
1818  if(!ip)
1819  {
1820  qsort (nodes_final, spc_final, sizeof (sorted_pair_node *),
1822 
1823 
1824  c->apairs =
1825  spn_merge (c->apairs, c->pair_top + 1, nodes_final, spc_final, c);
1826  c->pair_top += spc_final;
1828  omFree (nodes_final);
1829  return NULL;
1830  }
1831  {
1832  *ip = spc_final;
1833  return nodes_final;
1834  }
1835 }
static int si_max(const int a, const int b)
Definition: auxiliary.h:138
int BOOLEAN
Definition: auxiliary.h:85
#define TRUE
Definition: auxiliary.h:98
#define FALSE
Definition: auxiliary.h:94
static int si_min(const int a, const int b)
Definition: auxiliary.h:139
const CanonicalForm CFMap CFMap & N
Definition: cfEzgcd.cc:49
int p
Definition: cfModGcd.cc:4019
intset lenS
Definition: kutil.h:310
unsigned long pTotaldegree(poly p)
Definition: tgb_internal.h:289
sorted_pair_node ** apairs
Definition: tgb_internal.h:244
BOOLEAN nc
Definition: tgb_internal.h:285
kStrategy strat
Definition: tgb_internal.h:235
int * T_deg_full
Definition: tgb_internal.h:237
int array_lengths
Definition: tgb_internal.h:264
int easy_product_crit
Definition: tgb_internal.h:271
int * lengths
Definition: tgb_internal.h:232
int extended_product_crit
Definition: tgb_internal.h:272
sorted_pair_node ** tmp_spn
Definition: tgb_internal.h:240
void introduceDelayedPairs(poly *pa, int s)
Definition: tgb.cc:3102
char ** states
Definition: tgb_internal.h:224
poly * gcd_of_terms
Definition: tgb_internal.h:242
poly * tmp_pair_lm
Definition: tgb_internal.h:239
long * short_Exps
Definition: tgb_internal.h:234
BOOLEAN is_homog
Definition: tgb_internal.h:281
int syz_comp
array_lengths should be greater equal n;
Definition: tgb_internal.h:263
int pTotaldegree_full(poly p)
Definition: tgb_internal.h:297
wlen_type * weighted_lengths
Definition: tgb_internal.h:233
CFFListIterator iter
Definition: facAbsBiFact.cc:54
const CanonicalForm int s
Definition: facAbsFact.cc:55
const Variable & v
< [in] a sqrfree bivariate poly
Definition: facBivar.h:37
CFArray copy(const CFList &list)
write elements of list into an array
static Poly * h
Definition: janet.cc:972
poly ksCreateShortSpoly(poly p1, poly p2, ring tailRing)
Definition: kspoly.cc:998
int64 wlen_type
Definition: kutil.h:50
static bool rIsSCA(const ring r)
Definition: nc.h:190
poly sca_pp_Mult_xi_pp(short i, const poly pPoly, const ring rRing)
Definition: sca.cc:1203
#define p_GetComp(p, r)
Definition: monomials.h:65
#define pIter(p)
Definition: monomials.h:38
#define pNext(p)
Definition: monomials.h:37
#define __p_GetComp(p, r)
Definition: monomials.h:64
#define omAlloc(size)
Definition: omAllocDecl.h:210
#define omalloc(size)
Definition: omAllocDecl.h:228
#define omFree(addr)
Definition: omAllocDecl.h:261
#define NULL
Definition: omList.c:10
#define TEST_OPT_INTSTRATEGY
Definition: options.h:109
#define TEST_V_FINDMONOM
Definition: options.h:139
#define TEST_V_UPTORADICAL
Definition: options.h:138
unsigned long p_GetShortExpVector(const poly p, const ring r)
Definition: p_polys.cc:4679
poly p_Cleardenom(poly p, const ring r)
Definition: p_polys.cc:2782
void pEnlargeSet(poly **p, int l, int increment)
Definition: p_polys.cc:3647
static BOOLEAN p_LmShortDivisibleBy(poly a, unsigned long sev_a, poly b, unsigned long not_sev_b, const ring r)
Definition: p_polys.h:1855
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent @Note: the integer VarOffset encodes:
Definition: p_polys.h:470
static BOOLEAN p_LmDivisibleBy(poly a, poly b, const ring r)
Definition: p_polys.h:1821
static void p_Delete(poly *p, const ring r)
Definition: p_polys.h:858
static unsigned pLength(poly a)
Definition: p_polys.h:193
static poly p_Copy(poly p, const ring r)
returns a copy of p
Definition: p_polys.h:813
#define p_Test(p, r)
Definition: p_polys.h:164
#define pSetm(p)
Definition: polys.h:265
#define pHasNotCF(p1, p2)
Definition: polys.h:257
#define pLmEqual(p1, p2)
Definition: polys.h:111
#define pExpVectorSub(p1, p2)
Definition: polys.h:88
void pNorm(poly p, const ring R=currRing)
Definition: polys.h:357
#define pMDivide(a, b)
Definition: polys.h:287
#define pCopy(p)
return a copy of the poly
Definition: polys.h:180
#define pLcm(a, b, m)
Definition: polys.h:289
void PrintS(const char *s)
Definition: reporter.cc:284
static short scaLastAltVar(ring r)
Definition: sca.h:25
static short scaFirstAltVar(ring r)
Definition: sca.h:18
static void shorten_tails(slimgb_alg *c, poly monom)
Definition: tgb.cc:3677
static poly gcd_of_terms(poly p, ring r)
Definition: tgb.cc:3983
static int add_to_reductors(slimgb_alg *c, poly h, int len, int ecart, BOOLEAN simplified=FALSE)
Definition: tgb.cc:965
int tgb_pair_better_gen2(const void *ap, const void *bp)
Definition: tgb.cc:680
static wlen_type pair_weighted_length(int i, int j, slimgb_alg *c)
Definition: tgb.cc:1373
void clean_top_of_pair_list(slimgb_alg *c)
Definition: tgb.cc:3883
#define ENLARGE(pointer, type)
static BOOLEAN monomial_root(poly m, ring r)
Definition: tgb.cc:89
#define ENLARGE_ALIGN(pointer, type)
int kFindDivisibleByInS_easy(kStrategy strat, const red_object &obj)
Definition: tgb.cc:685
sorted_pair_node ** spn_merge(sorted_pair_node **p, int pn, sorted_pair_node **q, int qn, slimgb_alg *c)
Definition: tgb.cc:751
static int iq_crit(const void *ap, const void *bp)
Definition: tgb.cc:1340
static void add_later(poly p, const char *prot, slimgb_alg *c)
Definition: tgb.cc:1292
static poly pOne_Special(const ring r=currRing)
Definition: tgb.cc:142
static void cleanS(kStrategy strat, slimgb_alg *c)
Definition: tgb.cc:919
static wlen_type pQuality(poly p, slimgb_alg *c, int l=-1)
Definition: tgb.cc:544
static BOOLEAN has_t_rep(const int &arg_i, const int &arg_j, slimgb_alg *state)
Definition: tgb.cc:3644
static BOOLEAN extended_product_criterion(poly p1, poly gcd1, poly p2, poly gcd2, slimgb_alg *c)
Definition: tgb.cc:4042

◆ clean_top_of_pair_list()

void clean_top_of_pair_list ( slimgb_alg c)

Definition at line 3883 of file tgb.cc.

3884 {
3885  while((c->pair_top >= 0) && (c->apairs[c->pair_top]->i >= 0)
3886  &&
3887  (!state_is
3888  (UNCALCULATED, c->apairs[c->pair_top]->j, c->apairs[c->pair_top]->i,
3889  c)))
3890  {
3891  free_sorted_pair_node (c->apairs[c->pair_top], c->r);
3892  c->pair_top--;
3893  }
3894 }
void free_sorted_pair_node(sorted_pair_node *s, const ring r)
Definition: tgb.cc:3916
static BOOLEAN state_is(calc_state state, const int &i, const int &j, slimgb_alg *c)
Definition: tgb.cc:3897

◆ convert_to_sparse_row()

template<class number_type >
SparseRow<number_type>* convert_to_sparse_row ( number_type *  temp_array,
int  temp_size,
int  non_zeros 
)

Definition at line 837 of file tgb_internal.h.

838 {
840 //int pos=0;
841 //Print("denseness:%f\n",((double) non_zeros/(double) temp_size));
842 number_type* it_coef=res->coef_array;
843 int* it_idx=res->idx_array;
844 #if 0
845 for(i=0;i<cache->nIrreducibleMonomials;i++)
846 {
847  if (!(0==temp_array[i]))
848  {
849 
850  res->idx_array[pos]=i;
851  res->coef_array[pos]=temp_array[i];
852 
853  pos++;
854  non_zeros--;
855  if (non_zeros==0) break;
856  }
857 
858 }
859 #else
860 int64* start=(int64*) ((void*)temp_array);
861 int64* end;
862 const int multiple=sizeof(int64)/sizeof(number_type);
863 if (temp_size==0) end=start;
864 
865 else
866 {
867  int temp_size_rounded=temp_size+(multiple-(temp_size%multiple));
868  assume(temp_size_rounded>=temp_size);
869  assume(temp_size_rounded%multiple==0);
870  assume(temp_size_rounded<temp_size+multiple);
871  number_type* nt_end=temp_array+temp_size_rounded;
872  end=(int64*)((void*)nt_end);
873 }
874 int64* it=start;
875 while(it!=end)
876 {
877  if UNLIKELY((*it)!=0)
878  {
879  int small_i;
880  const int temp_index=((number_type*)((void*) it))-temp_array;
881  const int bound=temp_index+multiple;
882  number_type c;
883  for(small_i=temp_index;small_i<bound;small_i++)
884  {
885  if((c=temp_array[small_i])!=0)
886  {
887  //res->idx_array[pos]=small_i;
888  //res->coef_array[pos]=temp_array[small_i];
889  (*(it_idx++))=small_i;
890  (*(it_coef++))=c;
891  //pos++;
892  non_zeros--;
893 
894  }
895  if UNLIKELY(non_zeros==0) break;
896  }
897 
898  }
899  ++it;
900 }
901 #endif
902 return res;
903 }
long int64
Definition: auxiliary.h:66
#define UNLIKELY(X)
Definition: auxiliary.h:418
CanonicalForm res
Definition: facAbsFact.cc:64

◆ do_t_rep_gb()

ideal do_t_rep_gb ( ring  r,
ideal  arg_I,
int  syz_comp,
BOOLEAN  F4_mode,
int  deg_pos 
)

Definition at line 3568 of file tgb.cc.

3569 {
3570  // Print("QlogSize(0) %d, QlogSize(1) %d,QlogSize(-2) %d, QlogSize(5) %d\n", QlogSize(nlInit(0)),QlogSize(nlInit(1)),QlogSize(nlInit(-2)),QlogSize(nlInit(5)));
3571 
3572  if(TEST_OPT_PROT)
3573  if(F4_mode)
3574  PrintS ("F4 Modus\n");
3575 
3576  //debug_Ideal=arg_debug_Ideal;
3577  //if (debug_Ideal) PrintS("DebugIdeal received\n");
3578  // Print("Idelems %i \n----------\n",IDELEMS(arg_I));
3579  ideal I = arg_I;
3580  id_Compactify (I,currRing);
3581  if(idIs0 (I))
3582  return I;
3583  int i;
3584  for(i = 0; i < IDELEMS (I); i++)
3585  {
3586  assume (I->m[i] != NULL);
3587  simplify_poly (I->m[i], currRing);
3588  }
3589 
3590  qsort (I->m, IDELEMS (I), sizeof (poly), poly_crit);
3591  //Print("Idelems %i \n----------\n",IDELEMS(I));
3592  //slimgb_alg* c=(slimgb_alg*) omalloc(sizeof(slimgb_alg));
3593  //int syz_comp=arg_I->rank;
3594  slimgb_alg *c = new slimgb_alg (I, syz_comp, F4_mode, deg_pos);
3595 
3596  while((c->pair_top >= 0)
3597  && ((!(TEST_OPT_DEGBOUND))
3598  || (c->apairs[c->pair_top]->deg <= Kstd1_deg)))
3599  {
3600 #ifdef HAVE_F4
3601  if(F4_mode)
3602  go_on_F4 (c);
3603  else
3604 #endif
3605  go_on (c);
3606  }
3607  if(c->pair_top < 0)
3608  c->completed = TRUE;
3609  I = c->S;
3610  delete c;
3611  if(TEST_OPT_REDSB)
3612  {
3613  ideal erg = kInterRed (I, NULL);
3614  assume (I != erg);
3615  id_Delete (&I, currRing);
3616  return erg;
3617  }
3618  //qsort(I->m, IDELEMS(I),sizeof(poly),pLmCmp_func);
3619  assume (I->rank >= id_RankFreeModule (I,currRing));
3620  return (I);
3621 }
BOOLEAN completed
Definition: tgb_internal.h:280
BOOLEAN idIs0(ideal h)
returns true if h is the zero ideal
ideal kInterRed(ideal F, ideal Q)
Definition: kstd1.cc:3380
int Kstd1_deg
Definition: kstd1.h:47
#define TEST_OPT_REDSB
Definition: options.h:103
#define TEST_OPT_DEGBOUND
Definition: options.h:112
#define TEST_OPT_PROT
Definition: options.h:102
void id_Delete(ideal *h, ring r)
deletes an ideal/module/matrix
long id_RankFreeModule(ideal s, ring lmRing, ring tailRing)
return the maximal component number found in any polynomial in s
void id_Compactify(ideal id, const ring r)
#define IDELEMS(i)
Definition: simpleideals.h:24
static void go_on(slimgb_alg *c)
Definition: tgb.cc:2678
static int poly_crit(const void *ap1, const void *ap2)
Definition: tgb.cc:3084
static void simplify_poly(poly p, ring r)
Definition: tgb.cc:59

◆ free_sorted_pair_node()

void free_sorted_pair_node ( sorted_pair_node s,
const ring  r 
)

Definition at line 3916 of file tgb.cc.

3917 {
3918  if(s->i >= 0)
3919  p_Delete (&s->lcm_of_lm, r);
3920  omFree (s);
3921 }

◆ kFindDivisibleByInS_easy() [1/2]

int kFindDivisibleByInS_easy ( kStrategy  strat,
const red_object obj 
)

Definition at line 685 of file tgb.cc.

686 {
687  poly p = obj.p;
688  if ((strat->syzComp>0) && (pGetComp(p)>strat->syzComp)) return -1;
689  long not_sev = ~obj.sev;
690  for(int i = 0; i <= strat->sl; i++)
691  {
692  if(pLmShortDivisibleBy (strat->S[i], strat->sevS[i], p, not_sev))
693  return i;
694  }
695  return -1;
696 }
unsigned long sev
Definition: tgb_internal.h:314
int syzComp
Definition: kutil.h:347
polyset S
Definition: kutil.h:297
int sl
Definition: kutil.h:341
unsigned long * sevS
Definition: kutil.h:313
#define pGetComp(p)
Component.
Definition: polys.h:37
#define pLmShortDivisibleBy(a, sev_a, b, not_sev_b)
Divisibility tests based on Short Exponent vectors sev_a == pGetShortExpVector(a) not_sev_b == ~ pGet...
Definition: polys.h:146

◆ kFindDivisibleByInS_easy() [2/2]

int kFindDivisibleByInS_easy ( kStrategy  strat,
poly  p,
long  sev 
)

Definition at line 698 of file tgb.cc.

699 {
700  if ((strat->syzComp>0) && (pGetComp(p)>strat->syzComp)) return -1;
701  long not_sev = ~sev;
702  for(int i = 0; i <= strat->sl; i++)
703  {
704  if(pLmShortDivisibleBy (strat->S[i], strat->sevS[i], p, not_sev))
705  return i;
706  }
707  return -1;
708 }

◆ modP_lastIndexRow()

template<class number_type >
int modP_lastIndexRow ( number_type *  row,
int  ncols 
)

Definition at line 1503 of file tgb_internal.h.

1504 {
1505  int lastIndex;
1506  const number_type zero=0;//npInit(0);
1507  for(lastIndex=ncols-1;lastIndex>=0;lastIndex--)
1508  {
1509  if (!(row[lastIndex]==zero))
1510  {
1511  return lastIndex;
1512  }
1513  }
1514  return -1;
1515 }
int int ncols
Definition: cf_linsys.cc:32

◆ noro_red_mon_to_non_poly()

template<class number_type >
MonRedResNP<number_type> noro_red_mon_to_non_poly ( poly  t,
NoroCache< number_type > *  cache,
slimgb_alg c 
)

Definition at line 758 of file tgb_internal.h.

759 {
760  MonRedResNP<number_type> res_holder;
761 
762 
764  if (ref!=NULL)
765  {
766  res_holder.coef=p_GetCoeff(t,c->r);
767 
768  res_holder.ref=ref;
769  p_Delete(&t,c->r);
770  return res_holder;
771  }
772 
773  unsigned long sev=p_GetShortExpVector(t,currRing);
774  int i=kFindDivisibleByInS_easy(c->strat,t,sev);
775  if (i>=0)
776  {
777  number coef_bak=p_GetCoeff(t,c->r);
778 
779  p_SetCoeff(t,npInit(1,c->r->cf),c->r);
780  assume(npIsOne(p_GetCoeff(c->strat->S[i],c->r),c->r->cf));
781  number coefstrat=p_GetCoeff(c->strat->S[i],c->r);
782 
783 
784  poly exp_diff=cache->temp_term;
785  p_ExpVectorDiff(exp_diff,t,c->strat->S[i],c->r);
786  p_SetCoeff(exp_diff,npNeg(npInvers(coefstrat,c->r->cf),c->r->cf),c->r);
787  p_Setm(exp_diff,c->r);
788  assume(c->strat->S[i]!=NULL);
789 
790  poly res;
791  res=pp_Mult_mm(pNext(c->strat->S[i]),exp_diff,c->r);
792 
793  int len=c->strat->lenS[i]-1;
795  srow=noro_red_to_non_poly_t<number_type>(res,len,cache,c);
796  ref=cache->insert(t,srow);
797  p_Delete(&t,c->r);
798 
799 
800  res_holder.coef=coef_bak;
801  res_holder.ref=ref;
802  return res_holder;
803 
804  } else {
805  number coef_bak=p_GetCoeff(t,c->r);
806  number one=npInit(1, c->r->cf);
807  p_SetCoeff(t,one,c->r);
808 
809  res_holder.ref=cache->insertAndTransferOwnerShip(t,c->r);
810  assume(res_holder.ref!=NULL);
811  res_holder.coef=coef_bak;
812 
813  return res_holder;
814 
815  }
816 
817 }
DataNoroCacheNode< number_type > * ref
Definition: tgb_internal.h:152
poly temp_term
Definition: tgb_internal.h:593
DataNoroCacheNode< number_type > * insertAndTransferOwnerShip(poly t, ring)
Definition: tgb_internal.h:647
DataNoroCacheNode< number_type > * getCacheReference(poly term)
DataNoroCacheNode< number_type > * insert(poly term, poly nf, int len)
Definition: tgb_internal.h:607
#define p_GetCoeff(p, r)
Definition: monomials.h:51
static poly pp_Mult_mm(poly p, poly m, const ring r)
Definition: p_polys.h:988
static void p_ExpVectorDiff(poly pr, poly p1, poly p2, const ring r)
Definition: p_polys.h:1411
static void p_Setm(poly p, const ring r)
Definition: p_polys.h:234
static number p_SetCoeff(poly p, number n, ring r)
Definition: p_polys.h:413
#define npNeg
Definition: tgb_internal.h:73
int kFindDivisibleByInS_easy(kStrategy strat, const red_object &obj)
Definition: tgb.cc:685
#define npInvers
Definition: tgb_internal.h:74
#define npInit
Definition: tgb_internal.h:72
#define npIsOne
Definition: tgb_internal.h:75

◆ noro_red_to_non_poly_dense()

template<class number_type >
SparseRow<number_type>* noro_red_to_non_poly_dense ( MonRedResNP< number_type > *  mon,
int  len,
NoroCache< number_type > *  cache 
)

Definition at line 1094 of file tgb_internal.h.

1095 {
1096  size_t temp_size_bytes=cache->nIrreducibleMonomials*sizeof(number_type)+8;//use 8bit int for testing
1097  assume(sizeof(int64)==8);
1098  cache->ensureTempBufferSize(temp_size_bytes);
1099  number_type* temp_array=(number_type*) cache->tempBuffer;//omalloc(cache->nIrreducibleMonomials*sizeof(number_type));
1100  int temp_size=cache->nIrreducibleMonomials;
1101  memset(temp_array,0,temp_size_bytes);
1102  number minus_one=npInit(-1,currRing->cf);
1103  int i;
1104  for(i=0;i<len;i++)
1105  {
1106  MonRedResNP<number_type> red=mon[i];
1107  if ( /*(*/ red.ref /*)*/ )
1108  {
1109  if (red.ref->row)
1110  {
1111  SparseRow<number_type>* row=red.ref->row;
1112  number coef=red.coef;
1113  if (row->idx_array)
1114  {
1115  if (!((coef==(number)1L)||(coef==minus_one)))
1116  {
1117  add_coef_times_sparse(temp_array,temp_size,row,coef);
1118  }
1119  else
1120  {
1121  if (coef==(number)1L)
1122  {
1123  add_sparse(temp_array,temp_size,row);
1124  }
1125  else
1126  {
1127  sub_sparse(temp_array,temp_size,row);
1128  }
1129  }
1130  }
1131  else
1132  //TODO: treat, 1,-1
1133  if (!((coef==(number)1L)||(coef==minus_one)))
1134  {
1135  add_coef_times_dense(temp_array,temp_size,row->coef_array,row->len,coef);
1136  }
1137  else
1138  {
1139  if (coef==(number)1L)
1140  add_dense(temp_array,temp_size,row->coef_array,row->len);
1141  else
1142  {
1143  assume(coef==minus_one);
1144  sub_dense(temp_array,temp_size,row->coef_array,row->len);
1145  //add_coef_times_dense(temp_array,temp_size,row->coef_array,row->len,coef);
1146  }
1147  }
1148  }
1149  else
1150  {
1151  if (red.ref->value_len==NoroCache<number_type>::backLinkCode)
1152  {
1153  STATISTIC(n_Add); temp_array[red.ref->term_index]=F4mat_to_number_type( npAddM((number)(long) temp_array[red.ref->term_index],red.coef,currRing->cf));
1154  }
1155  else
1156  {
1157  //PrintS("third case\n");
1158  }
1159  }
1160  }
1161  }
1162  int non_zeros=0;
1163  for(i=0;i<cache->nIrreducibleMonomials;i++)
1164  {
1165  //if (!(temp_array[i]==0))
1166  //{
1167  // non_zeros++;
1168  //}
1169  assume(((temp_array[i]!=0)==0)|| (((temp_array[i]!=0)==1)));
1170  non_zeros+=(temp_array[i]!=0);
1171  }
1172 
1173  if (non_zeros==0)
1174  {
1175  //omfree(mon);
1176  return NULL;
1177  }
1178  SparseRow<number_type>* res=new SparseRow<number_type>(temp_size,temp_array);//convert_to_sparse_row(temp_array,temp_size, non_zeros);
1179 
1180  //omfree(temp_array);
1181 
1182 
1183  return res;
1184 }
int nIrreducibleMonomials
Definition: tgb_internal.h:706
void ensureTempBufferSize(size_t size)
Definition: tgb_internal.h:670
void * tempBuffer
Definition: tgb_internal.h:708
void add_dense(number_type *const temp_array, int, const number_type *row, int len)
void sub_dense(number_type *const temp_array, int, const number_type *row, int len)
void add_coef_times_sparse(number_type *const temp_array, int, SparseRow< number_type > *row, number coef)
Definition: tgb_internal.h:905
void sub_sparse(number_type *const temp_array, int, SparseRow< number_type > *row)
void add_sparse(number_type *const temp_array, int, SparseRow< number_type > *row)
void add_coef_times_dense(number_type *const temp_array, int, const number_type *row, int len, number coef)
Definition: tgb_internal.h:953

◆ noro_red_to_non_poly_sparse()

template<class number_type >
SparseRow<number_type>* noro_red_to_non_poly_sparse ( MonRedResNP< number_type > *  mon,
int  len,
NoroCache< number_type > *  cache 
)

Definition at line 1284 of file tgb_internal.h.

1285 {
1286  int i;
1287  int together=0;
1288  for(i=0;i<len;i++)
1289  {
1290  MonRedResNP<number_type> red=mon[i];
1291  if ((red.ref) &&( red.ref->row))
1292  {
1293  together+=red.ref->row->len;
1294  }
1295  else
1296  {
1297  if ((red.ref) &&(red.ref->value_len==NoroCache<number_type>::backLinkCode))
1298  together++;
1299  }
1300  }
1301  //PrintS("here\n");
1302  if (together==0) return 0;
1303  //PrintS("there\n");
1304  cache->ensureTempBufferSize(together*sizeof(CoefIdx<number_type>));
1305  CoefIdx<number_type>* pairs=(CoefIdx<number_type>*) cache->tempBuffer; //omalloc(together*sizeof(CoefIdx<number_type>));
1306  int pos=0;
1307  const number one=npInit(1, currRing->cf);
1308  const number minus_one=npInit(-1, currRing->cf);
1309  for(i=0;i<len;i++)
1310  {
1311  MonRedResNP<number_type> red=mon[i];
1312  if ((red.ref) &&( red.ref->row))
1313  {
1314  //together+=red.ref->row->len;
1315  int* idx_array=red.ref->row->idx_array;
1316  number_type* coef_array=red.ref->row->coef_array;
1317  int rlen=red.ref->row->len;
1318  number coef=red.coef;
1319  if (idx_array)
1320  {
1321  if ((coef!=one)&&(coef!=minus_one))
1322  {
1323  write_coef_times_xx_idx_to_buffer(pairs,pos,idx_array, coef_array,rlen, coef);
1324  }
1325  else
1326  {
1327  if (coef==one)
1328  {
1329  write_coef_idx_to_buffer(pairs,pos,idx_array, coef_array,rlen);
1330  }
1331  else
1332  {
1333  assume(coef==minus_one);
1334  write_minus_coef_idx_to_buffer(pairs,pos,idx_array, coef_array,rlen);
1335  }
1336  }
1337  }
1338  else
1339  {
1340  if ((coef!=one)&&(coef!=minus_one))
1341  {
1342  write_coef_times_xx_idx_to_buffer_dense(pairs,pos,coef_array,rlen,coef);
1343  }
1344  else
1345  {
1346  if (coef==one)
1347  write_coef_idx_to_buffer_dense(pairs,pos,coef_array,rlen);
1348  else
1349  {
1350  assume(coef==minus_one);
1351  write_minus_coef_idx_to_buffer_dense(pairs,pos,coef_array,rlen);
1352  }
1353  }
1354  }
1355  }
1356  else
1357  {
1358  if ((red.ref) &&(red.ref->value_len==NoroCache<number_type>::backLinkCode))
1359  {
1361  ci.coef=F4mat_to_number_type(red.coef);
1362  ci.idx=red.ref->term_index;
1363  pairs[pos++]=ci;
1364  }
1365  }
1366  }
1367  assume(pos<=together);
1368  together=pos;
1369 
1370  std::sort(pairs,pairs+together);
1371 
1372  int act=0;
1373 
1374  assume(pairs[0].coef!=0);
1375  for(i=1;i<together;i++)
1376  {
1377  if (pairs[i].idx!=pairs[act].idx)
1378  {
1379  if (pairs[act].coef!=0)
1380  {
1381  act=act+1;
1382  }
1383  pairs[act]=pairs[i];
1384  }
1385  else
1386  {
1387  STATISTIC(n_Add); pairs[act].coef=F4mat_to_number_type(npAddM((number)(long)pairs[act].coef,(number)(long)pairs[i].coef,currRing->cf));
1388  }
1389  }
1390 
1391  if (pairs[act].coef==0)
1392  {
1393  act--;
1394  }
1395  int sparse_row_len=act+1;
1396  //Print("res len:%d",sparse_row_len);
1397  if (sparse_row_len==0) {return NULL;}
1398  SparseRow<number_type>* res=new SparseRow<number_type>(sparse_row_len);
1399  {
1400  number_type* coef_array=res->coef_array;
1401  int* idx_array=res->idx_array;
1402  for(i=0;i<sparse_row_len;i++)
1403  {
1404  idx_array[i]=pairs[i].idx;
1405  coef_array[i]=pairs[i].coef;
1406  }
1407  }
1408  //omfree(pairs);
1409 
1410  return res;
1411 }
number_type coef
void sort(CFArray &A, int l=0)
quick sort A
static scmon act
Definition: hdegree.cc:1078
void pairs()
void write_minus_coef_idx_to_buffer_dense(CoefIdx< number_type > *const pairs, int &pos, number_type *const coef_array, const int rlen)
void write_minus_coef_idx_to_buffer(CoefIdx< number_type > *const pairs, int &pos, int *const idx_array, number_type *const coef_array, const int rlen)
void write_coef_idx_to_buffer(CoefIdx< number_type > *const pairs, int &pos, int *const idx_array, number_type *const coef_array, const int rlen)
void write_coef_times_xx_idx_to_buffer(CoefIdx< number_type > *const pairs, int &pos, int *const idx_array, number_type *const coef_array, const int rlen, const number coef)
void write_coef_times_xx_idx_to_buffer_dense(CoefIdx< number_type > *const pairs, int &pos, number_type *const coef_array, const int rlen, const number coef)
void write_coef_idx_to_buffer_dense(CoefIdx< number_type > *const pairs, int &pos, number_type *const coef_array, const int rlen)

◆ noro_red_to_non_poly_t()

template<class number_type >
SparseRow< number_type > * noro_red_to_non_poly_t ( poly  p,
int &  len,
NoroCache< number_type > *  cache,
slimgb_alg c 
)

Definition at line 1412 of file tgb_internal.h.

1413 {
1414  assume(len==pLength(p));
1415  if (p==NULL)
1416  {
1417  len=0;
1418  return NULL;
1419  }
1420 
1422  int i=0;
1423  double max_density=0.0;
1424  while(p!=NULL)
1425  {
1426  poly t=p;
1427  pIter(p);
1428  pNext(t)=NULL;
1429 
1431  if ((red.ref) && (red.ref->row))
1432  {
1433  double act_density=(double) red.ref->row->len;
1434  act_density/=(double) cache->nIrreducibleMonomials;
1435  max_density=std::max(act_density,max_density);
1436  }
1437  mon[i]=red;
1438  i++;
1439  }
1440 
1441  assume(i==len);
1442  len=i;
1443  bool dense=true;
1444  if (max_density<0.3) dense=false;
1445  if (dense)
1446  {
1448  omfree(mon);
1449  return res;
1450  }
1451  else
1452  {
1454  omfree(mon);
1455  return res;
1456  }
1457  //in the loop before nIrreducibleMonomials increases, so position here is important
1458 
1459 }
static int max(int a, int b)
Definition: fast_mult.cc:264
#define omfree(addr)
Definition: omAllocDecl.h:237
MonRedResNP< number_type > noro_red_mon_to_non_poly(poly t, NoroCache< number_type > *cache, slimgb_alg *c)
Definition: tgb_internal.h:758
SparseRow< number_type > * noro_red_to_non_poly_sparse(MonRedResNP< number_type > *mon, int len, NoroCache< number_type > *cache)
SparseRow< number_type > * noro_red_to_non_poly_dense(MonRedResNP< number_type > *mon, int len, NoroCache< number_type > *cache)

◆ noro_step()

template<class number_type >
void noro_step ( poly *  p,
int &  pn,
slimgb_alg c 
)

Definition at line 1801 of file tgb_internal.h.

1802 {
1803  //Print("Input rows %d\n",pn);
1804  int j;
1805  if (TEST_OPT_PROT)
1806  {
1807  Print("Input rows %d\n",pn);
1808  }
1809 
1810  NoroCache<number_type> cache;
1811 
1813  int non_zeros=0;
1814  for(j=0;j<pn;j++)
1815  {
1816  poly h=p[j];
1817  int h_len=pLength(h);
1818  //number coef;
1819  srows[non_zeros]=noro_red_to_non_poly_t<number_type>(h,h_len,&cache,c);
1820  if (srows[non_zeros]!=NULL) non_zeros++;
1821  }
1822  std::vector<DataNoroCacheNode<number_type>*> irr_nodes;
1823  cache.collectIrreducibleMonomials(irr_nodes);
1824  //now can build up terms array
1825  //Print("historic irred Mon%d\n",cache.nIrreducibleMonomials);
1826  int n=irr_nodes.size();//cache.countIrreducibleMonomials();
1827  cache.nIrreducibleMonomials=n;
1828  if (TEST_OPT_PROT)
1829  {
1830  Print("Irred Mon:%d\n",n);
1831  Print("red Mon:%d\n",cache.nReducibleMonomials);
1832  }
1834 
1835  for(j=0;j<n;j++)
1836  {
1837  assume(irr_nodes[j]!=NULL);
1838  assume(irr_nodes[j]->value_len==NoroCache<number_type>::backLinkCode);
1839  term_nodes[j].t=irr_nodes[j]->value_poly;
1840  assume(term_nodes[j].t!=NULL);
1841  term_nodes[j].node=irr_nodes[j];
1842  }
1843 
1844  qsort(term_nodes,n,sizeof(TermNoroDataNode<number_type>),term_nodes_sort_crit<number_type>);
1845  poly* terms=(poly*) omalloc(n*sizeof(poly));
1846 
1847  int* old_to_new_indices=(int*) omalloc(cache.nIrreducibleMonomials*sizeof(int));
1848  for(j=0;j<n;j++)
1849  {
1850  old_to_new_indices[term_nodes[j].node->term_index]=j;
1851  term_nodes[j].node->term_index=j;
1852  terms[j]=term_nodes[j].t;
1853  }
1854 
1855  //if (TEST_OPT_PROT)
1856  // Print("Evaluate Rows \n");
1857  pn=non_zeros;
1858  number_type* number_array=(number_type*) omalloc0(((size_t)n)*pn*sizeof(number_type));
1859 
1860  for(j=0;j<pn;j++)
1861  {
1862  int i;
1863  number_type* row=number_array+((long)n)*(long)j;
1864  /*for(i=0;i<n;i++)
1865  {
1866  row[i]=zero;
1867  }*/
1868 
1869  SparseRow<number_type>* srow=srows[j];
1870 
1871  if (srow)
1872  {
1873  int* const idx_array=srow->idx_array;
1874  number_type* const coef_array=srow->coef_array;
1875  const int len=srow->len;
1876  if (srow->idx_array)
1877  {
1878  for(i=0;i<len;i++)
1879  {
1880  int idx=old_to_new_indices[idx_array[i]];
1881  row[idx]=F4mat_to_number_type(coef_array[i]);
1882  }
1883  }
1884  else
1885  {
1886  for(i=0;i<len;i++)
1887  {
1888  row[old_to_new_indices[i]]=F4mat_to_number_type(coef_array[i]);
1889  }
1890  }
1891  delete srow;
1892  }
1893  }
1894 
1895  //static int export_n=0;
1896  //export_mat(number_array,pn,n,"mat%i.py",++export_n);
1898 
1899  int p_pos=0;
1900  for(j=0;j<pn;j++)
1901  {
1902  poly h=row_to_poly(number_array+((long)j)*((long)n),terms,n,c->r);
1903  if(h!=NULL)
1904  {
1905  p[p_pos++]=h;
1906  }
1907  }
1908  pn=p_pos;
1909  omfree(terms);
1910  omfree(term_nodes);
1912  #ifdef NORO_NON_POLY
1913  omfree(srows);
1914  omfree(old_to_new_indices);
1915  #endif
1916  //don't forget the rank
1917 
1918 }
void collectIrreducibleMonomials(std::vector< DataNoroCacheNode< number_type > * > &res)
int nReducibleMonomials
Definition: tgb_internal.h:707
#define Print
Definition: emacs.cc:80
number * number_array
Definition: ntupel.cc:26
#define omalloc0(size)
Definition: omAllocDecl.h:229
void simplest_gauss_modp(number_type *a, int nrows, int ncols)
poly row_to_poly(number_type *row, poly *terms, int tn, ring r)
DataNoroCacheNode< number_type > * node
Definition: tgb_internal.h:586

◆ now_t_rep()

void now_t_rep ( const int &  arg_i,
const int &  arg_j,
slimgb_alg c 
)

Definition at line 3623 of file tgb.cc.

3624 {
3625  int i, j;
3626  if(arg_i == arg_j)
3627  {
3628  return;
3629  }
3630  if(arg_i > arg_j)
3631  {
3632  i = arg_j;
3633  j = arg_i;
3634  }
3635  else
3636  {
3637  i = arg_i;
3638  j = arg_j;
3639  }
3640  c->states[j][i] = HASTREP;
3641 }

◆ pELength()

wlen_type pELength ( poly  p,
ring  r 
)

◆ pos_helper()

template<class len_type , class set_type >
int pos_helper ( kStrategy  strat,
poly  p,
len_type  len,
set_type  setL,
polyset  set 
)

Definition at line 397 of file tgb_internal.h.

398 {
399  //Print("POSHELER:%d",sizeof(wlen_type));
400  int length=strat->sl;
401  int i;
402  int an = 0;
403  int en= length;
404 
405  if ((len>setL[length])
406  || ((len==setL[length]) && (pLmCmp(set[length],p)== -1)))
407  return length+1;
408 
409  loop
410  {
411  if (an >= en-1)
412  {
413  if ((len<setL[an])
414  || ((len==setL[an]) && (pLmCmp(set[an],p) == 1))) return an;
415  return en;
416  }
417  i=(an+en) / 2;
418  if ((len<setL[i])
419  || ((len==setL[i]) && (pLmCmp(set[i],p) == 1))) en=i;
420  //else if ((len>setL[i])
421  //|| ((len==setL[i]) && (pLmCmp(set[i],p) == -1))) an=i;
422  else an=i;
423  }
424 
425 }
static BOOLEAN length(leftv result, leftv arg)
Definition: interval.cc:263
#define pLmCmp(p, q)
returns 0|1|-1 if p=q|p>q|p<q w.r.t monomial ordering
Definition: polys.h:105
#define loop
Definition: structs.h:78

◆ quick_pop_pair()

sorted_pair_node* quick_pop_pair ( slimgb_alg c)

Definition at line 3862 of file tgb.cc.

3863 {
3864  if(c->pair_top < 0)
3865  return NULL;
3866  else
3867  return (c->apairs[c->pair_top--]);
3868 }

◆ row_to_poly()

template<class number_type >
poly row_to_poly ( number_type *  row,
poly *  terms,
int  tn,
ring  r 
)

Definition at line 1484 of file tgb_internal.h.

1485 {
1486  poly h=NULL;
1487  int j;
1488  number_type zero=0;//;npInit(0);
1489  for(j=tn-1;j>=0;j--)
1490  {
1491  if (!(zero==(row[j])))
1492  {
1493  poly t=terms[j];
1494  t=p_LmInit(t,r);
1495  p_SetCoeff(t,(number)(long) row[j],r);
1496  pNext(t)=h;
1497  h=t;
1498  }
1499 
1500  }
1501  return h;
1502 }
static poly p_LmInit(poly p, const ring r)
Definition: p_polys.h:1272

◆ simplest_gauss_modp()

template<class number_type >
void simplest_gauss_modp ( number_type *  a,
int  nrows,
int  ncols 
)

Definition at line 1778 of file tgb_internal.h.

1779 {
1780  //use memmoves for changing rows
1781  //if (TEST_OPT_PROT)
1782  // PrintS("StartGauss\n");
1784 
1785  int c=0;
1786  int r=0;
1787  while(mat.findPivot(r,c))
1788  {
1789  //int pivot=find_pivot()
1790  mat.reduceOtherRowsForward(r);
1791  r++;
1792  c++;
1793  }
1795  backmat.backwardSubstitute();
1796  //backward substitutions
1797  //if (TEST_OPT_PROT)
1798  //PrintS("StopGauss\n");
1799 }
int nrows
Definition: cf_linsys.cc:32

◆ slim_nsize()

int slim_nsize ( number  n,
ring  r 
)

Definition at line 73 of file tgb.cc.

74 {
75  if(rField_is_Zp (r))
76  {
77  return 1;
78  }
79  if(rField_is_Q (r))
80  {
81  return nlQlogSize (n, r->cf);
82  }
83  else
84  {
85  return n_Size (n, r->cf);
86  }
87 }
static FORCE_INLINE int n_Size(number n, const coeffs r)
return a non-negative measure for the complexity of n; return 0 only when n represents zero; (used fo...
Definition: coeffs.h:570
static FORCE_INLINE int nlQlogSize(number n, const coeffs r)
only used by slimgb (tgb.cc)
Definition: longrat.h:75
static BOOLEAN rField_is_Zp(const ring r)
Definition: ring.h:491
static BOOLEAN rField_is_Q(const ring r)
Definition: ring.h:497

◆ spn_merge()

sorted_pair_node** spn_merge ( sorted_pair_node **  p,
int  pn,
sorted_pair_node **  q,
int  qn,
slimgb_alg c 
)

Definition at line 751 of file tgb.cc.

753 {
754  int i;
755  int *a = (int *) omalloc (qn * sizeof (int));
756 // int mc;
757 // PrintS("Debug\n");
758 // for(mc=0;mc<qn;mc++)
759 // {
760 // wrp(q[mc]->lcm_of_lm);
761 // PrintS("\n");
762 // }
763 // PrintS("Debug they are in\n");
764 // for(mc=0;mc<pn;mc++)
765 // {
766 // wrp(p[mc]->lcm_of_lm);
767 // PrintS("\n");
768 // }
769  int lastpos = 0;
770  for(i = 0; i < qn; i++)
771  {
772  lastpos = posInPairs (p, pn, q[i], c, si_max (lastpos - 1, 0));
773  // cout<<lastpos<<"\n";
774  a[i] = lastpos;
775  }
776  if((pn + qn) > c->max_pairs)
777  {
778  p =
780  2 * (pn +
781  qn) *
782  sizeof (sorted_pair_node *));
783  c->max_pairs = 2 * (pn + qn);
784  }
785  for(i = qn - 1; i >= 0; i--)
786  {
787  size_t size;
788  if(qn - 1 > i)
789  size = (a[i + 1] - a[i]) * sizeof (sorted_pair_node *);
790  else
791  size = (pn - a[i]) * sizeof (sorted_pair_node *); //as indices begin with 0
792  memmove (p + a[i] + (1 + i), p + a[i], size);
793  p[a[i] + i] = q[i];
794  }
795  omFree (a);
796  return p;
797 }
int size(const CanonicalForm &f, const Variable &v)
int size ( const CanonicalForm & f, const Variable & v )
Definition: cf_ops.cc:600
#define omrealloc(addr, size)
Definition: omAllocDecl.h:233
static int posInPairs(sorted_pair_node **p, int pn, sorted_pair_node *qe, slimgb_alg *c, int an=0)
Definition: tgb.cc:711

◆ sub_dense()

template<class number_type >
void sub_dense ( number_type *const  temp_array,
int  ,
const number_type *  row,
int  len 
)

Definition at line 1027 of file tgb_internal.h.

1033 {
1034  //int j;
1035  //const number_type* const coef_array=row;
1036  //int* const idx_array=row->idx_array;
1037  //const int len=temp_size;
1038  //tgb_uint32 buffer[256];
1039  //const tgb_uint32 prime=npPrimeM;
1040  //const tgb_uint32 c=F4mat_to_number_type(coef);
1041 
1042  int i;
1043  for(i=0;i<len;i++)
1044  {
1045 
1046  STATISTIC(n_Sub); temp_array[i]=F4mat_to_number_type(npSubM((number)(long) temp_array[i], (number)(long) row[i],currRing->cf));
1047  #ifndef SING_NDEBUG
1048  assume(i<temp_size);
1049  #endif
1050  }
1051 
1052 }
static FORCE_INLINE number n_Sub(number a, number b, const coeffs r)
return the difference of 'a' and 'b', i.e., a-b
Definition: coeffs.h:669
static number npSubM(number a, number b, const coeffs r)
Definition: modulop.h:135

◆ sub_sparse()

template<class number_type >
void sub_sparse ( number_type *const  temp_array,
int  ,
SparseRow< number_type > *  row 
)

Definition at line 1075 of file tgb_internal.h.

1079 {
1080  int j;
1081 
1082  number_type* const coef_array=row->coef_array;
1083  int* const idx_array=row->idx_array;
1084  const int len=row->len;
1085  for(j=0;j<len;j++)
1086  {
1087  int idx=idx_array[j];
1088  STATISTIC(n_Sub); temp_array[idx]=F4mat_to_number_type( (number_type)(long) npSubM((number) (long)temp_array[idx],(number)(long) coef_array[j],currRing->cf));
1089  #ifndef SING_NDEBUG
1090  assume(idx<temp_size);
1091  #endif
1092  }
1093 }

◆ term_nodes_sort_crit()

template<class number_type >
int term_nodes_sort_crit ( const void *  a,
const void *  b 
)

Definition at line 1516 of file tgb_internal.h.

1517 {
1519 }
CanonicalForm b
Definition: cfModGcd.cc:4044

◆ terms_sort_crit()

int terms_sort_crit ( const void *  a,
const void *  b 
)

Definition at line 2030 of file tgb.cc.

2031 {
2032  return -pLmCmp (*((poly *) a), *((poly *) b));
2033 }

◆ tgb_pair_better_gen2()

int tgb_pair_better_gen2 ( const void *  ap,
const void *  bp 
)

Definition at line 680 of file tgb.cc.

681 {
682  return (-tgb_pair_better_gen (ap, bp));
683 }
Definition: ap.h:40
static int tgb_pair_better_gen(const void *ap, const void *bp)
Definition: tgb.cc:3951

◆ top_pair()

sorted_pair_node* top_pair ( slimgb_alg c)

Definition at line 3838 of file tgb.cc.

3839 {
3840  while(c->pair_top >= 0)
3841  {
3842  super_clean_top_of_pair_list (c); //yeah, I know, it's odd that I use a different proc here
3843  if((c->is_homog) && (c->pair_top >= 0)
3844  && (c->apairs[c->pair_top]->deg >= c->lastCleanedDeg + 2))
3845  {
3846  int upper = c->apairs[c->pair_top]->deg - 1;
3847  c->cleanDegs (c->lastCleanedDeg + 1, upper);
3848  c->lastCleanedDeg = upper;
3849  }
3850  else
3851  {
3852  break;
3853  }
3854  }
3855 
3856  if(c->pair_top < 0)
3857  return NULL;
3858  else
3859  return (c->apairs[c->pair_top]);
3860 }
int lastCleanedDeg
Definition: tgb_internal.h:275
void cleanDegs(int lower, int upper)
Definition: tgb.cc:3756
static void super_clean_top_of_pair_list(slimgb_alg *c)
Definition: tgb.cc:3870

◆ write_coef_idx_to_buffer()

template<class number_type >
void write_coef_idx_to_buffer ( CoefIdx< number_type > *const  pairs,
int &  pos,
int *const  idx_array,
number_type *const  coef_array,
const int  rlen 
)

Definition at line 1259 of file tgb_internal.h.

1260 {
1261  int j;
1262  for(j=0;j<rlen;j++)
1263  {
1264  assume(coef_array[j]!=0);
1266  ci.coef=coef_array[j];
1267  ci.idx=idx_array[j];
1268  pairs[pos++]=ci;
1269  }
1270 }

◆ write_coef_idx_to_buffer_dense()

template<class number_type >
void write_coef_idx_to_buffer_dense ( CoefIdx< number_type > *const  pairs,
int &  pos,
number_type *const  coef_array,
const int  rlen 
)

Definition at line 1224 of file tgb_internal.h.

1225 {
1226  int j;
1227 
1228  for(j=0;j<rlen;j++)
1229  {
1230  if (coef_array[j]!=0)
1231  {
1232  assume(coef_array[j]!=0);
1234  ci.coef=coef_array[j];
1235  assume(ci.coef!=0);
1236  ci.idx=j;
1237  pairs[pos++]=ci;
1238  }
1239  }
1240 }

◆ write_coef_times_xx_idx_to_buffer()

template<class number_type >
void write_coef_times_xx_idx_to_buffer ( CoefIdx< number_type > *const  pairs,
int &  pos,
int *const  idx_array,
number_type *const  coef_array,
const int  rlen,
const number  coef 
)

Definition at line 1195 of file tgb_internal.h.

1196 {
1197  int j;
1198  for(j=0;j<rlen;j++)
1199  {
1200  assume(coef_array[j]!=0);
1202  STATISTIC(n_Mult); ci.coef=F4mat_to_number_type(npMultM((number)(long) coef,(number)(long) coef_array[j],currRing->cf));
1203  ci.idx=idx_array[j];
1204  pairs[pos++]=ci;
1205  }
1206 }
static FORCE_INLINE number n_Mult(number a, number b, const coeffs r)
return the product of 'a' and 'b', i.e., a*b
Definition: coeffs.h:636
static number npMultM(number a, number b, const coeffs r)
Definition: modulop.h:72

◆ write_coef_times_xx_idx_to_buffer_dense()

template<class number_type >
void write_coef_times_xx_idx_to_buffer_dense ( CoefIdx< number_type > *const  pairs,
int &  pos,
number_type *const  coef_array,
const int  rlen,
const number  coef 
)

Definition at line 1207 of file tgb_internal.h.

1208 {
1209  int j;
1210 
1211  for(j=0;j<rlen;j++)
1212  {
1213  if (coef_array[j]!=0)
1214  {
1215  assume(coef_array[j]!=0);
1217  STATISTIC(n_Mult); ci.coef=F4mat_to_number_type(npMultM((number)(long) coef,(number)(long) coef_array[j],currRing->cf));
1218  assume(ci.coef!=0);
1219  ci.idx=j;
1220  pairs[pos++]=ci;
1221  }
1222  }
1223 }

◆ write_minus_coef_idx_to_buffer()

template<class number_type >
void write_minus_coef_idx_to_buffer ( CoefIdx< number_type > *const  pairs,
int &  pos,
int *const  idx_array,
number_type *const  coef_array,
const int  rlen 
)

Definition at line 1272 of file tgb_internal.h.

1273 {
1274  int j;
1275  for(j=0;j<rlen;j++)
1276  {
1277  assume(coef_array[j]!=0);
1279  STATISTIC(n_InpNeg); ci.coef=F4mat_to_number_type(npNegM((number)(unsigned long)coef_array[j],currRing->cf)); // FIXME: inplace negation! // TODO: check if this is not a bug!?
1280  ci.idx=idx_array[j];
1281  pairs[pos++]=ci;
1282  }
1283 }
static FORCE_INLINE number n_InpNeg(number n, const coeffs r)
in-place negation of n MUST BE USED: n = n_InpNeg(n) (no copy is returned)
Definition: coeffs.h:557
static number npNegM(number a, const coeffs r)
Definition: modulop.h:175

◆ write_minus_coef_idx_to_buffer_dense()

template<class number_type >
void write_minus_coef_idx_to_buffer_dense ( CoefIdx< number_type > *const  pairs,
int &  pos,
number_type *const  coef_array,
const int  rlen 
)

Definition at line 1242 of file tgb_internal.h.

1243 {
1244  int j;
1245 
1246  for(j=0;j<rlen;j++)
1247  {
1248  if (coef_array[j]!=0)
1249  {
1250  assume(coef_array[j]!=0);
1252  STATISTIC(n_InpNeg); ci.coef=F4mat_to_number_type(npNegM((number)(long) coef_array[j],currRing->cf)); // FIXME: inplace negation! // TODO: check if this is not a bug!?
1253  assume(ci.coef!=0);
1254  ci.idx=j;
1255  pairs[pos++]=ci;
1256  }
1257  }
1258 }

◆ write_poly_to_row()

template<class number_type >
void write_poly_to_row ( number_type *  row,
poly  h,
poly *  terms,
int  tn,
ring  r 
)

Definition at line 1469 of file tgb_internal.h.

1470 {
1471  //poly* base=row;
1472  while(h!=NULL)
1473  {
1474  //Print("h:%i\n",h);
1475  number coef=p_GetCoeff(h,r);
1476  poly* ptr_to_h=(poly*) bsearch(&h,terms,tn,sizeof(poly),terms_sort_crit);
1477  assume(ptr_to_h!=NULL);
1478  int pos=ptr_to_h-terms;
1479  row[pos]=F4mat_to_number_type(coef);
1480  //number_type_array[base+pos]=coef;
1481  pIter(h);
1482  }
1483 }
int terms_sort_crit(const void *a, const void *b)
Definition: tgb.cc:2030