data-structure/monoid/affine.hpp

View this file on GitHub
Last update: 2023-02-25 23:57:16+09:00
Include: #include "data-structure/monoid/affine.hpp"

Required by

test/library-checker/data-structure/point-set-range-composite.cpp

Verified with

test/library-checker/data-structure/vertex-set-path-composite.test.cpp

Code

#pragma once

#include <utility>

template <typename T, bool rev = false> struct MonoidAffine {
    using S = std::pair<T, T>;
    using value_type = S;
    inline static S op(const S &l, const S &r) {
        if(rev) return S(r.first * l.first, r.first * l.second + r.second);
        return S(l.first * r.first, l.first * r.second + l.second);
    }
    inline static S e() { return S(T(1), T(0)); }
};

#line 2 "data-structure/monoid/affine.hpp"

#include <utility>

template <typename T, bool rev = false> struct MonoidAffine {
    using S = std::pair<T, T>;
    using value_type = S;
    inline static S op(const S &l, const S &r) {
        if(rev) return S(r.first * l.first, r.first * l.second + r.second);
        return S(l.first * r.first, l.first * r.second + l.second);
    }
    inline static S e() { return S(T(1), T(0)); }
};