A handy, tiny but powerful compile-time reflection system for C++.
中文[https://zhuanlan.zhihu.com/p/141996889]
I am a C++ game developer, I have been hunting for a powerful and easy to use reflection library for a long time, but none of them make me happy completely(even the new proposal).
What I need is a reflection system that:
So for summary, systems and design that are already known to strongly benefit from reflection are:
struct TypeA {
TrefType(TypeA);
int val;
TrefField(val);
};
static_assert(is_reflected_v<TypeA>);
static_assert(class_info<TypeA>().name == "TypeA");
static_assert(class_info<TypeA>().size == sizeof(TypeA));
static_assert(class_info<TypeA>().each_field([](auto info, int) {
using mem_t = decltype(info.value);
return info.name == "val" && is_same_v<enclosing_class_t<mem_t>, TypeA> &&
is_same_v<member_t<mem_t>, decltype(TypeA{}.val)>;
}));
static_assert(class_info<TypeA>().get_field_index("val") == 1);
static_assert(class_info<TypeA>().get_field<1>().index == 1);
static_assert(class_info<TypeA>().get_field<1>().name == "val");
static_assert(
is_same_v<decltype(class_info<TypeA>().get_field<1>())::member_t, int>);
struct TypeB : TypeA {
TrefType(TypeB);
float foo;
TrefField(foo);
};
static_assert(has_base_class_v<TypeB>);
static_assert(is_same_v<base_of_t<TypeB>, TypeA>);
static_assert(is_same_v<decltype(class_info<TypeB>())::base_t, TypeA>);
static_assert(class_info<TypeB>().each_field([](auto info, int level) {
// exclude members of base class
if (level != 0)
return true;
using mem_t = decltype(info.value);
return info.name == "foo" && is_same_v<enclosing_class_t<mem_t>, TypeB> &&
is_same_v<member_t<mem_t>, decltype(TypeB{}.foo)>;
}));
template <typename T>
struct TempType : TypeB {
TrefType(TempType);
T tempVal;
TrefField(tempVal);
};
static_assert(class_info<TempType<int>>().name == "TempType");
static_assert(class_info<TempType<int>>().each_field([](auto info, int lv) {
// exclude members of base class.
if (lv != 0)
return true;
using mem_t = decltype(info.value);
return info.name == "tempVal" &&
is_same_v<enclosing_class_t<mem_t>, TempType<int>> &&
is_same_v<member_t<mem_t>, int>;
}));
struct FakeMeta {
int foo;
float bar;
};
// A computed meta
constexpr int makeMetaFoo(int a, int b) {
return a + b;
}
struct ClassWithMeta {
TrefTypeWithMeta(ClassWithMeta, (FakeMeta{makeMetaFoo(1, 2), 22}));
};
static_assert(class_info<ClassWithMeta>().meta.foo == 3);
static_assert(class_info<ClassWithMeta>().meta.bar == 22);
struct OverloadingTest {
TrefType(OverloadingTest);
template <int, int>
struct Meta {};
void foo(int);
void foo(float);
void foo(char*, int);
// Can omit the paren for function with only one argument.
TrefField(foo, int); // equals to TreField(foo, (int))
TrefFieldWithMeta(foo, (float), (Meta<1, 2>{}));
TrefField(foo, (char*, int));
};
static_assert(class_info<OverloadingTest>().each_field([](auto info, int) {
if (info.name != "foo")
return false;
if constexpr (is_same_v<decltype(info.value),
void (OverloadingTest::*)(int)>) {
return info.value == overload_v<int>(&OverloadingTest::foo);
} else if constexpr (is_same_v<decltype(info.value),
void (OverloadingTest::*)(float)>) {
static_assert(is_same_v<decltype(info.meta), OverloadingTest::Meta<1, 2>>);
return info.value == overload_v<float>(&OverloadingTest::foo);
} else if constexpr (is_same_v<decltype(info.value),
void (OverloadingTest::*)(char*, int)>) {
return info.value == overload_v<char*, int>(&OverloadingTest::foo);
}
return false;
}));
struct FakeEnumMeta {
int foo;
int bar;
};
TrefEnumWithMeta(EnumA,
(FakeEnumMeta{111, 222}),
Ass = 1,
Ban = (int)EnumA::Ass * 3);
static_assert(enum_to_string(EnumA::Ass) == "Ass");
static_assert(string_to_enum("Ban", EnumA::Ass) == EnumA::Ban);
static_assert(enum_info<EnumA>().meta.foo == 111);
static_assert(enum_info<EnumA>().meta.bar == 222);
static_assert(enum_info<EnumA>().name == "EnumA");
static_assert(enum_info<EnumA>().size == sizeof(EnumA));
static_assert(enum_info<EnumA>().items.size() == 2);
static_assert(enum_info<EnumA>().each_item([](auto info) {
switch (info.value) {
case EnumA::Ass:
return info.name == "Ass";
case EnumA::Ban:
return info.name == "Ban";
default:
return false;
}
}));
enum class ExternalEnum { Value1 = 1, Value2 = Value1 + 4 };
TrefExternalEnum(ExternalEnum, Value1, Value2);
static_assert(enum_info<ExternalEnum>().name == "ExternalEnum");
static_assert(enum_info<ExternalEnum>().size == sizeof(ExternalEnum));
static_assert(enum_info<ExternalEnum>().items.size() == 2);
struct CustomEnumItem {
string_view desc;
string_view comment;
int otherMetaData = 0;
};
TrefEnumEx(EnumValueMetaTest,
(TestA,
(CustomEnumItem{"Desc for A Test", "Comment for A Test", 11})),
(TestB,
(CustomEnumItem{"Desc for B Test", "Comment for B Test", 22})));
static_assert(enum_info<EnumValueMetaTest>().items[0].meta.desc ==
"Desc for A Test");
static_assert(enum_info<EnumValueMetaTest>().items[0].meta.comment ==
"Comment for A Test");
static_assert(enum_info<EnumValueMetaTest>().items[0].meta.otherMetaData == 11);
static_assert(enum_info<EnumValueMetaTest>().items[1].meta.desc ==
"Desc for B Test");
static_assert(enum_info<EnumValueMetaTest>().items[1].meta.comment ==
"Comment for B Test");
static_assert(enum_info<EnumValueMetaTest>().items[1].meta.otherMetaData == 22);
enum class TestEnumStaticDispatching;
constexpr auto processA(TestEnumStaticDispatching v) {
return 111;
}
constexpr auto processB(TestEnumStaticDispatching v) {
return 222;
}
TrefEnumEx(TestEnumStaticDispatching, (EnumA, &processA), (EnumB, &processB));
static_assert([] {
constexpr auto c = TestEnumStaticDispatching::EnumA;
constexpr auto idx = enum_info<TestEnumStaticDispatching>().index_of_value(c);
return enum_info<TestEnumStaticDispatching>().items[idx].meta(c) == 111;
}());
struct Base {
TrefType(Base);
int baseVal;
TrefField(baseVal);
};
template <typename T>
struct Data : Base {
TrefType(Data);
T t;
TrefFieldWithMeta(t, Meta{"test"});
int x, y;
TrefFieldWithMeta(x, (MetaNumber{"pos x", 1, 100}));
TrefFieldWithMeta(y, (MetaNumber{"pos y", 1, 100}));
std::string name{"boo"};
TrefFieldWithMeta(name, Meta{"entity name"});
};
struct Child : Data<int> {
TrefType(Child);
float z;
TrefField(z);
};
TrefSubType(Data<int>);
TrefSubType(Child);
template <typename T>
constexpr bool hasSubclass(string_view name) {
auto found = false;
class_info<T>().each_subclass([&](auto info, int) {
found = info.name == name;
return !found;
});
return found;
}
static_assert(hasSubclass<Base>("Child"));
template <class T>
void dumpTree() {
printf("===== All Subclass of %s ====\n", class_info<T>().name.data());
class_info<T>().each_subclass([&](auto info, int level) {
for (int i = 0; i < 4 * level; i++)
printf(" ");
assert(info.name.size() > 0);
printf("%s (rtti: %s)\n", info.name.data(),
typeid(decltype(info)::class_t).name());
return true;
});
puts("============");
}
template <typename T,
typename = std::enable_if_t<tref::is_reflected_v<T>, bool>>
bool operator>>(JsonReader& r, T& d) {
if (!r.expectObjStart())
return false;
for (std::string key; !r.expectObjEnd();) {
if (!r.expectObjKey(key))
return false;
auto loaded = false;
tref::class_info<T>().each_field([&](auto info, int) {
if (info.name == key) {
auto ptr = info.value;
if (r >> d.*ptr) {
loaded = true;
} else {
r.onInvalidValue(key.c_str());
}
return false;
}
return true;
});
if (!loaded) {
r.onInvalidValue(key.c_str());
return false;
}
}
return true;
}
template <typename T>
bool operator>>(JsonReader& in, std::unique_ptr<T>& p) {
std::string typeName;
if (!(in >> typeName)) {
in.onInvalidValue(typeName.c_str());
return false;
}
auto loaded = false;
tref::class_info<T>().each_subclass([&](auto info, int) {
if (typeName == info.name) {
using C = typename decltype(info)::class_t;
auto i = std::make_unique<C>();
if (in >> *i) {
loaded = true;
p = std::move(i);
} else {
in.onInvalidValue(typeName.c_str());
loaded = false;
}
return false;
}
return true;
});
return loaded;
}
The MIT License
Copyright (C) 2018 crazybie<[email protected]>
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.