#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstddef>
#include <utility>
#include <vector>
Go to the source code of this file.
|
| template<typename T > |
| void | smash::lowess::lowest (const T *x, const T *y, size_t n, T xs, T &ys, size_t nleft, size_t nright, T *w, bool userw, T *rw, bool &ok) |
| | Fit value at x[i] Based on R function lowest: Translated to C++ by C. More...
|
| |
| template<typename T > |
| void | smash::lowess::psort (T *x, size_t n, size_t k) |
| | Partial sort. More...
|
| |
| template<typename T > |
| void | smash::lowess::lowess (const T *x, const T *y, size_t n, T *ys, T span, size_t iter, T delta, T *rw, T *res) |
| | Lowess regression smoother. More...
|
| |
| template<typename T > |
| std::vector< T > | smash::smooth (const std::vector< T > &x, const std::vector< T > &y, T span=2./3, size_t iter=3, T delta=0) |
| | Apply the LOWESS smoother (see the reference below) to the given data (x, y). More...
|
| |
