From Jason Turner

[variant.syn]

Diff to HTML by rtfpessoa

tmp/tmpiix731ia/{from.md → to.md} RENAMED
@@ -10,11 +10,11 @@ namespace std {
10
 
11
  // [variant.helper], variant helper classes
12
  template<class T> struct variant_size; // not defined
13
  template<class T> struct variant_size<const T>;
14
  template<class T>
15
- inline constexpr size_t variant_size_v = variant_size<T>::value;
16
 
17
  template<class... Types>
18
  struct variant_size<variant<Types...>>;
19
 
20
  template<size_t I, class T> struct variant_alternative; // not defined
@@ -93,11 +93,11 @@ namespace std {
93
  constexpr bool operator==(monostate, monostate) noexcept;
94
  constexpr strong_ordering operator<=>(monostate, monostate) noexcept;
95
 
96
  // [variant.specalg], specialized algorithms
97
  template<class... Types>
98
- void swap(variant<Types...>&, variant<Types...>&) noexcept(see below);
99
 
100
  // [variant.bad.access], class bad_variant_access
101
  class bad_variant_access;
102
 
103
  // [variant.hash], hash support
 
10
 
11
  // [variant.helper], variant helper classes
12
  template<class T> struct variant_size; // not defined
13
  template<class T> struct variant_size<const T>;
14
  template<class T>
15
+ constexpr size_t variant_size_v = variant_size<T>::value;
16
 
17
  template<class... Types>
18
  struct variant_size<variant<Types...>>;
19
 
20
  template<size_t I, class T> struct variant_alternative; // not defined
 
93
  constexpr bool operator==(monostate, monostate) noexcept;
94
  constexpr strong_ordering operator<=>(monostate, monostate) noexcept;
95
 
96
  // [variant.specalg], specialized algorithms
97
  template<class... Types>
98
+ constexpr void swap(variant<Types...>&, variant<Types...>&) noexcept(see below);
99
 
100
  // [variant.bad.access], class bad_variant_access
101
  class bad_variant_access;
102
 
103
  // [variant.hash], hash support