Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::Lazy_Sum_Segment_Tree< T > Member List

This is the complete list of members for Aleph::Lazy_Sum_Segment_Tree< T >, including all inherited members.

alloc_size() constAleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >inlineprivate
Base typedefAleph::Lazy_Sum_Segment_Tree< T >
build(size_t node, const size_t start, const size_t end)Aleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >inlineprivate
fill_and_build(Getter getter)Aleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >inlineprivate
fill_from_aleph_it(AlephIt it)Aleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >inlineprivate
fill_leaves_recursive(size_t node, size_t start, size_t end, Getter &getter)Aleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >inlineprivate
Gen_Lazy_Segment_Tree(const size_t num, const value_type &init_val=value_type(), Add_Sum_Policy< T > p=Add_Sum_Policy< T >())Aleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >inline
Gen_Lazy_Segment_Tree(std::initializer_list< value_type > il, Add_Sum_Policy< T > p=Add_Sum_Policy< T >())Aleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >inline
Gen_Lazy_Segment_Tree(const Array< value_type > &values, Add_Sum_Policy< T > p=Add_Sum_Policy< T >())Aleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >inline
Gen_Lazy_Segment_Tree(const std::vector< value_type > &values, Add_Sum_Policy< T > p=Add_Sum_Policy< T >())Aleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >inline
Gen_Lazy_Segment_Tree(const DynList< value_type > &values, Add_Sum_Policy< T > p=Add_Sum_Policy< T >())Aleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >inline
Gen_Lazy_Segment_Tree(const Gen_Lazy_Segment_Tree &)=defaultAleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >
Gen_Lazy_Segment_Tree(Gen_Lazy_Segment_Tree &&) noexcept(std::is_nothrow_move_constructible_v< Array< value_type > > and std::is_nothrow_move_constructible_v< Array< lazy_type > > and std::is_nothrow_move_constructible_v< Add_Sum_Policy< T > >)=defaultAleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >
get(const size_t i) constAleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >inline
is_empty() const noexceptAleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >inline
Item_Type typedefAleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >
lazyAleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >mutableprivate
lazy_type typedefAleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >
nAleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >private
operator=(const Gen_Lazy_Segment_Tree &)=defaultAleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >
operator=(Gen_Lazy_Segment_Tree &&) noexcept(std::is_nothrow_move_assignable_v< Array< value_type > > and std::is_nothrow_move_assignable_v< Array< lazy_type > > and std::is_nothrow_move_assignable_v< Add_Sum_Policy< T > >)=defaultAleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >
point_update(const size_t i, const lazy_type &delta)Aleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >inline
polAleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >private
push_down(size_t node, const size_t start, const size_t end) constAleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >inlineprivate
query(const size_t l, const size_t r) constAleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >inline
query_impl(size_t node, const size_t start, const size_t end, const size_t l, const size_t r) constAleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >inlineprivate
set(const size_t i, const value_type &val)Aleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >inline
set_impl(size_t node, const size_t start, const size_t end, const size_t idx, const value_type &val)Aleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >inlineprivate
size() const noexceptAleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >inline
swap(Gen_Lazy_Segment_Tree &other) noexcept(noexcept(std::swap(std::declval< Add_Sum_Policy< T > & >(), std::declval< Add_Sum_Policy< T > & >())))Aleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >inline
treeAleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >mutableprivate
update(const size_t l, const size_t r, const lazy_type &val)Aleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >inline
update_impl(size_t node, const size_t start, const size_t end, const size_t l, const size_t r, const lazy_type &val)Aleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >inlineprivate
value_type typedefAleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >
values() constAleph::Gen_Lazy_Segment_Tree< Add_Sum_Policy< T > >inline