20 General utilities library [utilities]

20.7 Variants [variant]

20.7.1 In general [variant.general]

A variant object holds and manages the lifetime of a value.

If the variant holds a value, that value's type has to be one of the template argument types given to variant.

These template arguments are called alternatives.

20.7.2 Header <variant> synopsis [variant.syn]

#include <compare>              // see [compare.syn]

namespace std {
  // [variant.variant], class template variant
  template<class... Types>
    class variant;

  // [variant.helper], variant helper classes
  template<class T> struct variant_size;                        // not defined
  template<class T> struct variant_size<const T>;
  template<class T>
    inline constexpr size_t variant_size_v = variant_size<T>::value;

  template<class... Types>
    struct variant_size<variant<Types...>>;

  template<size_t I, class T> struct variant_alternative;       // not defined
  template<size_t I, class T> struct variant_alternative<I, const T>;
  template<size_t I, class T>
    using variant_alternative_t = typename variant_alternative<I, T>::type;

  template<size_t I, class... Types>
    struct variant_alternative<I, variant<Types...>>;

  inline constexpr size_t variant_npos = -1;

  // [variant.get], value access
  template<class T, class... Types>
    constexpr bool holds_alternative(const variant<Types...>&) noexcept;

  template<size_t I, class... Types>
    constexpr variant_alternative_t<I, variant<Types...>>& get(variant<Types...>&);
  template<size_t I, class... Types>
    constexpr variant_alternative_t<I, variant<Types...>>&& get(variant<Types...>&&);
  template<size_t I, class... Types>
    constexpr const variant_alternative_t<I, variant<Types...>>& get(const variant<Types...>&);
  template<size_t I, class... Types>
    constexpr const variant_alternative_t<I, variant<Types...>>&& get(const variant<Types...>&&);

  template<class T, class... Types>
    constexpr T& get(variant<Types...>&);
  template<class T, class... Types>
    constexpr T&& get(variant<Types...>&&);
  template<class T, class... Types>
    constexpr const T& get(const variant<Types...>&);
  template<class T, class... Types>
    constexpr const T&& get(const variant<Types...>&&);

  template<size_t I, class... Types>
    constexpr add_pointer_t<variant_alternative_t<I, variant<Types...>>>
      get_if(variant<Types...>*) noexcept;
  template<size_t I, class... Types>
    constexpr add_pointer_t<const variant_alternative_t<I, variant<Types...>>>
      get_if(const variant<Types...>*) noexcept;

  template<class T, class... Types>
    constexpr add_pointer_t<T>
      get_if(variant<Types...>*) noexcept;
  template<class T, class... Types>
    constexpr add_pointer_t<const T>
      get_if(const variant<Types...>*) noexcept;

  // [variant.relops], relational operators
  template<class... Types>
    constexpr bool operator==(const variant<Types...>&, const variant<Types...>&);
  template<class... Types>
    constexpr bool operator!=(const variant<Types...>&, const variant<Types...>&);
  template<class... Types>
    constexpr bool operator<(const variant<Types...>&, const variant<Types...>&);
  template<class... Types>
    constexpr bool operator>(const variant<Types...>&, const variant<Types...>&);
  template<class... Types>
    constexpr bool operator<=(const variant<Types...>&, const variant<Types...>&);
  template<class... Types>
    constexpr bool operator>=(const variant<Types...>&, const variant<Types...>&);
  template<class... Types> requires (three_way_comparable<Types> && ...)
    constexpr common_comparison_category_t<compare_three_way_result_t<Types>...>
      operator<=>(const variant<Types...>&, const variant<Types...>&);

  // [variant.visit], visitation
  template<class Visitor, class... Variants>
    constexpr see below visit(Visitor&&, Variants&&...);
  template<class R, class Visitor, class... Variants>
    constexpr R visit(Visitor&&, Variants&&...);

  // [variant.monostate], class monostate
  struct monostate;

  // [variant.monostate.relops], monostate relational operators
  constexpr bool operator==(monostate, monostate) noexcept;
  constexpr strong_ordering operator<=>(monostate, monostate) noexcept;

  // [variant.specalg], specialized algorithms
  template<class... Types>
    void swap(variant<Types...>&, variant<Types...>&) noexcept(see below);

  // [variant.bad.access], class bad_variant_access
  class bad_variant_access;

  // [variant.hash], hash support
  template<class T> struct hash;
  template<class... Types> struct hash<variant<Types...>>;
  template<> struct hash<monostate>;
}

20.7.3 Class template variant [variant.variant]

namespace std {
  template<class... Types>
  class variant {
  public:
    // [variant.ctor], constructors
    constexpr variant() noexcept(see below);
    constexpr variant(const variant&);
    constexpr variant(variant&&) noexcept(see below);

    template<class T>
      constexpr variant(T&&) noexcept(see below);

    template<class T, class... Args>
      constexpr explicit variant(in_place_type_t<T>, Args&&...);
    template<class T, class U, class... Args>
      constexpr explicit variant(in_place_type_t<T>, initializer_list<U>, Args&&...);

    template<size_t I, class... Args>
      constexpr explicit variant(in_place_index_t<I>, Args&&...);
    template<size_t I, class U, class... Args>
      constexpr explicit variant(in_place_index_t<I>, initializer_list<U>, Args&&...);

    // [variant.dtor], destructor
    ~variant();

    // [variant.assign], assignment
    constexpr variant& operator=(const variant&);
    constexpr variant& operator=(variant&&) noexcept(see below);

    template<class T> variant& operator=(T&&) noexcept(see below);

    // [variant.mod], modifiers
    template<class T, class... Args>
      T& emplace(Args&&...);
    template<class T, class U, class... Args>
      T& emplace(initializer_list<U>, Args&&...);
    template<size_t I, class... Args>
      variant_alternative_t<I, variant<Types...>>& emplace(Args&&...);
    template<size_t I, class U, class... Args>
      variant_alternative_t<I, variant<Types...>>& emplace(initializer_list<U>, Args&&...);

    // [variant.status], value status
    constexpr bool valueless_by_exception() const noexcept;
    constexpr size_t index() const noexcept;

    // [variant.swap], swap
    void swap(variant&) noexcept(see below);
  };
}

Any instance of variant at any given time either holds a value of one of its alternative types or holds no value.

When an instance of variant holds a value of alternative type T, it means that a value of type T, referred to as the variant object's contained value, is allocated within the storage of the variant object.

Implementations are not permitted to use additional storage, such as dynamic memory, to allocate the contained value.

The contained value shall be allocated in a region of the variant storage suitably aligned for all types in Types.

All types in Types shall meet the Cpp17Destructible requirements (Table 32).

A program that instantiates the definition of variant with no template arguments is ill-formed.

20.7.3.1 Constructors [variant.ctor]

In the descriptions that follow, let i be in the range [0, sizeof...(Types)), and

T_{i}

be the

i^{th}

type in Types.

🔗

constexpr variant() noexcept(see below);

Constraints: is_default_constructible_v<

T_{0}

> is true.

Effects: Constructs a variant holding a value-initialized value of type

T_{0}

Postconditions: valueless_by_exception() is false and index() is 0.

Throws: Any exception thrown by the value-initialization of

T_{0}

Remarks: This function is constexpr if and only if the value-initialization of the alternative type

T_{0}

would satisfy the requirements for a constexpr function.

The expression inside noexcept is equivalent to is_nothrow_default_constructible_v<

T_{0}

[ Note

20.7.3.2 Destructor [variant.dtor]

🔗

~variant();

Effects: If valueless_by_exception() is false, destroys the currently contained value.

Remarks: If is_trivially_destructible_v<

T_{i}

> is true for all

T_{i}

, then this destructor is trivial.

20.7.3.3 Assignment [variant.assign]

🔗

constexpr variant& operator=(const variant& rhs);

Let j be rhs.index().

Effects:

(2.1)
If neither *this nor rhs holds a value, there is no effect.
(2.2)
Otherwise, if *this holds a value but rhs does not, destroys the value contained in *this and sets *this to not hold a value.
(2.3)
Otherwise, if index() == j, assigns the value contained in rhs to the value contained in *this.
(2.4)
Otherwise, if either is_nothrow_copy_constructible_v< $T_{j}$ > is true or is_nothrow_move_constructible_v< $T_{j}$ > is false, equivalent to emplace<j>(get<j>(rhs)).
(2.5)
Otherwise, equivalent to operator=(variant(rhs)).

Returns: *this.

Postconditions: index() == rhs.index().

Remarks: This operator is defined as deleted unless is_copy_constructible_v<

T_{i}

> && is_copy_assignable_v<

T_{i}

> is true for all i.

If is_trivially_copy_constructible_v<

T_{i}

> && is_trivially_copy_assignable_v<

T_{i}

> && is_trivially_destructible_v<

T_{i}

> is true for all i, this assignment operator is trivial.

🔗

constexpr variant& operator=(variant&& rhs) noexcept(see below);

Let j be rhs.index().

Constraints: is_move_constructible_v<

T_{i}

> && is_move_assignable_v<

T_{i}

> is true for all i.

Effects:

(8.1)
If neither *this nor rhs holds a value, there is no effect.
(8.2)
Otherwise, if *this holds a value but rhs does not, destroys the value contained in *this and sets *this to not hold a value.
(8.3)
Otherwise, if index() == j, assigns get<j>(std::move(rhs)) to the value contained in *this.
(8.4)
Otherwise, equivalent to emplace<j>(get<j>(std::move(rhs))).

Returns: *this.

Remarks: If is_trivially_move_constructible_v<

T_{i}

> && is_trivially_move_assignable_v<

T_{i}

> && is_trivially_destructible_v<

T_{i}

> is true for all i, this assignment operator is trivial.

The expression inside noexcept is equivalent to: is_nothrow_move_constructible_v<

T_{i}

> && is_nothrow_move_assignable_v<

T_{i}

> for all i.

(10.1)
If an exception is thrown during the call to $T_{j}$ 's move construction (with j being rhs.index()), the variant will hold no value.
(10.2)
If an exception is thrown during the call to $T_{j}$ 's move assignment, the state of the contained value is as defined by the exception safety guarantee of $T_{j}$ 's move assignment; index() will be j.

🔗

template<class T> variant& operator=(T&& t) noexcept(see below);

Let

T_{j}

be a type that is determined as follows: build an imaginary function FUN(

T_{i}

) for each alternative type

T_{i}

for which

T_{i}

x[] = {std::forward<T>(t)}; is well-formed for some invented variable x.

The overload FUN(

T_{j}

) selected by overload resolution for the expression FUN(std::forward<T>(t)) defines the alternative

T_{j}

which is the type of the contained value after assignment.

Constraints:

(12.1)
is_same_v<remove_cvref_t<T>, variant> is false,
(12.2)
is_assignable_v< $T_{j}$ &, T> && is_constructible_v< $T_{j}$ , T> is true, and
(12.3)
the expression FUN(std::forward<T>(t)) (with FUN being the above-mentioned set of imaginary functions) is well-formed.
[ Note
:
```
variant<string, string> v;
v = "abc";
```
is ill-formed, as both alternative types have an equally viable constructor for the argument. — end note
]

Effects:

(13.1)
If *this holds a $T_{j}$ , assigns std::forward<T>(t) to the value contained in *this.
(13.2)
Otherwise, if is_nothrow_constructible_v< $T_{j}$ , T> || !is_nothrow_move_constructible_v< $T_{j}$ > is true, equivalent to emplace<j>(std::forward<T>(t)).
(13.3)
Otherwise, equivalent to operator=(variant(std::forward<T>(t))).

Postconditions: holds_alternative<

T_{j}

>(*this) is true, with

T_{j}

selected by the imaginary function overload resolution described above.

Returns: *this.

Remarks: The expression inside noexcept is equivalent to:

is_nothrow_assignable_v<T $_{j}$ &, T> && is_nothrow_constructible_v<T $_{j}$ , T>

(16.1)
If an exception is thrown during the assignment of std::forward<T>(t) to the value contained in *this, the state of the contained value and t are as defined by the exception safety guarantee of the assignment expression; valueless_by_exception() will be false.
(16.2)
If an exception is thrown during the initialization of the contained value, the variant object might not hold a value.

20.7.3.4 Modifiers [variant.mod]

🔗

template<class T, class... Args> T& emplace(Args&&... args);

Constraints: is_constructible_v<T, Args...> is true, and T occurs exactly once in Types.

Effects: Equivalent to:

return emplace<I>(std::forward<Args>(args)...);

where I is the zero-based index of T in Types.

🔗

template<class T, class U, class... Args> T& emplace(initializer_list<U> il, Args&&... args);

Constraints: is_constructible_v<T, initializer_list&, Args...> is true, and T occurs exactly once in Types.

Effects: Equivalent to:

return emplace<I>(il, std::forward<Args>(args)...);

where I is the zero-based index of T in Types.

🔗

template<size_t I, class... Args>
  variant_alternative_t<I, variant<Types...>>& emplace(Args&&... args);

Mandates:

I < sizeof...(Types)

Constraints: is_constructible_v<

T_{I}

, Args...> is true.

Effects: Destroys the currently contained value if valueless_by_exception() is false.

Then initializes the contained value as if direct-non-list-initializing a value of type

T_{I}

with the arguments std::forward<Args>(args)....

Postconditions: index() is I.

Returns: A reference to the new contained value.

Throws: Any exception thrown during the initialization of the contained value.

Remarks: If an exception is thrown during the initialization of the contained value, the variant might not hold a value.

🔗

template<size_t I, class U, class... Args>
  variant_alternative_t<I, variant<Types...>>& emplace(initializer_list<U> il, Args&&... args);

Mandates:

I < sizeof...(Types)

Constraints: is_constructible_v<

T_{I}

, initializer_list&, Args...> is true.

Effects: Destroys the currently contained value if valueless_by_exception() is false.

Then initializes the contained value as if direct-non-list-initializing a value of type

T_{I}

with the arguments il, std::forward<Args>(args)....

Postconditions: index() is I.

Returns: A reference to the new contained value.

Throws: Any exception thrown during the initialization of the contained value.

Remarks: If an exception is thrown during the initialization of the contained value, the variant might not hold a value.

20.7.3.5 Value status [variant.status]

🔗

constexpr bool valueless_by_exception() const noexcept;

Effects: Returns false if and only if the variant holds a value.

[ Note

A variant might not hold a value if an exception is thrown during a type-changing assignment or emplacement.

The latter means that even a variant<float, int> can become valueless_by_exception(), for instance by

struct S { operator int() { throw 42; }};
variant<float, int> v{12.f};
v.emplace<1>(S());

— end note

]

🔗

constexpr size_t index() const noexcept;

Effects: If valueless_by_exception() is true, returns variant_npos.

Otherwise, returns the zero-based index of the alternative of the contained value.

20.7.3.6 Swap [variant.swap]

🔗

void swap(variant& rhs) noexcept(see below);

Mandates: is_move_constructible_v<

T_{i}

> is true for all i.

Preconditions: Lvalues of type

T_{i}

are swappable ([swappable.requirements]).

Effects:

(3.1)
If valueless_by_exception() && rhs.valueless_by_exception() no effect.
(3.2)
Otherwise, if index() == rhs.index(), calls swap(get(*this), get(rhs)) where i is index().
(3.3)
Otherwise, exchanges values of rhs and *this.

Throws: If index() == rhs.index(), any exception thrown by swap(get(*this), get(rhs)) with i being index().

Otherwise, any exception thrown by the move constructor of

T_{i}

T_{j}

with i being index() and j being rhs.index().

Remarks: If an exception is thrown during the call to function swap(get(*this), get(rhs)), the states of the contained values of *this and of rhs are determined by the exception safety guarantee of swap for lvalues of

T_{i}

with i being index().

If an exception is thrown during the exchange of the values of *this and rhs, the states of the values of *this and of rhs are determined by the exception safety guarantee of variant's move constructor.

The expression inside noexcept is equivalent to the logical AND of is_nothrow_move_constructible_v<

T_{i}

> && is_nothrow_swappable_v<

T_{i}

> for all i.

20.7.4 variant helper classes [variant.helper]

🔗

template<class T> struct variant_size;

All specializations of variant_size meet the Cpp17UnaryTypeTrait requirements ([meta.rqmts]) with a base characteristic of integral_constant<size_t, N> for some N.

🔗

template<class T> class variant_size<const T>;

Let VS denote variant_size<T> of the cv-unqualified type T.

Then each specialization of the template meets the Cpp17UnaryTypeTrait requirements ([meta.rqmts]) with a base characteristic of integral_constant<size_t, VS::value>.

🔗

template<class... Types>
  struct variant_size<variant<Types...>> : integral_constant<size_t, sizeof...(Types)> { };

🔗

template<size_t I, class T> class variant_alternative<I, const T>;

Let VA denote variant_alternative<I, T> of the cv-unqualified type T.

Then each specialization of the template meets the Cpp17TransformationTrait requirements ([meta.rqmts]) with a member typedef type that names the type add_const_t<VA::type>.

🔗

variant_alternative<I, variant<Types...>>::type

Mandates:

I < sizeof...(Types)

Type: The type

T_{I}

20.7.5 Value access [variant.get]

🔗

template<class T, class... Types>
  constexpr bool holds_alternative(const variant<Types...>& v) noexcept;

Mandates: The type T occurs exactly once in Types.

Returns: true if index() is equal to the zero-based index of T in Types.

🔗

template<size_t I, class... Types>
  constexpr variant_alternative_t<I, variant<Types...>>& get(variant<Types...>& v);
template<size_t I, class... Types>
  constexpr variant_alternative_t<I, variant<Types...>>&& get(variant<Types...>&& v);
template<size_t I, class... Types>
  constexpr const variant_alternative_t<I, variant<Types...>>& get(const variant<Types...>& v);
template<size_t I, class... Types>
  constexpr const variant_alternative_t<I, variant<Types...>>&& get(const variant<Types...>&& v);

Mandates:

I < sizeof...(Types)

Effects: If v.index() is I, returns a reference to the object stored in the variant.

Otherwise, throws an exception of type bad_variant_access.

🔗

template<class T, class... Types> constexpr T& get(variant<Types...>& v);
template<class T, class... Types> constexpr T&& get(variant<Types...>&& v);
template<class T, class... Types> constexpr const T& get(const variant<Types...>& v);
template<class T, class... Types> constexpr const T&& get(const variant<Types...>&& v);

Mandates: The type T occurs exactly once in Types.

Effects: If v holds a value of type T, returns a reference to that value.

Otherwise, throws an exception of type bad_variant_access.

🔗

template<size_t I, class... Types>
  constexpr add_pointer_t<variant_alternative_t<I, variant<Types...>>>
    get_if(variant<Types...>* v) noexcept;
template<size_t I, class... Types>
  constexpr add_pointer_t<const variant_alternative_t<I, variant<Types...>>>
    get_if(const variant<Types...>* v) noexcept;

Mandates:

I < sizeof...(Types)

Returns: A pointer to the value stored in the variant, if v != nullptr and v->index() == I.

Otherwise, returns nullptr.

🔗

template<class T, class... Types>
  constexpr add_pointer_t<T>
    get_if(variant<Types...>* v) noexcept;
template<class T, class... Types>
  constexpr add_pointer_t<const T>
    get_if(const variant<Types...>* v) noexcept;

Mandates: The type T occurs exactly once in Types.

Effects: Equivalent to: return get_if(v); with i being the zero-based index of T in Types.

20.7.6 Relational operators [variant.relops]

🔗

template<class... Types>
  constexpr bool operator==(const variant<Types...>& v, const variant<Types...>& w);

Mandates: get(v) == get(w) is a valid expression that is convertible to bool, for all i.

Returns: If v.index() != w.index(), false; otherwise if v.valueless_by_exception(), true; otherwise get(v) == get(w) with i being v.index().

🔗

template<class... Types>
  constexpr bool operator!=(const variant<Types...>& v, const variant<Types...>& w);

Mandates: get(v) != get(w) is a valid expression that is convertible to bool, for all i.

Returns: If v.index() != w.index(), true; otherwise if v.valueless_by_exception(), false; otherwise get(v) != get(w) with i being v.index().

🔗

template<class... Types>
  constexpr bool operator<(const variant<Types...>& v, const variant<Types...>& w);

Mandates: get(v) < get(w) is a valid expression that is convertible to bool, for all i.

Returns: If w.valueless_by_exception(), false; otherwise if v.valueless_by_exception(), true; otherwise, if v.index() < w.index(), true; otherwise if v.index() > w.index(), false; otherwise get(v) < get(w) with i being v.index().

🔗

template<class... Types>
  constexpr bool operator>(const variant<Types...>& v, const variant<Types...>& w);

Mandates: get(v) > get(w) is a valid expression that is convertible to bool, for all i.

Returns: If v.valueless_by_exception(), false; otherwise if w.valueless_by_exception(), true; otherwise, if v.index() > w.index(), true; otherwise if v.index() < w.index(), false; otherwise get(v) > get(w) with i being v.index().

🔗

template<class... Types>
  constexpr bool operator<=(const variant<Types...>& v, const variant<Types...>& w);

Mandates: get(v) <= get(w) is a valid expression that is convertible to bool, for all i.

Returns: If v.valueless_by_exception(), true; otherwise if w.valueless_by_exception(), false; otherwise, if v.index() < w.index(), true; otherwise if v.index() > w.index(), false; otherwise get(v) <= get(w) with i being v.index().

🔗

template<class... Types>
  constexpr bool operator>=(const variant<Types...>& v, const variant<Types...>& w);

Mandates: get(v) >= get(w) is a valid expression that is convertible to bool, for all i.

Returns: If w.valueless_by_exception(), true; otherwise if v.valueless_by_exception(), false; otherwise, if v.index() > w.index(), true; otherwise if v.index() < w.index(), false; otherwise get(v) >= get(w) with i being v.index().

🔗

template<class... Types> requires (three_way_comparable<Types> && ...)
  constexpr common_comparison_category_t<compare_three_way_result_t<Types>...>
    operator<=>(const variant<Types...>& v, const variant<Types...>& w);

Effects: Equivalent to:

if (v.valueless_by_exception() && w.valueless_by_exception())
  return strong_ordering::equal;
if (v.valueless_by_exception()) return strong_ordering::less;
if (w.valueless_by_exception()) return strong_ordering::greater;
if (auto c = v.index() <=> w.index(); c != 0) return c;
return get<i>(v) <=> get<i>(w);

with i being v.index().

20.7.7 Visitation [variant.visit]

🔗

template<class Visitor, class... Variants>
  constexpr see below visit(Visitor&& vis, Variants&&... vars);
template<class R, class Visitor, class... Variants>
  constexpr R visit(Visitor&& vis, Variants&&... vars);

Let n be sizeof...(Variants).

Let m be a pack of n values of type size_t.

Such a pack is called valid if

0 \leq m_{i} < {variant_size_v<remove_reference_t<Variants}_{i} >>

for all

0 \leq i < n

For each valid pack m, let e(m) denote the expression:

INVOKE(std::forward<Visitor>(vis), get<m>(std::forward<Variants>(vars))...) // see [func.require]

for the first form and

INVOKE<R>(std::forward<Visitor>(vis), get<m>(std::forward<Variants>(vars))...) // see [func.require]

for the second form.

Mandates: For each valid pack m, e(m) is a valid expression.

All such expressions are of the same type and value category.

Returns: e(m), where m is the pack for which

m_{i}

is vars

_{i}

.index() for all

0 \leq i < n

The return type is decltype(e(m)) for the first form.

Throws: bad_variant_access if any variant in vars is valueless_by_exception().

Complexity: For

n \leq 1

, the invocation of the callable object is implemented in constant time, i.e., for

n = 1

, it does not depend on the number of alternative types of

{Variants}_{0}

For

n > 1

, the invocation of the callable object has no complexity requirements.

20.7.8 Class monostate [variant.monostate]

🔗

struct monostate{};

The class monostate can serve as a first alternative type for a variant to make the variant type default constructible.

20.7.9 monostate relational operators [variant.monostate.relops]

🔗

constexpr bool operator==(monostate, monostate) noexcept { return true; }
constexpr strong_ordering operator<=>(monostate, monostate) noexcept
{ return strong_ordering::equal; }

[ Note

monostate objects have only a single state; they thus always compare equal.

— end note

]

20.7.10 Specialized algorithms [variant.specalg]

🔗

template<class... Types>
  void swap(variant<Types...>& v, variant<Types...>& w) noexcept(see below);

Constraints: is_move_constructible_v<

T_{i}

> && is_swappable_v<

T_{i}

> is true for all i.

Effects: Equivalent to v.swap(w).

Remarks: The expression inside noexcept is equivalent to noexcept(v.swap(w)).

20.7.11 Class bad_variant_access [variant.bad.access]

class bad_variant_access : public exception {
public:
  // see [exception] for the specification of the special member functions
  const char* what() const noexcept override;
};

Objects of type bad_variant_access are thrown to report invalid accesses to the value of a variant object.

🔗

const char* what() const noexcept override;

Returns: An implementation-defined ntbs.

20.7.12 Hash support [variant.hash]

🔗

template<class... Types> struct hash<variant<Types...>>;

The specialization hash<variant<Types...>> is enabled ([unord.hash]) if and only if every specialization in hash<remove_const_t<Types>>... is enabled.

The member functions are not guaranteed to be noexcept.

🔗

template<> struct hash<monostate>;

The specialization is enabled ([unord.hash]).

20 General utilities library [utilities]

20.7 Variants [variant]

20.7.1 In general [variant.general]

20.7.2 Header <variant> synopsis [variant.syn]

20.7.3 Class template variant [variant.variant]

20.7.3.1 Constructors [variant.ctor]

20.7.3.2 Destructor [variant.dtor]

20.7.3.3 Assignment [variant.assign]

20.7.3.4 Modifiers [variant.mod]

20.7.3.5 Value status [variant.status]

20.7.3.6 Swap [variant.swap]

20.7.4 variant helper classes [variant.helper]

20.7.5 Value access [variant.get]

20.7.6 Relational operators [variant.relops]

20.7.7 Visitation [variant.visit]

20.7.8 Class monostate [variant.monostate]

20.7.9 monostate relational operators [variant.monostate.relops]

20.7.10 Specialized algorithms [variant.specalg]

20.7.11 Class bad_­variant_­access [variant.bad.access]

20.7.12 Hash support [variant.hash]

20.7.11 Class bad_variant_access [variant.bad.access]