Polynomial.h

Go to the documentation of this file.

/***************************************************/
#ifndef POLYNOMIAL_H
#define POLYNOMIAL_H

#include <vector>

namespace seabreeze {
    template <class T>
    class Polynomial {
    public:
        Polynomial(std::vector<T> *coefficients);
        Polynomial(T *coefficients, unsigned int length);
        ~Polynomial();
        T evaluate(T x);
    private:
        std::vector<T> *coefficients;
    };

    template <class T>
    Polynomial<T>::Polynomial(std::vector<T> *coeffs) {
        unsigned int i;

        if(NULL == coeffs) {
            this->coefficients = new std::vector<T>(0);
        } else {
            this->coefficients = new std::vector<T>(coeffs->size());
        }
        for(i = 0; i < coeffs->size(); i++) {
            (*(this->coefficients))[i] = (*coeffs)[i];
        }
    }

    template <class T>
    Polynomial<T>::Polynomial(T *coeffs, unsigned int length) {
        unsigned int i;

        if(NULL == coeffs) {
            this->coefficients = new std::vector<T>(0);
        } else {
            this->coefficients = new std::vector<T>(length);
        }
        for(i = 0; i < length; i++) {
            (*(this->coefficients))[i] = coeffs[i];
        }
    }


    template <class T>
    Polynomial<T>::~Polynomial() {
        delete this->coefficients;
    }


    template <class T>
    T Polynomial<T>::evaluate(T x) {
        T acc;
        T retval = 0.0;
        unsigned int order;

        if(NULL == this->coefficients || 0 == this->coefficients->size()) {
            return 0;
        }

        retval = this->coefficients->at(0); /* Initialize to A */
        acc = 1;
        for(order = 1; order < this->coefficients->size(); order++) {
            acc *= x;
            retval += this->coefficients->at(order) * acc; /* Add x^n term (Bx^2, Cx^3, ...) */
        }
        return retval;
    }

}

#endif /* POLYNOMIAL_H */