42 lines
1.1 KiB
C++
42 lines
1.1 KiB
C++
|
// Copyright (c) 2023 Denis Mikhailov
|
||
|
|
//
|
||
|
|
// 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)
|
||
|
|
|
||
|
|
#ifndef BOOST_PFR_DETAIL_STDARRAY_HPP
|
||
|
|
#define BOOST_PFR_DETAIL_STDARRAY_HPP
|
||
|
|
#pragma once
|
||
|
|
|
||
|
|
#include <boost/pfr/detail/config.hpp>
|
||
|
|
|
||
|
|
#include <boost/pfr/detail/sequence_tuple.hpp>
|
||
|
|
|
||
|
|
#if !defined(BOOST_PFR_INTERFACE_UNIT)
|
||
|
|
#include <array>
|
||
|
|
#if BOOST_PFR_CORE_NAME_ENABLED
|
||
|
|
# include <string_view>
|
||
|
|
#endif
|
||
|
|
#include <utility> // metaprogramming stuff
|
||
|
|
#endif
|
||
|
|
|
||
|
|
namespace boost { namespace pfr { namespace detail {
|
||
|
|
|
||
|
|
#if BOOST_PFR_CORE_NAME_ENABLED
|
||
|
|
template <class T, std::size_t... I>
|
||
|
|
constexpr auto make_stdarray_from_tietuple(const T& t, std::index_sequence<I...>) noexcept {
|
||
|
|
return std::array<std::string_view, sizeof...(I)>{
|
||
|
|
boost::pfr::detail::sequence_tuple::get<I>(t)...
|
||
|
|
};
|
||
|
|
}
|
||
|
|
#else
|
||
|
|
template <class T, std::size_t... I>
|
||
|
|
constexpr auto make_stdarray_from_tietuple(const T&, std::index_sequence<I...>) noexcept {
|
||
|
|
return nullptr;
|
||
|
|
}
|
||
|
|
#endif
|
||
|
|
|
||
|
|
}}} // namespace boost::pfr::detail
|
||
|
|
|
||
|
|
#endif // BOOST_PFR_DETAIL_STDARRAY_HPP
|
||
|
|
|