folly::sorted_vector_set::sorted_vector_set

Synopses

Declared in <folly/container/sorted_vector_types.h>

Constructs an empty set.

sorted_vector_set();

» more...

Copy-constructs from another set.

sorted_vector_set(sorted_vector_set const& other) = default;

» more...

Move-constructs from another set.

sorted_vector_set(sorted_vector_set&& other) = default;

» more...

Constructs an empty set using the given allocator.

explicit
sorted_vector_set(Allocator const& alloc);

» more...

Constructs a set from an initializer list using the given allocator.

sorted_vector_set(
    std::initializer_list<value_type> list,
    Allocator const& alloc);

» more...

Constructs an empty set with the given comparator and allocator.

explicit
sorted_vector_set(
    Compare const& comp,
    Allocator const& alloc = Allocator());

» more...

Copy-constructs from another set using the given allocator.

sorted_vector_set(
    sorted_vector_set const& other,
    Allocator const& alloc);

» more...

Construct a sorted_vector_set by stealing the storage of a prefilled container. The container need not be sorted already. This supports bulk construction of sorted_vector_set with zero allocations, not counting those performed by the caller. (The iterator range constructor performs at least one allocation).

explicit
sorted_vector_set(
    Container&& container,
    Compare const& comp = Compare());

» more...

Move-constructs from another set using the given allocator.

sorted_vector_set(
    sorted_vector_set&& other,
    Allocator const& alloc) noexcept(/* see-below */);

» more...

Construct a sorted_vector_set by stealing the storage of a prefilled container. Its elements must be sorted and unique, as sorted_unique_t hints. Supports bulk construction of sorted_vector_set with zero allocations, not counting those performed by the caller. (The iterator range constructor performs at least one allocation).

sorted_vector_set(
    sorted_unique_t tag,
    Container&& container,
    Compare const& comp = Compare()) noexcept(/* see-below */);

» more...

Constructs a set from an initializer list.

sorted_vector_set(
    std::initializer_list<value_type> list,
    Compare const& comp = Compare(),
    Allocator const& alloc = Allocator());

» more...

Constructs a set from the range [first, last) using the given allocator.]

template<class InputIterator>
sorted_vector_set(
    InputIterator first,
    InputIterator last,
    Allocator const& alloc);

» more...

Constructs a set from the elements in the range [first, last).]

template<class InputIterator>
sorted_vector_set(
    InputIterator first,
    InputIterator last,
    Compare const& comp = Compare(),
    Allocator const& alloc = Allocator());

» more...