polynomial/taylor_shift.hpp

• View this file on GitHub
• Last update: 2022-07-17 14:27:07+09:00
• Include: #include "polynomial/taylor_shift.hpp"

Verified with

• polynomial/test/polynomial_taylor_shift.test.cpp

Code

#pragma once

#include <algorithm>
#include <utility>
#include <vector>

template <typename T, typename Binom, typename Mul>
std::vector<T> taylor_shift(std::vector<T> f, const T &c, const Binom &binom) {
    int n = (int) f.size();
    for (int i = 0; i < n; ++i) {
        f[i] *= binom.fact(i);
    }
    std::reverse(f.begin(), f.end());
    std::vector<T> g(n);
    T pw(1);
    for (int i = 0; i < n; ++i) {
        g[i] = pw * binom.inv_fact(i);
        pw *= c;
    }
    std::vector<T> h = Mul::mul(std::move(f), std::move(g));
    h.resize(n);
    std::reverse(h.begin(), h.end());
    for (int i = 0; i < n; ++i) {
        h[i] *= binom.inv_fact(i);
    }
    return h;
}

#line 2 "polynomial/taylor_shift.hpp"

#include <algorithm>
#include <utility>
#include <vector>

template <typename T, typename Binom, typename Mul>
std::vector<T> taylor_shift(std::vector<T> f, const T &c, const Binom &binom) {
    int n = (int) f.size();
    for (int i = 0; i < n; ++i) {
        f[i] *= binom.fact(i);
    }
    std::reverse(f.begin(), f.end());
    std::vector<T> g(n);
    T pw(1);
    for (int i = 0; i < n; ++i) {
        g[i] = pw * binom.inv_fact(i);
        pw *= c;
    }
    std::vector<T> h = Mul::mul(std::move(f), std::move(g));
    h.resize(n);
    std::reverse(h.begin(), h.end());
    for (int i = 0; i < n; ++i) {
        h[i] *= binom.inv_fact(i);
    }
    return h;
}

Back to top page