Public Member Functions | Private Types | List of all members
absl::btree_set< Key, Compare, Alloc > Class Template Reference

#include <btree_set.h>

Inheritance diagram for absl::btree_set< Key, Compare, Alloc >:
Inheritance graph
[legend]

Public Member Functions

 Base (int an_x)
 
 Base (int an_x)
 
 Base (int an_x)
 
 Base (int an_x)
 
 Base (int an_x)
 
 Base (int an_x)
 
 Base (int an_x)
 
 Base (int an_x)
 
 Base (int an_x)
 
 Base (int an_x)
 
 btree_set ()
 
 btree_set ()
 
- Public Member Functions inherited from absl::container_internal::btree_set_container< container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > >
 btree_set_container ()
 
 btree_set_container ()
 
 btree_set_container (InputIterator b, InputIterator e, const allocator_type &alloc)
 
 btree_set_container (InputIterator b, InputIterator e, const allocator_type &alloc)
 
 btree_set_container (InputIterator b, InputIterator e, const key_compare &comp=key_compare(), const allocator_type &alloc=allocator_type())
 
 btree_set_container (InputIterator b, InputIterator e, const key_compare &comp=key_compare(), const allocator_type &alloc=allocator_type())
 
 btree_set_container (std::initializer_list< init_type > init, const allocator_type &alloc)
 
 btree_set_container (std::initializer_list< init_type > init, const allocator_type &alloc)
 
 btree_set_container (std::initializer_list< init_type > init, const key_compare &comp=key_compare(), const allocator_type &alloc=allocator_type())
 
 btree_set_container (std::initializer_list< init_type > init, const key_compare &comp=key_compare(), const allocator_type &alloc=allocator_type())
 
std::pair< iterator, bool > emplace (Args &&... args)
 
std::pair< iterator, bool > emplace (Args &&... args)
 
iterator emplace_hint (const_iterator hint, Args &&... args)
 
iterator emplace_hint (const_iterator hint, Args &&... args)
 
node_type extract (const key_arg< K > &key)
 
node_type extract (const key_arg< K > &key)
 
node_type extract (const_iterator position)
 
node_type extract (const_iterator position)
 
node_type extract (const_iterator position)
 
node_type extract (const_iterator position)
 
node_type extract (iterator position)
 
node_type extract (iterator position)
 
node_type extract (iterator position)
 
node_type extract (iterator position)
 
std::pair< iterator, bool > insert (const value_type &v)
 
std::pair< iterator, bool > insert (const value_type &v)
 
iterator insert (const_iterator hint, const value_type &v)
 
iterator insert (const_iterator hint, const value_type &v)
 
iterator insert (const_iterator hint, node_type &&node)
 
iterator insert (const_iterator hint, node_type &&node)
 
iterator insert (const_iterator hint, value_type &&v)
 
iterator insert (const_iterator hint, value_type &&v)
 
void insert (InputIterator b, InputIterator e)
 
void insert (InputIterator b, InputIterator e)
 
insert_return_type insert (node_type &&node)
 
insert_return_type insert (node_type &&node)
 
void insert (std::initializer_list< init_type > init)
 
void insert (std::initializer_list< init_type > init)
 
std::pair< iterator, bool > insert (value_type &&v)
 
std::pair< iterator, bool > insert (value_type &&v)
 
void merge (btree_container< T > &&src)
 
void merge (btree_container< T > &&src)
 
void merge (btree_container< T > &src)
 
void merge (btree_container< T > &src)
 
- Public Member Functions inherited from absl::container_internal::btree_container< container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > >
iterator begin ()
 
iterator begin ()
 
const_iterator begin () const
 
const_iterator begin () const
 
 btree_container ()
 
 btree_container ()
 
 btree_container (btree_container &&other) noexcept(std::is_nothrow_move_constructible< container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > >::value)=default
 
 btree_container (btree_container &&other) noexcept(std::is_nothrow_move_constructible< container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > >::value)=default
 
 btree_container (btree_container &&other, const allocator_type &alloc)
 
 btree_container (btree_container &&other, const allocator_type &alloc)
 
 btree_container (const allocator_type &alloc)
 
 btree_container (const allocator_type &alloc)
 
 btree_container (const btree_container &other)
 
 btree_container (const btree_container &other)
 
 btree_container (const btree_container &other, const allocator_type &alloc)
 
 btree_container (const btree_container &other, const allocator_type &alloc)
 
 btree_container (const key_compare &comp, const allocator_type &alloc=allocator_type())
 
 btree_container (const key_compare &comp, const allocator_type &alloc=allocator_type())
 
const_iterator cbegin () const
 
const_iterator cbegin () const
 
const_iterator cend () const
 
const_iterator cend () const
 
void clear ()
 
ABSL_ATTRIBUTE_REINITIALIZES void clear ()
 
bool contains (const key_arg< K > &key) const
 
bool contains (const key_arg< K > &key) const
 
size_type count (const key_arg< K > &key) const
 
size_type count (const key_arg< K > &key) const
 
const_reverse_iterator crbegin () const
 
const_reverse_iterator crbegin () const
 
const_reverse_iterator crend () const
 
const_reverse_iterator crend () const
 
bool empty () const
 
bool empty () const
 
iterator end ()
 
iterator end ()
 
const_iterator end () const
 
const_iterator end () const
 
std::pair< iterator, iterator > equal_range (const key_arg< K > &key)
 
std::pair< iterator, iterator > equal_range (const key_arg< K > &key)
 
std::pair< const_iterator, const_iterator > equal_range (const key_arg< K > &key) const
 
std::pair< const_iterator, const_iterator > equal_range (const key_arg< K > &key) const
 
size_type erase (const key_arg< K > &key)
 
size_type erase (const key_arg< K > &key)
 
iterator erase (const_iterator first, const_iterator last)
 
iterator erase (const_iterator first, const_iterator last)
 
iterator erase (const_iterator iter)
 
iterator erase (const_iterator iter)
 
iterator erase (iterator iter)
 
iterator erase (iterator iter)
 
node_type extract (const_iterator position)
 
node_type extract (const_iterator position)
 
node_type extract (iterator position)
 
node_type extract (iterator position)
 
iterator find (const key_arg< K > &key)
 
iterator find (const key_arg< K > &key)
 
const_iterator find (const key_arg< K > &key) const
 
const_iterator find (const key_arg< K > &key) const
 
allocator_type get_allocator () const
 
allocator_type get_allocator () const
 
key_compare key_comp () const
 
key_compare key_comp () const
 
iterator lower_bound (const key_arg< K > &key)
 
iterator lower_bound (const key_arg< K > &key)
 
const_iterator lower_bound (const key_arg< K > &key) const
 
const_iterator lower_bound (const key_arg< K > &key) const
 
size_type max_size () const
 
size_type max_size () const
 
btree_container & operator= (btree_container &&other) noexcept(std::is_nothrow_move_assignable< container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > >::value)=default
 
btree_container & operator= (btree_container &&other) noexcept(std::is_nothrow_move_assignable< container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > >::value)=default
 
btree_container & operator= (const btree_container &other)=default
 
btree_container & operator= (const btree_container &other)=default
 
reverse_iterator rbegin ()
 
reverse_iterator rbegin ()
 
const_reverse_iterator rbegin () const
 
const_reverse_iterator rbegin () const
 
reverse_iterator rend ()
 
reverse_iterator rend ()
 
const_reverse_iterator rend () const
 
const_reverse_iterator rend () const
 
size_type size () const
 
size_type size () const
 
void swap (btree_container &other)
 
void swap (btree_container &other)
 
iterator upper_bound (const key_arg< K > &key)
 
iterator upper_bound (const key_arg< K > &key)
 
const_iterator upper_bound (const key_arg< K > &key) const
 
const_iterator upper_bound (const key_arg< K > &key) const
 
value_compare value_comp () const
 
value_compare value_comp () const
 
void verify () const
 
void verify () const
 

Private Types

using Base = typename btree_set::btree_set_container
 
using Base = typename btree_set::btree_set_container
 

Additional Inherited Members

- Public Types inherited from absl::container_internal::btree_set_container< container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > >
using allocator_type = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::allocator_type
 
using allocator_type = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::allocator_type
 
using const_iterator = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::const_iterator
 
using const_iterator = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::const_iterator
 
using insert_return_type = InsertReturnType< iterator, node_type >
 
using insert_return_type = InsertReturnType< iterator, node_type >
 
using iterator = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::iterator
 
using iterator = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::iterator
 
using key_compare = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::key_compare
 
using key_compare = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::original_key_compare
 
using key_type = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::key_type
 
using key_type = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::key_type
 
using node_type = typename super_type::node_type
 
using node_type = typename super_type::node_type
 
using size_type = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::size_type
 
using size_type = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::size_type
 
using value_type = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::value_type
 
using value_type = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::value_type
 
- Public Types inherited from absl::container_internal::btree_container< container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > >
using allocator_type = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::allocator_type
 
using allocator_type = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::allocator_type
 
using const_iterator = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::const_iterator
 
using const_iterator = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::const_iterator
 
using const_pointer = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::const_pointer
 
using const_pointer = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::const_pointer
 
using const_reference = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::const_reference
 
using const_reference = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::const_reference
 
using const_reverse_iterator = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::const_reverse_iterator
 
using const_reverse_iterator = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::const_reverse_iterator
 
using difference_type = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::difference_type
 
using difference_type = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::difference_type
 
using iterator = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::iterator
 
using iterator = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::iterator
 
using key_compare = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::key_compare
 
using key_compare = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::original_key_compare
 
using key_type = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::key_type
 
using key_type = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::key_type
 
using node_type = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::node_handle_type
 
using node_type = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::node_handle_type
 
using pointer = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::pointer
 
using pointer = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::pointer
 
using reference = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::reference
 
using reference = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::reference
 
using reverse_iterator = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::reverse_iterator
 
using reverse_iterator = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::reverse_iterator
 
using size_type = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::size_type
 
using size_type = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::size_type
 
using value_compare = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::value_compare
 
using value_compare = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::value_compare
 
using value_type = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::value_type
 
using value_type = typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::value_type
 
- Protected Types inherited from absl::container_internal::btree_set_container< container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > >
using key_arg = typename super_type::template key_arg< K >
 
using key_arg = typename super_type::template key_arg< K >
 
- Protected Types inherited from absl::container_internal::btree_container< container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > >
using key_arg = typename KeyArg< IsTransparent< typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::key_compare >::value >::template type< K, typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::key_type >
 
using key_arg = typename KeyArg< params_type::kIsKeyCompareTransparent >::template type< K, typename container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > ::key_type >
 
- Protected Attributes inherited from absl::container_internal::btree_container< container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > >
container_internal::btree< container_internal::set_params< Key, std::less< Key >, std::allocator< Key >, 256, false > > tree_
 

Detailed Description

template<typename Key, typename Compare = std::less<Key>, typename Alloc = std::allocator<Key>>
class absl::btree_set< Key, Compare, Alloc >

Definition at line 86 of file abseil-cpp/absl/container/btree_set.h.

Member Typedef Documentation

◆ Base [1/2]

template<typename Key , typename Compare = std::less<Key>, typename Alloc = std::allocator<Key>>
using absl::btree_set< Key, Compare, Alloc >::Base = typename btree_set::btree_set_container
private

Definition at line 78 of file bloaty/third_party/abseil-cpp/absl/container/btree_set.h.

◆ Base [2/2]

template<typename Key , typename Compare = std::less<Key>, typename Alloc = std::allocator<Key>>
using absl::btree_set< Key, Compare, Alloc >::Base = typename btree_set::btree_set_container
private

Definition at line 91 of file abseil-cpp/absl/container/btree_set.h.

Constructor & Destructor Documentation

◆ btree_set() [1/2]

template<typename Key , typename Compare = std::less<Key>, typename Alloc = std::allocator<Key>>
absl::btree_set< Key, Compare, Alloc >::btree_set ( )
inline

Definition at line 132 of file abseil-cpp/absl/container/btree_set.h.

◆ btree_set() [2/2]

template<typename Key , typename Compare = std::less<Key>, typename Alloc = std::allocator<Key>>
absl::btree_set< Key, Compare, Alloc >::btree_set ( )
inline

Definition at line 119 of file bloaty/third_party/abseil-cpp/absl/container/btree_set.h.

Member Function Documentation

◆ Base() [1/10]

template<typename Key , typename Compare = std::less<Key>, typename Alloc = std::allocator<Key>>
Base::Base
inlineexplicit

Definition at line 5143 of file bloaty/third_party/googletest/googletest/test/gtest_unittest.cc.

◆ Base() [2/10]

template<typename Key , typename Compare = std::less<Key>, typename Alloc = std::allocator<Key>>
Base::Base
inlineexplicit

Definition at line 5215 of file boringssl-with-bazel/src/third_party/googletest/test/gtest_unittest.cc.

◆ Base() [3/10]

template<typename Key , typename Compare = std::less<Key>, typename Alloc = std::allocator<Key>>
Base::Base
inlineexplicit

Definition at line 5194 of file googletest/googletest/test/gtest_unittest.cc.

◆ Base() [4/10]

template<typename Key , typename Compare = std::less<Key>, typename Alloc = std::allocator<Key>>
Base::Base
inlineexplicit

Definition at line 5170 of file protobuf/third_party/googletest/googletest/test/gtest_unittest.cc.

◆ Base() [5/10]

template<typename Key , typename Compare = std::less<Key>, typename Alloc = std::allocator<Key>>
Base::Base
inlineexplicit

Definition at line 5170 of file bloaty/third_party/protobuf/third_party/googletest/googletest/test/gtest_unittest.cc.

◆ Base() [6/10]

template<typename Key , typename Compare = std::less<Key>, typename Alloc = std::allocator<Key>>
Base::Base
inlineexplicit

Definition at line 5215 of file boringssl-with-bazel/src/third_party/googletest/test/gtest_unittest.cc.

◆ Base() [7/10]

template<typename Key , typename Compare = std::less<Key>, typename Alloc = std::allocator<Key>>
Base::Base
inlineexplicit

Definition at line 5170 of file bloaty/third_party/protobuf/third_party/googletest/googletest/test/gtest_unittest.cc.

◆ Base() [8/10]

template<typename Key , typename Compare = std::less<Key>, typename Alloc = std::allocator<Key>>
Base::Base
inlineexplicit

Definition at line 5170 of file protobuf/third_party/googletest/googletest/test/gtest_unittest.cc.

◆ Base() [9/10]

template<typename Key , typename Compare = std::less<Key>, typename Alloc = std::allocator<Key>>
Base::Base
inlineexplicit

Definition at line 5143 of file bloaty/third_party/googletest/googletest/test/gtest_unittest.cc.

◆ Base() [10/10]

template<typename Key , typename Compare = std::less<Key>, typename Alloc = std::allocator<Key>>
Base::Base
inlineexplicit

Definition at line 5194 of file googletest/googletest/test/gtest_unittest.cc.

The documentation for this class was generated from the following file:

grpc
Author(s):
autogenerated on Fri May 16 2025 03:02:08