__GNU_PBDS::DETAIL::OV_TREE_MAP(3cxx)

💅 NAME

__gnu_pbds::detail::ov_tree_map< Key, Mapped, Cmp_Fn, Node_And_It_Traits, _Alloc > — an ordered-vector tree associative-container ✨ (yes bestie, that whole template signature is the name, we don't make the rules, the C++ committee does 😭)

So real talk: this little icon lives in the 3cxx section of the manual — that's the libstdc++ corner of manpage land 🎀

---

🌸 SYNOPSIS

#include <ov_tree_map_.hpp>

It inherits Cmp_Fn, Node_And_It_Traits::node_update, and __gnu_pbds::detail::types_traits< Key, Mapped, _Alloc, false >. Like, all three. It's a nepo baby of inheritance, and honestly? It ate 💅

🧚 Classes

• class cond_dtor — the conditional destructor. It destructs conditionally, iykyk 🦋

👑 Public Types

Every single one, no skipping, no cap:

• typedef _Alloc allocator_type
• typedef Cmp_Fn cmp_fn
• typedef std::pair< size_type, size_type > comp_hash
• typedef point_const_iterator const_iterator
• typedef traits_base::const_pointer const_pointer
• typedef traits_base::const_reference const_reference
• typedef ov_tree_tag container_category
• typedef _Alloc::difference_type difference_type
• typedef point_iterator iterator
• typedef traits_base::key_const_pointer key_const_pointer
• typedef traits_base::key_const_reference key_const_reference
• typedef traits_base::key_pointer key_pointer
• typedef traits_base::key_reference key_reference
• typedef traits_base::key_type key_type
• typedef traits_base::mapped_const_pointer mapped_const_pointer
• typedef traits_base::mapped_const_reference mapped_const_reference
• typedef traits_base::mapped_pointer mapped_pointer
• typedef traits_base::mapped_reference mapped_reference
• typedef traits_base::mapped_type mapped_type
• typedef __nothrowcopy::indicator no_throw_indicator
• typedef traits_type::node_const_iterator node_const_iterator
• typedef traits_type::node_iterator node_iterator
• typedef traits_type::node_update node_update
• typedef const_pointer point_const_iterator
• typedef pointer point_iterator
• typedef traits_base::pointer pointer
• typedef traits_base::reference reference
• typedef _Alloc::size_type size_type
• typedef integral_constant< int, Store_Hash > store_extra
• typedef stored_data< value_type, size_type, Store_Hash > stored_data_type
• typedef traits_base::value_type value_type

That's the whole roster, bestie. Every alias accounted for 🫶

💖 Public Member Functions

• ov_tree_map (const Cmp_Fn &)
• ov_tree_map (const Cmp_Fn &, const node_update &)
• ov_tree_map (const tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc > &)
• iterator begin ()
• const_iterator begin () const
• void clear ()
• template<typename It > void copy_from_range (It, It)
• bool empty () const
• iterator end ()
• const_iterator end () const
• iterator erase (iterator it)
• bool erase (key_const_reference)
• template<typename Pred > size_type erase_if (Pred)
• point_iterator find (key_const_reference r_key)
• point_const_iterator find (key_const_reference r_key) const
• Cmp_Fn & get_cmp_fn ()
• const Cmp_Fn & get_cmp_fn () const
• std::pair< point_iterator, bool > insert (const_reference r_value)
• void join (tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc > &)
• point_iterator lower_bound (key_const_reference r_key)
• point_const_iterator lower_bound (key_const_reference r_key) const
• size_type max_size () const
• node_iterator node_begin () — returns a node_iterator pointing at the node at the root of the tree 🌳
• node_const_iterator node_begin () const — returns a const node_iterator pointing at the node at the root of the tree 🌳
• node_iterator node_end () — returns a node_iterator pointing at a node just after a leaf of the tree 🍃
• node_const_iterator node_end () const — returns a const node_iterator pointing at a node just after a leaf of the tree 🍃
• mapped_reference operator[] (key_const_reference r_key)
• size_type size () const
• void split (key_const_reference, tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc > &)
• void swap (tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc > &)
• point_iterator upper_bound (key_const_reference r_key)
• point_const_iterator upper_bound (key_const_reference r_key) const

⭐ Public Attributes

• no_throw_indicator m_no_throw_copies_indicator
• store_extra m_store_extra_indicator

---

🦋 Detailed Description

template<typename Key, typename Mapped, typename Cmp_Fn, typename
    Node_And_It_Traits, typename _Alloc>
    class __gnu_pbds::detail::ov_tree_map< Key, Mapped, Cmp_Fn,
    Node_And_It_Traits, _Alloc >

"Ordered-vector tree associative-container." — the original quote, verbatim, because it's iconic and we respect it 👑

That's the whole pitch. An ordered-vector tree. An associative container. It's giving data-structure main character energy and we're obsessed 🌈

---

✨ Member Function Documentation

🌳 node_begin

template<typename Key , typename Mapped , typename Cmp_Fn , typename
    Node_And_It_Traits , typename _Alloc > node_iterator
    __gnu_pbds::detail::ov_tree_map< Key, Mapped, Cmp_Fn,
    Node_And_It_Traits, _Alloc >::node_begin () [inline]

Returns a node_iterator corresponding to the node at the root of the tree. That's the top of the whole vibe, bestie — the main character node 💅

🌳 node_begin () const

template<typename Key , typename Mapped , typename Cmp_Fn , typename
    Node_And_It_Traits , typename _Alloc > node_const_iterator
    __gnu_pbds::detail::ov_tree_map< Key, Mapped, Cmp_Fn,
    Node_And_It_Traits, _Alloc >::node_begin () const [inline]

Returns a const node_iterator corresponding to the node at the root of the tree. Same root, but make it const — no touching, only admiring 🙈

🍃 node_end

template<typename Key , typename Mapped , typename Cmp_Fn , typename
    Node_And_It_Traits , typename _Alloc > node_iterator
    __gnu_pbds::detail::ov_tree_map< Key, Mapped, Cmp_Fn,
    Node_And_It_Traits, _Alloc >::node_end () [inline]

Returns a node_iterator corresponding to a node just after a leaf of the tree. It's the one-past-the-end situation but make it leafy 🍓

🍃 node_end () const

template<typename Key , typename Mapped , typename Cmp_Fn , typename
    Node_And_It_Traits , typename _Alloc > node_const_iterator
    __gnu_pbds::detail::ov_tree_map< Key, Mapped, Cmp_Fn,
    Node_And_It_Traits, _Alloc >::node_end () const [inline]

Returns a const node_iterator corresponding to a node just after a leaf of the tree. Constified leaf-adjacent action, slay 🧚

---

🎀 Author

Generated automatically by Doxygen for libstdc++, straight from the source code. Not a human, not a vibe curator — a documentation generator. And yet, here we are ✨

---

💖 that's the whole page, bestie — libstdc++ 3cxx manual, __gnu_pbds::detail::ov_tree_map, generated by Doxygen from the source code. go forth and be ordered-vector-tree-pilled 🫶🎀