44 lines
1.3 KiB
C++
44 lines
1.3 KiB
C++
/*
|
|
* This file is part of libgim.
|
|
*
|
|
* libgim is free software: you can redistribute it and/or modify it under the
|
|
* terms of the GNU General Public License as published by the Free Software
|
|
* Foundation, either version 3 of the License, or (at your option) any later
|
|
* version.
|
|
*
|
|
* libgim is distributed in the hope that it will be useful, but WITHOUT ANY
|
|
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
|
|
* FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
|
|
* details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with libgim. If not, see <http://www.gnu.org/licenses/>.
|
|
*
|
|
* Copyright 2015 Danny Robson <danny@nerdcruft.net>
|
|
*/
|
|
|
|
#ifndef __UTIL_POLYNOMIAL_HPP
|
|
#define __UTIL_POLYNOMIAL_HPP
|
|
|
|
#include <array>
|
|
#include <cstdlib>
|
|
|
|
namespace util {
|
|
namespace polynomial {
|
|
// Invalid solutions are represented by NaN. They are guaranteed to
|
|
// be at the end of the solution list, so they are safe to skip on the
|
|
// first instance.
|
|
template <size_t S>
|
|
std::array<float,S>
|
|
solve (std::array<float,S+1>);
|
|
|
|
template <size_t S, typename T, typename U>
|
|
T
|
|
eval (std::array<T,S>, U x);
|
|
}
|
|
}
|
|
|
|
#include "polynomial.ipp"
|
|
|
|
#endif
|