Function testDouble

code/mathematics/berlekamp_massey.test.cpp:63–92

}

void testDouble() {
    for (int it = 0; it < 10000; it++) {
        int K = rng() % 5 + 1,
            S = rng() % 10 + 1;

        int k = rng() % K + 1;
        vector<long double> init(k);
        rep(i,0,k) init[i] = (int)(rng() % (2*S)) - S;

        vector<long double> c(k);
        rep(i,0,k) c[i] = (int)(rng() % (2*S)) - S;
        rep(i,0,k) {
            long double cur = 0;
            rep(j,0,k) {
                cur = cur + init[(int)init.size()-1 - j] * c[j];
            }
            init.push_back(cur);
        }

        vector<long double> res = berlekamp_massey<long double>(init);
        assert(res.size() <= k);
        for (int i = k; i < init.size(); i++) {
            long double cur = 0;
            rep(j,0,res.size()) {
                cur = cur + init[i-1 - j] * res[j];
            }
            assert_almost_equal(init[i], cur, 1e-6, true);
        }
    }
}

void test() {
    testMod();