Scarfski/entt
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

meta: reduce cost of meta ctor

Browse Source
This commit is contained in:
Michele Caini
2024-08-27 10:18:43 +02:00
parent 94735d04b3
commit 5da2c3c3c2
3 changed files with 6 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
src/entt/meta/factory.hpp
View File

@@ -64,7 +64,9 @@ protected:
details->conv.insert_or_assign(node.type, node);
} else {
static_assert(std::is_same_v<Type, meta_ctor_node>, "Unexpected type");
details->ctor.insert_or_assign(node.id, node);
std::size_t pos{};
for(const std::size_t last = details->ctor.size(); (pos != last) && (details->ctor[pos].id != node.id); ++pos) {}
(pos == details->ctor.size()) ? details->ctor.emplace_back(node) : (details->ctor[pos] = node);
}
}

2
src/entt/meta/meta.hpp
View File

@@ -1444,7 +1444,7 @@ public:
*/
[[nodiscard]] meta_any construct(meta_any *const args, const size_type sz) const {
if(node.details) {
if(const auto *candidate = lookup(args, sz, false, [first = node.details->ctor.cbegin(), last = node.details->ctor.cend()]() mutable { return first == last ? nullptr : &(first++)->second; }); candidate) {
if(const auto *candidate = lookup(args, sz, false, [first = node.details->ctor.cbegin(), last = node.details->ctor.cend()]() mutable { return first == last ? nullptr : &*(first++); }); candidate) {
return candidate->invoke(*ctx, args);
}
}

3
src/entt/meta/node.hpp
View File

@@ -5,6 +5,7 @@
#include <memory>
#include <type_traits>
#include <utility>
#include <vector>
#include "../config/config.h"
#include "../container/dense_map.hpp"
#include "../core/attribute.h"
@@ -134,7 +135,7 @@ struct meta_template_node {
};
struct meta_type_descriptor {
dense_map<id_type, meta_ctor_node, identity> ctor{};
std::vector<meta_ctor_node> ctor{};
dense_map<id_type, meta_base_node, identity> base{};
dense_map<id_type, meta_conv_node, identity> conv{};
dense_map<id_type, meta_data_node, identity> data{};