Changeset 3d9165 in git
- Timestamp:
- Aug 10, 2011, 6:44:58 PM (12 years ago)
- Branches:
- (u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'f875bbaccd0831e36aaed09ff6adeb3eb45aeb94')
- Children:
- 88479ff4bbd8d2b194c3da0d9b207cdc5f0af538
- Parents:
- 88a3ea2163706a0102cfc25beed3233b8f552271
- git-author:
- Burcin Erocal <burcin@erocal.org>2011-08-10 18:44:58+02:00
- git-committer:
- Mohamed Barakat <mohamed.barakat@rwth-aachen.de>2011-11-09 13:19:12+01:00
- Location:
- Singular
- Files:
-
- 7 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/Cache.h
r88a3ea2 r3d9165 2 2 #define CACHE_H 3 3 4 #include <iostream>5 4 #include <string> 6 5 #include <list> -
Singular/CacheImplementation.h
r88a3ea2 r3d9165 1 1 #ifndef CACHE_IMPLEMENTATION_H 2 2 #define CACHE_IMPLEMENTATION_H 3 4 #include <cstdio> // for sprintf 5 #include <iostream> 3 6 4 7 template<class KeyClass, class ValueClass> -
Singular/Minor.cc
r88a3ea2 r3d9165 1 #include <iostream> 2 1 3 #include <kernel/mod2.h> 2 4 #include <kernel/structs.h> … … 4 6 #include <Minor.h> 5 7 #include <kernel/febase.h> 8 6 9 7 10 void MinorKey::reset() -
Singular/Minor.h
r88a3ea2 r3d9165 3 3 4 4 #include <assert.h> 5 #include <iostream>6 5 #include <string> 6 7 #include <polys/polys.h> 7 8 8 9 using namespace std; -
Singular/MinorInterface.cc
r88a3ea2 r3d9165 1 // include before anything to avoid clashes with stdio.h included elsewhere 2 #include <cstdio> 3 4 #include <MinorInterface.h> 5 #include <MinorProcessor.h> 6 7 #include <polys/polys.h> 8 #include <kernel/structs.h> 9 1 10 #include <kernel/mod2.h> 2 #include <kernel/structs.h>3 #include <polys/polys.h>4 11 #include <kernel/ideals.h> 5 12 #include <kernel/kstd1.h> 6 #include <polys/matpol.h>7 #include <MinorInterface.h>8 #include <MinorProcessor.h>9 13 10 14 bool currRingIsOverIntegralDomain () 11 15 { 12 if (rField_is_Ring_PtoM( )) return false;13 if (rField_is_Ring_2toM( )) return false;14 if (rField_is_Ring_ModN( )) return false;16 if (rField_is_Ring_PtoM(currRing)) return false; 17 if (rField_is_Ring_2toM(currRing)) return false; 18 if (rField_is_Ring_ModN(currRing)) return false; 15 19 return true; 16 20 } … … 18 22 bool currRingIsOverField () 19 23 { 20 if (rField_is_Ring_PtoM( )) return false;21 if (rField_is_Ring_2toM( )) return false;22 if (rField_is_Ring_ModN( )) return false;23 if (rField_is_Ring_Z( )) return false;24 if (rField_is_Ring_PtoM(currRing)) return false; 25 if (rField_is_Ring_2toM(currRing)) return false; 26 if (rField_is_Ring_ModN(currRing)) return false; 27 if (rField_is_Ring_Z(currRing)) return false; 24 28 return true; 25 29 } … … 59 63 else 60 64 { 61 intArray[i] = n_Int(pGetCoeff(nfPolyArray[i]), currRing );65 intArray[i] = n_Int(pGetCoeff(nfPolyArray[i]), currRing->cf); 62 66 if (characteristic != 0) intArray[i] = intArray[i] % characteristic; 63 67 if (intArray[i] == 0) zeroCounter++; … … 211 215 { 212 216 if ((k == 0) && (strcmp(algorithm, "Bareiss") == 0) 213 && (!rField_is_Ring_Z( )) && (!allDifferent))217 && (!rField_is_Ring_Z(currRing)) && (!allDifferent)) 214 218 { 215 219 /* In this case, we call an optimized procedure, dating back to … … 267 271 268 272 if ((k == 0) && (strcmp(algorithm, "Bareiss") == 0) 269 && (!rField_is_Ring_Z( )) && (!allDifferent))273 && (!rField_is_Ring_Z(currRing)) && (!allDifferent)) 270 274 { 271 275 /* In this case, we call an optimized procedure, dating back to … … 525 529 else if (vars <= 2) b = true; 526 530 else if (currRingIsOverField() && (vars == 3) 527 && (currRing->ch >= 2) && (currRing->ch <= 32003)) b = true; 531 && (currRing->cf->ch >= 2) && (currRing->cf->ch <= 32003)) 532 b = true; 528 533 } 529 534 if (!b) -
Singular/MinorInterface.h
r88a3ea2 r3d9165 1 1 #ifndef MINOR_INTERFACE_H 2 2 #define MINOR_INTERFACE_H 3 4 5 #include <polys/simpleideals.h> 6 #include <polys/polys.h> 3 7 4 8 /* all computations are module char, if char <> 0; -
Singular/MinorProcessor.cc
r88a3ea2 r3d9165 1 #include <MinorProcessor.h> 2 1 3 #include <kernel/mod2.h> 2 4 #include <kernel/structs.h> 3 5 #include <polys/polys.h> 4 #include <MinorProcessor.h>5 6 #include <kernel/febase.h> 6 7 #include <kernel/kstd1.h> … … 430 431 poly g = kNF(iSB, currRing->qideal, f); 431 432 int result = 0; 432 if (g != NULL) result = n_Int(pGetCoeff(g), currRing );433 if (g != NULL) result = n_Int(pGetCoeff(g), currRing->cf); 433 434 pDelete(&f); 434 435 pDelete(&g); … … 1293 1294 addsPoly++; 1294 1295 #endif 1295 kBucket_pt myBucket = kBucketCreate( );1296 kBucket_pt myBucket = kBucketCreate(currRing); 1296 1297 addOperationBucket(p1, p2, myBucket); 1297 1298 poly p3Neg = pNeg(pCopy(p3)); … … 1329 1330 addsPoly++; 1330 1331 #endif 1331 kBucket_pt myBucket = kBucketCreate( );1332 kBucket_pt myBucket = kBucketCreate(currRing); 1332 1333 addOperationBucket(p1, p2, myBucket); 1333 1334 poly p3Neg = pNeg(pCopy(p3));
Note: See TracChangeset
for help on using the changeset viewer.