2 * This file is part of the GROMACS molecular simulation package.
4 * Copyright (c) 2020, by the GROMACS development team, led by
5 * Mark Abraham, David van der Spoel, Berk Hess, and Erik Lindahl,
6 * and including many others, as listed in the AUTHORS file in the
7 * top-level source directory and at http://www.gromacs.org.
9 * GROMACS is free software; you can redistribute it and/or
10 * modify it under the terms of the GNU Lesser General Public License
11 * as published by the Free Software Foundation; either version 2.1
12 * of the License, or (at your option) any later version.
14 * GROMACS is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 * Lesser General Public License for more details.
19 * You should have received a copy of the GNU Lesser General Public
20 * License along with GROMACS; if not, see
21 * http://www.gnu.org/licenses, or write to the Free Software Foundation,
22 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
24 * If you want to redistribute modifications to GROMACS, please
25 * consider that scientific software is very special. Version
26 * control is crucial - bugs must be traceable. We will be happy to
27 * consider code for inclusion in the official distribution, but
28 * derived work must not be called official GROMACS. Details are found
29 * in the README & COPYING files - if they are missing, get the
30 * official version at http://www.gromacs.org.
32 * To help us fund GROMACS development, we humbly ask that you cite
33 * the research papers on the package. Check out http://www.gromacs.org.
37 #include "gromacs/compat/mp11.h"
39 #include <gtest/gtest.h>
41 // Defining some dummy functions to use later
58 static int testIncrement()
69 template<Options i
, Options j
>
70 static int testEnumTwoIPlusJPlusK(int k
)
72 return 2 * int(i
) + int(j
) + k
;
75 TEST(TemplateMPTest
, MpWithIndexInt
)
77 static constexpr int maxArgValue
= 4;
78 int inc_0
= mp_with_index
<maxArgValue
>(0, [](auto i
) { return testIncrement
<i
>(); });
80 int inc_3
= mp_with_index
<maxArgValue
>(3, [](auto i
) { return testIncrement
<i
>(); });
84 TEST(TemplateMPTest
, MpWithIndexIntBad
)
86 static constexpr int maxArgValue
= 4;
88 // Function requirement: i < maxArgValue
89 EXPECT_THROW(mp_with_index
<maxArgValue
>(i
, [](auto i
) { return testIncrement
<i
>(); }),
93 TEST(TemplateMPTest
, MpWithIndexBool
)
95 bool not_true
= mp_with_index
<2>(size_t(true), [](auto i
) { return testNot
<i
>(); });
96 EXPECT_FALSE(not_true
);
97 bool not_false
= mp_with_index
<2>(size_t(false), [](auto i
) { return testNot
<i
>(); });
98 EXPECT_TRUE(not_false
);
101 TEST(TemplateMPTest
, MpWithIndexEnum
)
104 int two1plus2plus5
= mp_with_index
<static_cast<size_t>(Options::Count
)>(
105 static_cast<size_t>(Options::Op2
), [=](auto i
) {
106 return testEnumTwoIPlusJPlusK
<Options::Op1
, static_cast<Options
>(size_t(i
))>(five
);
108 EXPECT_EQ(two1plus2plus5
, 9);
112 } // namespace compat