absl::btree

An ordered associative container of unique keys and associated values.

Synopsis

Declared in <absl/container/btree_map.h>

template<
    typename Key,
    typename Value,
    typename Compare = std::less<Key>,
    typename Alloc = std::allocator<std::pair<Key const, Value>>>
class btree_map
    : public /* implementation-defined */::btree_map_container</* implementation-defined */::btree</* implementation-defined */>>

Description

An absl::btree_map<K, V> is an ordered associative container of unique keys and associated values designed to be a more efficient replacement for std::map (in most cases).

Keys are sorted using an (optional) comparison function, which defaults to std::less<K>.

An absl::btree_map<K, V> uses a default allocator of std::allocator<std::pair<const K, V>> to allocate (and deallocate) nodes, and construct and destruct values within those nodes. You may instead specify a custom allocator A (which in turn requires specifying a custom comparator C) as in absl::btree_map<K, V, C, A>.