monoid/fill.hpp

• View this file on GitHub
• Last update: 2021-04-15 20:24:09+09:00
• Include: #include "monoid/fill.hpp"

Verified with

• 双対セグメント木 (区間変更・一点取得) (test/aoj/DSL_2_D.test.cpp)
• 遅延セグメント木 (区間更新・区間最小) (test/aoj/DSL_2_F.test.cpp)

Code

#ifndef _MONOID_FILL
#define _MONOID_FILL
#include <utility>

namespace monoid {
template <class T>
struct fill {
  typedef std::pair<bool, T> value_t;
  value_t identity() const { return std::make_pair(false, T()); }
  value_t merge(value_t a, value_t b) const { return b.first ? b : a; }
};
} // namespace monoid

#endif // _MONOID_FILL

#line 1 "monoid/fill.hpp"


#include <utility>

namespace monoid {
template <class T>
struct fill {
  typedef std::pair<bool, T> value_t;
  value_t identity() const { return std::make_pair(false, T()); }
  value_t merge(value_t a, value_t b) const { return b.first ? b : a; }
};
} // namespace monoid

Back to top page