source: git/Tst/Short/test_zero_ideal_decomposition.tst @ fdda546

spielwiese
Last change on this file since fdda546 was 0f0b30, checked in by Hans Schoenemann <hannes@…>, 8 years ago
fix: some place of ideal==int
  • Property mode set to 100644
File size: 2.9 KB
Line 
1LIB "tst.lib";
2tst_init();
3echo=1;
4
5LIB("primdec.lib");
6
7
8proc testMinAssZero(method, I)
9{
10  def result = method(I);
11  ASSUME(0, size(result)==1);
12  ASSUME(0, result[1][1]==0 );
13}
14
15
16proc testPrimdecZero(method, I)
17{
18  def result = method(I);
19  ASSUME(0, size(result)==1);
20  ASSUME(0, size(result[1])==2 );
21  ASSUME(0, result[1][1][1]==0 );
22  ASSUME(0, result[1][2][1]==0 );
23}
24
25proc primdecGTZkeepKomp (I)          {    return ( primdecGTZ(I,"keep_comp") );    }
26proc minAssGTZFacSTD (I)             {    return ( minAssGTZ(I,"facstd") );    }
27proc minAssGTZnoFacSTD (I)           {    return ( minAssGTZ(I,"noFacstd") );  }
28proc minAssGTZorig (I)               {    return ( minAssGTZ(I,"GTZ") );       }
29proc minAssGTZorigNoFacSTD (I)       {    return ( minAssGTZ(I,"GTZ","noFacstd") );       }
30
31proc primdecSYNoOptimalOrdering (I)  {    return ( primdecSY(I,0) );           }
32proc minAssCharNoOptimalOrdering (I)  {    return ( minAssChar(I,0) );           }
33
34
35ring rng = 0,(x,y),dp;
36ideal I = x+y,x+1,y;  ideal Z = 0 ;
37
38
39testPrimdecZero( primdecGTZ,Z );
40testPrimdecZero( primdecGTZkeepKomp,Z );
41testMinAssZero( minAssGTZ, Z );
42testMinAssZero( minAssGTZFacSTD, Z );
43testMinAssZero( minAssGTZnoFacSTD, Z );
44testMinAssZero( minAssGTZorig, Z );
45testMinAssZero( minAssGTZorigNoFacSTD, Z );
46testPrimdecZero( primdecSY, Z );
47testPrimdecZero( primdecSYNoOptimalOrdering, Z );
48testMinAssZero( minAssChar,Z );
49testMinAssZero( minAssCharNoOptimalOrdering,Z );
50
51
52kill rng;
53ring rng = 0,(x,y),ds;
54ideal I = x+y,x+1,y;    ideal Z = 0 ;
55
56
57testPrimdecZero( primdecGTZ,Z );
58testPrimdecZero( primdecGTZkeepKomp,Z );
59testMinAssZero( minAssGTZ, Z );
60testMinAssZero( minAssGTZFacSTD, Z );
61testMinAssZero( minAssGTZnoFacSTD, Z );
62testMinAssZero( minAssGTZorig, Z );
63testMinAssZero( minAssGTZorigNoFacSTD, Z );
64testPrimdecZero( primdecSY, Z );
65testPrimdecZero( primdecSYNoOptimalOrdering, Z );
66testMinAssZero( minAssChar,Z );
67testMinAssZero( minAssCharNoOptimalOrdering,Z );
68
69
70kill rng;
71ring rng = (7,a),(x,y,z),dp; minpoly = a^2+a+3;
72ideal I = x+y,x+1,y; ideal Z = 0 ;
73
74
75testPrimdecZero( primdecGTZ,Z );
76testPrimdecZero( primdecGTZkeepKomp,Z );
77testMinAssZero( minAssGTZ, Z );
78testMinAssZero( minAssGTZFacSTD, Z );
79testMinAssZero( minAssGTZnoFacSTD, Z );
80testMinAssZero( minAssGTZorig, Z );
81testMinAssZero( minAssGTZorigNoFacSTD, Z );
82testPrimdecZero( primdecSY, Z );
83testPrimdecZero( primdecSYNoOptimalOrdering, Z );
84
85//  minAssChar not implemented for...
86
87kill rng;
88ring rng = (7,a),(x,y,z),ds; minpoly = a^2 + a+3;
89ideal I = x+y,x+1,y; ideal Z = 0 ;
90
91
92testPrimdecZero( primdecGTZ,Z );
93testPrimdecZero( primdecGTZkeepKomp,Z );
94testMinAssZero( minAssGTZ, Z );
95testMinAssZero( minAssGTZFacSTD, Z );
96testMinAssZero( minAssGTZnoFacSTD, Z );
97testMinAssZero( minAssGTZorig, Z );
98testMinAssZero( minAssGTZorigNoFacSTD, Z );
99testPrimdecZero( primdecSY, Z );
100testPrimdecZero( primdecSYNoOptimalOrdering, Z );
101
102// minAssChar not implemented for...
103
104
105tst_status(1); $
Note: See TracBrowser for help on using the repository browser.