71 if(start<sp.
start){
return 1;}
78 else if (d>0) {
return 1;}
100 if(polyCount){free(polys);}
109 for( i=0 ; i<count ; i++ )
111 if( !c || sps[i].start!=polys[c-1].start ) polys[c++] = sps[i];
112 else{polys[c-1].
p+=sps[i].
p;}
116 template <
int Degree>
122 if(polyCount){free(polys);}
146 template<
int Degree2>
149 for(
int i=0;i<int(polyCount);i++){
150 polys[i].start=p.
polys[i].start;
151 polys[i].p=p.
polys[i].p;
160 for(
int i=0 ; i<int(polyCount) && t>polys[i].start ; i++ ) v+=polys[i].p(t);
168 double start,end,s,v=0;
176 for(
int i=0;i<int(polyCount) && polys[i].start<end;i++){
177 if(start<polys[i].start){s=polys[i].start;}
179 v+=polys[i].p.integral(s,end);
195 else if (i>=
int( polyCount)-1) {q.
polys[idx]=p.
polys[++j];}
196 else if(polys[i+1].start<p.
polys[j+1].start){q.
polys[idx]= polys[++i];}
212 else if (i>=
int( polyCount)-1) {q.
polys[idx].start=p.
polys[++j].start;q.
polys[idx].p=p.
polys[j].p*(-1.0);}
213 else if(polys[i+1].start<p.
polys[j+1].start){q.
polys[idx]= polys[++i];}
223 std::size_t idx=0,cnt=0,oldPolyCount=polyCount;
228 while(cnt<polyCount){
229 if (j>=
int( p.
polyCount)-1) {polys[idx]=oldPolys[++i];}
230 else if (i>=
int(oldPolyCount)-1) {polys[idx].
start= p.
polys[++j].start;polys[idx].p=p.
polys[j].p*scale;}
231 else if (oldPolys[i+1].start<p.
polys[j+1].start){polys[idx]=oldPolys[++i];}
232 else {polys[idx].
start= p.
polys[++j].start;polys[idx].p=p.
polys[j].p*scale;}
233 if(idx && polys[idx].start==polys[idx-1].start) {polys[idx-1].p+=polys[idx].p;}
242 template<
int Degree2>
246 int i,j,spCount=int(polyCount*p.
polyCount);
249 for(i=0;i<int(polyCount);i++){
259 template<
int Degree2>
263 for(
int i=0;i<int(polyCount);i++){
264 q.
polys[i].start=polys[i].start;
265 q.
polys[i].p=polys[i].p*p;
274 for(std::size_t i=0;i<polyCount;i++){q.
polys[i]=polys[i].scale(s);}
282 for(std::size_t i=0;i<polyCount;i++){q.
polys[i]=polys[i].shift(s);}
289 for(std::size_t i=0;i<polyCount;i++){
290 q.polys[i].start=polys[i].start;
291 q.polys[i].p=polys[i].p.derivative();
300 for(i=0;i<int(polyCount);i++){
301 q.
polys[i].start=polys[i].start;
302 q.
polys[i].p=polys[i].p.integral();
314 for(
int i=0;i<int(polyCount);i++){polys[i].p*=s;}
320 for(std::size_t i=0;i<polyCount;i++){polys[i].p/=s;}
358 printf(
"[-Infinity,Infinity]\n");
361 for(std::size_t i=0;i<polyCount;i++){
363 if (polys[i ].start== DBL_MAX){printf(
"Infinity,");}
364 else if (polys[i ].start==-DBL_MAX){printf(
"-Infinity,");}
365 else {printf(
"%f,",polys[i].start);}
366 if(i+1==polyCount) {printf(
"Infinity]\t");}
367 else if (polys[i+1].start== DBL_MAX){printf(
"Infinity]\t");}
368 else if (polys[i+1].start==-DBL_MAX){printf(
"-Infinity]\t");}
369 else {printf(
"%f]\t",polys[i+1].start);}
382 q.
polys[0].start=-radius;
383 q.
polys[1].start= radius;
385 q.
polys[0].p.coefficients[0]= 1.0;
386 q.
polys[1].p.coefficients[0]=-1.0;
389 template<
int Degree >
403 for(
int i=0;i<int(polyCount);i++){
404 sps[2*i ].
start=polys[i].start-radius;
405 sps[2*i+1].
start=polys[i].start+radius;
406 p=polys[i].p.
integral()-polys[i].p.integral()(polys[i].start);
407 sps[2*i ].
p=p.
shift(-radius);
408 sps[2*i+1].
p=p.
shift( radius)*-1;
410 A.
set(sps,
int(polyCount*2));
412 return A*1.0/(2*radius);
417 std::vector<double> tempRoots;
420 for(std::size_t i=0;i<polyCount;i++){
422 if(polys[i].start>max){
break;}
423 if(i<polyCount-1 && polys[i+1].start<min){
continue;}
425 for(std::size_t j=0;j<tempRoots.size();j++){
426 if(tempRoots[j]>polys[i].start && (i+1==polyCount || tempRoots[j]<=polys[i+1].start)){
427 if(tempRoots[j]>min && tempRoots[j]<max){roots.push_back(tempRoots[j]);}
435 fwrite(&samples,
sizeof(
int),1,fp);
436 for(
int i=0;i<samples;i++){
437 double x=min+i*(max-min)/(samples-1);
439 fwrite(&v,
sizeof(
float),1,fp);