MonoidRangeSumPointAdd - [区間和, 一点加算]
(lib/99-operator/monoid/MonoidRangeSumPointAdd.cpp)

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

Verified with

• test/binary-search-tree/BinaryTrie-set-xor-min.test.cpp
• test/binary-search-tree/RandomizedBinarySearchTreeSet-get.test.cpp
• test/binary-search-tree/RandomizedBinarySearchTreeSet-med.test.cpp
• test/graph/Tree-hld-vertex-2.test.cpp
• test/segment-tree/DynamicSegmentTree-rsq-1.test.cpp
• test/segment-tree/DynamicSegmentTree-rsq-2.test.cpp
• test/segment-tree/DynamicSegmentTree-rsq-3.test.cpp
• test/segment-tree/SegmentTree-rsq.test.cpp
• test/segment-tree/SegmentTree2D-rsq.test.cpp

Code

/*
 * @title MonoidRangeSumPointAdd - [区間和, 一点加算]
 * @docs md/operator/monoid/MonoidRangeSumPointAdd.md
 */
template<class T> struct MonoidRangeSumPointAdd {
    using TypeNode = T;
    inline static constexpr TypeNode unit_node = 0;
    inline static constexpr TypeNode func_fold(TypeNode l,TypeNode r){return l+r;}
    inline static constexpr TypeNode func_operate(TypeNode l,TypeNode r){return l+r;}
    inline static constexpr bool func_check(TypeNode nodeVal,TypeNode var){return var == nodeVal;}
};

#line 1 "lib/99-operator/monoid/MonoidRangeSumPointAdd.cpp"
/*
 * @title MonoidRangeSumPointAdd - [区間和, 一点加算]
 * @docs md/operator/monoid/MonoidRangeSumPointAdd.md
 */
template<class T> struct MonoidRangeSumPointAdd {
    using TypeNode = T;
    inline static constexpr TypeNode unit_node = 0;
    inline static constexpr TypeNode func_fold(TypeNode l,TypeNode r){return l+r;}
    inline static constexpr TypeNode func_operate(TypeNode l,TypeNode r){return l+r;}
    inline static constexpr bool func_check(TypeNode nodeVal,TypeNode var){return var == nodeVal;}
};

Back to top page