|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Range add + range max policy. More...
#include <tpl_segment_tree.H>
Public Types | |
| using | value_type = T |
| using | lazy_type = T |
Public Member Functions | |
| constexpr T | value_identity () const noexcept |
Static Public Member Functions | |
| static constexpr T | combine (const T &a, const T &b) noexcept |
| static constexpr T | apply (const T &val, const T &delta, size_t) noexcept |
| static constexpr T | compose (const T &old_lazy, const T &new_lazy) noexcept |
| static constexpr T | lazy_identity () noexcept |
Range add + range max policy.
Policy for Gen_Lazy_Segment_Tree implementing a segment tree supporting range additions and range maximum queries.
combine(a, b) = max(a, b)apply(val, delta, count) = val + deltacompose(old, new) = old + new| T | a totally ordered arithmetic type. |
Definition at line 811 of file tpl_segment_tree.H.
| using Aleph::Add_Max_Policy< T >::lazy_type = T |
Definition at line 814 of file tpl_segment_tree.H.
| using Aleph::Add_Max_Policy< T >::value_type = T |
Definition at line 813 of file tpl_segment_tree.H.
|
inlinestaticconstexprnoexcept |
Definition at line 821 of file tpl_segment_tree.H.
|
inlinestaticconstexprnoexcept |
Definition at line 816 of file tpl_segment_tree.H.
|
inlinestaticconstexprnoexcept |
Definition at line 827 of file tpl_segment_tree.H.
References Aleph::divide_and_conquer_partition_dp().
|
inlinestaticconstexprnoexcept |
Definition at line 838 of file tpl_segment_tree.H.
|
inlineconstexprnoexcept |
Definition at line 833 of file tpl_segment_tree.H.