* #/bin/sh
* IFS=$'\n'
* cat exam_inifcns_nstdsums_data.raw | sed -e 's/\*\^/E/g' > exam_inifcns_nstdsums_data.raw2
- * echo 'string data[] = {' > exam_inifcns_nstdsums_data.raw3
+ * echo 'const char *data[] = {' > exam_inifcns_nstdsums_data.raw3
* for i in `cat exam_inifcns_nstdsums_data.raw2`; do echo \"$i\",; done >> exam_inifcns_nstdsums_data.raw3
* echo '"-999"};' >> exam_inifcns_nstdsums.h
*
vp::iterator it;
int error = 0;
- cout << endl << "Calculating ";
+// cout << endl << "Calculating ";
for (int sum=2; sum<=3; sum++) {
for (int nn=1; nn<sum; nn++) {
vp& da = pp[nn-1][sum-nn-1];
for (it = da.begin(); it!=da.end(); it++) {
- cout << "S(" << nn << "," << sum-nn << "," << it->x << ") " << flush;
+// cout << "S(" << nn << "," << sum-nn << "," << it->x << ") " << flush;
ex res = S(nn,sum-nn,it->x).evalf();
if (!is_a<numeric>(res)) {
if ((it->x != -1) || ((sum-nn) == 1)) {
}
}
- cout << endl;
+// cout << endl;
return result;
}
return result;
}
-
(no output)
----------consistency of symbolic functions:
(no output)
+----------consistency of nestedsums functions:
+(no output)
----------symbolic differentiation:
(no output)
----------polynomial GCD computation: