PMDK C++ bindings 1.2.0
This is the C++ bindings documentation for PMDK's libpmemobj.
integer_sequence.hpp
Go to the documentation of this file.
1/*
2 * Copyright 2016-2017, Intel Corporation
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
6 * are met:
7 *
8 * * Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 *
11 * * Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in
13 * the documentation and/or other materials provided with the
14 * distribution.
15 *
16 * * Neither the name of the copyright holder nor the names of its
17 * contributors may be used to endorse or promote products derived
18 * from this software without specific prior written permission.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
21 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
22 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
23 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
24 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
25 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
26 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
27 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
28 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
29 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
30 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 */
32
33#ifndef LIBPMEMOBJ_INTEGER_SEQUENCE_HPP
34#define LIBPMEMOBJ_INTEGER_SEQUENCE_HPP
35
36#include <stddef.h>
37
43namespace pmem
44{
45
46namespace detail
47{
48
49/*
50 * Base index type template.
51 */
52template <typename T, T...>
53struct integer_sequence {
54};
55
56/*
57 * Size_t specialization of the integer sequence.
58 */
59template <size_t... Indices>
60using index_sequence = integer_sequence<size_t, Indices...>;
61
62/*
63 * Empty base class.
64 *
65 * Subject of empty base optimization.
66 */
67template <typename T, T I, typename... Types>
68struct make_integer_seq_impl;
69
70/*
71 * Class ending recursive variadic template peeling.
72 */
73template <typename T, T I, T... Indices>
74struct make_integer_seq_impl<T, I, integer_sequence<T, Indices...>> {
75 typedef integer_sequence<T, Indices...> type;
76};
77
78/*
79 * Recursively create index while peeling off the types.
80 */
81template <typename N, N I, N... Indices, typename T, typename... Types>
82struct make_integer_seq_impl<N, I, integer_sequence<N, Indices...>, T,
83 Types...> {
84 typedef typename make_integer_seq_impl<
85 N, I + 1, integer_sequence<N, Indices..., I>, Types...>::type
86 type;
87};
88
89/*
90 * Make index sequence entry point.
91 */
92template <typename... Types>
93using make_index_sequence =
94 make_integer_seq_impl<size_t, 0, integer_sequence<size_t>, Types...>;
95
96} /* namespace detail */
97
98} /* namespace pmem */
99
100#endif /* LIBPMEMOBJ_INTEGER_SEQUENCE_HPP */