[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Toon-members] tag/src polynomial.cc
From: |
Edward Rosten |
Subject: |
[Toon-members] tag/src polynomial.cc |
Date: |
Wed, 15 Jul 2009 17:38:14 +0000 |
CVSROOT: /cvsroot/toon
Module name: tag
Changes by: Edward Rosten <edrosten> 09/07/15 17:38:14
Modified files:
src : polynomial.cc
Log message:
Replace pair<A, B> with tuple<A, B> so that tie() works with older
standard libraries.
CVSWeb URLs:
http://cvs.savannah.gnu.org/viewcvs/tag/src/polynomial.cc?cvsroot=toon&r1=1.2&r2=1.3
Patches:
Index: polynomial.cc
===================================================================
RCS file: /cvsroot/toon/tag/src/polynomial.cc,v
retrieving revision 1.2
retrieving revision 1.3
diff -u -b -r1.2 -r1.3
--- polynomial.cc 12 Jul 2009 12:28:32 -0000 1.2
+++ polynomial.cc 15 Jul 2009 17:38:14 -0000 1.3
@@ -65,7 +65,7 @@
}
template<int N, int M>
-pair<Vector<N>, Vector<M> > neg_second(const pair<Vector<N>, Vector<M> >& r)
+tuple<Vector<N>, Vector<M> > neg_second(const pair<Vector<N>, Vector<M> >& r)
{
return make_pair(r.first, -r.second);
}
@@ -119,7 +119,7 @@
//
// Q_i is always of degree 1, so the number of sign changes
// can be evaluated using the recursion above efficiently.
- pair<int, double> changes(double x) const
+ tuple<int, double> changes(double x) const
{
int changes=0;
double v_prev_2 = polyval(f0, x);
@@ -226,7 +226,7 @@
return (upper + lower)/2;
}
-template<class F> pair<double, double> polish_root_newton(double lower, double
upper, double lower_val, double upper_val, const F& f)
+template<class F> tuple<double, double> polish_root_newton(double lower,
double upper, double lower_val, double upper_val, const F& f)
{
const double zeps = 1e-20;
const double eps = 1e-15;
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- [Toon-members] tag/src polynomial.cc,
Edward Rosten <=