Changeset d84a4d in git
- Timestamp:
- Sep 8, 2011, 9:11:36 PM (12 years ago)
- Branches:
- (u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a657104b677b4c461d018cbf3204d72d34ad66a9')
- Children:
- f7aa4c7c61207b077fe954f2e563ca261edcc109
- Parents:
- 38fc1817a82ba6eed7f9f6355cfa06e1e00e1872
- git-author:
- Oleksandr Motsak <motsak@mathematik.uni-kl.de>2011-09-08 21:11:36+02:00
- git-committer:
- Mohamed Barakat <mohamed.barakat@rwth-aachen.de>2011-11-09 16:12:37+01:00
- Files:
-
- 4 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/iparith.cc
r38fc181 rd84a4d 540 540 static BOOLEAN jjPOWER_ID(leftv res, leftv u, leftv v) 541 541 { 542 res->data = (char *)id Power((ideal)(u->Data()),(int)(long)(v->Data()));542 res->data = (char *)id_Power((ideal)(u->Data()),(int)(long)(v->Data()), currRing); 543 543 if (u!=NULL) return jjOP_REST(res,u,v); 544 544 return FALSE; … … 2314 2314 pLmDelete(p); 2315 2315 if (d==1) 2316 res->data = (char *)id Homogen((ideal)u->Data(),i);2316 res->data = (char *)id_Homogen((ideal)u->Data(), i, currRing); 2317 2317 else 2318 2318 WerrorS("variable must have weight 1"); … … 5579 5579 pLmDelete(p); 5580 5580 if (d==1) 5581 res->data = (char *)id Homogen((ideal)u->Data(),i);5581 res->data = (char *)id_Homogen((ideal)u->Data(), i, currRing); 5582 5582 else 5583 5583 WerrorS("variable must have weight 1"); -
Singular/ipshell.cc
r38fc181 rd84a4d 2795 2795 BOOLEAN kQHWeight(leftv res,leftv v) 2796 2796 { 2797 res->data=(char *)id QHomWeight((ideal)v->Data());2797 res->data=(char *)id_QHomWeight((ideal)v->Data(), currRing); 2798 2798 if (res->data==NULL) 2799 2799 res->data=(char *)new intvec(rVar(currRing)); … … 4422 4422 { 4423 4423 test_id->m[0]=gls->m[j]; 4424 intvec *dummy_w=id QHomWeight(test_id);4424 intvec *dummy_w=id_QHomWeight(test_id, currRing); 4425 4425 if (dummy_w!=NULL) 4426 4426 { -
kernel/ideals.h
r38fc181 rd84a4d 19 19 20 20 21 ideal idCopyFirstK (const ideal ide, const int k); 21 inline ideal idCopyFirstK (const ideal ide, const int k, ring R = currRing) 22 { 23 return id_CopyFirstK(ide, k, R); 24 } 22 25 23 26 /// delete an ideal … … 34 37 //int id_PosConstant(ideal id, const ring r) 35 38 #define idPosConstant(I) id_PosConstant(I,currRing) 36 // 39 37 40 /// Count the effective size of an ideal 38 41 /// (without the trailing allocated zero-elements) 39 static inline int idSize(const ideal id , const ring r = currRing)42 static inline int idSize(const ideal id) 40 43 { 41 44 int j = IDELEMS(id) - 1; … … 93 96 94 97 95 ideal idAdd (ideal h1,ideal h2); 96 /* h1 + h2 */ 97 BOOLEAN idInsertPoly (ideal h1,poly h2); 98 /* h1 + h2 */ 99 BOOLEAN idInsertPolyWithTests (ideal h1, const int validEntries, 100 const poly h2, const bool zeroOk, const bool duplicateOk); 101 /* h1 + h2 */ 102 ideal idMult (ideal h1,ideal h2); 103 /*hh := h1 * h2*/ 98 /// h1 + h2 99 inline ideal idAdd (ideal h1, ideal h2, const ring R = currRing) 100 { 101 return id_Add(h1, h2, R); 102 } 103 104 BOOLEAN idInsertPoly (ideal h1,poly h2); /* h1 + h2 */ 105 inline BOOLEAN idInsertPolyWithTests (ideal h1, const int validEntries, const poly h2, const bool zeroOk, const bool duplicateOk, const ring R = currRing) 106 { 107 return id_InsertPolyWithTests (h1, validEntries, h2, zeroOk, duplicateOk, R); 108 } 109 110 111 /* h1 + h2 */ 112 113 /// hh := h1 * h2 114 inline ideal idMult (ideal h1, ideal h2, const ring R = currRing) 115 { 116 return id_Mult(h1, h2, R); 117 } 104 118 105 119 BOOLEAN idIs0 (ideal h); … … 107 121 // returns TRUE, if idRankFreeModule(m) > 0 108 122 BOOLEAN idIsModule(ideal m, const ring r); 109 BOOLEAN idHomIdeal (ideal id, ideal Q=NULL); 110 BOOLEAN idHomModule(ideal m, ideal Q,intvec **w); 123 124 inline BOOLEAN idHomIdeal (ideal id, ideal Q=NULL, const ring R = currRing) 125 { 126 return id_HomIdeal(id, Q, R); 127 } 128 129 inline BOOLEAN idHomModule(ideal m, ideal Q,intvec **w, const ring R = currRing) 130 { 131 return id_HomModule(m, Q, w, R); 132 } 133 111 134 BOOLEAN idTestHomModule(ideal m, ideal Q, intvec *w); 112 135 … … 146 169 BOOLEAN h1IsStb=FALSE, BOOLEAN resultIsIdeal=FALSE); 147 170 148 ideal idPower(ideal gid,int deg);171 // ideal idPower(ideal gid,int deg); 149 172 150 173 //ideal idElimination (ideal h1,poly delVar); … … 158 181 ideal idHead(ideal h); 159 182 160 ideal idHomogen(ideal h, int varnum);183 // ideal idHomogen(ideal h, int varnum); 161 184 162 185 BOOLEAN idIsSubModule(ideal id1,ideal id2); … … 167 190 } 168 191 169 ideal idMatrix2Module(matrix mat); 170 171 matrix idModule2Matrix(ideal mod); 172 173 matrix idModule2formatedMatrix(ideal mod,int rows, int cols); 192 inline ideal idMatrix2Module(matrix mat, const ring R = currRing) 193 { 194 return idMatrix2Module(mat, R); 195 } 196 197 inline matrix idModule2Matrix(ideal mod, const ring R = currRing) 198 { 199 return id_Module2Matrix(mod, R); 200 } 201 inline matrix idModule2formatedMatrix(ideal mod, int rows, int cols, const ring R = currRing) 202 { 203 return id_Module2formatedMatrix(mod, rows, cols, R); 204 } 174 205 175 206 ideal idSubst(ideal i, int n, poly e); 176 207 177 ideal idJet(ideal i,int d); 178 ideal idJetW(ideal i,int d, intvec * iv); 208 inline ideal idJet(ideal i, int d, const ring R = currRing) 209 { 210 return id_Jet(i, d, R); 211 } 212 213 inline ideal idJetW(ideal i,int d, intvec * iv, const ring R = currRing) 214 { 215 return id_JetW(i, d, iv, R); 216 } 179 217 ideal idSeries(int n,ideal M,matrix U=NULL,intvec *w=NULL); 180 218 181 BOOLEAN idIsZeroDim(ideal i); 219 inline BOOLEAN idIsZeroDim(ideal i, const ring R = currRing) 220 { 221 return idIsZeroDim(i, R); 222 } 223 182 224 matrix idDiff(matrix i, int k); 183 225 matrix idDiffOp(ideal I, ideal J,BOOLEAN multiply=TRUE); 184 226 185 intvec *idSort(ideal id,BOOLEAN nolex=TRUE); 227 inline intvec *idSort(ideal id,BOOLEAN nolex=TRUE, const ring R = currRing) 228 { 229 return id_Sort(id, nolex, R); 230 } 231 186 232 ideal idModulo (ideal h1,ideal h2, tHomog h=testHomog, intvec ** w=NULL); 187 233 matrix idCoeffOfKBase(ideal arg, ideal kbase, poly how); 188 // transpose a module 189 ideal idTransp(ideal a); 190 // version of "ideal idTransp(ideal)" which works within a given ring. 191 ideal id_Transp(ideal a, const ring rRing); 192 193 intvec *idQHomWeight(ideal id); 234 235 /// transpose a module 236 inline ideal idTransp(ideal a, const ring R = currRing) 237 { 238 return id_Transp(a, R); 239 } 240 241 // intvec *idQHomWeight(ideal id); 194 242 195 243 ideal idXXX (ideal h1, int k); … … 202 250 203 251 ideal id_TensorModuleMult(const int m, const ideal M, const ring rRing); // image of certain map for BGG 252 253 204 254 #endif -
libpolys/polys/simpleideals.h
r38fc181 rd84a4d 131 131 132 132 133 /// insert h2 into h1 depending on the two boolean parameters: 134 /// - if zeroOk is true, then h2 will also be inserted when it is zero 135 /// - if duplicateOk is true, then h2 will also be inserted when it is 136 /// already present in h1 137 /// return TRUE iff h2 was indeed inserted 138 BOOLEAN id_InsertPolyWithTests (ideal h1, const int validEntries, 139 const poly h2, const bool zeroOk, 140 const bool duplicateOk, const ring r); 141 142 143 intvec * id_QHomWeight(ideal id, const ring r); 144 145 133 146 #endif
Note: See TracChangeset
for help on using the changeset viewer.