Polynomial.h

Go to the documentation of this file.

/*
 *  Copyright (c) 2018, Martin Duy Tat
 *  All rights reserved.
 *  Redistribution and use in source and binary forms, with or without
 *  modification, are permitted provided that the following conditions are met:
 *  1. Redistributions of source code must retain the above copyright notice,
 *     this list of conditions and the following disclaimer.
 *  2. Redistributions in binary form must reproduce the above copyright notice,
 *     this list of conditions and the following disclaimer in the documentation
 *     and/or other materials provided with the distribution.
 *  3. Neither the name of STFC nor the names of its contributors may be used to
 *     endorse or promote products derived from this software without specific
 *     prior written permission.
 *
 *  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 *  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 *  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 *  ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
 *  LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 *  CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 *  SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 *  INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 *  CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 *  ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 *  POSSIBILITY OF SUCH DAMAGE.
 */
 
#ifndef POLYNOMIAL_H
#define POLYNOMIAL_H
 
#include <vector>
 
namespace polynomial {
 
class Polynomial {
public:
    Polynomial();
    explicit Polynomial(const std::vector<int> &coefficients);
    Polynomial(const Polynomial &poly);
    ~Polynomial();
    Polynomial& operator= (const Polynomial &poly);
    void differentiatePolynomial();
    void multiplyPolynomial(const Polynomial &poly);
    void addPolynomial(const Polynomial &poly);
    void printPolynomial() const;
    int getCoefficient(const std::size_t &order) const;
    void setCoefficient(const int &coefficient, const std::size_t &order);
    int getMaxXorder() const;
    void setMaxXorder(const std::size_t &maxXorder);
    void setZero();
    double evaluatePolynomial(const double &x) const;
    void truncate(const std::size_t &truncateOrder);
private:
    std::size_t maxXorder_m;
    std::vector<int> coefficients_m;
};
 
inline
    int Polynomial::getCoefficient(const std::size_t &order) const {
        if (order > maxXorder_m) {
            return 0;
    }
        return coefficients_m[order];
}
inline
    int Polynomial::getMaxXorder() const{
        return maxXorder_m;
}
inline
    void Polynomial::setMaxXorder(const std::size_t &maxXorder) {
        coefficients_m.resize(maxXorder + 1, 0);
        maxXorder_m = maxXorder;
}
inline
    void Polynomial::setZero() {
        maxXorder_m = 0;
        coefficients_m.resize(1);
        coefficients_m[0] = 0;
}
inline
    void Polynomial::truncate(const std::size_t &truncateOrder) {
        if (truncateOrder < maxXorder_m) {
            coefficients_m.resize(truncateOrder + 1);
            maxXorder_m = truncateOrder;
        }
}
 
}
 
#endif