PMDK C++ bindings  1.12.1-rc1
This is the C++ bindings documentation for PMDK's libpmemobj.
pmem::obj::experimental::radix_tree< Key, Value, BytesView > Member List

This is the complete list of members for pmem::obj::experimental::radix_tree< Key, Value, BytesView >, including all inherited members.

begin()pmem::obj::experimental::radix_tree< Key, Value, BytesView >
begin() constpmem::obj::experimental::radix_tree< Key, Value, BytesView >
cbegin() constpmem::obj::experimental::radix_tree< Key, Value, BytesView >
cend() constpmem::obj::experimental::radix_tree< Key, Value, BytesView >
check_pmem()pmem::obj::experimental::radix_tree< Key, Value, BytesView >private
check_tx_stage_work()pmem::obj::experimental::radix_tree< Key, Value, BytesView >private
clear()pmem::obj::experimental::radix_tree< Key, Value, BytesView >
count(const key_type &k) constpmem::obj::experimental::radix_tree< Key, Value, BytesView >
count(const K &k) constpmem::obj::experimental::radix_tree< Key, Value, BytesView >
crbegin() constpmem::obj::experimental::radix_tree< Key, Value, BytesView >
crend() constpmem::obj::experimental::radix_tree< Key, Value, BytesView >
emplace(Args &&... args)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
empty() const noexceptpmem::obj::experimental::radix_tree< Key, Value, BytesView >
end()pmem::obj::experimental::radix_tree< Key, Value, BytesView >
end() constpmem::obj::experimental::radix_tree< Key, Value, BytesView >
erase(const_iterator pos)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
erase(const_iterator first, const_iterator last)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
erase(const key_type &k)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
erase(const K &k)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
find(const key_type &k)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
find(const key_type &k) constpmem::obj::experimental::radix_tree< Key, Value, BytesView >
find(const K &k)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
find(const K &k) constpmem::obj::experimental::radix_tree< Key, Value, BytesView >
insert(const value_type &v)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
insert(value_type &&v)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
insert(InputIterator first, InputIterator last)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
insert(std::initializer_list< value_type > il)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
insert(P &&p)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
insert_or_assign(const key_type &k, M &&obj)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
insert_or_assign(key_type &&k, M &&obj)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
insert_or_assign(K &&k, M &&obj)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
lower_bound(const key_type &k)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
lower_bound(const key_type &k) constpmem::obj::experimental::radix_tree< Key, Value, BytesView >
lower_bound(const K &k)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
lower_bound(const K &k) constpmem::obj::experimental::radix_tree< Key, Value, BytesView >
max_size() const noexceptpmem::obj::experimental::radix_tree< Key, Value, BytesView >
operator<<(std::ostream &os, const radix_tree< K, V, BV > &tree)pmem::obj::experimental::radix_tree< Key, Value, BytesView >friend
operator=(const radix_tree &m)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
operator=(radix_tree &&m)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
operator=(std::initializer_list< value_type > ilist)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
radix_tree()pmem::obj::experimental::radix_tree< Key, Value, BytesView >
radix_tree(InputIt first, InputIt last)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
radix_tree(const radix_tree &m)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
radix_tree(radix_tree &&m)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
radix_tree(std::initializer_list< value_type > il)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
rbegin()pmem::obj::experimental::radix_tree< Key, Value, BytesView >
rend()pmem::obj::experimental::radix_tree< Key, Value, BytesView >
size() const noexceptpmem::obj::experimental::radix_tree< Key, Value, BytesView >
swap(radix_tree &rhs)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
try_emplace(K &&k, Args &&... args) -> typename std::enable_if< detail::has_is_transparent< BV >::value &&!std::is_same< typename std::remove_const< typename std::remove_reference< K >::type >::type, key_type >::value, std::pair< iterator, bool >>::typepmem::obj::experimental::radix_tree< Key, Value, BytesView >
try_emplace(const key_type &k, Args &&... args)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
try_emplace(key_type &&k, Args &&... args)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
upper_bound(const key_type &k)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
upper_bound(const key_type &k) constpmem::obj::experimental::radix_tree< Key, Value, BytesView >
upper_bound(const K &k)pmem::obj::experimental::radix_tree< Key, Value, BytesView >
upper_bound(const K &k) constpmem::obj::experimental::radix_tree< Key, Value, BytesView >
~radix_tree()pmem::obj::experimental::radix_tree< Key, Value, BytesView >