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}
120KINLINE void sTObject::Set(poly p_in, ring r)
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 }
142 pLength=::pLength(p_in);
143}
144
145KINLINE sTObject::sTObject(poly p_in, ring r)
146{
147 Init(r);
148 Set(p_in, r);
149}
150
151KINLINE void sTObject::Set(poly p_in, ring c_r, ring t_r)
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 {
165 p_Test(p_in, currRing);
166 }
167 p = p_in;
168 pLength=::pLength(p_in);
169 }
170 else
171 {
172 Set(p_in, c_r);
173 }
174}
175
176KINLINE sTObject::sTObject(poly p_in, ring c_r, ring t_r)
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
381sTObject::ShallowCopyDelete(ring new_tailRing, omBin new_tailBin,
382 pShallowCopyDeleteProc p_shallow_copy_delete,
383 BOOLEAN set_max)
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),
403 tailRing, new_tailRing, new_tailBin);
404 }
405 if (new_tailRing != currRing)
406 {
407 t_p = k_LmInit_currRing_2_tailRing(p, new_tailRing);
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 {
417 max_exp = p_GetMaxExpP(pNext(t_p), new_tailRing);
418 }
419 tailRing = new_tailRing;
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);
478 denom->next=DENOMINATOR_LIST;
479 DENOMINATOR_LIST=denom;
480 }
481 nDelete(&n);
482 }
483 else if (is_ring)
484 {
485 number c;
486 if (t_p != NULL)
487 c=pGetCoeff(t_p);
488 else
489 c=pGetCoeff(p);
490 const coeffs C=tailRing->cf;
491 number u=n_GetUnit(c,C);
492
493 if (t_p != NULL)
494 {
495 if (!n_IsOne(u,C))
496 {
497 number uInv = n_Invers(u, C);
499 n_Delete(&uInv,C);
500 }
502 {
504 }
506 }
507 else
508 {
509 if (!n_IsOne(u,C))
510 {
511 number uInv = n_Invers(u, C);
512 p=p_Mult_nn(p,uInv,tailRing);
513 n_Delete(&uInv,C);
514 }
516 {
517 p = p_Neg(p,tailRing);
518 }
519 }
520 n_Delete(&u,C);
521 }
522 else
523 {
524 if (t_p != NULL)
525 {
528 }
529 else
530 {
532 }
533 }
534}
535
537{
538 assume(p != NULL);
539 if (t_p != NULL)
540 {
543 {
545 }
547 }
548 else
549 {
552 {
553 p=p_Neg (p,currRing);
554 }
555 }
556}
557
558KINLINE void sTObject::pNorm() // pNorm seems to be a _bad_ method name...
559{
560 assume(p != NULL);
561 if (! is_normalized)
562 {
563 p_Norm(p, currRing);
564 if (t_p != NULL)
567 }
568}
569
570
571
572/***************************************************************
573 *
574 * Operation on LObjects
575 *
576 ***************************************************************/
577// Initialization
579{
581 sev = 0;
582}
583
584
591
593{
594 memset(this, 0, sizeof(sLObject));
595 i_r1 = -1;
596 i_r2 = -1;
597 i_r = -1;
598 Set(r);
599}
601{
602 Init(r);
603}
604KINLINE sLObject::sLObject(poly p_in, ring r)
605{
606 Init(r);
607 Set(p_in, r);
608}
609
610KINLINE sLObject::sLObject(poly p_in, ring c_r, ring t_r)
611{
612 Init(t_r);
613 Set(p_in, c_r, t_r);
614}
615
617{
618 if (bucket == NULL)
619 {
620 unsigned l = GetpLength();
621 if (use_bucket && (l > 1))
622 {
623 poly tp = GetLmTailRing();
624 assume((int)l == ::pLength(tp));
626 kBucketInit(bucket, pNext(tp), l-1);
627 pNext(tp) = NULL;
628 if (p != NULL) pNext(p) = NULL;
629 pLength = 0;
630 }
631 }
632}
633
634KINLINE void sLObject::SetLmTail(poly lm, poly p_tail, int p_Length, int use_bucket, ring _tailRing)
635{
636
637 Set(lm, _tailRing);
638 if (use_bucket)
639 {
640 bucket = kBucketCreate(_tailRing);
641 kBucketInit(bucket, p_tail, p_Length);
642 pNext(lm) = NULL;
643 pLength = 0;
644 }
645 else
646 {
647 pNext(lm) = p_tail;
648 pLength = p_Length + 1;
649 }
650}
651
653{
654 if (bucket != NULL)
655 {
657 }
658 else
659 {
660 poly _p = (t_p != NULL ? t_p : p);
661 assume(_p != NULL);
662 pNext(_p) = __p_Mult_nn(pNext(_p), n, tailRing);
663 }
664}
665
667 poly spNoether)
668{
669 if (bucket != NULL)
670 {
671 kBucket_Minus_m_Mult_p(bucket, m, q, &lq, spNoether);
672 }
673 else
674 {
675 if (lq<=0) lq= ::pLength(q);
676 poly _p = (t_p != NULL ? t_p : p);
677 assume(_p != NULL);
678
679 int lp=pLength-1;
680 pNext(_p) = p_Minus_mm_Mult_qq( pNext(_p), m, q, lp, lq,
681 spNoether, tailRing );
682 pLength=lp+1;
683// tailRing->p_Procs->p_Minus_mm_Mult_qq(pNext(_p), m, q, shorter,spNoether, tailRing, last);
684// pLength += lq - shorter;
685 }
686}
687
689{
691 if (bucket != NULL)
692 {
693 poly _p = kBucketExtractLm(bucket);
694 if (_p == NULL)
695 {
697 p = t_p = NULL;
698 return;
699 }
700 Set(_p, tailRing);
701 }
702 else
703 {
704 pLength--;
705 }
706}
707
709{
710 poly ret = GetLmTailRing();
711 poly pn;
712
713 assume(p != NULL || t_p != NULL);
714
715 if (bucket != NULL)
716 {
718 if (pn == NULL)
720 }
721 else
722 {
723 pn = pNext(ret);
724 }
725 pLength--;
726 pNext(ret) = NULL;
727 if (p != NULL && t_p != NULL)
729
730 Set(pn, tailRing);
731 return ret;
732}
733
735{
736 //kTest_L(this);
737 poly tp = GetLmTailRing();
738 assume(tp != NULL);
739
740 if (bucket != NULL)
741 {
744 pLength++;
745 }
746 return tp;
747}
748
749
751{
752 //kTest_L(this);
753 if (p == NULL)
754 {
756 ((lmBin!=NULL)?lmBin:currRing->PolyBin));
757 FDeg = pFDeg();
758 }
759 else if ((lmBin != NULL) && (lmBin != currRing->PolyBin))
760 {
762 FDeg = pFDeg();
763 }
764
765 if (bucket != NULL)
766 {
769 pLength++;
770 if (t_p != NULL) pNext(t_p) = pNext(p);
771 }
772 //kTest_L(this);
773 return p;
774}
775
776KINLINE void
778 pShallowCopyDeleteProc p_shallow_copy_delete)
779{
780 if (bucket != NULL)
781 kBucketShallowCopyDelete(bucket, new_tailRing, new_tailRing->PolyBin,
782 p_shallow_copy_delete);
783 sTObject::ShallowCopyDelete(new_tailRing,
784 new_tailRing->PolyBin,p_shallow_copy_delete,
785 FALSE);
786}
787
789{
790 if (t_p != NULL)
791 {
793 }
794 else
795 {
797 }
798}
799
801{
802 if (bucket != NULL)
803 {
805 kBucket_pt new_bucket = kBucketCreate(tailRing);
806 kBucketInit(new_bucket,
807 p_Copy(bucket->buckets[i], tailRing),
808 bucket->buckets_length[i]);
809 bucket = new_bucket;
810 if (t_p != NULL) pNext(t_p) = NULL;
811 if (p != NULL) pNext(p) = NULL;
812 }
813 TObject::Copy();
814}
815
817{
818 poly tp = GetLmTailRing();
819 assume(tp != NULL);
820 if (bucket != NULL)
821 {
823 pNext(tp) = bucket->buckets[i];
824 long ldeg = tailRing->pLDeg(tp, &length, tailRing);
825 pNext(tp) = NULL;
826 return ldeg;
827 }
828 else
829 return tailRing->pLDeg(tp, &length, tailRing);
830}
832{
833 if (! deg_last || bucket != NULL) return sLObject::pLDeg();
834
835 long ldeg;
836 ldeg = tailRing->pLDeg(GetLmTailRing(), &length, tailRing);
837#ifndef SING_NDEBUG
838 if ( pLength == 0)
841#else
843#endif
844 return ldeg;
845}
846
848{
849 FDeg = this->pFDeg();
850 long d = this->pLDeg();
851 ecart = d - FDeg;
852 return d;
853}
855{
856 FDeg = this->pFDeg();
857 long d = this->pLDeg(use_last);
858 ecart = d - FDeg;
859 return d;
860}
862{
863 if (bucket == NULL)
864 return sTObject::GetpLength();
866 return bucket->buckets_length[i] + 1;
867}
869{
870 if (length_pLength)
871 {
872 length = this->GetpLength();
873 }
874 else
875 this->pLDeg();
876 return length;
877}
879{
880 poly tp = GetLmTailRing();
881 assume(tp != NULL);
882 if (bucket != NULL)
883 {
885 pNext(tp) = bucket->buckets[i];
886 long m = p_MinComp(tp, tailRing);
887 pNext(tp) = NULL;
888 return m;
889 }
890 else
891 return p_MinComp(tp, tailRing);
892}
894{
895 poly pp;
896 ring r;
897 GetLm(pp, r);
898 assume(pp != NULL);
899 return p_GetComp(pp, r);
900}
901
903{
904 memcpy(this, &t, sizeof(sTObject));
905 return *this;
906}
907
909{
910 if (p1 == NULL) return NULL;
911 if (i_r1 == -1) i_r1 = kFindInT(p1, s->T, s->tl);
912 assume(i_r1 >= 0 && i_r1 <= s->tl);
913 TObject* T = s->R[i_r1];
914 assume(T->p == p1);
915 return T;
916}
917
919{
920 if (p1 == NULL) return NULL;
921 assume(p2 != NULL);
922 if (i_r2 == -1) i_r2 = kFindInT(p2, strat->T, strat->tl);
923 assume(i_r2 >= 0 && i_r2 <= strat->tl);
924 TObject* T = strat->R[i_r2];
925 assume(T->p == p2);
926 return T;
927}
928
930 TObject* &T_1, TObject* &T_2)
931{
932 if (p1 == NULL)
933 {
934 T_1 = NULL;
935 T_2 = NULL;
936 return;
937 }
938 assume(p1 != NULL && p2 != NULL);
939 if (i_r1 == -1) i_r1 = kFindInT(p1, strat->T, strat->tl);
940 if (i_r2 == -1) i_r2 = kFindInT(p2, strat->T, strat->tl);
941 assume(i_r1 >= 0 && i_r1 <= strat->tl);
942 assume(i_r2 >= 0 && i_r2 <= strat->tl);
943 T_1 = strat->R[i_r1];
944 T_2 = strat->R[i_r2];
945 assume(T_1->p == p1);
946 assume(T_2->p == p2);
947 return;
948}
949
950/***************************************************************
951 *
952 * Conversion of polys
953 *
954 ***************************************************************/
955
956KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing, omBin tailBin)
957{
958
959 poly t_p = p_LmInit(p, currRing, tailRing, tailBin);
960 pNext(t_p) = pNext(p);
961 pSetCoeff0(t_p, pGetCoeff(p));
962 return t_p;
963}
964
965KINLINE poly k_LmInit_tailRing_2_currRing(poly t_p, ring tailRing, omBin lmBin)
966{
967 poly p = p_LmInit(t_p, tailRing, currRing, lmBin);
968 pNext(p) = pNext(t_p);
969 pSetCoeff0(p, pGetCoeff(t_p));
970 return p;
971}
972
973// this should be made more efficient
975{
976 poly np = k_LmInit_currRing_2_tailRing(p, tailRing, tailBin);
978 return np;
979}
980
982{
983 poly np = k_LmInit_tailRing_2_currRing(p, tailRing, lmBin);
984 p_LmFree(p, tailRing);
985 return np;
986}
987
988KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing)
989{
990 return k_LmInit_currRing_2_tailRing(p, tailRing, tailRing->PolyBin);
991}
992
993KINLINE poly k_LmInit_tailRing_2_currRing(poly p, ring tailRing)
994{
995 return k_LmInit_tailRing_2_currRing(p, tailRing, currRing->PolyBin);
996}
997
999{
1000 return k_LmShallowCopyDelete_currRing_2_tailRing(p, tailRing, tailRing->PolyBin);
1001}
1002
1004{
1005 return k_LmShallowCopyDelete_tailRing_2_currRing(p, tailRing, currRing->PolyBin);
1006}
1007
1008/***************************************************************
1009 *
1010 * Lcm business
1011 *
1012 ***************************************************************/
1013// get m1 = LCM(LM(p1), LM(p2))/LM(p1)
1014// m2 = LCM(LM(p1), LM(p2))/LM(p2)
1015KINLINE BOOLEAN k_GetLeadTerms(const poly p1, const poly p2, const ring p_r,
1016 poly &m1, poly &m2, const ring m_r)
1017{
1018 p_LmCheckPolyRing(p1, p_r);
1019 p_LmCheckPolyRing(p2, p_r);
1020
1021 int i;
1022 long x;
1023 m1 = p_Init(m_r,m_r->PolyBin);
1024 m2 = p_Init(m_r,m_r->PolyBin);
1025
1026 for (i = p_r->N; i; i--)
1027 {
1028 x = p_GetExpDiff(p1, p2, i, p_r);
1029 if (x > 0)
1030 {
1031 if (x > (long) m_r->bitmask) goto false_return;
1032 p_SetExp(m2,i,x, m_r);
1033 p_SetExp(m1,i,0, m_r);
1034 }
1035 else
1036 {
1037 if (-x > (long) m_r->bitmask) goto false_return;
1038 p_SetExp(m1,i,-x, m_r);
1039 p_SetExp(m2,i,0, m_r);
1040 }
1041 }
1042
1043 p_Setm(m1, m_r);
1044 p_Setm(m2, m_r);
1045 return TRUE;
1046
1047 false_return:
1048 p_LmFree(m1, m_r);
1049 p_LmFree(m2, m_r);
1050 m1 = m2 = NULL;
1051 return FALSE;
1052}
1053
1054// get m1 = LCM(LM(p1), LM(p2))/LM(p1)
1055// m2 = LCM(LM(p1), LM(p2))/LM(p2) in tailRing
1056// lcm = LCM(LM(p1), LM(p2)) in leadRing
1057KINLINE void k_GetStrongLeadTerms(const poly p1, const poly p2, const ring leadRing,
1058 poly &m1, poly &m2, poly &lcm, const ring tailRing)
1059{
1060 p_LmCheckPolyRing(p1, leadRing);
1061 p_LmCheckPolyRing(p2, leadRing);
1062
1063 int i;
1064 int x;
1065 int e1;
1066 int e2;
1067 int s;
1068 m1 = p_Init(tailRing,tailRing->PolyBin);
1069 m2 = p_Init(tailRing,tailRing->PolyBin);
1070 lcm = p_Init(leadRing,leadRing->PolyBin);
1071
1072 for (i = leadRing->N; i>=0; i--)
1073 {
1074 e1 = p_GetExp(p1,i,leadRing);
1075 e2 = p_GetExp(p2,i,leadRing);
1076 x = e1 - e2;
1077 if (x > 0)
1078 {
1079 p_SetExp(m2,i,x, tailRing);
1080 //p_SetExp(m1,i,0, tailRing); // done by p_Init
1081 s = e1;
1082 }
1083 else if (x<0)
1084 {
1085 p_SetExp(m1,i,-x, tailRing);
1086 //p_SetExp(m2,i,0, tailRing); // done by p_Init
1087 s = e2;
1088 }
1089 else
1090 s = e1; // e1==e2
1091 p_SetExp(lcm,i,s, leadRing);
1092 }
1093
1094 p_Setm(m1, tailRing);
1095 p_Setm(m2, tailRing);
1096 p_Setm(lcm, leadRing);
1097}
1098
1099/***************************************************************
1100 *
1101 * Misc things
1102 *
1103 ***************************************************************/
1105{
1106 BOOLEAN ret;
1107 number mult, rest;
1108 TObject red = *PW;
1109 red.Copy();
1110 rest = n_QuotRem(pGetCoeff(Red->p), pGetCoeff(red.p),
1111 &mult, currRing->cf);
1112 red.Mult_nn(rest);
1113
1114 assume(PR->GetLmCurrRing() != red.GetLmCurrRing());
1115 ret = ksReducePolyLC(Red, &red, NULL, &mult);
1116 red.Delete();
1117 red.Clear();
1118
1119 return ret;
1120}
1121
1123{
1124 BOOLEAN ret;
1125 number coef=NULL;
1126
1127 assume(PR->GetLmCurrRing() != PW->GetLmCurrRing());
1128 ret = ksReducePoly(Red, PW, NULL, &coef, NULL,NULL,TRUE);
1129
1130#if 0 // shlould not happen
1131 if (!ret)
1132 {
1133 if (! n_IsOne(coef, currRing->cf))
1134 {
1135 PR->Mult_nn(coef);
1136 // HANNES: mark for Normalize
1137 }
1138 }
1139#endif
1140 n_Delete(&coef, currRing->cf);
1141 return ret;
1142}
1143
1145{
1146 BOOLEAN ret;
1147 number coef;
1148
1149 assume(PR->GetLmCurrRing() != PW->GetLmCurrRing());
1150 Red->HeadNormalize();
1151 ret = ksReducePoly(Red, PW, NULL, &coef);
1152
1153 if (!ret)
1154 {
1155 if (! n_IsOne(coef, currRing->cf))
1156 {
1157 PR->Mult_nn(coef);
1158 // HANNES: mark for Normalize
1159 }
1160 n_Delete(&coef, currRing->cf);
1161 }
1162 return ret;
1163}
1164
1165/***************************************************************
1166 *
1167 * Routines for backwards-Compatibility
1168 *
1169 *
1170 ***************************************************************/
1171KINLINE poly ksOldSpolyRed(poly p1, poly p2, poly spNoether)
1172{
1173 LObject L(p2);
1174 TObject T(p1);
1175
1176 ksReducePoly(&L, &T, spNoether);
1177
1178 return L.GetLmCurrRing();
1179}
1180
1181KINLINE poly ksOldSpolyRedNew(poly p1, poly p2, poly spNoether)
1182{
1183 LObject L(p_Copy(p2, currRing));
1184 TObject T(p1);
1185
1186 ksReducePoly(&L, &T, spNoether);
1187
1188 return L.GetLmCurrRing();
1189}
1190
1191KINLINE poly ksOldCreateSpoly(poly p1, poly p2, poly spNoether, ring r)
1192{
1193 LObject L(r);
1194 L.p1 = p1;
1195 L.p2 = p2;
1196
1197 ksCreateSpoly(&L, spNoether);
1198 return L.GetLmCurrRing();
1199}
1200
1201void ksOldSpolyTail(poly p1, poly q, poly q2, poly spNoether, ring r)
1202{
1203 LObject L(q, currRing, r);
1204 TObject T(p1, currRing, r);
1205
1206 ksReducePolyTail(&L, &T, q2, spNoether);
1207}
1208
1210{
1211 LObject L(p);
1212 return redtailBba(&L, pos, strat,FALSE, normalize);
1213}
1214
1216{
1217 LObject L(p, currRing, strat->tailRing); // ? L(p); ??
1218 return redtailBbaBound(&L, pos, strat,bound, FALSE, normalize);
1219}
1220
1221KINLINE poly redtailBba_Ring (poly p,int pos,kStrategy strat)
1222{
1223 LObject L(p, currRing, strat->tailRing);
1224 return redtailBba_Ring(&L, pos, strat);
1225}
1226KINLINE poly redtailBba_Z (poly p,int pos,kStrategy strat)
1227{
1228 LObject L(p, currRing, strat->tailRing);
1229 return redtailBba_Z(&L, pos, strat);
1230}
1231
1232KINLINE void clearS (poly p, unsigned long p_sev, int* at, int* k,
1233 kStrategy strat)
1234{
1235 assume(p_sev == pGetShortExpVector(p));
1236 if (strat->noClearS) return;
1238 {
1239 if (!pLmShortDivisibleBy(p,p_sev, strat->S[*at], ~ strat->sevS[*at]))
1240 return;
1241 if(!n_DivBy(pGetCoeff(strat->S[*at]), pGetCoeff(p), currRing->cf))
1242 return;
1243 }
1244 else
1245 {
1246 if (!pLmShortDivisibleBy(p,p_sev, strat->S[*at], ~ strat->sevS[*at])) return;
1247 }
1248 deleteInS((*at),strat);
1249 (*at)--;
1250 (*k)--;
1251}
1252
1253// dummy function for function pointer strat->rewCrit being usable in all
1254// possible choices for criteria
1255KINLINE BOOLEAN arriRewDummy(poly /*sig*/, unsigned long /*not_sevSig*/, poly /*lm*/, kStrategy /*strat*/, int /*start=0*/)
1256{
1257 return FALSE;
1258}
1259
1260#endif // defined(KINLINE) || defined(KUTIL_CC)
1261#endif // KINLINE_H
static int si_max(const int a, const int b)
Definition auxiliary.h:125
int BOOLEAN
Definition auxiliary.h:88
#define TRUE
Definition auxiliary.h:101
#define FALSE
Definition auxiliary.h:97
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:4090
int p
Definition cfModGcd.cc:4086
static CanonicalForm bound(const CFMatrix &M)
Definition cf_linsys.cc:460
KINLINE long SetDegStuffReturnLDeg()
Definition kInline.h:847
KINLINE void Tail_Mult_nn(number n)
Definition kInline.h:652
int i_r1
Definition kutil.h:194
KINLINE void Copy()
Definition kInline.h:800
KINLINE void Delete()
Definition kInline.h:585
KINLINE void LmDeleteAndIter()
Definition kInline.h:688
KINLINE TObject * T_2(const skStrategy *strat)
Definition kInline.h:918
KINLINE void PrepareRed(BOOLEAN use_bucket)
Definition kInline.h:616
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:634
KINLINE void T_1_2(const skStrategy *strat, TObject *&T_1, TObject *&T_2)
Definition kInline.h:929
KINLINE void Normalize()
Definition kInline.h:347
unsigned long sev
Definition kutil.h:188
KINLINE void Init(ring tailRing=currRing)
Definition kInline.h:592
KINLINE long MinComp()
Definition kInline.h:878
kBucket_pt bucket
Definition kutil.h:193
poly p2
Definition kutil.h:189
KINLINE TObject * T_1(const skStrategy *strat)
Definition kInline.h:908
KINLINE int GetpLength()
Definition kInline.h:861
KINLINE int SetLength(BOOLEAN lengt_pLength=FALSE)
Definition kInline.h:868
KINLINE void Clear()
Definition kInline.h:578
KINLINE void Tail_Minus_mm_Mult_qq(poly m, poly qq, int lq, poly spNoether)
Definition kInline.h:666
KINLINE void ShallowCopyDelete(ring new_tailRing, pShallowCopyDeleteProc p_shallow_copy_delete)
Definition kInline.h:777
KINLINE poly GetTP()
Definition kInline.h:734
KINLINE long pLDeg()
Definition kInline.h:816
KINLINE sLObject & operator=(const sTObject &)
Definition kInline.h:902
KINLINE void SetShortExpVector()
Definition kInline.h:788
KINLINE void HeadNormalize()
Definition kInline.h:367
KINLINE poly GetP(omBin lmBin=(omBin) NULL)
Definition kInline.h:750
KINLINE sLObject(ring tailRing=currRing)
Definition kInline.h:600
poly p1
Definition kutil.h:189
KINLINE long Comp()
Definition kInline.h:893
KINLINE poly LmExtractAndIter()
Definition kInline.h:708
int i_r2
Definition kutil.h:194
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:80
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:79
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:76
char is_normalized
Definition kutil.h:88
KINLINE long pLDeg()
Definition kInline.h:442
KINLINE void LmDeleteAndIter()
Definition kInline.h:313
int pLength
Definition kutil.h:81
KINLINE long pFDeg() const
Definition kInline.h:422
int i_r
Definition kutil.h:82
poly p
Definition kutil.h:74
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:75
ring tailRing
Definition kutil.h:77
KINLINE int GetpLength()
Definition kInline.h:293
KINLINE void pNorm()
Definition kInline.h:558
KINLINE void Clear()
Definition kInline.h:213
long FDeg
Definition kutil.h:78
KINLINE poly Next()
Definition kInline.h:305
int shift
Definition kutil.h:85
KINLINE void pContent()
Definition kInline.h:536
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:331
int * S_2_R
Definition kutil.h:343
ring tailRing
Definition kutil.h:344
TSet T
Definition kutil.h:327
polyset S
Definition kutil.h:307
poly kNoether
Definition kutil.h:330
TObject ** R
Definition kutil.h:341
int tl
Definition kutil.h:351
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:401
int sl
Definition kutil.h:349
unsigned long * sevS
Definition kutil.h:323
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:565
static FORCE_INLINE number n_QuotRem(number a, number b, number *q, const coeffs r)
Definition coeffs.h:682
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:498
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:535
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'
Definition coeffs.h:459
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:748
static FORCE_INLINE BOOLEAN n_IsOne(number n, const coeffs r)
TRUE iff 'n' represents the one element.
Definition coeffs.h:472
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:981
KINLINE poly ksOldCreateSpoly(poly p1, poly p2, poly spNoether, ring r)
Definition kInline.h:1191
KINLINE poly redtailBba_Ring(poly p, int pos, kStrategy strat)
Definition kInline.h:1221
void ksOldSpolyTail(poly p1, poly q, poly q2, poly spNoether, ring r)
Definition kInline.h:1201
KINLINE poly k_LmShallowCopyDelete_currRing_2_tailRing(poly p, ring tailRing, omBin tailBin)
Definition kInline.h:974
KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing, omBin tailBin)
Definition kInline.h:956
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:1057
KINLINE int ksReducePolyTailLC_Z(LObject *PR, TObject *PW, LObject *Red)
Definition kInline.h:1104
KINLINE poly redtailBba(poly p, int pos, kStrategy strat, BOOLEAN normalize)
Definition kInline.h:1209
KINLINE poly ksOldSpolyRed(poly p1, poly p2, poly spNoether)
Definition kInline.h:1171
KINLINE poly k_LmInit_tailRing_2_currRing(poly t_p, ring tailRing, omBin lmBin)
Definition kInline.h:965
KINLINE TObject ** initR()
Definition kInline.h:95
KINLINE poly redtailBbaBound(poly p, int pos, kStrategy strat, int bound, BOOLEAN normalize)
Definition kInline.h:1215
KINLINE BOOLEAN arriRewDummy(poly, unsigned long, poly, kStrategy, int)
Definition kInline.h:1255
KINLINE int ksReducePolyTail(LObject *PR, TObject *PW, LObject *Red)
Definition kInline.h:1144
KINLINE poly ksOldSpolyRedNew(poly p1, poly p2, poly spNoether)
Definition kInline.h:1181
KINLINE void clearS(poly p, unsigned long p_sev, int *at, int *k, kStrategy strat)
Definition kInline.h:1232
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:1015
KINLINE poly redtailBba_Z(poly p, int pos, kStrategy strat)
Definition kInline.h:1226
KINLINE int ksReducePolyTail_Z(LObject *PR, TObject *PW, LObject *Red)
Definition kInline.h:1122
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:477
void ksCreateSpoly(LObject *Pair, poly spNoether, int use_buckets, ring tailRing, poly m1, poly m2, TObject **R)
Definition kspoly.cc:1203
int ksReducePoly(LObject *PR, TObject *PW, poly spNoether, number *coef, poly *mon, kStrategy strat, BOOLEAN reduce)
Definition kspoly.cc:187
void deleteInS(int i, kStrategy strat)
Definition kutil.cc:1139
denominator_list_s * denominator_list
Definition kutil.h:64
int kFindInT(poly p, TSet T, int tlength)
returns index of p in TSet, or -1 if not found
Definition kutil.cc:710
TObject * TSet
Definition kutil.h:60
EXTERN_VAR denominator_list DENOMINATOR_LIST
Definition kutil.h:67
KINLINE poly k_LmInit_tailRing_2_currRing(poly p, ring tailRing, omBin bin)
Definition kInline.h:965
denominator_list next
Definition kutil.h:66
KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing, omBin bin)
Definition kInline.h:956
#define setmaxT
Definition kutil.h:34
#define KINLINE
Definition kutil.h:50
class sTObject TObject
Definition kutil.h:58
class sLObject LObject
Definition kutil.h:59
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:129
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:1139
void p_Cleardenom_n(poly ph, const ring r, number &c)
Definition p_polys.cc:2958
void p_SimpleContent(poly ph, int smax, const ring r)
Definition p_polys.cc:2568
void p_Norm(poly p1, const ring r)
Definition p_polys.cc:3799
unsigned long p_GetShortExpVector(const poly p, const ring r)
Definition p_polys.cc:4889
void p_ProjectiveUnique(poly ph, const ring r)
Definition p_polys.cc:3147
poly p_Last(const poly p, int &l, const ring r)
Definition p_polys.cc:4730
static poly p_Neg(poly p, const ring r)
Definition p_polys.h:1109
static long p_GetExpDiff(poly p1, poly p2, int i, ring r)
Definition p_polys.h:637
BOOLEAN p_LmCheckPolyRing(poly p, ring r)
Definition pDebug.cc:123
static poly p_LmInit(poly p, const ring r)
Definition p_polys.h:1351
static long p_FDeg(const poly p, const ring r)
Definition p_polys.h:382
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:490
static long p_MinComp(poly p, ring lmRing, ring tailRing)
Definition p_polys.h:315
static void p_Setm(poly p, const ring r)
Definition p_polys.h:235
static poly p_LmShallowCopyDelete(poly p, const ring r)
Definition p_polys.h:1409
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:471
static poly p_Mult_nn(poly p, number n, const ring r)
Definition p_polys.h:960
static void p_Delete(poly *p, const ring r)
Definition p_polys.h:903
static void p_LmFree(poly p, ring)
Definition p_polys.h:685
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:1072
static poly p_Init(const ring r, omBin bin)
Definition p_polys.h:1336
static poly p_LmDeleteAndNext(poly p, const ring r)
Definition p_polys.h:757
static poly p_Copy(poly p, const ring r)
returns a copy of p
Definition p_polys.h:848
static long p_Totaldegree(poly p, const ring r)
Definition p_polys.h:1523
#define p_Test(p, r)
Definition p_polys.h:161
#define __p_Mult_nn(p, n, r)
Definition p_polys.h:973
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:147
#define pGetShortExpVector(a)
returns the "Short Exponent Vector" – used to speed up divisibility tests (see polys-impl....
Definition polys.h:153
#define pNormalize(p)
Definition polys.h:318
kBucket * kBucket_pt
Definition ring.h:26
static BOOLEAN rIsSyzIndexRing(const ring r)
Definition ring.h:726
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:45
#define rField_is_Ring(R)
Definition ring.h:491
int p_mFirstVblock(poly p, const ring ri)
Definition shiftop.cc:478
skStrategy * kStrategy
Definition structs.h:54
static poly normalize(poly next_p, ideal add_generators, syStrategy syzstr, int *g_l, int *p_l, int crit_comp)
Definition syz3.cc:1027