Aleph::PersistentTreapMap< Key, T, Compare > Member List

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

cmp_	Aleph::PersistentTreapMap< Key, T, Compare >	private
collect_items(const NodePtr &node, Array< std::pair< Key, T > > &out)	Aleph::PersistentTreapMap< Key, T, Compare >	inlineprivatestatic
contains(const Key &key) const	Aleph::PersistentTreapMap< Key, T, Compare >	inline
erase(const Key &key) const	Aleph::PersistentTreapMap< Key, T, Compare >	inline
find(const Key &key) const	Aleph::PersistentTreapMap< Key, T, Compare >	inline
insert(KArg &&key, VArg &&value) const	Aleph::PersistentTreapMap< Key, T, Compare >	inline
insert_or_assign(KArg &&key, VArg &&value) const	Aleph::PersistentTreapMap< Key, T, Compare >	inline
insert_or_assign_rec(const NodePtr &node, std::shared_ptr< const Key > key, std::shared_ptr< const T > value, const std::uint64_t priority, const Compare &cmp, bool &inserted)	Aleph::PersistentTreapMap< Key, T, Compare >	inlineprivatestatic
insert_rec(const NodePtr &node, std::shared_ptr< const Key > key, std::shared_ptr< const T > value, const std::uint64_t priority, const Compare &cmp, bool &inserted)	Aleph::PersistentTreapMap< Key, T, Compare >	inlineprivatestatic
is_empty() const noexcept	Aleph::PersistentTreapMap< Key, T, Compare >	inline
items() const	Aleph::PersistentTreapMap< Key, T, Compare >	inline
join(const PersistentTreapMap &left, const PersistentTreapMap &right)	Aleph::PersistentTreapMap< Key, T, Compare >	inlinestatic
join(const PersistentTreapMap &right) const	Aleph::PersistentTreapMap< Key, T, Compare >	inline
keys() const	Aleph::PersistentTreapMap< Key, T, Compare >	inline
make_node(std::shared_ptr< const Key > key, std::shared_ptr< const T > value, const std::uint64_t priority, NodePtr left, NodePtr right)	Aleph::PersistentTreapMap< Key, T, Compare >	inlineprivatestatic
next_priority_	Aleph::PersistentTreapMap< Key, T, Compare >	private
NodeOps typedef	Aleph::PersistentTreapMap< Key, T, Compare >	private
NodePtr typedef	Aleph::PersistentTreapMap< Key, T, Compare >	private
PersistentTreapMap(NodePtr root, Compare cmp, const std::uint64_t next_priority)	Aleph::PersistentTreapMap< Key, T, Compare >	inlineprivate
PersistentTreapMap(Compare cmp=Compare())	Aleph::PersistentTreapMap< Key, T, Compare >	inlineexplicit
rebuild_node(const NodePtr &node, NodePtr left, NodePtr right)	Aleph::PersistentTreapMap< Key, T, Compare >	inlineprivatestatic
root_	Aleph::PersistentTreapMap< Key, T, Compare >	private
size() const noexcept	Aleph::PersistentTreapMap< Key, T, Compare >	inline
split(const Key &pivot) const	Aleph::PersistentTreapMap< Key, T, Compare >	inline
verify() const	Aleph::PersistentTreapMap< Key, T, Compare >	inline