Go to the source code of this file.
|
scfmon | hInit (ideal S, ideal Q, int *Nexist) |
|
void | hDelete (scfmon ev, int ev_length) |
|
void | hComp (scfmon exist, int Nexist, int ak, scfmon stc, int *Nstc) |
|
void | hSupp (scfmon stc, int Nstc, varset var, int *Nvar) |
|
void | hOrdSupp (scfmon stc, int Nstc, varset var, int Nvar) |
|
static void | hShrink (scfmon co, int a, int Nco) |
|
void | hStaircase (scfmon stc, int *Nstc, varset var, int Nvar) |
|
void | hRadical (scfmon rad, int *Nrad, int Nvar) |
|
void | hLexS (scfmon stc, int Nstc, varset var, int Nvar) |
|
void | hLexR (scfmon rad, int Nrad, varset var, int Nvar) |
|
void | hPure (scfmon stc, int a, int *Nstc, varset var, int Nvar, scmon pure, int *Npure) |
|
void | hElimS (scfmon stc, int *e1, int a2, int e2, varset var, int Nvar) |
|
void | hElimR (scfmon rad, int *e1, int a2, int e2, varset var, int Nvar) |
|
void | hLex2S (scfmon rad, int e1, int a2, int e2, varset var, int Nvar, scfmon w) |
|
void | hLex2R (scfmon rad, int e1, int a2, int e2, varset var, int Nvar, scfmon w) |
|
void | hStepS (scfmon stc, int Nstc, varset var, int Nvar, int *a, int *x) |
|
void | hStepR (scfmon rad, int Nrad, varset var, int Nvar, int *a) |
|
monf | hCreate (int Nvar) |
|
void | hKill (monf xmem, int Nvar) |
|
scfmon | hGetmem (int lm, scfmon old, monp monmem) |
|
scmon | hGetpure (scmon p) |
|
◆ hComp()
Definition at line 154 of file hutil.cc.
155{
159
161 {
162 if (((**
ex) == 0) || ((**
ex) == ak))
163 {
167 }
169 }
171}
◆ hCreate()
◆ hDelete()
Definition at line 140 of file hutil.cc.
141{
143
145 {
150 }
151}
STATIC_VAR scfmon hsecure
#define omFreeSize(addr, size)
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
◆ hElimR()
Definition at line 742 of file hutil.cc.
743{
744 int nc = *
e1, z = 0,
i,
j,
k,
k1;
746 if (!nc || (a2 ==
e2))
747 return;
754 {
757 {
762 else
763 {
766 {
770 }
771 else
772 {
773 if (z!=0)
774 {
777 }
778 return;
779 }
780 }
781 }
782 else
783 {
786 {
788 z++;
791 {
796 }
797 else
798 {
799 if (z!=0)
800 {
803 }
804 return;
805 }
806 }
807 }
808 }
809}
static void hShrink(scfmon co, int a, int Nco)
◆ hElimS()
Definition at line 672 of file hutil.cc.
673{
674 int nc = *
e1, z = 0,
i,
j,
k,
k1;
676 if (!nc || (a2 ==
e2))
677 return;
684 {
687 {
692 else
693 {
696 {
700 }
701 else
702 {
703 if (z!=0)
704 {
707 }
708 return;
709 }
710 }
711 }
712 else
713 {
716 {
718 z++;
721 {
726 }
727 else
728 {
729 if (z!=0)
730 {
733 }
734 return;
735 }
736 }
737 }
738 }
739}
◆ hGetmem()
Definition at line 1023 of file hutil.cc.
1024{
1028 {
1029
1030
1031
1032
1036 }
1039}
◆ hGetpure()
◆ hInit()
Definition at line 31 of file hutil.cc.
32{
35
37
40
44
46 {
49 }
50 else
51 {
53 sl = 0;
54 }
56 {
59 }
60 else
61 {
64 }
66 {
69 }
71 for (
i = sl;
i>0;
i--)
72 {
76 }
78 for (
i =
ql;
i>0;
i--)
79 {
83 }
89 for (
i = sl;
i>0;
i--)
90 {
92 {
96 }
98 }
99 for (
i =
ql;
i>0;
i--)
100 {
102 {
106 }
108 }
111}
static void p_GetExpV(poly p, int *ev, const ring r)
long id_RankFreeModule(ideal s, ring lmRing, ring tailRing)
return the maximal component number found in any polynomial in s
◆ hKill()
Definition at line 1010 of file hutil.cc.
1011{
1014 {
1018 }
1020}
◆ hLex2R()
Definition at line 880 of file hutil.cc.
882{
883 int j0 = 0,
j = 0,
i = a2,
k,
k1;
886 {
889 return;
890 }
892 return;
896 {
899 {
902 {
907 {
909 break;
910 }
911 else
912 {
914 {
917 }
919 return;
920 }
921 }
922 else if (o[
k1] && !n[
k1])
923 {
928 {
930 break;
931 }
932 else
933 {
935 {
938 }
940 return;
941 }
942 }
944 }
945 }
946}
◆ hLex2S()
Definition at line 812 of file hutil.cc.
814{
815 int j0 = 0,
j = 0,
i = a2,
k,
k1;
818 {
821 return;
823 return;
827 {
830 {
833 {
838 {
840 break;
841 }
842 else
843 {
845 {
848 }
850 return;
851 }
852 }
853 else if (o[
k1] > n[
k1])
854 {
859 {
861 break;
862 }
863 else
864 {
866 {
869 }
871 return;
872 }
873 }
875 }
876 }
877}
◆ hLexR()
Definition at line 565 of file hutil.cc.
566{
567 int j = 1,
i = 0,
k,
k1;
570 return;
575 {
578 {
581 {
584 }
585 else
586 {
589 {
594 }
595 else
596 return;
597 }
598 }
599 else if (o[
k1] && !n[
k1])
600 {
601 for (
k =
j;
k >
i;
k--)
606 {
611 }
612 else
613 return;
614 }
615 else
617 }
618}
◆ hLexS()
Definition at line 506 of file hutil.cc.
507{
509 return;
515 {
518 {
521 {
524 }
525 else
526 {
529 {
534 }
535 else
536 return;
537 }
538 }
539 else if (o[
k1] > n[
k1])
540 {
547 {
552 }
553 else
554 return;
555 }
556 else
557 {
560 }
561 }
562}
◆ hOrdSupp()
Definition at line 202 of file hutil.cc.
203{
208
213 {
219 {
223 {
225 {
228 {
232 break;
233 }
234 }
236 {
238 {
241 }
245 break;
246 }
247 else
248 {
250 break;
251 }
252 }
253 }
256 for(
j = 0;
j <
jj;
j++)
257 {
261 else
265 }
267 }
271 {
276 {
278 {
279 for (
l =
i;
l >
j;
l--)
280 {
283 }
286 break;
287 }
290 break;
291 }
292 }
294}
int status int void size_t count
◆ hPure()
Definition at line 621 of file hutil.cc.
623{
626 for (
j = a;
j < nc;
j++)
627 {
630 c = 2;
633 {
636 {
637 c--;
638 if (!c)
639 {
641 break;
642 }
643 else if (c == 1)
645 }
648 break;
649 }
651 {
653 {
654 np++;
656 }
661 }
662 }
665 {
668 }
669}
◆ hRadical()
Definition at line 411 of file hutil.cc.
412{
413 int nc = *
Nrad, z = 0,
i,
j,
k;
415 if (nc < 2)
416 return;
423 {
424 if ((o[
k]!=0) && (n[
k]==0))
425 {
427 {
430 {
432 z++;
433 break;
434 }
435 else
436 {
437 if ((o[
k]==0) && (n[
k]!=0))
438 break;
439 }
440 }
442 }
443 else if (!o[
k] && n[
k])
444 {
446 {
449 {
451 z++;
452 break;
453 }
454 else
455 {
457 break;
458 }
459 }
461 }
462 else
463 {
466 {
468 z++;
470 }
471 }
473 {
477 {
480 {
485 else
486 {
487 if (z)
488 {
491 }
492 return;
493 }
494 }
496 {
498 break;
499 }
500 }
501 }
502 }
503}
◆ hShrink()
Definition at line 297 of file hutil.cc.
298{
303 {
305 {
308 }
309 }
310}
◆ hStaircase()
Definition at line 313 of file hutil.cc.
314{
316 if (nc < 2)
317 return;
318 int z = 0;
325 {
328 {
330 {
333 {
335 z++;
336 break;
337 }
338 else
339 {
342 break;
343 }
344 }
346 }
347 else if (o[
k1] < n[
k1])
348 {
350 {
353 {
355 z++;
356 break;
357 }
358 else
359 {
362 break;
363 }
364 }
366 }
367 else
368 {
371 {
373 z++;
375 }
376 }
378 {
382 {
385 {
390 else
391 {
392 if (z!=0)
393 {
396 }
397 return;
398 }
399 }
401 {
403 break;
404 }
405 }
406 }
407 }
408}
◆ hStepR()
Definition at line 974 of file hutil.cc.
975{
980 {
982 {
984 return;
985 }
988 {
990 return;
991 }
992 }
993}
◆ hStepS()
Definition at line 949 of file hutil.cc.
950{
957 {
959 {
962 return;
963 }
966 {
968 return;
969 }
970 }
971}
const CanonicalForm int const CFList const Variable & y
◆ hSupp()
Definition at line 174 of file hutil.cc.
175{
179 for (
i = 1;
i <=
nv;
i++)
180 {
183 {
185 {
188 break;
189 }
192 {
195 break;
196 }
197 }
198 }
200}
◆ hexist
◆ hisModule
◆ hNexist
◆ hNpure
◆ hNrad
◆ hNstc
◆ hNvar
◆ hpur0
◆ hpure
◆ hrad
◆ hsecure
◆ hsel
◆ hstc
◆ hvar
◆ hwork
◆ radmem
◆ stcmem