libostd/ostd/utility.hh

231 lines
7.2 KiB
C++
Raw Normal View History

/* Utilities for OctaSTD.
*
* This file is part of OctaSTD. See COPYING.md for futher information.
*/
2015-07-13 21:08:55 +02:00
#ifndef OSTD_UTILITY_HH
#define OSTD_UTILITY_HH
#include <stddef.h>
2017-01-25 01:44:22 +01:00
#include <utility>
2017-01-28 19:39:50 +01:00
#include <tuple>
2017-02-09 20:56:15 +01:00
#include <type_traits>
2017-01-25 01:44:22 +01:00
2017-02-09 20:56:15 +01:00
#include "ostd/types.hh"
2015-04-18 17:46:44 +02:00
2015-07-13 21:07:14 +02:00
namespace ostd {
2015-04-29 01:01:22 +02:00
namespace detail {
template<typename T, typename U,
2017-02-09 20:56:15 +01:00
bool = std::is_same_v<std::remove_cv_t<T>, std::remove_cv_t<U>>,
bool = std::is_empty_v<T>, bool = std::is_empty_v<U>
>
2017-01-30 19:11:39 +01:00
constexpr size_t CompressedPairSwitch = detail::Undefined<T>();
/* neither empty */
template<typename T, typename U, bool Same>
2017-01-30 19:11:39 +01:00
constexpr size_t CompressedPairSwitch<T, U, Same, false, false> = 0;
/* first empty */
template<typename T, typename U, bool Same>
2017-01-30 19:11:39 +01:00
constexpr size_t CompressedPairSwitch<T, U, Same, true, false> = 1;
/* second empty */
template<typename T, typename U, bool Same>
2017-01-30 19:11:39 +01:00
constexpr size_t CompressedPairSwitch<T, U, Same, false, true> = 2;
/* both empty, not the same */
template<typename T, typename U>
2017-01-30 19:11:39 +01:00
constexpr size_t CompressedPairSwitch<T, U, false, true, true> = 3;
/* both empty and same */
template<typename T, typename U>
2017-01-30 19:11:39 +01:00
constexpr size_t CompressedPairSwitch<T, U, true, true, true> = 1;
2017-01-30 19:11:39 +01:00
template<typename T, typename U, size_t = CompressedPairSwitch<T, U>>
struct CompressedPairBase;
template<typename T, typename U>
struct CompressedPairBase<T, U, 0> {
T p_first;
U p_second;
2015-06-13 17:36:47 +02:00
template<typename TT, typename UU>
CompressedPairBase(TT &&a, UU &&b):
2017-01-25 01:44:22 +01:00
p_first(std::forward<TT>(a)), p_second(std::forward<UU>(b))
{}
2017-01-30 19:11:39 +01:00
template<typename ...A1, typename ...A2, size_t ...I1, size_t ...I2>
CompressedPairBase(
2017-01-28 19:06:52 +01:00
std::piecewise_construct_t,
std::tuple<A1...> &fa, std::tuple<A2...> &sa,
std::index_sequence<I1...>, std::index_sequence<I2...>
);
T &first() { return p_first; }
2016-06-23 20:18:35 +02:00
T const &first() const { return p_first; }
U &second() { return p_second; }
2016-06-23 20:18:35 +02:00
U const &second() const { return p_second; }
void swap(CompressedPairBase &v) {
swap_adl(p_first, v.p_first);
swap_adl(p_second, v.p_second);
}
};
template<typename T, typename U>
struct CompressedPairBase<T, U, 1>: T {
U p_second;
2015-06-13 17:36:47 +02:00
template<typename TT, typename UU>
CompressedPairBase(TT &&a, UU &&b):
2017-01-25 01:44:22 +01:00
T(std::forward<TT>(a)), p_second(std::forward<UU>(b))
{}
2017-01-30 19:11:39 +01:00
template<typename ...A1, typename ...A2, size_t ...I1, size_t ...I2>
CompressedPairBase(
2017-01-28 19:06:52 +01:00
std::piecewise_construct_t,
std::tuple<A1...> &fa, std::tuple<A2...> &sa,
std::index_sequence<I1...>, std::index_sequence<I2...>
);
T &first() { return *this; }
2016-06-23 20:18:35 +02:00
T const &first() const { return *this; }
U &second() { return p_second; }
2016-06-23 20:18:35 +02:00
U const &second() const { return p_second; }
void swap(CompressedPairBase &v) {
swap_adl(p_second, v.p_second);
}
};
template<typename T, typename U>
struct CompressedPairBase<T, U, 2>: U {
T p_first;
2015-06-13 17:36:47 +02:00
template<typename TT, typename UU>
CompressedPairBase(TT &&a, UU &&b):
2017-01-25 01:44:22 +01:00
U(std::forward<UU>(b)), p_first(std::forward<TT>(a))
{}
2017-01-30 19:11:39 +01:00
template<typename ...A1, typename ...A2, size_t ...I1, size_t ...I2>
CompressedPairBase(
2017-01-28 19:06:52 +01:00
std::piecewise_construct_t,
std::tuple<A1...> &fa, std::tuple<A2...> &sa,
std::index_sequence<I1...>, std::index_sequence<I2...>
);
T &first() { return p_first; }
2016-06-23 20:18:35 +02:00
T const &first() const { return p_first; }
U &second() { return *this; }
2016-06-23 20:18:35 +02:00
U const &second() const { return *this; }
void swap(CompressedPairBase &v) {
swap_adl(p_first, v.p_first);
}
};
template<typename T, typename U>
struct CompressedPairBase<T, U, 3>: T, U {
2015-06-13 17:36:47 +02:00
template<typename TT, typename UU>
CompressedPairBase(TT &&a, UU &&b):
2017-01-25 01:44:22 +01:00
T(std::forward<TT>(a)), U(std::forward<UU>(b))
{}
2017-01-30 19:11:39 +01:00
template<typename ...A1, typename ...A2, size_t ...I1, size_t ...I2>
CompressedPairBase(
2017-01-28 19:06:52 +01:00
std::piecewise_construct_t,
std::tuple<A1...> &fa, std::tuple<A2...> &sa,
std::index_sequence<I1...>, std::index_sequence<I2...>
);
T &first() { return *this; }
2016-06-23 20:18:35 +02:00
T const &first() const { return *this; }
U &second() { return *this; }
2016-06-23 20:18:35 +02:00
U const &second() const { return *this; }
void swap(CompressedPairBase &) {}
};
template<typename T, typename U>
struct CompressedPair: CompressedPairBase<T, U> {
2015-06-14 03:36:20 +02:00
using Base = CompressedPairBase<T, U>;
2015-06-13 17:36:47 +02:00
template<typename TT, typename UU>
CompressedPair(TT &&a, UU &&b):
2017-01-25 01:44:22 +01:00
Base(std::forward<TT>(a), std::forward<UU>(b))
{}
template<typename ...A1, typename ...A2>
2017-01-28 19:06:52 +01:00
CompressedPair(
std::piecewise_construct_t pc,
std::tuple<A1...> fa, std::tuple<A2...> sa
):
Base(
pc, fa, sa,
2017-01-28 19:06:52 +01:00
std::make_index_sequence<sizeof...(A1)>(),
std::make_index_sequence<sizeof...(A2)>()
)
{}
T &first() { return Base::first(); }
2016-06-23 20:18:35 +02:00
T const &first() const { return Base::first(); }
U &second() { return Base::second(); }
2016-06-23 20:18:35 +02:00
U const &second() const { return Base::second(); }
void swap(CompressedPair &v) {
Base::swap(v);
}
};
2017-01-28 19:06:52 +01:00
template<typename T, typename U>
2017-01-30 19:11:39 +01:00
template<typename ...A1, typename ...A2, size_t ...I1, size_t ...I2>
2017-01-28 19:06:52 +01:00
CompressedPairBase<T, U, 0>::CompressedPairBase(
std::piecewise_construct_t, std::tuple<A1...> &fa, std::tuple<A2...> &sa,
std::index_sequence<I1...>, std::index_sequence<I2...>
):
p_first(std::forward<A1>(std::get<I1>(fa))...),
p_second(std::forward<A2>(std::get<I2>(sa))...)
{}
template<typename T, typename U>
2017-01-30 19:11:39 +01:00
template<typename ...A1, typename ...A2, size_t ...I1, size_t ...I2>
2017-01-28 19:06:52 +01:00
CompressedPairBase<T, U, 1>::CompressedPairBase(
std::piecewise_construct_t, std::tuple<A1...> &fa, std::tuple<A2...> &sa,
std::index_sequence<I1...>, std::index_sequence<I2...>
):
T(std::forward<A1>(std::get<I1>(fa))...),
p_second(std::forward<A2>(std::get<I2>(sa))...)
{}
template<typename T, typename U>
2017-01-30 19:11:39 +01:00
template<typename ...A1, typename ...A2, size_t ...I1, size_t ...I2>
2017-01-28 19:06:52 +01:00
CompressedPairBase<T, U, 2>::CompressedPairBase(
std::piecewise_construct_t, std::tuple<A1...> &fa, std::tuple<A2...> &sa,
std::index_sequence<I1...>, std::index_sequence<I2...>
):
U(std::forward<A2>(std::get<I2>(sa))...),
p_first(std::forward<A1>(std::get<I1>(fa))...)
{}
template<typename T, typename U>
2017-01-30 19:11:39 +01:00
template<typename ...A1, typename ...A2, size_t ...I1, size_t ...I2>
2017-01-28 19:06:52 +01:00
CompressedPairBase<T, U, 3>::CompressedPairBase(
std::piecewise_construct_t, std::tuple<A1...> &fa, std::tuple<A2...> &sa,
std::index_sequence<I1...>, std::index_sequence<I2...>
):
T(std::forward<A1>(std::get<I1>(fa))...),
U(std::forward<A2>(std::get<I2>(sa))...)
{}
} /* namespace detail */
2015-07-13 21:07:14 +02:00
} /* namespace ostd */
2015-06-04 00:01:23 +02:00
2016-02-07 22:17:15 +01:00
#endif