CoDiPack  3.0.0
A Code Differentiation Package
SciComp TU Kaiserslautern
Loading...
Searching...
No Matches
tupleMemory.hpp
1/*
2 * CoDiPack, a Code Differentiation Package
3 *
4 * Copyright (C) 2015-2025 Chair for Scientific Computing (SciComp), University of Kaiserslautern-Landau
5 * Homepage: http://scicomp.rptu.de
6 * Contact: Prof. Nicolas R. Gauger (codi@scicomp.uni-kl.de)
7 *
8 * Lead developers: Max Sagebaum, Johannes Blühdorn (SciComp, University of Kaiserslautern-Landau)
9 *
10 * This file is part of CoDiPack (http://scicomp.rptu.de/software/codi).
11 *
12 * CoDiPack is free software: you can redistribute it and/or
13 * modify it under the terms of the GNU General Public License
14 * as published by the Free Software Foundation, either version 3 of the
15 * License, or (at your option) any later version.
16 *
17 * CoDiPack is distributed in the hope that it will be useful,
18 * but WITHOUT ANY WARRANTY; without even the implied warranty
19 * of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
20 *
21 * See the GNU General Public License for more details.
22 * You should have received a copy of the GNU
23 * General Public License along with CoDiPack.
24 * If not, see <http://www.gnu.org/licenses/>.
25 *
26 * For other licensing options please contact us.
27 *
28 * Authors:
29 * - SciComp, University of Kaiserslautern-Landau:
30 * - Max Sagebaum
31 * - Johannes Blühdorn
32 * - Former members:
33 * - Tim Albring
34 */
35#pragma once
36
37#include <tuple>
38
39#include "../config.h"
40#include "../misc/macros.hpp"
41
43namespace codi {
44
48 template<size_t i, typename T>
50 public:
52
54 template<typename TT>
55 CODI_INLINE TupleMemoryLeaf(TT&& v) : value(std::forward<TT>(v)) {}
56
59 };
60
64 template<typename Ids, typename... Ts>
66
70 template<size_t... Ids, typename... Ts>
71 struct TupleMemoryBase<std::integer_sequence<size_t, Ids...>, Ts...> : public TupleMemoryLeaf<Ids, Ts>... {
72 public:
73
75 template<typename... TTs>
76 CODI_INLINE TupleMemoryBase(TTs&&... v) : TupleMemoryLeaf<Ids, Ts>(std::forward<TTs>(v))... {}
77
80 };
81
91 template<typename... Ts>
92 struct TupleMemory : public TupleMemoryBase<std::make_index_sequence<sizeof...(Ts)>, Ts...> {
93 public:
94
95 using Args = std::tuple<Ts...>;
96
97 using Base = TupleMemoryBase<std::make_index_sequence<sizeof...(Ts)>, Ts...>;
98
100 template<typename... TTs>
101 CODI_INLINE TupleMemory(TTs&&... v) : Base(std::forward<TTs>(v)...) {}
102
105
107 template<size_t i>
108 CODI_INLINE auto& get() const {
109 return static_cast<TupleMemoryLeaf<i, typename std::tuple_element<i, Args>::type> const*>(this)->value;
110 }
111 };
112}
#define CODI_INLINE
See codi::Config::ForcedInlines.
Definition config.h:469
CoDiPack - Code Differentiation Package.
Definition codi.hpp:94
Base for tuple implementation see TupleMemory for details.
Definition tupleMemory.hpp:65
Leaf for tuple implementation see TupleMemory for details.
Definition tupleMemory.hpp:49
T value
Memory value.
Definition tupleMemory.hpp:51
Tuple implementation which allows to force inline of the construction of the tuple.
Definition tupleMemory.hpp:92
inlineauto & get() const
Get specific element.
Definition tupleMemory.hpp:108
std::tuple< Ts... > Args
Definition tupleMemory.hpp:95
TupleMemoryBase< std::make_index_sequence< sizeof...(Ts)>, Ts... > Base
Definition tupleMemory.hpp:97