aboutsummaryrefslogtreecommitdiff
path: root/source/10-common/LookupTable.hpp
diff options
context:
space:
mode:
authorrtk0c <[email protected]>2022-06-02 21:34:16 -0700
committerrtk0c <[email protected]>2022-06-02 21:34:16 -0700
commitbd07ae3f4e1bcdedc3e373460671ca9713a03de5 (patch)
tree15c897891474a97983f247196923f8e4f2184083 /source/10-common/LookupTable.hpp
parent8a0f2cd0b398ee0b7740e44a0e5fb2f75d090ccb (diff)
Changeset: 60 Add struct/class scanning to codegen
Diffstat (limited to 'source/10-common/LookupTable.hpp')
-rw-r--r--source/10-common/LookupTable.hpp27
1 files changed, 19 insertions, 8 deletions
diff --git a/source/10-common/LookupTable.hpp b/source/10-common/LookupTable.hpp
index c50e28e..360cc2b 100644
--- a/source/10-common/LookupTable.hpp
+++ b/source/10-common/LookupTable.hpp
@@ -20,19 +20,30 @@
#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])
-#define STR_LUT_DECL(name, enumMinValue, enumMaxValue) \
+// 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 STR_LUT_MAP_FOR(name) \
+#define FSTR_LUT_MAP_FOR(name) \
const char** lutMapping = gLut_##name; \
int lutMappingMinValue = kLutMinVal_##name
-#define STR_LUT_MAP(value, text) lutMapping[value - lutMappingMinValue] = text
-#define STR_LUT_MAP_ENUM(enumValue) STR_LUT_MAP(enumValue, #enumValue)
-#define STR_LUT_LOOKUP(name, enumValue) gLut_##name[enumValue - kLutMinVal_##name]
-#define STR_LUT_INIT(name) InitializeLut##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()
-// BSTR stands for bi-directional string
+// 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]; \
@@ -49,5 +60,5 @@
#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))
+#define BSTR_LUT_S2V_LOOKUP(name, string) gLut_##name##_S2V.find(std::string_view(text))->second
#define BSTR_LUT_INIT(name) InitializeLut##name()