1 #ifndef MSP_GAME_REFLECTION_H_
2 #define MSP_GAME_REFLECTION_H_
9 #include "mspgame_api.h"
12 namespace Reflection {
17 class PolymorphismBase
20 virtual ~PolymorphismBase() = default;
22 virtual bool is_instance_of(const void *, const PolymorphismBase &) const = 0;
27 class RootedPolymorphism: public PolymorphismBase
30 virtual bool is_instance(const B &) const = 0;
34 template<typename T, typename B>
35 requires std::is_base_of_v<B, T>
36 class Polymorphism: public RootedPolymorphism<B>
39 bool is_instance(const B &obj) const override { return std::is_same_v<B, T> || dynamic_cast<const T *>(&obj); }
40 bool is_instance_of(const void *, const PolymorphismBase &) const override;
44 class MSPGAME_API ClassBase
50 std::vector<const ClassBase *> bases;
51 std::unique_ptr<PolymorphismBase> polymorphism;
53 ClassBase(Reflector &, std::type_index);
55 virtual ~ClassBase() = default;
57 const std::type_index &get_type() const { return type; }
58 const std::string &get_name() const { return name; }
60 bool is_direct_base_of(const ClassBase &) const;
61 bool is_base_of(const ClassBase &) const;
64 bool is_instance(const T &) const;
67 bool has_polymorphic_base() const { return dynamic_cast<const RootedPolymorphism<T> *>(polymorphism.get()); }
72 class Class: public ClassBase
75 Class(Reflector &r): ClassBase(r, typeid(T)) { }
78 void set_polymorphic_base();
81 void set_polymorphic_base(const T &obj) { set_polymorphic_base<B>(); check_bases<B>(obj); }
85 void check_bases(const T &obj);
89 class MSPGAME_API Reflector
92 std::vector<std::unique_ptr<ClassBase>> classes;
94 std::vector<std::unique_ptr<ClassBase>>::const_iterator lower_bound(const std::type_index &) const;
97 ClassBase *find_class(const std::type_index &) const;
100 Class<T> *find_class() const { return static_cast<Class<T> *>(find_class(typeid(T))); }
103 Class<T> &get_or_create_class();
106 std::vector<ClassBase *> find_classes_if(F &&) const;
110 inline std::vector<std::unique_ptr<ClassBase>>::const_iterator Reflector::lower_bound(const std::type_index &type) const
112 return std::ranges::lower_bound(classes, type, {}, [](auto &c){ return c->get_type(); });
116 inline Class<T> &Reflector::get_or_create_class()
118 std::type_index type = typeid(T);
119 auto i = lower_bound(type);
120 if(i==classes.end() || (*i)->get_type()!=type)
121 i = classes.emplace(i, std::make_unique<Class<T>>(std::ref(*this)));
122 return static_cast<Class<T> &>(*i->get());
126 inline std::vector<ClassBase *> Reflector::find_classes_if(F &&pred) const
128 std::vector<ClassBase *> result;
129 for(auto &c: classes)
131 result.push_back(&*c);
136 template<typename T, typename B>
137 inline bool Polymorphism<T, B>::is_instance_of(const void *obj, const PolymorphismBase &other) const
139 if(const RootedPolymorphism<B> *rooted = dynamic_cast<const RootedPolymorphism<B> *>(&other))
140 return rooted->is_instance(*static_cast<const T *>(obj));
146 inline bool ClassBase::is_instance(const T &obj) const
148 if(const RootedPolymorphism<T> *p = dynamic_cast<const RootedPolymorphism<T> *>(polymorphism.get()))
149 return p->is_instance(obj);
150 else if(ClassBase *c = reflector.find_class<T>(); c->polymorphism)
151 return c->polymorphism->is_instance_of(&obj, *polymorphism);
158 inline void Class<T>::set_polymorphic_base()
161 polymorphism = std::make_unique<Polymorphism<T, B>>();
162 else if(!dynamic_cast<const Polymorphism<T, B> *>(polymorphism.get()))
163 throw std::logic_error("conflicting polymorphism");
168 inline void Class<T>::check_bases(const T &obj)
170 std::vector<const ClassBase *> candidate_bases;
171 for(const ClassBase *b: reflector.find_classes_if([](const ClassBase &c){ return c.has_polymorphic_base<B>(); }))
172 if(b!=this && b->is_instance<B>(obj))
173 candidate_bases.push_back(b);
175 for(auto i=candidate_bases.begin(); i!=candidate_bases.end(); )
177 if(std::ranges::any_of(candidate_bases, [i](const ClassBase *c){ return (c!=*i && (*i)->is_direct_base_of(*c)); }))
178 i = candidate_bases.erase(i);
183 bases = std::move(candidate_bases);
186 } // namespace Reflection
187 } // namespace Msp::Game