boost/beast/core/detail/variant.hpp
//
// Copyright (c) 2016-2017 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//
// Official repository: https://github.com/boostorg/beast
//
#ifndef BOOST_BEAST_DETAIL_VARIANT_HPP
#define BOOST_BEAST_DETAIL_VARIANT_HPP
#include <boost/beast/core/detail/type_traits.hpp>
#include <boost/assert.hpp>
#include <cstddef>
#include <tuple>
#include <type_traits>
namespace boost {
namespace beast {
namespace detail {
// This simple variant gets the job done without
// causing too much trouble with template depth:
//
// * Always allows an empty state I==0
// * emplace() and get() support 1-based indexes only
// * Basic exception guarantee
// * Max 255 types
//
template<class... TN>
class variant
{
detail::aligned_union_t<1, TN...> buf_;
unsigned char i_ = 0;
template<std::size_t I>
using type = typename std::tuple_element<
I, std::tuple<TN...>>::type;
template<std::size_t I>
using C = std::integral_constant<std::size_t, I>;
public:
variant() = default;
~variant()
{
destroy(C<0>{});
}
bool
operator==(variant const& other) const
{
if(i_ != other.i_)
return false;
return equal(other, C<0>{});
}
// 0 = empty
unsigned char
index() const
{
return i_;
}
// moved-from object becomes empty
variant(variant&& other)
{
i_ = other.move(&buf_, C<0>{});
other.i_ = 0;
}
variant(variant const& other)
{
i_ = other.copy(&buf_, C<0>{});
}
// moved-from object becomes empty
variant& operator=(variant&& other)
{
if(this != &other)
{
destroy(C<0>{});
i_ = other.move(&buf_, C<0>{});
other.i_ = 0;
}
return *this;
}
variant& operator=(variant const& other)
{
if(this != &other)
{
destroy(C<0>{});
i_ = other.copy(&buf_, C<0>{});
}
return *this;
}
template<std::size_t I, class... Args>
void
emplace(Args&&... args)
{
destroy(C<0>{});
new(&buf_) type<I-1>(
std::forward<Args>(args)...);
i_ = I;
}
template<std::size_t I>
type<I-1>&
get()
{
BOOST_ASSERT(i_ == I);
return *reinterpret_cast<
type<I-1>*>(&buf_);
}
template<std::size_t I>
type<I-1> const&
get() const
{
BOOST_ASSERT(i_ == I);
return *reinterpret_cast<
type<I-1> const*>(&buf_);
}
void
reset()
{
destroy(C<0>{});
}
private:
void
destroy(C<0>)
{
auto const I = 0;
if(i_ == I)
return;
destroy(C<I+1>{});
i_ = 0;
}
template<std::size_t I>
void
destroy(C<I>)
{
if(i_ == I)
{
using T = type<I-1>;
get<I>().~T();
return;
}
destroy(C<I+1>{});
}
void
destroy(C<sizeof...(TN)>)
{
auto const I = sizeof...(TN);
BOOST_ASSERT(i_ == I);
using T = type<I-1>;
get<I>().~T();
}
unsigned char
move(void* dest, C<0>)
{
auto const I = 0;
if(i_ == I)
return I;
return move(dest, C<I+1>{});
}
template<std::size_t I>
unsigned char
move(void* dest, C<I>)
{
if(i_ == I)
{
using T = type<I-1>;
new(dest) T(std::move(get<I>()));
get<I>().~T();
return I;
}
return move(dest, C<I+1>{});
}
unsigned char
move(void* dest, C<sizeof...(TN)>)
{
auto const I = sizeof...(TN);
BOOST_ASSERT(i_ == I);
using T = type<I-1>;
new(dest) T(std::move(get<I>()));
get<I>().~T();
return I;
}
unsigned char
copy(void* dest, C<0>) const
{
auto const I = 0;
if(i_ == I)
return I;
return copy(dest, C<I+1>{});
}
template<std::size_t I>
unsigned char
copy(void* dest, C<I>) const
{
if(i_ == I)
{
using T = type<I-1>;
auto const& t = get<I>();
new(dest) T(t);
return I;
}
return copy(dest, C<I+1>{});
}
unsigned char
copy(void* dest, C<sizeof...(TN)>) const
{
auto const I = sizeof...(TN);
BOOST_ASSERT(i_ == I);
using T = type<I-1>;
auto const& t = get<I>();
new(dest) T(t);
return I;
}
bool
equal(variant const& other, C<0>) const
{
auto constexpr I = 0;
if(i_ == I)
return true;
return equal(other, C<I+1>{});
}
template<std::size_t I>
bool
equal(variant const& other, C<I>) const
{
if(i_ == I)
return get<I>() == other.get<I>();
return equal(other, C<I+1>{});
}
bool
equal(variant const& other, C<sizeof...(TN)>) const
{
auto constexpr I = sizeof...(TN);
BOOST_ASSERT(i_ == I);
return get<I>() == other.get<I>();
}
};
} // detail
} // beast
} // boost
#endif