AbelPrefixSumPointAdd
(lib/99-operator/abel/AbelPrefixSumPointAdd.cpp)

• View this file on GitHub
• Last update: 2023-05-30 04:39:19+09:00

Verified with

• test/binary-indexed-tree/BinaryIndexedTree-rsqraq.test.cpp
• test/binary-indexed-tree/BinaryIndexedTreeOffline2D-1.test.cpp
• test/binary-indexed-tree/BinaryIndexedTreeOffline2D-2.test.cpp
• test/binary-indexed-tree/DynamicBinaryIndexedTree-rsqraq.test.cpp
• test/static-range-query/StaticRangeInversionQuery.test.cpp

Code

/*
 * @title AbelPrefixSumPointAdd
 * @docs md/operator/abel/AbelPrefixSumPointAdd.md
 */
template<class T> struct AbelPrefixSumPointAdd {
    using TypeNode = T;
    inline static constexpr TypeNode unit_node = 0;
    inline static constexpr TypeNode func_fold(const TypeNode& l,const TypeNode& r){return l+r;}
    inline static constexpr TypeNode func_fold_inv(const TypeNode& l,const TypeNode& r){return l-r;}
};

#line 1 "lib/99-operator/abel/AbelPrefixSumPointAdd.cpp"
/*
 * @title AbelPrefixSumPointAdd
 * @docs md/operator/abel/AbelPrefixSumPointAdd.md
 */
template<class T> struct AbelPrefixSumPointAdd {
    using TypeNode = T;
    inline static constexpr TypeNode unit_node = 0;
    inline static constexpr TypeNode func_fold(const TypeNode& l,const TypeNode& r){return l+r;}
    inline static constexpr TypeNode func_fold_inv(const TypeNode& l,const TypeNode& r){return l-r;}
};

Back to top page