aboutsummaryrefslogtreecommitdiff
path: root/source/10-common/LookupTable.hpp
blob: 360cc2b0610388d1e74868fe3313edc0b3939e15 (plain)
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#pragma once

#include <robin_hood.h>
#include <string_view>

// BIDI stands for bi-directional
#define BIDI_LUT_DECL(name, aType, aCount, bType, bCount) \
	int gLut_##name##_A2B[aCount];                        \
	int gLut_##name##_B2A[bCount];                        \
	using name##AType = aType;                            \
	using name##BType = bType;                            \
	void InitializeLut##name()
#define BIDI_LUT_MAP_FOR(name)              \
	int* lutMappingA2B = gLut_##name##_A2B; \
	int* lutMappingB2A = gLut_##name##_B2A
#define BIDI_LUT_MAP(from, to) \
	lutMappingA2B[from] = to;  \
	lutMappingB2A[to] = from
#define BIDI_LUT_INIT(name) InitializeLut##name()
#define BIDI_LUT_A2B_LOOKUP(name, from) (name##BType)(gLut_##name##_A2B[from])
#define BIDI_LUT_B2A_LOOKUP(name, to) (name##AType)(gLut_##name##_B2A[to])

// Forward string lookup
#define FSTR_LUT_DECL(name, enumMinValue, enumMaxValue)             \
	constexpr int kLutMinVal_##name = enumMinValue;                 \
	const char* gLut_##name[(int)enumMaxValue - (int)enumMinValue]; \
	void InitializeLut##name()
#define FSTR_LUT_MAP_FOR(name)             \
	const char** lutMapping = gLut_##name; \
	int lutMappingMinValue = kLutMinVal_##name
#define FSTR_LUT_MAP(value, text) lutMapping[value - lutMappingMinValue] = text
#define FSTR_LUT_MAP_ENUM(enumValue) FSTR_LUT_MAP(enumValue, #enumValue)
#define FSTR_LUT_LOOKUP(name, enumValue) gLut_##name[enumValue - kLutMinVal_##name]
#define FSTR_LUT_INIT(name) InitializeLut##name()

// RSTR stands for reverse-string lookup
#define RSTR_LUT_DECL(name, enumMinValue, enumMaxValue)                                   \
	robin_hood::unordered_flat_map<std::string_view, decltype(enumMaxValue)> gLut_##name; \
	void InitializeLut##name()
#define RSTR_LUT_MAP_FOR(name) auto& lutMapping = gLut_##name;
#define RSTR_LUT_MAP(value, text) lutMapping.insert_or_assign(std::string_view(text), value);
#define RSTR_LUT(name) gLut_##name
#define BSTR_LUT_LOOKUP(name, string) gLut_##name.find(std::string_view(text))->second
#define RSTR_LUT_INIT(name) InitializeLut##name()

// BSTR stands for bi-directional string lookup
#define BSTR_LUT_DECL(name, enumMinValue, enumMaxValue)                                         \
	constexpr int kLutMinVal_##name = enumMinValue;                                             \
	const char* gLut_##name##_V2S[(int)enumMaxValue - (int)enumMinValue];                       \
	robin_hood::unordered_flat_map<std::string_view, decltype(enumMaxValue)> gLut_##name##_S2V; \
	void InitializeLut##name()
#define BSTR_LUT_MAP_FOR(name)                      \
	const char** lutMappingV2S = gLut_##name##_V2S; \
	auto& lutMappingS2V = gLut_##name##_S2V;        \
	int lutMappingMinValue = kLutMinVal_##name
#define BSTR_LUT_MAP(value, text)                     \
	lutMappingV2S[value - lutMappingMinValue] = text; \
	lutMappingS2V.insert_or_assign(std::string_view(text), value);
#define BSTR_LUT_MAP_ENUM(enumValue) BSTR_LUT_MAP(enumValue, #enumValue)
#define BSTR_LUT_V2S(name) gLut_##name##_V2S
#define BSTR_LUT_S2V(name) gLut_##name##_S2V
#define BSTR_LUT_V2S_LOOKUP(name, enumValue) gLut_##name##_V2S[enumValue - kLutMinVal_##name]
#define BSTR_LUT_S2V_LOOKUP(name, string) gLut_##name##_S2V.find(std::string_view(text))->second
#define BSTR_LUT_INIT(name) InitializeLut##name()