Added my "Copyright (c) 2007" notices, for files I edited in 2007.

[synfig.git] / synfig-core / trunk / src / synfig / polynomial_root.h

diff --git a/synfig-core/trunk/src/synfig/polynomial_root.h b/synfig-core/trunk/src/synfig/polynomial_root.h
index 16f1123..09e31e4 100644 (file)
--- a/synfig-core/trunk/src/synfig/polynomial_root.h
+++ b/synfig-core/trunk/src/synfig/polynomial_root.h
@@ -2,10 +2,11 @@
 /*!    \file polynomial_root.h
 **     \brief Polynomial Root Finder Header
 **
-**     $Id: polynomial_root.h,v 1.1.1.1 2005/01/04 01:23:14 darco Exp $
+**     $Id$
 **
 **     \legal
 **     Copyright (c) 2002-2005 Robert B. Quattlebaum Jr., Adrian Bentley
+**     Copyright (c) 2007 Chris Moore
 **
 **     This package is free software; you can redistribute it and/or
 **     modify it under the terms of the GNU General Public License as
@@ -37,57 +38,57 @@
 /* === C L A S S E S & S T R U C T S ======================================= */
 template < typename T = float, typename F = float >
 class Polynomial : public std::vector<T> //a0 + a1x + a2x^2 + ... + anx^n
-{              
+{
 public:
-       
+
        //Will maintain all lower constants
        void degree(unsigned int d, const T & def = (T)0) { resize(d+1,def); }
-       unsigned int degree()const { return size() - 1; }
-       
+       unsigned int degree()const { return this->size() - 1; }
+
        const Polynomial & operator+=(const Polynomial &p)
        {
-               if(p.size() > size())
+               if(p.size() > this->size())
                        resize(p.size(), (T)0);
-               
+
                for(int i = 0; i < p.size(); ++i)
                {
                        (*this)[i] += p[i];
                }
                return *this;
        }
-       
+
        const Polynomial & operator-=(const Polynomial &p)
        {
-               if(p.size() > size())
+               if(p.size() > this->size())
                        resize(p.size(), (T)0);
-               
+
                for(int i = 0; i < p.size(); ++i)
                {
                        (*this)[i] -= p[i];
                }
                return *this;
        }
-       
+
        const Polynomial & operator*=(const Polynomial &p)
        {
                if(p.size() < 1)
                {
-                       resize(0);
+                       this->resize(0);
                        return *this;
                }
-               
+
                unsigned int i,j;
                std::vector<T> nc(*this);
-               
+
                //in place for constant stuff
                for(i = 0; i < nc.size(); ++i)
                {
                        (*this)[i] *= p[0];
                }
-               
+
                if(p.size() < 2) return *this;
-                       
-               resize(size() + p.degree());            
+
+               this->resize(this->size() + p.degree());
                for(int i = 0; i < nc.size(); ++i)
                {
                        for(int j = 1; j < p.size(); ++j)
@@ -95,16 +96,16 @@ public:
                                nc[i+j] += nc[i]*p[j];
                        }
                }
-               
+
                return *this;
-       }       
+       }
 };
 
 class RootFinder
 {
        std::vector< std::complex<float> >      workcoefs;
        int     its;
-       
+
 public:
        std::vector< std::complex<float> >      coefs; //the number of coefficients determines the degree of polynomial