mirror of
https://git.freebsd.org/ports.git
synced 2025-04-29 18:16:48 -04:00
o Update URL in MASTER_SITES to current address o Update MAINTAINER o Remove post-patch target as it is not needed - Use LDFLAGS instead of the non-standard variable ADDITIONALLINKOPTIONS. - Replace "${REINPLACE_CMD} 's,log2,gfan_log2,g'" by appropriate patch files as the command triggers multiple warnings. log2 is a macro defined in src/log.h. The name of this macro is in conflict with the function log2 from math.h. To avoid errors when compiling the code, the above renaming is necessary. Furthermore, PHB 4.4.3 strongly suggests using patch files instead of REINPLACE_CMD for static content. o Sort pkg-plist alphabetically as required by PHB 3.2.2 o Shorten pkg-descr and make it less technical PR: 250879 Submitted by: Moritz Schmitt (maintainer)
44 lines
1.7 KiB
C++
44 lines
1.7 KiB
C++
--- src/buchberger.cpp.orig 2017-06-20 14:47:37 UTC
|
|
+++ src/buchberger.cpp
|
|
@@ -65,7 +65,7 @@ void buchberger/*Simple*/(PolynomialSet *g, TermOrder
|
|
return buchberger2(g, termOrder, allowSaturation);
|
|
//return buchbergerChain(g, termOrder, allowSaturation);
|
|
PolynomialRing theRing=g->getRing();
|
|
- // log2 fprintf(Stderr,"ENTERING buchberger\n");
|
|
+ // gfan_log2 fprintf(Stderr,"ENTERING buchberger\n");
|
|
TimerScope ts(&buchbergerTimer);
|
|
PolynomialSet sPolynomials(theRing);
|
|
|
|
@@ -136,11 +136,11 @@ void buchberger/*Simple*/(PolynomialSet *g, TermOrder
|
|
// else
|
|
// pout<<"ZERO\n";
|
|
}
|
|
- //log2 fprintf(Stderr," buchberger minimize\n");
|
|
+ //gfan_log2 fprintf(Stderr," buchberger minimize\n");
|
|
minimize(g);
|
|
- //log2 fprintf(Stderr," buchberger autoreduce\n");
|
|
+ //gfan_log2 fprintf(Stderr," buchberger autoreduce\n");
|
|
autoReduce(g,termOrder);
|
|
- //log2 fprintf(Stderr,"LEAVING buchberger\n\n");
|
|
+ //gfan_log2 fprintf(Stderr,"LEAVING buchberger\n\n");
|
|
|
|
cerr<<"NumberOfReductions: "<<numberOfReductions<<std::endl;
|
|
}
|
|
@@ -496,7 +496,7 @@ void buchberger2(PolynomialSet *g, TermOrder const &te
|
|
g->push_back(p);
|
|
G.push_back(p);
|
|
numberOfUsefulCriticalPairs++;
|
|
- log2
|
|
+ gfan_log2
|
|
{
|
|
static int t;
|
|
if(((++t)&=31)==0)
|
|
@@ -587,7 +587,7 @@ bool isMarkedGroebnerBasis(PolynomialSet const &g)
|
|
int counter=0;
|
|
for(PolynomialSet::const_iterator i=g.begin();i!=g.end();i++)
|
|
{
|
|
- log2 fprintf(Stderr,"%i ",counter++);
|
|
+ gfan_log2 fprintf(Stderr,"%i ",counter++);
|
|
for(PolynomialSet::const_iterator j=i;j!=g.end();j++)
|
|
if(!relativelyPrime(i->getMarked().m.exponent,j->getMarked().m.exponent))
|
|
{
|