|
| 1 | +#include <tuple> |
| 2 | + // provides std::tuple_element to be able to index a pack of types, |
| 3 | + // indirectly includes type traits and utility |
| 4 | +#include <new> |
| 5 | + |
| 6 | +namespace zoo { |
| 7 | + |
| 8 | +template<typename T> |
| 9 | +void swap(T &t1, T &t2) { |
| 10 | + T temporary{std::move(t1)}; |
| 11 | + t1 = std::move(t2); |
| 12 | + t2 = std::move(temporary); |
| 13 | +} |
| 14 | + |
| 15 | +struct Maxer { |
| 16 | + int v_; |
| 17 | + constexpr Maxer(int v): v_{v} {} |
| 18 | + constexpr operator int() const { return v_; } |
| 19 | + constexpr Maxer operator*(Maxer o) const { return v_ < o.v_ ? o.v_ : v_; } |
| 20 | +}; |
| 21 | + |
| 22 | +template<int... Ints> |
| 23 | +constexpr auto Largest = int{(Maxer{0} * ... * Maxer(Ints))}; |
| 24 | + |
| 25 | +template<typename... Ts> |
| 26 | +constexpr auto LargestSize = Largest<sizeof(Ts)...>; |
| 27 | + |
| 28 | +template<typename... Ts> |
| 29 | +constexpr auto LargestAlignment = Largest<alignof(Ts)...>; |
| 30 | + |
| 31 | +static_assert(sizeof(void *) == LargestSize<int, float, char, void *>, ""); |
| 32 | +static_assert(alignof(short) == LargestAlignment<short, char, char[4]>, ""); |
| 33 | + |
| 34 | +struct BadVariant {}; |
| 35 | + |
| 36 | +template<int Index, typename... Ts> |
| 37 | +using TypeAtIndex = |
| 38 | + typename std::tuple_element<Index, std::tuple<Ts..., BadVariant>>::type; |
| 39 | + |
| 40 | +template<typename R, typename Visitor, typename Var> |
| 41 | +R visit(Visitor &&visitor, Var &&value); |
| 42 | + |
| 43 | +template<typename... Ts> |
| 44 | +struct Variant { |
| 45 | + constexpr static auto Count = sizeof...(Ts); |
| 46 | + constexpr static auto Size = LargestSize<Ts...>; |
| 47 | + constexpr static auto Alignment = LargestAlignment<Ts...>; |
| 48 | + constexpr static auto NTMC = |
| 49 | + std::conjunction<std::is_nothrow_move_constructible<Ts>...>::value; |
| 50 | + |
| 51 | + alignas(Alignment) char space_[Size]; |
| 52 | + int typeSwitch_ = Count; |
| 53 | + |
| 54 | + Variant() {} |
| 55 | + |
| 56 | + Variant(const Variant &v): typeSwitch_{v.typeSwitch_} { |
| 57 | + visit<void>( |
| 58 | + [&](const auto &c) { |
| 59 | + using Source = std::decay_t<decltype(c)>; |
| 60 | + new(as<Source>()) Source{c}; |
| 61 | + }, |
| 62 | + v |
| 63 | + ); |
| 64 | + } |
| 65 | + |
| 66 | + Variant(Variant &&v) noexcept(NTMC): typeSwitch_{v.typeSwitch_} { |
| 67 | + visit<void>( |
| 68 | + [&](auto &&m) { |
| 69 | + using Source = std::decay_t<decltype(m)>; |
| 70 | + new(as<Source>()) Source{std::move(m)}; |
| 71 | + }, |
| 72 | + v |
| 73 | + ); |
| 74 | + v.typeSwitch_ = Count; |
| 75 | + } |
| 76 | + |
| 77 | + template<std::size_t Ndx, typename... Args> |
| 78 | + Variant(std::in_place_index_t<Ndx>, Args &&...args): typeSwitch_{Ndx} { |
| 79 | + using Held = TypeAtIndex<Ndx, Ts...>; |
| 80 | + new(as<Held>()) Held{std::forward<Args>(args)...}; |
| 81 | + } |
| 82 | + |
| 83 | + Variant &operator=(const Variant &model) { |
| 84 | + Variant copy{model}; |
| 85 | + swap(*this, copy); |
| 86 | + return *this; |
| 87 | + } |
| 88 | + |
| 89 | + Variant &operator=(Variant &&other) noexcept(NTMC) { |
| 90 | + destroy(); |
| 91 | + new(this) Variant{std::move(other)}; |
| 92 | + return *this; |
| 93 | + } |
| 94 | + |
| 95 | + ~Variant() { destroy(); } |
| 96 | + |
| 97 | + void reset() { |
| 98 | + destroy(); |
| 99 | + typeSwitch_ = Count; |
| 100 | + } |
| 101 | + |
| 102 | + template<typename T> |
| 103 | + T *as() noexcept { return reinterpret_cast<T *>(space_); } |
| 104 | + |
| 105 | + template<typename T> |
| 106 | + const T *as() const noexcept { |
| 107 | + return const_cast<Variant *>(this)->as<T>(); |
| 108 | + } |
| 109 | + |
| 110 | +private: |
| 111 | + void destroy() { |
| 112 | + visit<void>( |
| 113 | + [](auto &who) { |
| 114 | + using Type = std::decay_t<decltype(who)>; |
| 115 | + (&who)->~Type(); |
| 116 | + }, |
| 117 | + *this |
| 118 | + ); |
| 119 | + } |
| 120 | + |
| 121 | +}; |
| 122 | + |
| 123 | +template<int Index, typename... Ts> |
| 124 | +auto get(Variant<Ts...> &v) -> |
| 125 | + TypeAtIndex<Index, std::tuple<Ts..., BadVariant>> & |
| 126 | +{ |
| 127 | + return v.as<TypeAtIndex<Index, std::tuple<Ts..., BadVariant>>(); |
| 128 | +} |
| 129 | + |
| 130 | +template< |
| 131 | + typename R, typename Visitor, typename V, |
| 132 | + int Current, typename Head, typename... Tail |
| 133 | +> |
| 134 | +struct Visit_impl { |
| 135 | + static R execute(Visitor &&visitor, V &&v, int typeSwitch) { |
| 136 | + switch(typeSwitch) { |
| 137 | + case Current: return visitor(*v.template as<Head>()); |
| 138 | + default: |
| 139 | + return |
| 140 | + Visit_impl< |
| 141 | + R, Visitor, V, Current + 1, Tail... |
| 142 | + >::execute( |
| 143 | + std::forward<Visitor>(visitor), |
| 144 | + std::forward<V>(v), |
| 145 | + typeSwitch |
| 146 | + ); |
| 147 | + } |
| 148 | + } |
| 149 | +}; |
| 150 | + |
| 151 | +template<typename R, typename Visitor, typename V, int Current> |
| 152 | +struct Visit_impl<R, Visitor, V, Current, BadVariant> { |
| 153 | + static R execute(Visitor &&visitor, V &&v, int) { |
| 154 | + return visitor(*v.template as<BadVariant>()); |
| 155 | + } |
| 156 | +}; |
| 157 | + |
| 158 | +template<typename R, typename Visitor, typename Var, typename... Types> |
| 159 | +R visit_injected(Visitor &&visitor, Var &&v, const Variant<Types...> *) { |
| 160 | + return Visit_impl<R, Visitor, Var, 0, Types..., BadVariant>::execute( |
| 161 | + std::forward<Visitor>(visitor), |
| 162 | + std::forward<Var>(v), |
| 163 | + v.typeSwitch_ |
| 164 | + ); |
| 165 | +} |
| 166 | + |
| 167 | +template<typename R, typename Visitor, typename Var> |
| 168 | +R visit(Visitor &&visitor, Var &&value) { |
| 169 | + return visit_injected<R>( |
| 170 | + std::forward<Visitor>(visitor), std::forward<Var>(value), &value |
| 171 | + ); |
| 172 | +} |
| 173 | + |
| 174 | +} |
0 commit comments