get_index_sequence.hpp
Go to the documentation of this file.
1 //
2 // Copyright (C) 2014, 2015 Ableton AG, Berlin. All rights reserved.
3 //
4 // Permission is hereby granted, free of charge, to any person obtaining a
5 // copy of this software and associated documentation files (the "Software"),
6 // to deal in the Software without restriction, including without limitation
7 // the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 // and/or sell copies of the Software, and to permit persons to whom the
9 // Software is furnished to do so, subject to the following conditions:
10 //
11 // The above copyright notice and this permission notice shall be included in
12 // all copies or substantial portions of the Software.
13 //
14 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15 // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16 // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
17 // THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
18 // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
19 // FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
20 // DEALINGS IN THE SOFTWARE.
21 //
22 
27 #pragma once
28 
30 #include <atria/estd/utility.hpp>
31 #include <tuple>
32 #include <array>
33 
34 namespace atria {
35 namespace meta {
36 
38 
39 namespace detail {
40 
41 using std::get;
42 
43 template <typename T, typename I, I N,
44  typename Enable = void>
45 struct get_integer_sequence_aux
46 {
47  using type = estd::conditional_t<
48  (N == 0),
50  estd::make_integer_sequence<I, N> >;
51 };
52 
53 template <typename T, typename I, I N>
54 struct get_integer_sequence_aux<
55  T, I, N, estd::void_t<decltype(get<N>(std::declval<T>()))> >
56  : get_integer_sequence_aux<T, I, N + 1>
57 {};
58 
59 template <typename T, typename I>
60 struct get_integer_sequence
61  : get_integer_sequence_aux<T, I, 0>
62 {};
63 
64 template <typename ...Ts, typename I>
65 struct get_integer_sequence<std::tuple<Ts...>, I>
66 {
67  using type = estd::make_integer_sequence<I, sizeof...(Ts)>;
68 };
69 
70 template <typename T, typename U, typename I>
71 struct get_integer_sequence<std::pair<T, U>, I>
72 {
73  using type = estd::make_integer_sequence<I, 2>;
74 };
75 
76 template <typename T, std::size_t N, typename I>
77 struct get_integer_sequence<std::array<T, N>, I>
78 {
79  using type = estd::make_integer_sequence<I, N>;
80 };
81 
82 } // namespace detail
83 
84 template <typename T, typename I>
85 using get_integer_sequence =
86  typename detail::get_integer_sequence<estd::decay_t<T>, I>::type;
87 
88 template <typename T>
89 using get_index_sequence = get_integer_sequence<T, std::size_t>;
90 
91 } // namespace meta
92 } // namespace atria
typename detail::make_void< Ts... >::type void_t
Similar to C++17 std::void_t.
Definition: type_traits.hpp:48
STL namespace.
typename std::conditional< X, T, F >::type conditional_t
Similar to C++14 std::conditional_t.
Definition: type_traits.hpp:66
C++ amazing templates and reusable implementations awesomeness.
Definition: _doc.hpp:35
Fork me on GitHub