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

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

build(size_t node, const size_t start, const size_t end)Aleph::Gen_Segment_Tree< T, Op >inlineprivate
fill_and_build(Getter getter)Aleph::Gen_Segment_Tree< T, Op >inlineprivate
fill_from_aleph_it(AlephIt it)Aleph::Gen_Segment_Tree< T, Op >inlineprivate
fill_leaves_recursive(size_t node, size_t start, size_t end, Getter &getter)Aleph::Gen_Segment_Tree< T, Op >inlineprivate
Gen_Segment_Tree(const size_t num, const T &init_val, const T &id, Op oper=Op())Aleph::Gen_Segment_Tree< T, Op >inline
Gen_Segment_Tree(std::initializer_list< T > il, const T &id, Op oper=Op())Aleph::Gen_Segment_Tree< T, Op >inline
Gen_Segment_Tree(const Array< T > &values, const T &id, Op oper=Op())Aleph::Gen_Segment_Tree< T, Op >inline
Gen_Segment_Tree(const std::vector< T > &values, const T &id, Op oper=Op())Aleph::Gen_Segment_Tree< T, Op >inline
Gen_Segment_Tree(const DynList< T > &values, const T &id, Op oper=Op())Aleph::Gen_Segment_Tree< T, Op >inline
Gen_Segment_Tree(const Gen_Segment_Tree &)=defaultAleph::Gen_Segment_Tree< T, Op >
Gen_Segment_Tree(Gen_Segment_Tree &&) noexcept(std::is_nothrow_move_constructible_v< Array< T > > and std::is_nothrow_move_constructible_v< Op >)=defaultAleph::Gen_Segment_Tree< T, Op >
get(const size_t i) constAleph::Gen_Segment_Tree< T, Op >inline
identityAleph::Gen_Segment_Tree< T, Op >private
is_empty() const noexceptAleph::Gen_Segment_Tree< T, Op >inline
Item_Type typedefAleph::Gen_Segment_Tree< T, Op >
nAleph::Gen_Segment_Tree< T, Op >private
opAleph::Gen_Segment_Tree< T, Op >private
operator=(const Gen_Segment_Tree &)=defaultAleph::Gen_Segment_Tree< T, Op >
operator=(Gen_Segment_Tree &&) noexcept(std::is_nothrow_move_assignable_v< Array< T > > and std::is_nothrow_move_assignable_v< Op >)=defaultAleph::Gen_Segment_Tree< T, Op >
query(const size_t l, const size_t r) constAleph::Gen_Segment_Tree< T, Op >inline
query_impl(size_t node, const size_t start, const size_t end, const size_t l, const size_t r) constAleph::Gen_Segment_Tree< T, Op >inlineprivate
set(const size_t i, const T &val)Aleph::Gen_Segment_Tree< T, Op >inline
set_impl(size_t node, const size_t start, const size_t end, const size_t idx, const T &val)Aleph::Gen_Segment_Tree< T, Op >inlineprivate
size() const noexceptAleph::Gen_Segment_Tree< T, Op >inline
swap(Gen_Segment_Tree &other) noexcept(noexcept(std::swap(std::declval< T & >(), std::declval< T & >())) and noexcept(std::swap(std::declval< Op & >(), std::declval< Op & >())))Aleph::Gen_Segment_Tree< T, Op >inline
treeAleph::Gen_Segment_Tree< T, Op >private
update(const size_t i, const T &delta)Aleph::Gen_Segment_Tree< T, Op >inline
update_impl(size_t node, const size_t start, const size_t end, const size_t idx, const T &delta)Aleph::Gen_Segment_Tree< T, Op >inlineprivate
values() constAleph::Gen_Segment_Tree< T, Op >inline