folly::heap_vector_set

heap_vector_set is a specialization of heap_vector_container

Synopsis

Declared in <folly/container/heap_vector_types.h>

template<
    class T,
    class Compare = std::less<T>,
    class Allocator = std::allocator<T>,
    class GrowthPolicy = void,
    class Container = std::vector<T, Allocator>>
class heap_vector_set;

Types

Name
heap_iterator

Type Aliases

Name
allocator_type
const_iterator
const_reference
const_reverse_iterator
container_type
difference_type
iterator
key_compare
key_type
pointer
reference
reverse_iterator
size_type
value_compare
value_type

Member Functions

NameDescription
operator= Assignment operators
begin
capacity
cbegin
cend
clear
contains
count
crbegin
crend
data
emplace
emplace_hint
empty
end
equal_range
erase
find
get_allocator
get_container
insert
iterate
key_comp
lower_bound
max_size
rbegin
rend
reserve
shrink_to_fit
size
swap
swap_container Directly swap the container. Similar to swap()
upper_bound
value_comp
operator== Equality operator
operator!= Inequality operator
operator<=> Three-way comparison operator

Using Declarations

Name
Unnamed using

Protected Types

Name
EBO

Protected Type Aliases

Name
if_is_transparent
self_iterator_t

Protected Member Functions

Name
get_growth_policy

Protected Static Member Functions

Name
find_
lower_bound
upper_bound

Protected Data Members

Name
m_

Non-Member Functions

NameDescription
swapSwap function that can be found using ADL.

Template Parameters

NameDescription
TData type to store
CompareComparison function that imposes a strict weak ordering over instances of T
Allocatorallocation policy
GrowthPolicypolicy object to control growth
Containerunderlying vector where elements are stored