libcruft-util/polynomial.hpp

41 lines
1.2 KiB
C++
Raw Normal View History

2015-01-21 23:40:45 +11:00
/*
2015-04-13 18:05:28 +10:00
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
2015-01-21 23:40:45 +11:00
*
2015-04-13 18:05:28 +10:00
* http://www.apache.org/licenses/LICENSE-2.0
2015-01-21 23:40:45 +11:00
*
2015-04-13 18:05:28 +10:00
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
2015-01-21 23:40:45 +11:00
*
* Copyright 2015 Danny Robson <danny@nerdcruft.net>
*/
#ifndef __UTIL_POLYNOMIAL_HPP
#define __UTIL_POLYNOMIAL_HPP
#include <array>
#include <cstdlib>
namespace util {
namespace polynomial {
2015-01-29 15:38:53 +11:00
// 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.
2015-01-21 23:40:45 +11:00
template <size_t S>
std::array<float,S>
2015-07-06 21:41:03 +10:00
roots (std::array<float,S+1>);
2015-01-21 23:40:45 +11:00
template <size_t S, typename T, typename U>
T
eval (std::array<T,S>, U x);
2015-01-21 23:40:45 +11:00
}
}
#include "polynomial.ipp"
2015-01-21 23:40:45 +11:00
#endif