1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
|
// Make this object complex and cost longer compile time...
#include <algorithm>
#include <any>
#include <bitset>
#include <filesystem>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <optional>
#include <queue>
#include <string>
#include <unordered_map>
#include <variant>
#include <vector>
int main(int argc, char** argv) {
using Type = std::variant<int8_t, uint8_t, int16_t, uint16_t, int32_t,
uint32_t, int64_t, uint64_t, double, float>;
Type a, b, c;
a = 5;
b = 3.0;
c = 4.0f;
double r;
std::visit([&](auto a, auto b, auto c) { r = a + b + c; }, a, b, c);
std::visit([&](auto a, auto b, auto c) { r = a + b - c; }, a, b, c);
std::visit([&](auto a, auto b, auto c) { r = a - b - c; }, a, b, c);
std::visit([&](auto a, auto b, auto c) { r = (a + b + c) * 2; }, a, b, c);
std::visit([&](auto a, auto b, auto c) { r = (a + b - c) * 3; }, a, b, c);
return 0;
}
|
