monoids/dual.hpp

• View this file on GitHub
• Last update: 2019-12-19 00:15:23+09:00
• Include: #include "monoids/dual.hpp"
• Link: http://hackage.haskell.org/package/base/docs/Data-Monoid.html#t:Dual

Verified with

• data_structure/link_cut_tree.dynamic_tree_vertex_set_path_composite.test.cpp
• data_structure/link_cut_tree.vertex_set_path_composite.test.cpp
• data_structure/segment_tree.point_set_range_composite.test.cpp
• data_structure/sliding_window_aggregation.yosupo.test.cpp

Code

#pragma once

/**
 * @see http://hackage.haskell.org/package/base/docs/Data-Monoid.html#t:Dual
 */
template <class Monoid>
struct dual_monoid {
    typedef typename Monoid::value_type value_type;
    Monoid base;
    value_type unit() const { return base.unit(); }
    value_type mult(const value_type & a, const value_type & b) const { return base.mult(b, a); }
};

#line 2 "monoids/dual.hpp"

/**
 * @see http://hackage.haskell.org/package/base/docs/Data-Monoid.html#t:Dual
 */
template <class Monoid>
struct dual_monoid {
    typedef typename Monoid::value_type value_type;
    Monoid base;
    value_type unit() const { return base.unit(); }
    value_type mult(const value_type & a, const value_type & b) const { return base.mult(b, a); }
};

Back to top page