heap_vector_set is a specialization of heap_vector_container
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;
| Name |
|---|
heap_iterator |
| Name | Description |
|---|---|
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 |
| Name |
|---|
Unnamed using |
| Name |
|---|
EBO |
| Name |
|---|
if_is_transparent |
self_iterator_t |
| Name |
|---|
get_growth_policy |
| Name |
|---|
find_ |
lower_bound |
upper_bound |
| Name |
|---|
m_ |
| Name | Description |
|---|---|
swap | Swap function that can be found using ADL. |
| Name | Description |
|---|---|
| T | Data type to store |
| Compare | Comparison function that imposes a strict weak ordering over instances of T |
| Allocator | allocation policy |
| GrowthPolicy | policy object to control growth |
| Container | underlying vector where elements are stored |