B+ tree recursive deletion has much information which is needs to be passed upward.
More...
template<typename Key, typename Value, typename KeyOfValue, typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
struct tlx::BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::result_t
B+ tree recursive deletion has much information which is needs to be passed upward.
Definition at line 2325 of file btree.hpp.