My Project
Loading...
Searching...
No Matches
kInline.h
Go to the documentation of this file.
1/****************************************
2* Computer Algebra System SINGULAR *
3****************************************/
4/***************************************************************
5 * File: kInline.h
6 * Purpose: implementation of std related inline routines
7 * Author: obachman (Olaf Bachmann)
8 * Created: 8/00
9 *******************************************************************/
10#ifndef KINLINE_H
11#define KINLINE_H
12
13#if !defined(NO_KINLINE) || defined(KUTIL_CC)
14/* this file is a header file with inline routines,
15 * if NO_KINLINE is not defined (AND ONLY THEN!)
16 * otherwise it is an part of kutil.cc and a source file!
17 * (remark: NO_KINLINE is defined by KDEBUG, i.e. in the debug version)
18 */
19
20#include "omalloc/omalloc.h"
21#include "misc/options.h"
23#include "polys/kbuckets.h"
24
25#include "kernel/polys.h"
26
27#ifdef HAVE_SHIFTBBA
28#include "polys/shiftop.h"
29#endif
30
31
32#define HAVE_TAIL_BIN
33// This doesn't really work, fixme, if necessary
34// #define HAVE_LM_BIN
35
36
37
39{
40 assume(i>= 0 && i<=sl);
41 assume(S_2_R[i] >= 0 && S_2_R[i] <= tl);
42 TObject* TT = R[S_2_R[i]];
43 assume(TT != NULL && TT->p == S[i]);
44 return TT;
45}
46
48{
49 if (i >= 0 && i <= sl)
50 {
51 int sri= S_2_R[i];
52 if ((sri >= 0) && (sri <= tl))
53 {
54 TObject* t = R[sri];
55 if ((t != NULL) && (t->p == S[i]))
56 return t;
57 }
58 // last but not least, try kFindInT
59 sri = kFindInT(S[i], T, tl);
60 if (sri >= 0)
61 return &(T[sri]);
62 }
63 return NULL;
64}
65
67{
68 if (tailRing == currRing)
69 return kNoether;
70 else
71 {
72 assume((kNoether == NULL && t_kNoether == NULL) ||
73 (kNoether != NULL && t_kNoether != NULL));
74 return t_kNoether;
75 }
76}
77
78/***************************************************************
79 *
80 * Operation on TObjects
81 *
82 ***************************************************************/
83
85{
86 TSet T = (TSet)omAlloc0(setmaxT*sizeof(TObject));
87 for (int i=setmaxT-1; i>=0; i--)
88 {
89 T[i].tailRing = currRing;
90 T[i].i_r = -1;
91 }
92 return T;
93}
94
96{
97 return (TObject**) omAlloc0(setmaxT*sizeof(TObject*));
98}
99
100KINLINE unsigned long* initsevT()
101{
102 return (unsigned long*) omAlloc0(setmaxT*sizeof(unsigned long));
103}
104
105// initialization
107{
108 tailRing = r;
109}
111{
112 memset(this, 0, sizeof(sTObject));
113 i_r = -1;
114 Set(r);
115}
117{
118 Init(r);
119}
121{
122#ifdef HAVE_SHIFTBBA
123 if (r->isLPring)
124 {
125 shift = si_max(p_mFirstVblock(p_in, r) - 1, 0);
126 if (!shift) p_Test(p_in, r);
127 }
128 else
129#endif
130 {
131 p_Test(p_in, r);
132 }
133 if (r != currRing)
134 {
135 assume(r == tailRing);
136 t_p = p_in;
137 }
138 else
139 {
140 p = p_in;
141 }
143}
144
146{
147 Init(r);
148 Set(p_in, r);
149}
150
152{
153 if (c_r != t_r)
154 {
155 assume(c_r == currRing && t_r == tailRing);
156#ifdef HAVE_SHIFTBBA
157 if (c_r->isLPring)
158 {
159 shift = si_max(p_mFirstVblock(p_in, c_r) - 1, 0);
160 if (!shift) p_Test(p_in, currRing);
161 }
162 else
163#endif
164 {
166 }
167 p = p_in;
169 }
170 else
171 {
172 Set(p_in, c_r);
173 }
174}
175
177{
178 Init(t_r);
179 Set(p_in, c_r, t_r);
180}
181
183{
184 *this = *T;
185 if (copy)
186 {
187 if (t_p != NULL)
188 {
191 }
192 else
193 {
194 p = p_Copy(p, currRing);
195 }
196 }
197}
198
200{
201 if (t_p != NULL)
202 {
204 if (p != NULL)
206 }
207 else
208 {
210 }
211}
212
214{
215 p = NULL;
216 t_p = NULL;
217 ecart = 0;
218 length = 0;
219 pLength = 0;
220 FDeg = 0;
222}
223
225{
226 if (t_p != NULL)
227 {
229 if (p != NULL) /* and t_p!=NULL*/
230 {
231 p = p_LmInit(p, currRing);
233 pNext(p) = pNext(t_p);
234 }
235 }
236 else
237 {
238 p = p_Copy(p, currRing);
239 }
240}
241
243{
244 if (p == NULL && t_p != NULL)
246
247 return p;
248}
250{
251 if (t_p == NULL)
252 {
253 if (p != NULL && tailRing != currRing)
254 {
256 return t_p;
257 }
258 return p;
259 }
260 return t_p;
261}
263{
264 assume(r == tailRing || r == currRing);
265 if (r == currRing)
266 return GetLmCurrRing();
267
268 if (t_p == NULL && p != NULL)
270
271 return t_p;
272}
273
274KINLINE void sTObject::GetLm(poly &p_r, ring &r_r) const
275{
276 if (t_p != NULL)
277 {
278 p_r = t_p;
279 r_r = tailRing;
280 }
281 else
282 {
283 p_r = p;
284 r_r = currRing;
285 }
286}
287
289{
290 return (p == NULL && t_p == NULL);
291}
292
294{
295 if (pLength <= 0) pLength = ::pLength(p != NULL ? p : t_p);
296 return pLength;
297}
298
304
306{
307 assume(p != NULL || t_p != NULL);
308 if (t_p != NULL) return pNext(t_p);
309 return pNext(p);
310}
311
312// Iterations
314{
315 assume(p != NULL || t_p != NULL);
316 if (t_p != NULL)
317 {
319 if (p != NULL)
320 {
322 p = NULL;
323 }
324 }
325 else
326 {
328 }
330}
331
332
333// arithmetic
335{
336 if (t_p != NULL)
337 {
338 t_p = p_Mult_nn(t_p, n, tailRing);
339 if (p != NULL) pSetCoeff0(p, pGetCoeff(t_p));
340 }
341 else
342 {
343 p = p_Mult_nn(p, n, currRing, tailRing);
344 }
345}
346
348{
349 if (t_p != NULL)
350 {
352 if (p != NULL) pSetCoeff0(p, pGetCoeff(t_p));
353 }
354 else
355 {
356 pNormalize(p);
357 }
359}
360
366
368{
369 if (t_p != NULL)
370 {
372 if (p != NULL) pSetCoeff0(p, pGetCoeff(t_p));
373 }
374 else
375 {
377 }
378}
379
380KINLINE void
382 pShallowCopyDeleteProc p_shallow_copy_delete,
384{
385 if (new_tailBin == NULL) new_tailBin = new_tailRing->PolyBin;
386 if (t_p != NULL)
387 {
388 t_p = p_shallow_copy_delete(t_p, tailRing, new_tailRing, new_tailBin);
389 if (p != NULL)
390 pNext(p) = pNext(t_p);
391 if (new_tailRing == currRing)
392 {
393 if (p == NULL) p = t_p;
394 else p_LmFree(t_p, tailRing);
395 t_p = NULL;
396 }
397 }
398 else if (p != NULL) /* && t_p==NULL */
399 {
400 if (pNext(p) != NULL)
401 {
402 pNext(p) = p_shallow_copy_delete(pNext(p),
404 }
405 if (new_tailRing != currRing)
406 {
408 pNext(t_p) = pNext(p);
409 }
410 }
411 if (max_exp != NULL)
412 {
413 max_exp = p_shallow_copy_delete(max_exp,tailRing,new_tailRing,new_tailBin);
414 }
415 else if (set_max && pNext(t_p) != NULL)
416 {
418 }
420}
421
423{
424 if (p != NULL) return p_FDeg(p, currRing);
425 return tailRing->pFDeg(t_p, tailRing);
426}
428{
429 if (p != NULL) return p_Totaldegree(p, currRing);
430 return p_Totaldegree(t_p,tailRing);
431}
433{
434 FDeg = this->pFDeg();
435 return FDeg;
436}
438{
439 assume(FDeg == this->pFDeg());
440 return FDeg;
441}
443{
444 return tailRing->pLDeg(GetLmTailRing(), &length, tailRing);
445}
447{
448 FDeg = this->pFDeg();
449 long d = this->pLDeg();
450 ecart = d - FDeg;
451 return d;
452}
453
454//extern void pCleardenom(poly p);
455// extern void pNorm(poly p);
456
457// manipulations
459{
460 assume(p != NULL);
462 if ((TEST_OPT_CONTENTSB) && (!is_ring))
463 {
464 number n;
465 if (t_p != NULL)
466 {
469 }
470 else
471 {
473 }
474 if (!nIsOne(n))
475 {
477 denom->n=nInvers(n);
480 }
481 nDelete(&n);
482 }
483 #ifdef HAVE_RINGS
484 else if (is_ring)
485 {
486 number c;
487 if (t_p != NULL)
488 c=pGetCoeff(t_p);
489 else
490 c=pGetCoeff(p);
491 const coeffs C=tailRing->cf;
492 number u=n_GetUnit(c,C);
493
494 if (t_p != NULL)
495 {
496 if (!n_IsOne(u,C))
497 {
498 number uInv = n_Invers(u, C);
500 n_Delete(&uInv,C);
501 }
503 {
505 }
507 }
508 else
509 {
510 if (!n_IsOne(u,C))
511 {
512 number uInv = n_Invers(u, C);
514 n_Delete(&uInv,C);
515 }
517 {
518 p = p_Neg(p,tailRing);
519 }
520 }
521 n_Delete(&u,C);
522 }
523 #endif
524 else
525 {
526 if (t_p != NULL)
527 {
530 }
531 else
532 {
534 }
535 }
536}
537
539{
540 assume(p != NULL);
541 if (t_p != NULL)
542 {
545 {
547 }
549 }
550 else
551 {
554 {
555 p=p_Neg (p,currRing);
556 }
557 }
558}
559
560KINLINE void sTObject::pNorm() // pNorm seems to be a _bad_ method name...
561{
562 assume(p != NULL);
563 if (! is_normalized)
564 {
565 p_Norm(p, currRing);
566 if (t_p != NULL)
569 }
570}
571
572
573
574/***************************************************************
575 *
576 * Operation on LObjects
577 *
578 ***************************************************************/
579// Initialization
581{
583 sev = 0;
584}
585
586
593
595{
596 memset(this, 0, sizeof(sLObject));
597 i_r1 = -1;
598 i_r2 = -1;
599 i_r = -1;
600 Set(r);
601}
603{
604 Init(r);
605}
607{
608 Init(r);
609 Set(p_in, r);
610}
611
613{
614 Init(t_r);
615 Set(p_in, c_r, t_r);
616}
617
619{
620 if (bucket == NULL)
621 {
622 unsigned l = GetpLength();
623 if (use_bucket && (l > 1))
624 {
625 poly tp = GetLmTailRing();
626 assume((int)l == ::pLength(tp));
629 pNext(tp) = NULL;
630 if (p != NULL) pNext(p) = NULL;
631 pLength = 0;
632 }
633 }
634}
635
637{
638
639 Set(lm, _tailRing);
640 if (use_bucket)
641 {
644 pNext(lm) = NULL;
645 pLength = 0;
646 }
647 else
648 {
649 pNext(lm) = p_tail;
650 pLength = p_Length + 1;
651 }
652}
653
655{
656 if (bucket != NULL)
657 {
659 }
660 else
661 {
662 poly _p = (t_p != NULL ? t_p : p);
663 assume(_p != NULL);
665 }
666}
667
669 poly spNoether)
670{
671 if (bucket != NULL)
672 {
674 }
675 else
676 {
677 if (lq<=0) lq= ::pLength(q);
678 poly _p = (t_p != NULL ? t_p : p);
679 assume(_p != NULL);
680
681 int lp=pLength-1;
684 pLength=lp+1;
685// tailRing->p_Procs->p_Minus_mm_Mult_qq(pNext(_p), m, q, shorter,spNoether, tailRing, last);
686// pLength += lq - shorter;
687 }
688}
689
691{
693 if (bucket != NULL)
694 {
695 poly _p = kBucketExtractLm(bucket);
696 if (_p == NULL)
697 {
699 p = t_p = NULL;
700 return;
701 }
702 Set(_p, tailRing);
703 }
704 else
705 {
706 pLength--;
707 }
708}
709
711{
712 poly ret = GetLmTailRing();
713 poly pn;
714
715 assume(p != NULL || t_p != NULL);
716
717 if (bucket != NULL)
718 {
720 if (pn == NULL)
722 }
723 else
724 {
725 pn = pNext(ret);
726 }
727 pLength--;
728 pNext(ret) = NULL;
729 if (p != NULL && t_p != NULL)
731
732 Set(pn, tailRing);
733 return ret;
734}
735
737{
738 //kTest_L(this);
739 poly tp = GetLmTailRing();
740 assume(tp != NULL);
741
742 if (bucket != NULL)
743 {
746 pLength++;
747 }
748 return tp;
749}
750
751
753{
754 //kTest_L(this);
755 if (p == NULL)
756 {
758 ((lmBin!=NULL)?lmBin:currRing->PolyBin));
759 FDeg = pFDeg();
760 }
761 else if ((lmBin != NULL) && (lmBin != currRing->PolyBin))
762 {
764 FDeg = pFDeg();
765 }
766
767 if (bucket != NULL)
768 {
771 pLength++;
772 if (t_p != NULL) pNext(t_p) = pNext(p);
773 }
774 //kTest_L(this);
775 return p;
776}
777
778KINLINE void
780 pShallowCopyDeleteProc p_shallow_copy_delete)
781{
782 if (bucket != NULL)
784 p_shallow_copy_delete);
786 new_tailRing->PolyBin,p_shallow_copy_delete,
787 FALSE);
788}
789
791{
792 if (t_p != NULL)
793 {
795 }
796 else
797 {
799 }
800}
801
803{
804 if (bucket != NULL)
805 {
809 p_Copy(bucket->buckets[i], tailRing),
810 bucket->buckets_length[i]);
812 if (t_p != NULL) pNext(t_p) = NULL;
813 if (p != NULL) pNext(p) = NULL;
814 }
815 TObject::Copy();
816}
817
819{
820 poly tp = GetLmTailRing();
821 assume(tp != NULL);
822 if (bucket != NULL)
823 {
825 pNext(tp) = bucket->buckets[i];
826 long ldeg = tailRing->pLDeg(tp, &length, tailRing);
827 pNext(tp) = NULL;
828 return ldeg;
829 }
830 else
831 return tailRing->pLDeg(tp, &length, tailRing);
832}
834{
835 if (! deg_last || bucket != NULL) return sLObject::pLDeg();
836
837 long ldeg;
839#ifndef SING_NDEBUG
840 if ( pLength == 0)
843#else
845#endif
846 return ldeg;
847}
848
850{
851 FDeg = this->pFDeg();
852 long d = this->pLDeg();
853 ecart = d - FDeg;
854 return d;
855}
857{
858 FDeg = this->pFDeg();
859 long d = this->pLDeg(use_last);
860 ecart = d - FDeg;
861 return d;
862}
864{
865 if (bucket == NULL)
866 return sTObject::GetpLength();
868 return bucket->buckets_length[i] + 1;
869}
871{
872 if (length_pLength)
873 {
874 length = this->GetpLength();
875 }
876 else
877 this->pLDeg();
878 return length;
879}
881{
882 poly tp = GetLmTailRing();
883 assume(tp != NULL);
884 if (bucket != NULL)
885 {
887 pNext(tp) = bucket->buckets[i];
888 long m = p_MinComp(tp, tailRing);
889 pNext(tp) = NULL;
890 return m;
891 }
892 else
893 return p_MinComp(tp, tailRing);
894}
896{
897 poly pp;
898 ring r;
899 GetLm(pp, r);
900 assume(pp != NULL);
901 return p_GetComp(pp, r);
902}
903
905{
906 memcpy(this, &t, sizeof(sTObject));
907 return *this;
908}
909
911{
912 if (p1 == NULL) return NULL;
913 if (i_r1 == -1) i_r1 = kFindInT(p1, s->T, s->tl);
914 assume(i_r1 >= 0 && i_r1 <= s->tl);
915 TObject* T = s->R[i_r1];
916 assume(T->p == p1);
917 return T;
918}
919
921{
922 if (p1 == NULL) return NULL;
923 assume(p2 != NULL);
924 if (i_r2 == -1) i_r2 = kFindInT(p2, strat->T, strat->tl);
925 assume(i_r2 >= 0 && i_r2 <= strat->tl);
926 TObject* T = strat->R[i_r2];
927 assume(T->p == p2);
928 return T;
929}
930
932 TObject* &T_1, TObject* &T_2)
933{
934 if (p1 == NULL)
935 {
936 T_1 = NULL;
937 T_2 = NULL;
938 return;
939 }
940 assume(p1 != NULL && p2 != NULL);
941 if (i_r1 == -1) i_r1 = kFindInT(p1, strat->T, strat->tl);
942 if (i_r2 == -1) i_r2 = kFindInT(p2, strat->T, strat->tl);
943 assume(i_r1 >= 0 && i_r1 <= strat->tl);
944 assume(i_r2 >= 0 && i_r2 <= strat->tl);
945 T_1 = strat->R[i_r1];
946 T_2 = strat->R[i_r2];
947 assume(T_1->p == p1);
948 assume(T_2->p == p2);
949 return;
950}
951
952/***************************************************************
953 *
954 * Conversion of polys
955 *
956 ***************************************************************/
957
958KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing, omBin tailBin)
959{
960
961 poly t_p = p_LmInit(p, currRing, tailRing, tailBin);
962 pNext(t_p) = pNext(p);
963 pSetCoeff0(t_p, pGetCoeff(p));
964 return t_p;
965}
966
967KINLINE poly k_LmInit_tailRing_2_currRing(poly t_p, ring tailRing, omBin lmBin)
968{
969 poly p = p_LmInit(t_p, tailRing, currRing, lmBin);
970 pNext(p) = pNext(t_p);
971 pSetCoeff0(p, pGetCoeff(t_p));
972 return p;
973}
974
975// this should be made more efficient
977{
978 poly np = k_LmInit_currRing_2_tailRing(p, tailRing, tailBin);
980 return np;
981}
982
984{
985 poly np = k_LmInit_tailRing_2_currRing(p, tailRing, lmBin);
986 p_LmFree(p, tailRing);
987 return np;
988}
989
991{
992 return k_LmInit_currRing_2_tailRing(p, tailRing, tailRing->PolyBin);
993}
994
996{
997 return k_LmInit_tailRing_2_currRing(p, tailRing, currRing->PolyBin);
998}
999
1001{
1002 return k_LmShallowCopyDelete_currRing_2_tailRing(p, tailRing, tailRing->PolyBin);
1003}
1004
1006{
1007 return k_LmShallowCopyDelete_tailRing_2_currRing(p, tailRing, currRing->PolyBin);
1008}
1009
1010/***************************************************************
1011 *
1012 * Lcm business
1013 *
1014 ***************************************************************/
1015// get m1 = LCM(LM(p1), LM(p2))/LM(p1)
1016// m2 = LCM(LM(p1), LM(p2))/LM(p2)
1017KINLINE BOOLEAN k_GetLeadTerms(const poly p1, const poly p2, const ring p_r,
1018 poly &m1, poly &m2, const ring m_r)
1019{
1022
1023 int i;
1024 long x;
1025 m1 = p_Init(m_r,m_r->PolyBin);
1026 m2 = p_Init(m_r,m_r->PolyBin);
1027
1028 for (i = p_r->N; i; i--)
1029 {
1030 x = p_GetExpDiff(p1, p2, i, p_r);
1031 if (x > 0)
1032 {
1033 if (x > (long) m_r->bitmask) goto false_return;
1034 p_SetExp(m2,i,x, m_r);
1035 p_SetExp(m1,i,0, m_r);
1036 }
1037 else
1038 {
1039 if (-x > (long) m_r->bitmask) goto false_return;
1040 p_SetExp(m1,i,-x, m_r);
1041 p_SetExp(m2,i,0, m_r);
1042 }
1043 }
1044
1045 p_Setm(m1, m_r);
1046 p_Setm(m2, m_r);
1047 return TRUE;
1048
1050 p_LmFree(m1, m_r);
1051 p_LmFree(m2, m_r);
1052 m1 = m2 = NULL;
1053 return FALSE;
1054}
1055
1056#ifdef HAVE_RINGS
1057// get m1 = LCM(LM(p1), LM(p2))/LM(p1)
1058// m2 = LCM(LM(p1), LM(p2))/LM(p2) in tailRing
1059// lcm = LCM(LM(p1), LM(p2)) in leadRing
1060KINLINE void k_GetStrongLeadTerms(const poly p1, const poly p2, const ring leadRing,
1061 poly &m1, poly &m2, poly &lcm, const ring tailRing)
1062{
1065
1066 int i;
1067 int x;
1068 int e1;
1069 int e2;
1070 int s;
1071 m1 = p_Init(tailRing,tailRing->PolyBin);
1072 m2 = p_Init(tailRing,tailRing->PolyBin);
1073 lcm = p_Init(leadRing,leadRing->PolyBin);
1074
1075 for (i = leadRing->N; i>=0; i--)
1076 {
1077 e1 = p_GetExp(p1,i,leadRing);
1078 e2 = p_GetExp(p2,i,leadRing);
1079 x = e1 - e2;
1080 if (x > 0)
1081 {
1082 p_SetExp(m2,i,x, tailRing);
1083 //p_SetExp(m1,i,0, tailRing); // done by p_Init
1084 s = e1;
1085 }
1086 else if (x<0)
1087 {
1088 p_SetExp(m1,i,-x, tailRing);
1089 //p_SetExp(m2,i,0, tailRing); // done by p_Init
1090 s = e2;
1091 }
1092 else
1093 s = e1; // e1==e2
1095 }
1096
1097 p_Setm(m1, tailRing);
1098 p_Setm(m2, tailRing);
1100}
1101#endif
1102
1103/***************************************************************
1104 *
1105 * Misc things
1106 *
1107 ***************************************************************/
1109{
1110 BOOLEAN ret;
1111 number mult, rest;
1112 TObject red = *PW;
1113 red.Copy();
1114 rest = n_QuotRem(pGetCoeff(Red->p), pGetCoeff(red.p),
1115 &mult, currRing->cf);
1116 red.Mult_nn(rest);
1117
1118 assume(PR->GetLmCurrRing() != red.GetLmCurrRing());
1119 ret = ksReducePolyLC(Red, &red, NULL, &mult);
1120 red.Delete();
1121 red.Clear();
1122
1123 return ret;
1124}
1125
1127{
1128 BOOLEAN ret;
1129 number coef=NULL;
1130
1131 assume(PR->GetLmCurrRing() != PW->GetLmCurrRing());
1132 ret = ksReducePoly(Red, PW, NULL, &coef, NULL,NULL,TRUE);
1133
1134#if 0 // shlould not happen
1135 if (!ret)
1136 {
1137 if (! n_IsOne(coef, currRing->cf))
1138 {
1139 PR->Mult_nn(coef);
1140 // HANNES: mark for Normalize
1141 }
1142 }
1143#endif
1144 n_Delete(&coef, currRing->cf);
1145 return ret;
1146}
1147
1149{
1150 BOOLEAN ret;
1151 number coef;
1152
1153 assume(PR->GetLmCurrRing() != PW->GetLmCurrRing());
1154 Red->HeadNormalize();
1155 ret = ksReducePoly(Red, PW, NULL, &coef);
1156
1157 if (!ret)
1158 {
1159 if (! n_IsOne(coef, currRing->cf))
1160 {
1161 PR->Mult_nn(coef);
1162 // HANNES: mark for Normalize
1163 }
1164 n_Delete(&coef, currRing->cf);
1165 }
1166 return ret;
1167}
1168
1169/***************************************************************
1170 *
1171 * Routines for backwards-Compatibility
1172 *
1173 *
1174 ***************************************************************/
1175KINLINE poly ksOldSpolyRed(poly p1, poly p2, poly spNoether)
1176{
1177 LObject L(p2);
1178 TObject T(p1);
1179
1180 ksReducePoly(&L, &T, spNoether);
1181
1182 return L.GetLmCurrRing();
1183}
1184
1185KINLINE poly ksOldSpolyRedNew(poly p1, poly p2, poly spNoether)
1186{
1187 LObject L(p_Copy(p2, currRing));
1188 TObject T(p1);
1189
1190 ksReducePoly(&L, &T, spNoether);
1191
1192 return L.GetLmCurrRing();
1193}
1194
1195KINLINE poly ksOldCreateSpoly(poly p1, poly p2, poly spNoether, ring r)
1196{
1197 LObject L(r);
1198 L.p1 = p1;
1199 L.p2 = p2;
1200
1202 return L.GetLmCurrRing();
1203}
1204
1205void ksOldSpolyTail(poly p1, poly q, poly q2, poly spNoether, ring r)
1206{
1207 LObject L(q, currRing, r);
1208 TObject T(p1, currRing, r);
1209
1211}
1212
1214{
1215 LObject L(p);
1216 return redtailBba(&L, pos, strat,FALSE, normalize);
1217}
1218
1220{
1221 LObject L(p, currRing, strat->tailRing); // ? L(p); ??
1222 return redtailBbaBound(&L, pos, strat,bound, FALSE, normalize);
1223}
1224
1225#ifdef HAVE_RINGS
1226KINLINE poly redtailBba_Ring (poly p,int pos,kStrategy strat)
1227{
1228 LObject L(p, currRing, strat->tailRing);
1229 return redtailBba_Ring(&L, pos, strat);
1230}
1231KINLINE poly redtailBba_Z (poly p,int pos,kStrategy strat)
1232{
1233 LObject L(p, currRing, strat->tailRing);
1234 return redtailBba_Z(&L, pos, strat);
1235}
1236#endif
1237
1238KINLINE void clearS (poly p, unsigned long p_sev, int* at, int* k,
1239 kStrategy strat)
1240{
1242 if (strat->noClearS) return;
1243 #ifdef HAVE_RINGS
1245 {
1246 if (!pLmShortDivisibleBy(p,p_sev, strat->S[*at], ~ strat->sevS[*at]))
1247 return;
1248 if(!n_DivBy(pGetCoeff(strat->S[*at]), pGetCoeff(p), currRing->cf))
1249 return;
1250 }
1251 else
1252 #endif
1253 {
1254 if (!pLmShortDivisibleBy(p,p_sev, strat->S[*at], ~ strat->sevS[*at])) return;
1255 }
1256 deleteInS((*at),strat);
1257 (*at)--;
1258 (*k)--;
1259}
1260
1261// dummy function for function pointer strat->rewCrit being usable in all
1262// possible choices for criteria
1263KINLINE BOOLEAN arriRewDummy(poly /*sig*/, unsigned long /*not_sevSig*/, poly /*lm*/, kStrategy /*strat*/, int /*start=0*/)
1264{
1265 return FALSE;
1266}
1267
1268#endif // defined(KINLINE) || defined(KUTIL_CC)
1269#endif // KINLINE_H
static int si_max(const int a, const int b)
Definition auxiliary.h:124
int BOOLEAN
Definition auxiliary.h:87
#define TRUE
Definition auxiliary.h:100
#define FALSE
Definition auxiliary.h:96
CanonicalForm FACTORY_PUBLIC pp(const CanonicalForm &)
CanonicalForm pp ( const CanonicalForm & f )
Definition cf_gcd.cc:676
int l
Definition cfEzgcd.cc:100
int m
Definition cfEzgcd.cc:128
int i
Definition cfEzgcd.cc:132
int k
Definition cfEzgcd.cc:99
Variable x
Definition cfModGcd.cc:4081
int p
Definition cfModGcd.cc:4077
static CanonicalForm bound(const CFMatrix &M)
Definition cf_linsys.cc:460
KINLINE long SetDegStuffReturnLDeg()
Definition kInline.h:849
KINLINE void Tail_Mult_nn(number n)
Definition kInline.h:654
int i_r1
Definition kutil.h:193
KINLINE void Copy()
Definition kInline.h:802
KINLINE void Delete()
Definition kInline.h:587
KINLINE void LmDeleteAndIter()
Definition kInline.h:690
KINLINE TObject * T_2(const skStrategy *strat)
Definition kInline.h:920
KINLINE void PrepareRed(BOOLEAN use_bucket)
Definition kInline.h:618
KINLINE void CanonicalizeP()
Definition kInline.h:361
KINLINE void SetLmTail(poly lm, poly new_p, int length, int use_bucket, ring r)
Definition kInline.h:636
KINLINE void T_1_2(const skStrategy *strat, TObject *&T_1, TObject *&T_2)
Definition kInline.h:931
KINLINE void Normalize()
Definition kInline.h:347
unsigned long sev
Definition kutil.h:187
KINLINE void Init(ring tailRing=currRing)
Definition kInline.h:594
KINLINE long MinComp()
Definition kInline.h:880
kBucket_pt bucket
Definition kutil.h:192
poly p2
Definition kutil.h:188
KINLINE TObject * T_1(const skStrategy *strat)
Definition kInline.h:910
KINLINE int GetpLength()
Definition kInline.h:863
KINLINE int SetLength(BOOLEAN lengt_pLength=FALSE)
Definition kInline.h:870
KINLINE void Clear()
Definition kInline.h:580
KINLINE void Tail_Minus_mm_Mult_qq(poly m, poly qq, int lq, poly spNoether)
Definition kInline.h:668
KINLINE void ShallowCopyDelete(ring new_tailRing, pShallowCopyDeleteProc p_shallow_copy_delete)
Definition kInline.h:779
KINLINE poly GetTP()
Definition kInline.h:736
KINLINE long pLDeg()
Definition kInline.h:818
KINLINE sLObject & operator=(const sTObject &)
Definition kInline.h:904
KINLINE void SetShortExpVector()
Definition kInline.h:790
KINLINE void HeadNormalize()
Definition kInline.h:367
KINLINE poly GetP(omBin lmBin=(omBin) NULL)
Definition kInline.h:752
KINLINE sLObject(ring tailRing=currRing)
Definition kInline.h:602
poly p1
Definition kutil.h:188
KINLINE long Comp()
Definition kInline.h:895
KINLINE poly LmExtractAndIter()
Definition kInline.h:710
int i_r2
Definition kutil.h:193
KINLINE poly GetLm(ring r)
Definition kInline.h:262
KINLINE poly GetLmCurrRing()
Definition kInline.h:242
KINLINE void Init(ring r=currRing)
Definition kInline.h:110
KINLINE void Mult_nn(number n)
Definition kInline.h:334
int length
Definition kutil.h:79
KINLINE long SetDegStuffReturnLDeg()
Definition kInline.h:446
KINLINE poly GetLmTailRing()
Definition kInline.h:249
KINLINE void pCleardenom()
Definition kInline.h:458
int ecart
Definition kutil.h:78
KINLINE long GetpFDeg() const
Definition kInline.h:437
KINLINE sTObject(ring tailRing=currRing)
Definition kInline.h:116
KINLINE void ShallowCopyDelete(ring new_tailRing, omBin new_tailBin, pShallowCopyDeleteProc p_shallow_copy_delete, BOOLEAN set_max=TRUE)
Definition kInline.h:381
KINLINE void SetLmCurrRing()
Definition kInline.h:299
poly max_exp
Definition kutil.h:75
char is_normalized
Definition kutil.h:87
KINLINE long pLDeg()
Definition kInline.h:442
KINLINE void LmDeleteAndIter()
Definition kInline.h:313
int pLength
Definition kutil.h:80
KINLINE long pFDeg() const
Definition kInline.h:422
int i_r
Definition kutil.h:81
poly p
Definition kutil.h:73
KINLINE BOOLEAN IsNull() const
Definition kInline.h:288
KINLINE void Set(ring r=currRing)
Definition kInline.h:106
KINLINE void Delete()
Definition kInline.h:199
poly t_p
Definition kutil.h:74
ring tailRing
Definition kutil.h:76
KINLINE int GetpLength()
Definition kInline.h:293
KINLINE void pNorm()
Definition kInline.h:560
KINLINE void Clear()
Definition kInline.h:213
long FDeg
Definition kutil.h:77
KINLINE poly Next()
Definition kInline.h:305
int shift
Definition kutil.h:84
KINLINE void pContent()
Definition kInline.h:538
KINLINE long pTotalDeg() const
Definition kInline.h:427
KINLINE long SetpFDeg()
Definition kInline.h:432
KINLINE void Copy()
Definition kInline.h:224
KINLINE poly kNoetherTail()
Definition kInline.h:66
poly t_kNoether
Definition kutil.h:330
int * S_2_R
Definition kutil.h:342
ring tailRing
Definition kutil.h:343
TSet T
Definition kutil.h:326
polyset S
Definition kutil.h:306
poly kNoether
Definition kutil.h:329
TObject ** R
Definition kutil.h:340
int tl
Definition kutil.h:350
KINLINE TObject * s_2_t(int i)
Definition kInline.h:47
KINLINE TObject * S_2_T(int i)
Definition kInline.h:38
char noClearS
Definition kutil.h:402
int sl
Definition kutil.h:348
unsigned long * sevS
Definition kutil.h:322
static FORCE_INLINE number n_Invers(number a, const coeffs r)
return the multiplicative inverse of 'a'; raise an error if 'a' is not invertible
Definition coeffs.h:561
static FORCE_INLINE number n_QuotRem(number a, number b, number *q, const coeffs r)
Definition coeffs.h:678
static FORCE_INLINE BOOLEAN n_GreaterZero(number n, const coeffs r)
ordered fields: TRUE iff 'n' is positive; in Z/pZ: TRUE iff 0 < m <= roundedBelow(p/2),...
Definition coeffs.h:491
static FORCE_INLINE number n_GetUnit(number n, const coeffs r)
in Z: 1 in Z/kZ (where k is not a prime): largest divisor of n (taken in Z) that is co-prime with k i...
Definition coeffs.h:529
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'
Definition coeffs.h:452
static FORCE_INLINE BOOLEAN n_DivBy(number a, number b, const coeffs r)
test whether 'a' is divisible 'b'; for r encoding a field: TRUE iff 'b' does not represent zero in Z:...
Definition coeffs.h:750
static FORCE_INLINE BOOLEAN n_IsOne(number n, const coeffs r)
TRUE iff 'n' represents the one element.
Definition coeffs.h:465
const CanonicalForm int s
Definition facAbsFact.cc:51
CFArray copy(const CFList &list)
write elements of list into an array
STATIC_VAR jList * T
Definition janet.cc:30
KINLINE poly k_LmShallowCopyDelete_tailRing_2_currRing(poly p, ring tailRing, omBin lmBin)
Definition kInline.h:983
KINLINE poly ksOldCreateSpoly(poly p1, poly p2, poly spNoether, ring r)
Definition kInline.h:1195
KINLINE poly redtailBba_Ring(poly p, int pos, kStrategy strat)
Definition kInline.h:1226
void ksOldSpolyTail(poly p1, poly q, poly q2, poly spNoether, ring r)
Definition kInline.h:1205
KINLINE poly k_LmShallowCopyDelete_currRing_2_tailRing(poly p, ring tailRing, omBin tailBin)
Definition kInline.h:976
KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing, omBin tailBin)
Definition kInline.h:958
KINLINE TSet initT()
Definition kInline.h:84
KINLINE void k_GetStrongLeadTerms(const poly p1, const poly p2, const ring leadRing, poly &m1, poly &m2, poly &lcm, const ring tailRing)
Definition kInline.h:1060
KINLINE int ksReducePolyTailLC_Z(LObject *PR, TObject *PW, LObject *Red)
Definition kInline.h:1108
KINLINE poly redtailBba(poly p, int pos, kStrategy strat, BOOLEAN normalize)
Definition kInline.h:1213
KINLINE poly ksOldSpolyRed(poly p1, poly p2, poly spNoether)
Definition kInline.h:1175
KINLINE poly k_LmInit_tailRing_2_currRing(poly t_p, ring tailRing, omBin lmBin)
Definition kInline.h:967
KINLINE TObject ** initR()
Definition kInline.h:95
KINLINE poly redtailBbaBound(poly p, int pos, kStrategy strat, int bound, BOOLEAN normalize)
Definition kInline.h:1219
KINLINE BOOLEAN arriRewDummy(poly, unsigned long, poly, kStrategy, int)
Definition kInline.h:1263
KINLINE int ksReducePolyTail(LObject *PR, TObject *PW, LObject *Red)
Definition kInline.h:1148
KINLINE poly ksOldSpolyRedNew(poly p1, poly p2, poly spNoether)
Definition kInline.h:1185
KINLINE void clearS(poly p, unsigned long p_sev, int *at, int *k, kStrategy strat)
Definition kInline.h:1238
KINLINE BOOLEAN k_GetLeadTerms(const poly p1, const poly p2, const ring p_r, poly &m1, poly &m2, const ring m_r)
Definition kInline.h:1017
KINLINE poly redtailBba_Z(poly p, int pos, kStrategy strat)
Definition kInline.h:1231
KINLINE int ksReducePolyTail_Z(LObject *PR, TObject *PW, LObject *Red)
Definition kInline.h:1126
KINLINE unsigned long * initsevT()
Definition kInline.h:100
void kBucketDeleteAndDestroy(kBucket_pt *bucket_pt)
Definition kbuckets.cc:223
void kBucketClear(kBucket_pt bucket, poly *p, int *length)
Definition kbuckets.cc:521
void kBucketShallowCopyDelete(kBucket_pt bucket, ring new_tailRing, omBin new_tailBin, pShallowCopyDeleteProc p_shallow_copy_delete)
For changing the ring of the Bpoly to new_tailBin.
Definition kbuckets.cc:535
void kBucket_Minus_m_Mult_p(kBucket_pt bucket, poly m, poly p, int *l, poly spNoether)
Bpoly == Bpoly - m*p; where m is a monom Does not destroy p and m assume (*l <= 0 || pLength(p) == *l...
Definition kbuckets.cc:722
void kBucket_Mult_n(kBucket_pt bucket, number n)
Multiply Bucket by number ,i.e. Bpoly == n*Bpoly.
Definition kbuckets.cc:598
void kBucketDestroy(kBucket_pt *bucket_pt)
Definition kbuckets.cc:216
void kBucketInit(kBucket_pt bucket, poly lm, int length)
Definition kbuckets.cc:493
poly kBucketExtractLm(kBucket_pt bucket)
Definition kbuckets.cc:511
kBucket_pt kBucketCreate(const ring bucket_ring)
Creation/Destruction of buckets.
Definition kbuckets.cc:209
void kBucketNormalize(kBucket_pt bucket)
apply n_Normalize to all coefficients
int kBucketCanonicalize(kBucket_pt bucket)
Canonicalizes Bpoly, i.e. converts polys of buckets into one poly in one bucket: Returns number of bu...
int ksReducePolyLC(LObject *PR, TObject *PW, poly spNoether, number *coef, kStrategy strat)
Definition kspoly.cc:481
void ksCreateSpoly(LObject *Pair, poly spNoether, int use_buckets, ring tailRing, poly m1, poly m2, TObject **R)
Definition kspoly.cc:1208
int ksReducePoly(LObject *PR, TObject *PW, poly spNoether, number *coef, poly *mon, kStrategy strat, BOOLEAN reduce)
Definition kspoly.cc:189
void deleteInS(int i, kStrategy strat)
Definition kutil.cc:1138
denominator_list_s * denominator_list
Definition kutil.h:63
int kFindInT(poly p, TSet T, int tlength)
returns index of p in TSet, or -1 if not found
Definition kutil.cc:717
TObject * TSet
Definition kutil.h:59
EXTERN_VAR denominator_list DENOMINATOR_LIST
Definition kutil.h:66
KINLINE poly k_LmInit_tailRing_2_currRing(poly p, ring tailRing, omBin bin)
Definition kInline.h:967
KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing, omBin bin)
Definition kInline.h:958
#define setmaxT
Definition kutil.h:33
#define KINLINE
Definition kutil.h:49
class sTObject TObject
Definition kutil.h:57
class sLObject LObject
Definition kutil.h:58
void mult(unsigned long *result, unsigned long *a, unsigned long *b, unsigned long p, int dega, int degb)
Definition minpoly.cc:647
int lcm(unsigned long *l, unsigned long *a, unsigned long *b, unsigned long p, int dega, int degb)
Definition minpoly.cc:709
#define assume(x)
Definition mod2.h:389
#define p_GetComp(p, r)
Definition monomials.h:64
#define pNext(p)
Definition monomials.h:36
#define pSetCoeff0(p, n)
Definition monomials.h:59
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
Definition monomials.h:44
The main handler for Singular numbers which are suitable for Singular polynomials.
Definition lq.h:40
#define nDelete(n)
Definition numbers.h:16
#define nInvers(a)
Definition numbers.h:33
#define nIsOne(n)
Definition numbers.h:25
#define nNormalize(n)
Definition numbers.h:30
#define omAlloc(size)
#define omAlloc0(size)
#define NULL
Definition omList.c:12
omBin_t * omBin
Definition omStructs.h:12
#define TEST_OPT_CONTENTSB
Definition options.h:127
p_Length
poly p_GetMaxExpP(poly p, const ring r)
return monomial r such that GetExp(r,i) is maximum of all monomials in p; coeff == 0,...
Definition p_polys.cc:1138
void p_Cleardenom_n(poly ph, const ring r, number &c)
Definition p_polys.cc:2954
void p_SimpleContent(poly ph, int smax, const ring r)
Definition p_polys.cc:2564
void p_Norm(poly p1, const ring r)
Definition p_polys.cc:3719
unsigned long p_GetShortExpVector(const poly p, const ring r)
Definition p_polys.cc:4780
void p_ProjectiveUnique(poly ph, const ring r)
Definition p_polys.cc:3143
poly p_Last(const poly p, int &l, const ring r)
Definition p_polys.cc:4621
static poly p_Neg(poly p, const ring r)
Definition p_polys.h:1107
static long p_GetExpDiff(poly p1, poly p2, int i, ring r)
Definition p_polys.h:635
BOOLEAN p_LmCheckPolyRing(poly p, ring r)
Definition pDebug.cc:123
static poly p_LmInit(poly p, const ring r)
Definition p_polys.h:1335
static long p_FDeg(const poly p, const ring r)
Definition p_polys.h:380
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
Definition p_polys.h:488
static long p_MinComp(poly p, ring lmRing, ring tailRing)
Definition p_polys.h:313
static void p_Setm(poly p, const ring r)
Definition p_polys.h:233
static poly p_LmShallowCopyDelete(poly p, const ring r)
Definition p_polys.h:1393
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:469
static poly p_Mult_nn(poly p, number n, const ring r)
Definition p_polys.h:958
static void p_Delete(poly *p, const ring r)
Definition p_polys.h:901
static void p_LmFree(poly p, ring)
Definition p_polys.h:683
static poly p_Minus_mm_Mult_qq(poly p, const poly m, const poly q, int &lp, int lq, const poly spNoether, const ring r)
Definition p_polys.h:1070
static poly p_Init(const ring r, omBin bin)
Definition p_polys.h:1320
static poly p_LmDeleteAndNext(poly p, const ring r)
Definition p_polys.h:755
static poly p_Copy(poly p, const ring r)
returns a copy of p
Definition p_polys.h:846
static long p_Totaldegree(poly p, const ring r)
Definition p_polys.h:1507
#define p_Test(p, r)
Definition p_polys.h:161
#define __p_Mult_nn(p, n, r)
Definition p_polys.h:971
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
Definition polys.cc:13
Compatibility layer for legacy polynomial operations (over currRing)
#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
#define pGetShortExpVector(a)
returns the "Short Exponent Vector" – used to speed up divisibility tests (see polys-impl....
Definition polys.h:152
#define pNormalize(p)
Definition polys.h:317
static BOOLEAN rIsSyzIndexRing(const ring r)
Definition ring.h:720
poly(* pShallowCopyDeleteProc)(poly s_p, ring source_r, ring dest_r, omBin dest_bin)
returns a poly from dest_r which is a ShallowCopy of s_p from source_r assumes that source_r->N == de...
Definition ring.h:44
#define rField_is_Ring(R)
Definition ring.h:485
int p_mFirstVblock(poly p, const ring ri)
Definition shiftop.cc:478
static poly normalize(poly next_p, ideal add_generators, syStrategy syzstr, int *g_l, int *p_l, int crit_comp)
Definition syz3.cc:1027