34#define BUCKETS_FOR_NORO_RED 1
35#define SR_HDL(A) ((long)(A))
39#define ADD_LATER_SIZE 500
153#define degbound(p) assume(pTotaldegree(p)<10)
240 for(
i =
b->buckets_used;
i >= 0;
i--)
243 s +=
b->buckets_length[
i] ;
245#ifdef HAVE_COEF_BUCKETS
247 if(
b->coef[0] !=
NULL)
313 for(
i =
b->buckets_used;
i >= 0;
i--)
316 s +=
b->buckets_length[
i] ;
318#ifdef HAVE_COEF_BUCKETS
320 if(
b->coef[0] !=
NULL)
442 return r->block0[last_block];
493 for(
i =
b->buckets_used;
i >= 0;
i--)
501 s +=
b->buckets_length[
i];
579#ifdef HAVE_COEF_BUCKETS
623static int LObject_better_gen (
const void *
ap,
const void *bp)
636static int pLmCmp_func_inverted (
const void *ap1,
const void *ap2)
639 p1 = *((poly *) ap1);
640 p2 = *((poly *) ap2);
654 long not_sev = ~obj.sev;
655 for(
int i = 0;
i <= strat->
sl;
i++)
667 for(
int i = 0;
i <= strat->
sl;
i++)
711 if(
i[top] <
i[top - 1])
720 int *a = (
int *)
omalloc (qn *
sizeof (
int));
735 for(
i = 0;
i < qn;
i++)
749 for(
i = qn - 1;
i >= 0;
i--)
756 memmove (
p + a[
i] + (1 +
i),
p + a[
i],
size);
766 poly p1 = c->
S->m[pos1];
767 poly p2 = c->
S->m[pos2];
776 if((gcd1 !=
NULL) && (gcd2 !=
NULL))
823 for(
i =
l + 1;
i <= u;
i++)
857 for(
int n = 0; ((n < c->
n) && (i_con[n] >= 0)); n++)
874 for(
i = 0;
i <= strat->
sl;
i++)
887 while(i <= strat->sl)
890 P.sev = strat->
sevS[
i];
899 for(
j = 0;
j < c->
n;
j++)
901 if(c->
S->m[
j] == P.p)
920 for(
i = bucket->buckets_used;
i >= 0;
i--)
922 if(bucket->buckets[
i])
923 sum += bucket->buckets_length[
i];
943 memset (&P, 0,
sizeof (P));
947 P.FDeg = c->
r->pFDeg (P.p, c->
r);
975 for(
i = 0;
i < pos;
i++)
980 for(
i = pos + 1;
i < c->
n;
i++)
992 assume (old_pos >= new_pos);
993 poly
p = strat->
S[old_pos];
994 int ecart = strat->
ecartS[old_pos];
995 long sev = strat->
sevS[old_pos];
996 int s_2_r = strat->
S_2_R[old_pos];
1001 length_w = strat->
lenSw[old_pos];
1003 for(
i = old_pos;
i > new_pos;
i--)
1005 strat->
S[
i] = strat->
S[
i - 1];
1011 for(
i = old_pos;
i > new_pos;
i--)
1014 for(
i = old_pos;
i > new_pos;
i--)
1017 strat->
S[new_pos] =
p;
1018 strat->
ecartS[new_pos] = ecart;
1019 strat->
sevS[new_pos] = sev;
1020 strat->
S_2_R[new_pos] = s_2_r;
1023 strat->
lenSw[new_pos] = length_w;
1029 assume (old_pos <= new_pos);
1030 poly
p = strat->
S[old_pos];
1031 int ecart = strat->
ecartS[old_pos];
1032 long sev = strat->
sevS[old_pos];
1033 int s_2_r = strat->
S_2_R[old_pos];
1038 length_w = strat->
lenSw[old_pos];
1040 for(
i = old_pos;
i < new_pos;
i++)
1042 strat->
S[
i] = strat->
S[
i + 1];
1048 for(
i = old_pos;
i < new_pos;
i++)
1051 for(
i = old_pos;
i < new_pos;
i++)
1054 strat->
S[new_pos] =
p;
1055 strat->
ecartS[new_pos] = ecart;
1056 strat->
sevS[new_pos] = sev;
1057 strat->
S_2_R[new_pos] = s_2_r;
1060 strat->
lenSw[new_pos] = length_w;
1067 int *cans = (
int *)
omAlloc (c->
n * sizeof (
int));
1068 int *connected = (
int *)
omAlloc (c->
n * sizeof (
int));
1070 int cans_length = 1;
1071 connected[0] = from;
1072 int last_cans_pos = -1;
1073 int connected_length = 1;
1074 long neg_bounds_short = ~p_GetShortExpVector (
bound, c->
r);
1076 int not_yet_found = cans_length;
1077 int con_checked = 0;
1082 if((con_checked < connected_length) && (not_yet_found > 0))
1084 pos = connected[con_checked];
1085 for(
int i = 0;
i < cans_length;
i++)
1094 connected[connected_length] = cans[
i];
1099 if(connected[connected_length - 1] == to)
1101 if(connected_length < c->n)
1103 connected[connected_length] = -1;
1114 for(last_cans_pos++; last_cans_pos <= c->
n; last_cans_pos++)
1116 if(last_cans_pos == c->
n)
1118 if(connected_length < c->n)
1120 connected[connected_length] = -1;
1125 if((last_cans_pos == from) || (last_cans_pos == to))
1129 neg_bounds_short, c->
r))
1131 cans[cans_length] = last_cans_pos;
1137 for(
int i = 0;
i < con_checked;
i++)
1139 if(
has_t_rep (connected[
i], last_cans_pos, c))
1141 connected[connected_length] = last_cans_pos;
1143 cans[cans_length - 1] = -1;
1145 if(connected[connected_length - 1] == to)
1147 if(connected_length < c->n)
1149 connected[connected_length] = -1;
1159 if(connected_length < c->n)
1161 connected[connected_length] = -1;
1180 for(
int n = 0; ((n < c->
n) && (i_con[n] >= 0)); n++)
1211 sugar +=
si_max (t_i, t_j);
1215 for(
int m = 0; ((
m < c->
n) && (i_con[
m] >= 0));
m++)
1226 for(
int m = 0; ((
m < c->
n) && (j_con[
m] >= 0));
m++)
1280 if(
l >= strat->
lenS[*at])
1340 res *= el1 + el2 - 2;
1404#define ENLARGE(pointer, type) pointer=(type*) omreallocSize(pointer, old*sizeof(type),c->array_lengths*sizeof(type))
1406#define ENLARGE_ALIGN(pointer, type) {if(pointer)\
1407 pointer=(type*)omReallocSize(pointer, old*sizeof(type),c->array_lengths*sizeof(type));\
1408 else pointer=(type*)omAllocAligned(c->array_lengths*sizeof(type));}
1431#ifndef USE_STDVECBOOL
1449 ecart = sugar - c->
T_deg[
i];
1471 c->
states.push_back (dynamic_bitset <> (
i));
1474#ifdef USE_STDVECBOOL
1476 c->
states.push_back (vector < bool > (
i));
1493 for(
j = 0;
j <
i;
j++)
1603 if (
i>
j) {
s->i=
i;
s->j=
j;}
1604 else {
s->i=
j;
s->j=
i;}
1649 for(upper = lower + 1; upper < spc; upper++)
1651 if(!
pLmEqual (nodes[lower]->lcm_of_lm, nodes[upper]->lcm_of_lm))
1655 if(
has_t_rep (nodes[upper]->
i, nodes[upper]->
j, c))
1661 for(z = 0; z < spc_final; z++)
1664 (nodes_final[z]->lcm_of_lm, nodes[lower]->lcm_of_lm, c->
r))
1673 for(; lower <= upper; lower++)
1677 nodes[lower] =
NULL;
1684 p_Test (nodes[lower]->lcm_of_lm, c->
r);
1688 nodes_final[spc_final] =
1691 *(nodes_final[spc_final++]) = *(nodes[lower]);
1693 nodes[lower] =
NULL;
1694 for(lower = lower + 1; lower <= upper; lower++)
1698 nodes[lower] =
NULL;
1707 assume (spc_final <= spc);
1742 m_iLastAltVar - m_iFirstAltVar + 1;
1745 poly *array_arg = (poly *)
omalloc (
N *
sizeof (poly));
1749 for(
unsigned short v = m_iFirstAltVar;
v <= m_iLastAltVar;
v++)
1804 P.SetShortExpVector ();
1819 if((
j >= 0) && ((!n) ||
1820 ((strat->
lenS[
j] <= n) &&
1837 number m2 =
nMult (
m, coef);
1851 P.SetShortExpVector ();
1882 for(
i = 0;
i <= strat->
sl;
i++)
1884 if((strat->
lenS[
i] > 2)
1899 for(
i = 0;
i < fixpos;
i++)
1909 for(
i = fixpos + 1;
i < c->
n;
i++)
1954 while(*node !=
NULL)
1956 int c =
pLmCmp (
p, (*node)->p);
1960 node = &((*node)->r);
1962 node = &((*node)->l);
1977 if((r2.
p != ro.
p) || (r2.
sev != ro.
sev))
1984 return -
pLmCmp (*((poly *) a), *((poly *)
b));
1988static void unify_terms (poly * terms,
int &sum)
1998 terms[++
last] = terms[curr];
2007export_mat (number *
number_array,
int pn,
int tn,
const char *format_str,
2011 sprintf (matname, format_str, mat_nr);
2012 FILE *out = fopen (matname,
"w");
2014 fprintf (out,
"mat=[\n");
2015 for(
i = 0;
i < pn;
i++)
2017 fprintf (out,
"[\n");
2018 for(
j = 0;
j < tn;
j++)
2022 fprintf (out,
", ");
2027 fprintf (out,
"],\n");
2029 fprintf (out,
"],\n");
2031 fprintf (out,
"]\n");
2041linalg_step_modp (poly *
p, poly * p_out,
int &pn, poly * terms,
int tn,
2048 const number_type zero = 0;
2049 int array_size = pn * tn;
2051 (number_type *)
omalloc (pn * tn *
sizeof (number_type));
2053 for(
i = 0;
i < array_size;
i++)
2057 for(
i = 0;
i < pn;
i++)
2066 export_mat (
number_array, pn, tn,
"mat%i.py", ++export_n);
2072 for(
i = 0;
i < pn;
i++)
2089 p_out[p_pos++] =
NULL;
2092 export_mat (
number_array, pn, tn,
"mat%i.py", ++export_n);
2100 int *ibuf = (
int *)
omalloc (pn *
sizeof (
int));
2103 for(
j = 0;
j < pn;
j++)
2109 for(
j = 0;
j < pn;
j++)
2116 for(
j = 0;
j < pn;
j++)
2118 memmove (big_sbuf + partsum, sbuf[
j],
2143#ifndef NORO_NON_POLY
2144void NoroCache::evaluateRows ()
2176#ifndef NORO_SPARSE_ROWS_PRE
2206 row->
array = (number *)
omalloc ((len) *
sizeof (number));
2207 memcpy (row->
array, a + row->
begin, len * sizeof (number));
2226 PrintS (
"F4 calc wrong, as poly len was wrong\n");
2235 NoroCache::evaluatePlaceHolder (number * row,
2236 std::vector < NoroPlaceHolder >
2240 int s = place_holders.size ();
2244 for(
i = 0;
i <
s;
i++)
2247 number coef = place_holders[
i].coef;
2254 #ifndef NORO_SPARSE_ROWS_PRE
2258 number *ref_begin = ref_row->
array;
2259 number *ref_end = ref_row->
array + (ref_row->
end - ref_row->
begin);
2260 number *my_pos = row + ref_row->
begin;
2264 while(ref_begin != ref_end)
2273 while(ref_begin != ref_end)
2276 *my_pos =
npAddM (*my_pos, *ref_begin);
2285 int n = ref_row->
len;
2291 for(
j = 0;
j < n;
j++)
2293 int idx = idx_array[
j];
2294 number ref_coef = coef_array[
j];
2300 for(
j = 0;
j < n;
j++)
2302 int idx = idx_array[
j];
2303 number ref_coef = coef_array[
j];
2304 row[idx] =
npAddM (row[idx], ref_coef);
2313 for(
i = 0;
i <
s;
i++)
2316 number coef = place_holders[
i].coef;
2323 #ifndef NORO_SPARSE_ROWS_PRE
2327 number *ref_begin = ref_row->
array;
2328 number *ref_end = ref_row->
array + (ref_row->
end - ref_row->
begin);
2329 number *my_pos = row + ref_row->
begin;
2333 while(ref_begin != ref_end)
2342 while(ref_begin != ref_end)
2344 *my_pos =
npAddM (*my_pos, *ref_begin);
2353 int n = ref_row->
len;
2359 for(
j = 0;
j < n;
j++)
2361 int idx = idx_array[
j];
2362 number ref_coef = coef_array[
j];
2368 for(
j = 0;
j < n;
j++)
2370 int idx = idx_array[
j];
2371 number ref_coef = coef_array[
j];
2372 row[idx] =
npAddM (row[idx], ref_coef);
2384#ifndef NORO_NON_POLY
2388 MonRedRes res_holder;
2391 res_holder.changed =
TRUE;
2404 res_holder.ref = ref;
2405 res_holder.onlyBorrowed =
TRUE;
2406 res_holder.changed =
TRUE;
2414 poly cache_lookup = cache->
lookup (t, succ, res_holder.len);
2417 if(cache_lookup == t)
2422 res_holder.changed =
FALSE;
2424 res_holder.coef =
npInit (1);
2426 res_holder.onlyBorrowed =
FALSE;
2433 res_holder.p = cache_lookup;
2435 res_holder.onlyBorrowed =
TRUE;
2463 res = noro_red_non_unique (
res, res_holder.len, cache, c);
2469 res_holder.changed =
TRUE;
2471 res_holder.coef = coef_bak;
2472 res_holder.onlyBorrowed =
TRUE;
2473 res_holder.ref = ref;
2484 res_holder.ref = cache->
insert (t, t, res_holder.len);
2489 res_holder.changed =
FALSE;
2492 res_holder.coef =
npInit (1);
2493 res_holder.onlyBorrowed =
FALSE;
2499 res_holder.coef = coef_bak;
2500 res_holder.onlyBorrowed =
TRUE;
2501 res_holder.changed =
FALSE;
2510#ifndef NORO_NON_POLY
2523 poly unchanged_head =
NULL;
2524 poly unchanged_tail =
NULL;
2525 int unchanged_size = 0;
2535 MonRedRes red = noro_red_mon (t,
FALSE, cache, c);
2536 if((!(red.changed)) && (!(red.onlyBorrowed)))
2543 pNext (unchanged_tail) = red.p;
2544 pIter (unchanged_tail);
2548 unchanged_tail = red.p;
2549 unchanged_head = red.p;
2555 if(red.onlyBorrowed)
2582#ifdef NORO_SPARSE_ROWS_PRE
2605#ifndef NORO_NON_POLY
2606std::vector < NoroPlaceHolder > noro_red (poly
p,
int &len,
NoroCache * cache,
2609 std::vector < NoroPlaceHolder >
res;
2616 MonRedRes red = noro_red_mon (t,
TRUE, cache, c);
2617 assume (red.onlyBorrowed);
2623 assume (!((
h.ref->value_poly ==
NULL) && (
h.ref->value_len != 0)));
2624 if(
h.ref->value_poly)
2636 poly *reduced = (poly *)
omalloc (pn *
sizeof (poly));
2638 int *reduced_len = (
int *)
omalloc (pn *
sizeof (
int));
2645 for(
j = 0;
j < pn;
j++)
2655 h = noro_red (
p_Copy (
h, c->
r), h_len, &cache, c);
2665 reduced[reduced_c] =
h;
2666 reduced_len[reduced_c] = h_len;
2669 Print (
"%d ", h_len);
2672 int reduced_sum = 0;
2673 for(
j = 0;
j < reduced_c;
j++)
2675 reduced_sum += reduced_len[
j];
2677 poly *terms = (poly *)
omalloc (reduced_sum *
sizeof (poly));
2679 for(
j = 0;
j < reduced_c;
j++)
2681 poly
h = reduced[
j];
2687 assume (tc <= reduced_sum);
2690 assume (tc == reduced_sum);
2692 int nterms = reduced_sum;
2695 unify_terms (terms, nterms);
2698 int rank = reduced_c;
2699 linalg_step_modp (reduced,
p, rank, terms, nterms, c);
2724 for(
i = 0;
i < c->
n;
i++)
2736 poly *
p = (poly *)
omAlloc ((max_pairs + 1) *
sizeof (poly));
2739 while(
i < max_pairs)
2748 if(
s->deg > curr_deg)
2794 if((!c->
nc) & (!(use_noro)))
2822#ifdef TGB_RESORT_PAIRS
2823 c->replaced =
new bool[c->
n];
2873 for(
j = 0;
j <
i;
j++)
2882 buf[
j].initial_quality =
buf[
j].guess_quality (c);
2890 Print (
"%dM[%d,", curr_deg,
i);
2894#ifdef TGB_RESORT_PAIRS
2905 if((c->replaced[c->
apairs[e]->
i]) || (c->replaced[c->
apairs[e]->
j]))
2918 for(
k = 0;
k <
i;
k++)
2922 for(k2 = 0; k2 <
i; k2++)
2938 poly *add_those = (poly *)
omalloc0 (
i *
sizeof (poly));
2940 for(
j = 0;
j <
i;
j++)
2968 add_those[num_to_add++] =
p;
2974 mass_add (add_those, num_to_add, c);
2981#ifdef TGB_RESORT_PAIRS
3018 P.SetShortExpVector ();
3063 P.SetShortExpVector ();
3122 poly *set_this = &
p;
3127 (*set_this) =
pLmInit (monoms[monom_index - 1 - r->
exp]);
3129 set_this = &((*set_this)->next);
3141 p1 = *((poly *) ap1);
3142 p2 = *((poly *) ap2);
3163 for(
int i = 0;
i <
s;
i++)
3205 for(hzz = 0; hzz <
IDELEMS (I); hzz++)
3209 poly t = I->m[hzz]->next;
3276#ifdef USE_STDVECBOOL
3326 poly *array_arg = I->m;
3351 for(
i = 1;
i <
n;
i++)
3385 for(piter = 0; piter <=
pair_top; piter++)
3391 if(
s->lcm_of_lm !=
NULL)
3393 add[pos] =
s->lcm_of_lm;
3408 for(piter = 0; piter <=
pair_top; piter++)
3452#ifndef USE_STDVECBOOL
3453 for(
int z = 1 ; z < c->
n; z++)
3463 for(
int z = 0; z < c->
n; z++)
3485 for(
i = 0;
i < c->
n;
i++)
3496 Print (
"\nNF:%i product criterion:%i, ext_product criterion:%i \n",
3505 for(
j = 0;
j < c->
n;
j++)
3535 for(
i = 0;
i < c->
n;
i++)
3540 for(
j = 0;
j < c->
n;
j++)
3542 if((c->
S->m[
j] ==
NULL) || (
i ==
j))
3578 if(orig_ring != new_ring)
3595 s_h =
id_Copy (arg_I, orig_ring);
3599 ideal s_result =
do_t_rep_gb (new_ring, s_h, syz_comp, F4_mode, pos);
3601 if(orig_ring != new_ring)
3699 assume (arg_i < state->n);
3700 assume (arg_j < state->n);
3719 for(
int i = 0;
i < c->
n;
i++)
3725 poly tail = c->
S->m[
i]->next;
3726 poly prev = c->
S->m[
i];
3728 while((tail !=
NULL) && (
pLmCmp (tail, monom) >= 0))
3732 did_something =
TRUE;
3733 prev->next = tail->next;
3752 for(
int z = 0; z <= c->
strat->
sl; z++)
3761 for(
int z = new_pos - 1; z >= 0; z--)
3770 assume (new_pos <= old_pos);
3775 if(new_pos < old_pos)
3802 for(deg = lower; deg <= upper; deg++)
3805 for(
i = 0;
i <
n;
i++)
3849 new_pos = new_pos - 1;
3861 for(
i = 0;
i < this->
n; i++)
3863 for(
j = 0;
j <
i;
j++)
3948 return (c->
states[arg_i][arg_j] == state);
3951 return (c->
states[arg_j][arg_i] == state);
3978 if(a->
i + a->
j <
b->i +
b->j)
3980 if(a->
i + a->
j >
b->i +
b->j)
4010 if(a->
i + a->
j <
b->i +
b->j)
4012 if(a->
i + a->
j >
b->i +
b->j)
4041 for(
i = max_g_0;
i;
i--)
4047 if((max_g_0 == 0) && (
pGetExp (
m,
i) > 0))
4101static poly kBucketGcd (
kBucket *
b, ring r)
4109 if(
b->buckets[
i] !=
NULL)
4194 los[best].
p = los[best].
bucket->buckets[b_pos];
4195 qc =
pQuality (los[best].bucket->buckets[b_pos], c);
4225 assume (qc == los[best].guess_quality (c));
4230 los[best].
p = los[best].
bucket->buckets[b_pos];
4231 qc =
pQuality (los[best].bucket->buckets[b_pos], c);
4250 PrintS (
"Wrong wlen_type");
4256 los[best].
p = los[best].
bucket->buckets[b_pos];
4257 qc =
pQuality (los[best].bucket->buckets[b_pos], c);
4269 if(qc < quality_a / 2)
4323 while((il > 0) &&
pLmEqual (los[il - 1].
p, los[il].
p))
4345 clear_into = los[bp].
p;
4357 for(z = c->
n; z; z--)
4359 if(
p == c->
S->m[z - 1])
4370#ifdef TGB_RESORT_PAIRS
4372 c->replaced[pos_in_c] =
TRUE;
4375 c->
S->m[pos_in_c] = clear_into;
4376 c->
lengths[pos_in_c] = new_length;
4408#ifdef FIND_DETERMINISTIC
4437 if (i2 < step) step=i2;
4449 if((!incr) && (step == 1))
4474 step = (step + 1) / 2;
4487 for(
i =
l;
i <= u;
i++)
4507 assume ((startf == losl - 1)
4508 || (
pLmCmp (los[startf].
p, los[startf + 1].
p) == -1));
4525 int i2 =
fwbw (los,
i);
4540 int i2 =
fwbw (los,
i);
4584 memmove (los + (
int) (
last + 1 - deleted), los + (
last + 1),
4592 if((
last >= 0) && (
last != losl - 1))
4593 memmove (los + (
int) (
last + 1 - deleted), los +
last + 1,
4625 int r_size = u -
l + 1;
4628 int *new_indices = (
int *)
omalloc ((r_size) *
sizeof (int));
4631 for(
i =
l;
i <= u;
i++)
4642 new_indices[
i -
l] =
l;
4647 for(
int i = 0;
i < r_size;
i++)
4649 new_indices[
i] +=
i;
4650 los_region[
i] = los[
l +
i];
4651 assume ((
i == 0) || (new_indices[
i] > new_indices[
i - 1]));
4659 if(new_indices[
i] ==
j)
4661 los[
j] = los_region[
i];
4681 poly *delay = (poly *)
omAlloc (losl *
sizeof (poly));
4689 for(
i = 0;
i < losl;
i++)
4693 if(los[
i].initial_quality > max_initial_quality)
4700 int curr_pos = losl - 1;
4704 while(curr_pos >= 0)
4709 int pn_noro = curr_pos + 1;
4710 poly *p_noro = (poly *)
omAlloc (pn_noro *
sizeof (poly));
4711 for(
i = 0;
i < pn_noro;
i++)
4734 for(
i = 0;
i < pn_noro;
i++)
4736 los[
i].
p = p_noro[
i];
4745 curr_pos -= deleted;
4771 assume (los[
i].initial_quality > 0);
4772 if(los[
i].guess_quality (c)
4778 if(los[
i].guess_quality (c) >
delay_factor * max_initial_quality)
4784 delay[delay_s] = los[
i].
p;
4799 curr_pos -= deleted;
4811#ifdef FIND_DETERMINISTIC
4815 (
i+2)*
sizeof(poly));
4912 for(
i =
l;
i <= u;
i++)
4916 for(
i =
l;
i <= u;
i++)
4976 work_on_copy =
TRUE;
5013 int reducer_deg = 0;
5026 reducer_deg = lm_deg + ecart;
5030 if((!work_on_copy) && (!erg.
fromS))
5061template int term_nodes_sort_crit<unsigned char>(
void const*,
void const*);
5062template int term_nodes_sort_crit<unsigned int>(
void const*,
void const*);
5063template int term_nodes_sort_crit<unsigned short>(
void const*,
void const*);
5069template void simplest_gauss_modp<unsigned char>(
unsigned char*,
int,
int);
5070template void simplest_gauss_modp<unsigned int>(
unsigned int*,
int,
int);
5071template void simplest_gauss_modp<unsigned short>(
unsigned short*,
int,
int);
5074template int modP_lastIndexRow<unsigned char>(
unsigned char*,
int);
5075template int modP_lastIndexRow<unsigned int>(
unsigned int*,
int);
5076template int modP_lastIndexRow<unsigned short>(
unsigned short*,
int);
5106template void add_coef_times_dense<unsigned char>(
unsigned char*,
int,
unsigned char const*,
int,
snumber*);
5107template void add_coef_times_dense<unsigned int>(
unsigned int*,
int,
unsigned int const*,
int,
snumber*);
5108template void add_coef_times_dense<unsigned short>(
unsigned short*,
int,
unsigned short const*,
int,
snumber*);
5112template void add_dense<unsigned char>(
unsigned char*,
int,
unsigned char const*,
int);
5113template void add_dense<unsigned int>(
unsigned int*,
int,
unsigned int const*,
int);
5114template void add_dense<unsigned short>(
unsigned short*,
int,
unsigned short const*,
int);
5120template void sub_dense<unsigned char>(
unsigned char*,
int,
unsigned char const*,
int);
5121template void sub_dense<unsigned int>(
unsigned int*,
int,
unsigned int const*,
int);
5122template void sub_dense<unsigned short>(
unsigned short*,
int,
unsigned short const*,
int);
5126template void write_coef_idx_to_buffer_dense<unsigned char>(
CoefIdx<unsigned char>*,
int&,
unsigned char*,
int);
5127template void write_coef_idx_to_buffer_dense<unsigned int>(
CoefIdx<unsigned int>*,
int&,
unsigned int*,
int);
5128template void write_coef_idx_to_buffer_dense<unsigned short>(
CoefIdx<unsigned short>*,
int&,
unsigned short*,
int);
5129template void write_coef_idx_to_buffer<unsigned char>(
CoefIdx<unsigned char>*,
int&,
int*,
unsigned char*,
int);
5130template void write_coef_idx_to_buffer<unsigned int>(
CoefIdx<unsigned int>*,
int&,
int*,
unsigned int*,
int);
5131template void write_coef_idx_to_buffer<unsigned short>(
CoefIdx<unsigned short>*,
int&,
int*,
unsigned short*,
int);
5138template void write_minus_coef_idx_to_buffer_dense<unsigned char>(
CoefIdx<unsigned char>*,
int&,
unsigned char*,
int);
5139template void write_minus_coef_idx_to_buffer_dense<unsigned int>(
CoefIdx<unsigned int>*,
int&,
unsigned int*,
int);
5140template void write_minus_coef_idx_to_buffer_dense<unsigned short>(
CoefIdx<unsigned short>*,
int&,
unsigned short*,
int);
5141template void write_minus_coef_idx_to_buffer<unsigned char>(
CoefIdx<unsigned char>*,
int&,
int*,
unsigned char*,
int);
5142template void write_minus_coef_idx_to_buffer<unsigned int>(
CoefIdx<unsigned int>*,
int&,
int*,
unsigned int*,
int);
5143template void write_minus_coef_idx_to_buffer<unsigned short>(
CoefIdx<unsigned short>*,
int&,
int*,
unsigned short*,
int);
5146template class std::vector<DataNoroCacheNode<unsigned char>*>;
5147template class std::vector<DataNoroCacheNode<unsigned int>*>;
5148template class std::vector<DataNoroCacheNode<unsigned short>*>;
5149template class std::vector<PolySimple>;
static int si_max(const int a, const int b)
static int si_min(const int a, const int b)
const CanonicalForm CFMap CFMap & N
static CanonicalForm bound(const CFMatrix &M)
template void noro_step< tgb_uint8 >(poly *p, int &pn, slimgb_alg *c)
template void noro_step< tgb_uint32 >(poly *p, int &pn, slimgb_alg *c)
template void noro_step< tgb_uint16 >(poly *p, int &pn, slimgb_alg *c)
SparseRow< number_type > * row
NoroCacheNode ** branches
int nIrreducibleMonomials
DataNoroCacheNode< number_type > * getCacheReference(poly term)
poly lookup(poly term, BOOLEAN &succ, int &len)
DataNoroCacheNode< number_type > * insertAndTransferOwnerShip(poly t, ring)
DataNoroCacheNode< number_type > * insert(poly term, poly nf, int len)
static const int backLinkCode
poly_tree_node * top_level
wlen_type initial_quality
wlen_type guess_quality(slimgb_alg *c)
makes on each red_object in a region a single_step
virtual ~reduction_step()
virtual void reduce(red_object *r, int l, int u)
we assume that all occurring red_objects have same lm, and all occ. lm's in r[l......
virtual void pre_reduce(red_object *r, int l, int u)
virtual void reduce(red_object *r, int l, int u)
we assume that all occurring red_objects have same lm, and all occ. lm's in r[l......
virtual void do_reduce(red_object &ro)
void(* enterS)(LObject &h, int pos, kStrategy strat, int atR)
void(* initEcart)(TObject *L)
unsigned long pTotaldegree(poly p)
int_pair_node * soon_free
sorted_pair_node ** apairs
BOOLEAN use_noro_last_block
int extended_product_crit
sorted_pair_node ** tmp_spn
void introduceDelayedPairs(poly *pa, int s)
unsigned int reduction_steps
poly_array_list * F_minus
slimgb_alg(ideal I, int syz_comp, BOOLEAN F4, int deg_pos)
void cleanDegs(int lower, int upper)
int syz_comp
array_lengths should be greater equal n;
int pTotaldegree_full(poly p)
BOOLEAN eliminationProblem
wlen_type * weighted_lengths
poly_list_node * to_destroy
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...
static FORCE_INLINE int n_GetChar(const coeffs r)
Return the characteristic of the coeff. domain.
static FORCE_INLINE number n_Init(long i, const coeffs r)
a number representing i in the given coeff field/ring r
static BOOLEAN pa(leftv res, leftv args)
void bit_reduce(poly &f, ring r)
const CanonicalForm int s
const Variable & v
< [in] a sqrfree bivariate poly
CFArray copy(const CFList &list)
write elements of list into an array
int comp(const CanonicalForm &A, const CanonicalForm &B)
compare polynomials
#define idDelete(H)
delete an ideal
ideal id_Copy(ideal h1, const ring r)
copy an ideal
BOOLEAN idIs0(ideal h)
returns true if h is the zero ideal
static BOOLEAN length(leftv result, leftv arg)
KINLINE poly ksOldCreateSpoly(poly p1, poly p2, poly spNoether, ring r)
void kBucketDeleteAndDestroy(kBucket_pt *bucket_pt)
void kBucketClear(kBucket_pt bucket, poly *p, int *length)
void kBucketDestroy(kBucket_pt *bucket_pt)
void kBucketInit(kBucket_pt bucket, poly lm, int length)
poly kBucketExtractLm(kBucket_pt bucket)
kBucket_pt kBucketCreate(const ring bucket_ring)
Creation/Destruction of buckets.
number kBucketPolyRed(kBucket_pt bucket, poly p1, int l1, poly spNoether)
void kBucket_Add_q(kBucket_pt bucket, poly q, int *l)
Add to Bucket a poly ,i.e. Bpoly == q+Bpoly.
const poly kBucketGetLm(kBucket_pt bucket)
void kBucketSimpleContent(kBucket_pt bucket)
int kBucketCanonicalize(kBucket_pt bucket)
Canonicalizes Bpoly, i.e. converts polys of buckets into one poly in one bucket: Returns number of bu...
#define MAX_BUCKET
Bucket definition (should be no one elses business, though)
poly ksCreateShortSpoly(poly p1, poly p2, ring tailRing)
ideal kInterRed(ideal F, ideal Q)
void initBuchMoraPos(kStrategy strat)
void initBuchMoraCrit(kStrategy strat)
void deleteInS(int i, kStrategy strat)
void initEcartBBA(TObject *h)
void enterSBba(LObject &p, int atS, kStrategy strat, int atR)
poly redNFTail(poly h, const int sl, kStrategy strat)
static void nc_kBucketPolyRed_Z(kBucket_pt b, poly p, number *c, BOOLEAN reduce)
static poly nc_mm_Mult_pp(const poly m, const poly p, const ring r)
static bool rIsSCA(const ring r)
static poly nc_CreateSpoly(const poly p1, const poly p2, const ring r)
poly sca_pp_Mult_xi_pp(short i, const poly pPoly, const ring rRing)
static FORCE_INLINE int nlQlogSize(number n, const coeffs r)
only used by slimgb (tgb.cc)
'SR_INT' is the type of those integers small enough to fit into 29 bits.
STATIC_VAR unsigned add[]
static number npNeg(number c, const coeffs r)
long npInt(number &n, const coeffs r)
static BOOLEAN npIsOne(number a, const coeffs)
static number npAddM(number a, number b, const coeffs r)
static number npInit(long i, const coeffs r)
static number nvMult(number a, number b, const coeffs r)
static number npMult(number a, number b, const coeffs r)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
#define __p_GetComp(p, r)
gmp_float exp(const gmp_float &a)
#define omreallocSize(addr, o_size, size)
#define omGetSpecBin(size)
#define omUnGetSpecBin(bin_ptr)
#define TEST_OPT_INTSTRATEGY
#define TEST_V_UPTORADICAL
#define TEST_OPT_DEGBOUND
#define TEST_OPT_REDTHROUGH
#define TEST_V_MODPSOLVSB
unsigned long p_GetShortExpVector(const poly p, const ring r)
poly p_Cleardenom(poly p, const ring r)
void pEnlargeSet(poly **p, int l, int increment)
static int pLength(poly a)
#define p_LmEqual(p1, p2, r)
#define __pp_Mult_nn(p, n, r)
static poly pp_Mult_mm(poly p, poly m, const ring r)
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_ExpVectorDiff(poly pr, poly p1, poly p2, const ring r)
static void p_Setm(poly p, const ring r)
static number p_SetCoeff(poly p, number n, ring r)
static BOOLEAN p_LmShortDivisibleBy(poly a, unsigned long sev_a, poly b, unsigned long not_sev_b, 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 BOOLEAN p_LmDivisibleBy(poly a, poly b, const ring r)
static void p_Delete(poly *p, const ring r)
static poly p_Init(const ring r, omBin bin)
static poly p_Copy(poly p, const ring r)
returns a copy of p
#define __p_Mult_nn(p, n, r)
void rChangeCurrRing(ring r)
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
#define pHasNotCF(p1, p2)
#define pExpVectorDiff(pr, p1, p2)
#define pGetComp(p)
Component.
#define pSetCoeff(p, n)
deletes old coeff before setting the new one
#define pLmShortDivisibleBy(a, sev_a, b, not_sev_b)
Divisibility tests based on Short Exponent vectors sev_a == pGetShortExpVector(a) not_sev_b == ~ pGet...
#define pExpVectorSub(p1, p2)
#define pLmInit(p)
like pInit, except that expvector is initialized to that of p, p must be != NULL
#define pGetShortExpVector(a)
returns the "Short Exponent Vector" – used to speed up divisibility tests (see polys-impl....
#define pGetExp(p, i)
Exponent.
#define pLmCmp(p, q)
returns 0|1|-1 if p=q|p>q|p<q w.r.t monomial ordering
#define pCopy(p)
return a copy of the poly
ideal idrMoveR_NoSort(ideal &id, ring src_r, ring dest_r)
ideal idrCopyR_NoSort(ideal id, ring src_r, ring dest_r)
void PrintS(const char *s)
ring rAssure_TDeg(ring r, int &pos)
BOOLEAN rRing_has_CompLastBlock(const ring r)
void rDelete(ring r)
unconditionally deletes fields in r
static BOOLEAN rField_is_Zp(const ring r)
static BOOLEAN rIsPluralRing(const ring r)
we must always have this test!
static int rBlocks(const ring r)
static BOOLEAN rField_is_Q(const ring r)
static short rVar(const ring r)
#define rVar(r) (r->N)
static short scaLastAltVar(ring r)
static short scaFirstAltVar(ring r)
int status int void * buf
ideal idInit(int idsize, int rank)
initialise an ideal / module
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 idSkipZeroes(ideal ide)
gives an ideal/module the minimal possible size
void id_Compactify(ideal id, const ring r)
static int fwbw(red_object *los, int i)
BOOLEAN is_valid_ro(red_object &ro)
static poly redNFTail(poly h, const int sl, kStrategy strat, int len)
ideal t_rep_gb(const ring r, ideal arg_I, int syz_comp, BOOLEAN F4_mode)
static void shorten_tails(slimgb_alg *c, poly monom)
static void go_on(slimgb_alg *c)
static poly gcd_of_terms(poly p, ring r)
BOOLEAN good_has_t_rep(int i, int j, slimgb_alg *c)
int tgb_pair_better_gen2(const void *ap, const void *bp)
static const int bundle_size
static int tgb_pair_better_gen(const void *ap, const void *bp)
static void clearS(poly p, unsigned long p_sev, int l, int *at, int *k, kStrategy strat)
static int pELength(poly p, slimgb_alg *c, int l)
sorted_pair_node ** spn_merge(sorted_pair_node **p, int pn, sorted_pair_node **q, int qn, slimgb_alg *c)
static wlen_type pair_weighted_length(int i, int j, slimgb_alg *c)
static void move_forward_in_S(int old_pos, int new_pos, kStrategy strat)
void now_t_rep(const int &arg_i, const int &arg_j, slimgb_alg *c)
void clean_top_of_pair_list(slimgb_alg *c)
#define ENLARGE(pointer, type)
static void mass_add(poly *p, int pn, slimgb_alg *c)
static int get_last_dp_block_start(ring r)
static wlen_type coeff_mult_size_estimate(int s1, int s2, ring r)
int find_best(red_object *r, int l, int u, wlen_type &w, slimgb_alg *c)
returns position sets w as weight
static BOOLEAN monomial_root(poly m, ring r)
int search_red_object_pos(red_object *a, int top, red_object *key)
static int multi_reduction_clear_zeroes(red_object *los, int losl, int l, int u, int syzComp)
static int * make_connections(int from, int to, poly bound, slimgb_alg *c)
sorted_pair_node ** add_to_basis_ideal_quotient(poly h, slimgb_alg *c, int *ip)
static BOOLEAN pair_better(sorted_pair_node *a, sorted_pair_node *b, slimgb_alg *c=NULL)
static poly p_Init_Special(const ring r)
#define ENLARGE_ALIGN(pointer, type)
static void sort_region_down(red_object *los, int l, int u, slimgb_alg *)
int slim_nsize(number n, ring r)
static wlen_type pSLength(poly p, int l)
static BOOLEAN lies_in_last_dp_block(poly p, slimgb_alg *c)
sorted_pair_node * quick_pop_pair(slimgb_alg *c)
wlen_type kEBucketLength(kBucket *b, poly lm, slimgb_alg *ca)
static int posInPairs(sorted_pair_node **p, int pn, sorted_pair_node *qe, slimgb_alg *c, int an=0)
static const int delay_factor
int kFindDivisibleByInS_easy(kStrategy strat, const red_object &obj)
static int poly_crit(const void *ap1, const void *ap2)
static int simple_posInS(kStrategy strat, poly p, int len, wlen_type wlen)
static wlen_type quality_of_pos_in_strat_S(int pos, slimgb_alg *c)
static void c_S_element_changed_hook(int pos, slimgb_alg *c)
sorted_pair_node * top_pair(slimgb_alg *c)
static void replace_pair(int &i, int &j, slimgb_alg *c)
static void multi_reduction_find(red_object *los, int, slimgb_alg *c, int startf, find_erg &erg)
static void line_of_extended_prod(int fixpos, slimgb_alg *c)
static BOOLEAN trivial_syzygie(int pos1, int pos2, poly bound, slimgb_alg *c)
static int iq_crit(const void *ap, const void *bp)
static poly redNF2(poly h, slimgb_alg *c, int &len, number &m, int n=0)
static void simplify_poly(poly p, ring r)
static void multi_reduction(red_object *los, int &losl, slimgb_alg *c)
static void add_later(poly p, const char *prot, slimgb_alg *c)
static poly pOne_Special(const ring r=currRing)
static poly redTailShort(poly h, kStrategy strat)
static void cleanS(kStrategy strat, slimgb_alg *c)
static BOOLEAN ascending(int *i, int top)
static wlen_type quality_of_pos_in_strat_S_mult_high(int pos, poly high, slimgb_alg *c)
static void multi_reduce_step(find_erg &erg, red_object *r, slimgb_alg *c)
static wlen_type do_pELength(poly p, slimgb_alg *c, int dlm=-1)
ideal do_t_rep_gb(ring, ideal arg_I, int syz_comp, BOOLEAN F4_mode, int deg_pos)
static wlen_type pQuality(poly p, slimgb_alg *c, int l=-1)
static void move_backward_in_S(int old_pos, int new_pos, kStrategy strat)
void free_sorted_pair_node(sorted_pair_node *s, const ring r)
BOOLEAN lenS_correct(kStrategy strat)
void init_with_mac_poly(tgb_sparse_matrix *mat, int row, mac_poly m)
int terms_sort_crit(const void *a, const void *b)
static void canonicalize_region(red_object *los, int l, int u, slimgb_alg *)
static BOOLEAN polynomial_root(poly h, ring r)
poly free_row_to_poly(tgb_sparse_matrix *mat, int row, poly *monoms, int monom_index)
static int bucket_guess(kBucket *bucket)
wlen_type kSBucketLength(kBucket *b, poly lm=NULL)
TODO CoefBuckets bercksichtigen.
static void super_clean_top_of_pair_list(slimgb_alg *c)
static void multi_reduction_lls_trick(red_object *los, int, slimgb_alg *c, find_erg &erg)
static int red_object_better_gen(const void *ap, const void *bp)
static void length_one_crit(slimgb_alg *c, int pos, int len)
static BOOLEAN has_t_rep(const int &arg_i, const int &arg_j, slimgb_alg *state)
static void add_to_reductors(slimgb_alg *c, poly h, int len, int ecart, BOOLEAN simplified=FALSE)
static BOOLEAN pHasNotCFExtended(poly p1, poly p2, poly m)
static BOOLEAN extended_product_criterion(poly p1, poly gcd1, poly p2, poly gcd2, slimgb_alg *c)
static const int bundle_size_noro
static BOOLEAN state_is(calc_state state, const int &i, const int &j, slimgb_alg *c)
static BOOLEAN elength_is_normal_length(poly p, slimgb_alg *c)
int tgb_pair_better_gen2(const void *ap, const void *bp)
sorted_pair_node ** spn_merge(sorted_pair_node **p, int pn, sorted_pair_node **q, int qn, slimgb_alg *c)
void now_t_rep(const int &arg_i, const int &arg_j, slimgb_alg *c)
void simplest_gauss_modp(number_type *a, int nrows, int ncols)
sorted_pair_node ** add_to_basis_ideal_quotient(poly h, slimgb_alg *c, int *ip)
void write_poly_to_row(number_type *row, poly h, poly *terms, int tn)
int pos_helper(kStrategy strat, poly p, len_type len, set_type setL, polyset set)
poly row_to_poly(number_type *row, poly *terms, int tn, ring r)
wlen_type expected_length
void free_sorted_pair_node(sorted_pair_node *s, const ring r)
void noro_step(poly *p, int &pn, slimgb_alg *c)