🛠️🐜 Antkeeper superbuild with dependencies included
https://antkeeper.com
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
1093 lines
32 KiB
1093 lines
32 KiB
#include <chrono>
|
|
#include <cstdint>
|
|
#include <iostream>
|
|
#include <utility>
|
|
#include <vector>
|
|
#include <gtest/gtest.h>
|
|
#include <entt/entity/registry.hpp>
|
|
|
|
struct position {
|
|
std::uint64_t x;
|
|
std::uint64_t y;
|
|
};
|
|
|
|
struct velocity: position {};
|
|
|
|
struct stable_position: position {
|
|
static constexpr auto in_place_delete = true;
|
|
};
|
|
|
|
template<auto>
|
|
struct comp { int x; };
|
|
|
|
struct timer final {
|
|
timer()
|
|
: start{std::chrono::system_clock::now()} {}
|
|
|
|
void elapsed() {
|
|
auto now = std::chrono::system_clock::now();
|
|
std::cout << std::chrono::duration<double>(now - start).count() << " seconds" << std::endl;
|
|
}
|
|
|
|
private:
|
|
std::chrono::time_point<std::chrono::system_clock> start;
|
|
};
|
|
|
|
template<typename Iterable, typename Func>
|
|
void generic(Iterable &&iterable, Func func) {
|
|
timer timer;
|
|
std::forward<Iterable>(iterable).each(func);
|
|
timer.elapsed();
|
|
}
|
|
|
|
template<typename Func>
|
|
void pathological(Func func) {
|
|
entt::registry registry;
|
|
|
|
for(std::uint64_t i = 0; i < 500000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity);
|
|
registry.emplace<velocity>(entity);
|
|
registry.emplace<comp<0>>(entity);
|
|
}
|
|
|
|
for(auto i = 0; i < 10; ++i) {
|
|
registry.each([i = 0, ®istry](const auto entity) mutable {
|
|
if(!(++i % 7)) { registry.remove<position>(entity); }
|
|
if(!(++i % 11)) { registry.remove<velocity>(entity); }
|
|
if(!(++i % 13)) { registry.remove<comp<0>>(entity); }
|
|
if(!(++i % 17)) { registry.destroy(entity); }
|
|
});
|
|
|
|
for(std::uint64_t j = 0; j < 50000L; j++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity);
|
|
registry.emplace<velocity>(entity);
|
|
registry.emplace<comp<0>>(entity);
|
|
}
|
|
}
|
|
|
|
timer timer;
|
|
func(registry).each([](auto &...comp) { ((comp.x = {}), ...); });
|
|
timer.elapsed();
|
|
}
|
|
|
|
TEST(Benchmark, Create) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Creating 1000000 entities" << std::endl;
|
|
|
|
timer timer;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
static_cast<void>(registry.create());
|
|
}
|
|
|
|
timer.elapsed();
|
|
}
|
|
|
|
TEST(Benchmark, CreateMany) {
|
|
entt::registry registry;
|
|
std::vector<entt::entity> entities(1000000);
|
|
|
|
std::cout << "Creating 1000000 entities at once" << std::endl;
|
|
|
|
timer timer;
|
|
registry.create(entities.begin(), entities.end());
|
|
timer.elapsed();
|
|
}
|
|
|
|
TEST(Benchmark, CreateManyAndEmplaceComponents) {
|
|
entt::registry registry;
|
|
std::vector<entt::entity> entities(1000000);
|
|
|
|
std::cout << "Creating 1000000 entities at once and emplace components" << std::endl;
|
|
|
|
timer timer;
|
|
registry.create(entities.begin(), entities.end());
|
|
|
|
for(const auto entity: entities) {
|
|
registry.emplace<position>(entity);
|
|
registry.emplace<velocity>(entity);
|
|
}
|
|
|
|
timer.elapsed();
|
|
}
|
|
|
|
TEST(Benchmark, CreateManyWithComponents) {
|
|
entt::registry registry;
|
|
std::vector<entt::entity> entities(1000000);
|
|
|
|
std::cout << "Creating 1000000 entities at once with components" << std::endl;
|
|
|
|
timer timer;
|
|
registry.create(entities.begin(), entities.end());
|
|
registry.insert<position>(entities.begin(), entities.end());
|
|
registry.insert<velocity>(entities.begin(), entities.end());
|
|
timer.elapsed();
|
|
}
|
|
|
|
TEST(Benchmark, Erase) {
|
|
entt::registry registry;
|
|
std::vector<entt::entity> entities(1000000);
|
|
auto view = registry.view<int>();
|
|
|
|
std::cout << "Erasing 1000000 components from their entities" << std::endl;
|
|
|
|
registry.create(entities.begin(), entities.end());
|
|
registry.insert<int>(entities.begin(), entities.end());
|
|
|
|
timer timer;
|
|
|
|
for(auto entity: view) {
|
|
registry.erase<int>(entity);
|
|
}
|
|
|
|
timer.elapsed();
|
|
}
|
|
|
|
TEST(Benchmark, EraseMany) {
|
|
entt::registry registry;
|
|
std::vector<entt::entity> entities(1000000);
|
|
auto view = registry.view<int>();
|
|
|
|
std::cout << "Erasing 1000000 components from their entities at once" << std::endl;
|
|
|
|
registry.create(entities.begin(), entities.end());
|
|
registry.insert<int>(entities.begin(), entities.end());
|
|
|
|
timer timer;
|
|
registry.erase<int>(view.begin(), view.end());
|
|
timer.elapsed();
|
|
}
|
|
|
|
TEST(Benchmark, Remove) {
|
|
entt::registry registry;
|
|
std::vector<entt::entity> entities(1000000);
|
|
auto view = registry.view<int>();
|
|
|
|
std::cout << "Removing 1000000 components from their entities" << std::endl;
|
|
|
|
registry.create(entities.begin(), entities.end());
|
|
registry.insert<int>(entities.begin(), entities.end());
|
|
|
|
timer timer;
|
|
|
|
for(auto entity: view) {
|
|
registry.remove<int>(entity);
|
|
}
|
|
|
|
timer.elapsed();
|
|
}
|
|
|
|
TEST(Benchmark, RemoveMany) {
|
|
entt::registry registry;
|
|
std::vector<entt::entity> entities(1000000);
|
|
auto view = registry.view<int>();
|
|
|
|
std::cout << "Removing 1000000 components from their entities at once" << std::endl;
|
|
|
|
registry.create(entities.begin(), entities.end());
|
|
registry.insert<int>(entities.begin(), entities.end());
|
|
|
|
timer timer;
|
|
registry.remove<int>(view.begin(), view.end());
|
|
timer.elapsed();
|
|
}
|
|
|
|
TEST(Benchmark, Clear) {
|
|
entt::registry registry;
|
|
std::vector<entt::entity> entities(1000000);
|
|
|
|
std::cout << "Clearing 1000000 components from their entities" << std::endl;
|
|
|
|
registry.create(entities.begin(), entities.end());
|
|
registry.insert<int>(entities.begin(), entities.end());
|
|
|
|
timer timer;
|
|
registry.clear<int>();
|
|
timer.elapsed();
|
|
}
|
|
|
|
TEST(Benchmark, Recycle) {
|
|
entt::registry registry;
|
|
std::vector<entt::entity> entities(1000000);
|
|
|
|
std::cout << "Recycling 1000000 entities" << std::endl;
|
|
|
|
registry.create(entities.begin(), entities.end());
|
|
|
|
registry.each([®istry](auto entity) {
|
|
registry.destroy(entity);
|
|
});
|
|
|
|
timer timer;
|
|
|
|
for(auto next = entities.size(); next; --next) {
|
|
static_cast<void>(registry.create());
|
|
}
|
|
|
|
timer.elapsed();
|
|
}
|
|
|
|
TEST(Benchmark, RecycleMany) {
|
|
entt::registry registry;
|
|
std::vector<entt::entity> entities(1000000);
|
|
|
|
std::cout << "Recycling 1000000 entities" << std::endl;
|
|
|
|
registry.create(entities.begin(), entities.end());
|
|
|
|
registry.each([®istry](auto entity) {
|
|
registry.destroy(entity);
|
|
});
|
|
|
|
timer timer;
|
|
registry.create(entities.begin(), entities.end());
|
|
timer.elapsed();
|
|
}
|
|
|
|
TEST(Benchmark, Destroy) {
|
|
entt::registry registry;
|
|
std::vector<entt::entity> entities(1000000);
|
|
auto view = registry.view<int>();
|
|
|
|
std::cout << "Destroying 1000000 entities" << std::endl;
|
|
|
|
registry.create(entities.begin(), entities.end());
|
|
registry.insert<int>(entities.begin(), entities.end());
|
|
|
|
timer timer;
|
|
|
|
for(auto entity: view) {
|
|
registry.destroy(entity);
|
|
}
|
|
|
|
timer.elapsed();
|
|
}
|
|
|
|
TEST(Benchmark, DestroyMany) {
|
|
entt::registry registry;
|
|
std::vector<entt::entity> entities(1000000);
|
|
auto view = registry.view<int>();
|
|
|
|
std::cout << "Destroying 1000000 entities at once" << std::endl;
|
|
|
|
registry.create(entities.begin(), entities.end());
|
|
registry.insert<int>(entities.begin(), entities.end());
|
|
|
|
timer timer;
|
|
registry.destroy(view.begin(), view.end());
|
|
timer.elapsed();
|
|
}
|
|
|
|
TEST(Benchmark, DestroyManyFastPath) {
|
|
entt::registry registry;
|
|
std::vector<entt::entity> entities(1000000);
|
|
|
|
std::cout << "Destroying 1000000 entities at once, fast path" << std::endl;
|
|
|
|
registry.create(entities.begin(), entities.end());
|
|
registry.insert<int>(entities.begin(), entities.end());
|
|
|
|
timer timer;
|
|
registry.destroy(entities.begin(), entities.end());
|
|
timer.elapsed();
|
|
}
|
|
|
|
TEST(Benchmark, IterateSingleComponent1M) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, one component" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity);
|
|
}
|
|
|
|
generic(registry.view<position>(), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateSingleComponentTombstonePolicy1M) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, one component, tombstone policy" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<stable_position>(entity);
|
|
}
|
|
|
|
generic(registry.view<stable_position>(), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateSingleComponentRuntime1M) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, one component, runtime view" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity);
|
|
}
|
|
|
|
entt::runtime_view view{};
|
|
view.iterate(registry.storage<position>());
|
|
|
|
generic(view, [®istry](auto entity) {
|
|
registry.get<position>(entity).x = {};
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateTwoComponents1M) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, two components" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity);
|
|
registry.emplace<velocity>(entity);
|
|
}
|
|
|
|
generic(registry.view<position, velocity>(), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateTombstonePolicyTwoComponentsTombstonePolicy1M) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, two components, tombstone policy" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<stable_position>(entity);
|
|
registry.emplace<velocity>(entity);
|
|
}
|
|
|
|
generic(registry.view<stable_position, velocity>(), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateTwoComponents1MHalf) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, two components, half of the entities have all the components" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<velocity>(entity);
|
|
|
|
if(i % 2) {
|
|
registry.emplace<position>(entity);
|
|
}
|
|
}
|
|
|
|
generic(registry.view<position, velocity>(), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateTwoComponents1MOne) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, two components, only one entity has all the components" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<velocity>(entity);
|
|
|
|
if(i == 500000L) {
|
|
registry.emplace<position>(entity);
|
|
}
|
|
}
|
|
|
|
generic(registry.view<position, velocity>(), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateTwoComponentsNonOwningGroup1M) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, two components, non owning group" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity);
|
|
registry.emplace<velocity>(entity);
|
|
}
|
|
|
|
generic(registry.group<>(entt::get<position, velocity>), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateTwoComponentsFullOwningGroup1M) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, two components, full owning group" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity);
|
|
registry.emplace<velocity>(entity);
|
|
}
|
|
|
|
generic(registry.group<position, velocity>(), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateTwoComponentsPartialOwningGroup1M) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, two components, partial owning group" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity);
|
|
registry.emplace<velocity>(entity);
|
|
}
|
|
|
|
generic(registry.group<position>(entt::get<velocity>), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateTwoComponentsRuntime1M) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, two components, runtime view" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity);
|
|
registry.emplace<velocity>(entity);
|
|
}
|
|
|
|
entt::runtime_view view{};
|
|
view.iterate(registry.storage<position>())
|
|
.iterate(registry.storage<velocity>());
|
|
|
|
generic(view, [®istry](auto entity) {
|
|
registry.get<position>(entity).x = {};
|
|
registry.get<velocity>(entity).x = {};
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateTwoComponentsRuntime1MHalf) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, two components, half of the entities have all the components, runtime view" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<velocity>(entity);
|
|
|
|
if(i % 2) {
|
|
registry.emplace<position>(entity);
|
|
}
|
|
}
|
|
|
|
entt::runtime_view view{};
|
|
view.iterate(registry.storage<position>())
|
|
.iterate(registry.storage<velocity>());
|
|
|
|
generic(view, [®istry](auto entity) {
|
|
registry.get<position>(entity).x = {};
|
|
registry.get<velocity>(entity).x = {};
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateTwoComponentsRuntime1MOne) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, two components, only one entity has all the components, runtime view" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<velocity>(entity);
|
|
|
|
if(i == 500000L) {
|
|
registry.emplace<position>(entity);
|
|
}
|
|
}
|
|
|
|
entt::runtime_view view{};
|
|
view.iterate(registry.storage<position>())
|
|
.iterate(registry.storage<velocity>());
|
|
|
|
generic(view, [®istry](auto entity) {
|
|
registry.get<position>(entity).x = {};
|
|
registry.get<velocity>(entity).x = {};
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateThreeComponents1M) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, three components" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity);
|
|
registry.emplace<velocity>(entity);
|
|
registry.emplace<comp<0>>(entity);
|
|
}
|
|
|
|
generic(registry.view<position, velocity, comp<0>>(), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateThreeComponentsTombstonePolicy1M) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, three components, tombstone policy" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<stable_position>(entity);
|
|
registry.emplace<velocity>(entity);
|
|
registry.emplace<comp<0>>(entity);
|
|
}
|
|
|
|
generic(registry.view<stable_position, velocity, comp<0>>(), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateThreeComponents1MHalf) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, three components, half of the entities have all the components" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<velocity>(entity);
|
|
registry.emplace<comp<0>>(entity);
|
|
|
|
if(i % 2) {
|
|
registry.emplace<position>(entity);
|
|
}
|
|
}
|
|
|
|
generic(registry.view<position, velocity, comp<0>>(), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateThreeComponents1MOne) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, three components, only one entity has all the components" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<velocity>(entity);
|
|
registry.emplace<comp<0>>(entity);
|
|
|
|
if(i == 500000L) {
|
|
registry.emplace<position>(entity);
|
|
}
|
|
}
|
|
|
|
generic(registry.view<position, velocity, comp<0>>(), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateThreeComponentsNonOwningGroup1M) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, three components, non owning group" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity);
|
|
registry.emplace<velocity>(entity);
|
|
registry.emplace<comp<0>>(entity);
|
|
}
|
|
|
|
generic(registry.group<>(entt::get<position, velocity, comp<0>>), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateThreeComponentsFullOwningGroup1M) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, three components, full owning group" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity);
|
|
registry.emplace<velocity>(entity);
|
|
registry.emplace<comp<0>>(entity);
|
|
}
|
|
|
|
generic(registry.group<position, velocity, comp<0>>(), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateThreeComponentsPartialOwningGroup1M) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, three components, partial owning group" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity);
|
|
registry.emplace<velocity>(entity);
|
|
registry.emplace<comp<0>>(entity);
|
|
}
|
|
|
|
generic(registry.group<position, velocity>(entt::get<comp<0>>), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateThreeComponentsRuntime1M) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, three components, runtime view" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity);
|
|
registry.emplace<velocity>(entity);
|
|
registry.emplace<comp<0>>(entity);
|
|
}
|
|
|
|
entt::runtime_view view{};
|
|
view.iterate(registry.storage<position>())
|
|
.iterate(registry.storage<velocity>())
|
|
.iterate(registry.storage<comp<0>>());
|
|
|
|
generic(view, [®istry](auto entity) {
|
|
registry.get<position>(entity).x = {};
|
|
registry.get<velocity>(entity).x = {};
|
|
registry.get<comp<0>>(entity).x = {};
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateThreeComponentsRuntime1MHalf) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, three components, half of the entities have all the components, runtime view" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<velocity>(entity);
|
|
registry.emplace<comp<0>>(entity);
|
|
|
|
if(i % 2) {
|
|
registry.emplace<position>(entity);
|
|
}
|
|
}
|
|
|
|
entt::runtime_view view{};
|
|
view.iterate(registry.storage<position>())
|
|
.iterate(registry.storage<velocity>())
|
|
.iterate(registry.storage<comp<0>>());
|
|
|
|
generic(view, [®istry](auto entity) {
|
|
registry.get<position>(entity).x = {};
|
|
registry.get<velocity>(entity).x = {};
|
|
registry.get<comp<0>>(entity).x = {};
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateThreeComponentsRuntime1MOne) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, three components, only one entity has all the components, runtime view" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<velocity>(entity);
|
|
registry.emplace<comp<0>>(entity);
|
|
|
|
if(i == 500000L) {
|
|
registry.emplace<position>(entity);
|
|
}
|
|
}
|
|
|
|
entt::runtime_view view{};
|
|
view.iterate(registry.storage<position>())
|
|
.iterate(registry.storage<velocity>())
|
|
.iterate(registry.storage<comp<0>>());
|
|
|
|
generic(view, [®istry](auto entity) {
|
|
registry.get<position>(entity).x = {};
|
|
registry.get<velocity>(entity).x = {};
|
|
registry.get<comp<0>>(entity).x = {};
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateFiveComponents1M) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, five components" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity);
|
|
registry.emplace<velocity>(entity);
|
|
registry.emplace<comp<0>>(entity);
|
|
registry.emplace<comp<1>>(entity);
|
|
registry.emplace<comp<2>>(entity);
|
|
}
|
|
|
|
generic(registry.view<position, velocity, comp<0>, comp<1>, comp<2>>(), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateFiveComponentsTombstonePolicy1M) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, five components, tombstone policy" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<stable_position>(entity);
|
|
registry.emplace<velocity>(entity);
|
|
registry.emplace<comp<0>>(entity);
|
|
registry.emplace<comp<1>>(entity);
|
|
registry.emplace<comp<2>>(entity);
|
|
}
|
|
|
|
generic(registry.view<stable_position, velocity, comp<0>, comp<1>, comp<2>>(), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateFiveComponents1MHalf) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, five components, half of the entities have all the components" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<velocity>(entity);
|
|
registry.emplace<comp<0>>(entity);
|
|
registry.emplace<comp<1>>(entity);
|
|
registry.emplace<comp<2>>(entity);
|
|
|
|
if(i % 2) {
|
|
registry.emplace<position>(entity);
|
|
}
|
|
}
|
|
|
|
generic(registry.view<position, velocity, comp<0>, comp<1>, comp<2>>(), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateFiveComponents1MOne) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, five components, only one entity has all the components" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<velocity>(entity);
|
|
registry.emplace<comp<0>>(entity);
|
|
registry.emplace<comp<1>>(entity);
|
|
registry.emplace<comp<2>>(entity);
|
|
|
|
if(i == 500000L) {
|
|
registry.emplace<position>(entity);
|
|
}
|
|
}
|
|
|
|
generic(registry.view<position, velocity, comp<0>, comp<1>, comp<2>>(), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateFiveComponentsNonOwningGroup1M) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, five components, non owning group" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity);
|
|
registry.emplace<velocity>(entity);
|
|
registry.emplace<comp<0>>(entity);
|
|
registry.emplace<comp<1>>(entity);
|
|
registry.emplace<comp<2>>(entity);
|
|
}
|
|
|
|
generic(registry.group<>(entt::get<position, velocity, comp<0>, comp<1>, comp<2>>), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateFiveComponentsFullOwningGroup1M) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, five components, full owning group" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity);
|
|
registry.emplace<velocity>(entity);
|
|
registry.emplace<comp<0>>(entity);
|
|
registry.emplace<comp<1>>(entity);
|
|
registry.emplace<comp<2>>(entity);
|
|
}
|
|
|
|
generic(registry.group<position, velocity, comp<0>, comp<1>, comp<2>>(), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateFiveComponentsPartialFourOfFiveOwningGroup1M) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, five components, partial (4 of 5) owning group" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity);
|
|
registry.emplace<velocity>(entity);
|
|
registry.emplace<comp<0>>(entity);
|
|
registry.emplace<comp<1>>(entity);
|
|
registry.emplace<comp<2>>(entity);
|
|
}
|
|
|
|
generic(registry.group<position, velocity, comp<0>, comp<1>>(entt::get<comp<2>>), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateFiveComponentsPartialThreeOfFiveOwningGroup1M) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, five components, partial (3 of 5) owning group" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity);
|
|
registry.emplace<velocity>(entity);
|
|
registry.emplace<comp<0>>(entity);
|
|
registry.emplace<comp<1>>(entity);
|
|
registry.emplace<comp<2>>(entity);
|
|
}
|
|
|
|
generic(registry.group<position, velocity, comp<0>>(entt::get<comp<1>, comp<2>>), [](auto &...comp) {
|
|
((comp.x = {}), ...);
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateFiveComponentsRuntime1M) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, five components, runtime view" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity);
|
|
registry.emplace<velocity>(entity);
|
|
registry.emplace<comp<0>>(entity);
|
|
registry.emplace<comp<1>>(entity);
|
|
registry.emplace<comp<2>>(entity);
|
|
}
|
|
|
|
entt::runtime_view view{};
|
|
view.iterate(registry.storage<position>())
|
|
.iterate(registry.storage<velocity>())
|
|
.iterate(registry.storage<comp<0>>())
|
|
.iterate(registry.storage<comp<1>>())
|
|
.iterate(registry.storage<comp<2>>());
|
|
|
|
generic(view, [®istry](auto entity) {
|
|
registry.get<position>(entity).x = {};
|
|
registry.get<velocity>(entity).x = {};
|
|
registry.get<comp<0>>(entity).x = {};
|
|
registry.get<comp<1>>(entity).x = {};
|
|
registry.get<comp<2>>(entity).x = {};
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateFiveComponentsRuntime1MHalf) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, five components, half of the entities have all the components, runtime view" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<velocity>(entity);
|
|
registry.emplace<comp<0>>(entity);
|
|
registry.emplace<comp<1>>(entity);
|
|
registry.emplace<comp<2>>(entity);
|
|
|
|
if(i % 2) {
|
|
registry.emplace<position>(entity);
|
|
}
|
|
}
|
|
|
|
entt::runtime_view view{};
|
|
view.iterate(registry.storage<position>())
|
|
.iterate(registry.storage<velocity>())
|
|
.iterate(registry.storage<comp<0>>())
|
|
.iterate(registry.storage<comp<1>>())
|
|
.iterate(registry.storage<comp<2>>());
|
|
|
|
generic(view, [®istry](auto entity) {
|
|
registry.get<position>(entity).x = {};
|
|
registry.get<velocity>(entity).x = {};
|
|
registry.get<comp<0>>(entity).x = {};
|
|
registry.get<comp<1>>(entity).x = {};
|
|
registry.get<comp<2>>(entity).x = {};
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IterateFiveComponentsRuntime1MOne) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Iterating over 1000000 entities, five components, only one entity has all the components, runtime view" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 1000000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<velocity>(entity);
|
|
registry.emplace<comp<0>>(entity);
|
|
registry.emplace<comp<1>>(entity);
|
|
registry.emplace<comp<2>>(entity);
|
|
|
|
if(i == 500000L) {
|
|
registry.emplace<position>(entity);
|
|
}
|
|
}
|
|
|
|
entt::runtime_view view{};
|
|
view.iterate(registry.storage<position>())
|
|
.iterate(registry.storage<velocity>())
|
|
.iterate(registry.storage<comp<0>>())
|
|
.iterate(registry.storage<comp<1>>())
|
|
.iterate(registry.storage<comp<2>>());
|
|
|
|
generic(view, [®istry](auto entity) {
|
|
registry.get<position>(entity).x = {};
|
|
registry.get<velocity>(entity).x = {};
|
|
registry.get<comp<0>>(entity).x = {};
|
|
registry.get<comp<1>>(entity).x = {};
|
|
registry.get<comp<2>>(entity).x = {};
|
|
});
|
|
}
|
|
|
|
TEST(Benchmark, IteratePathological) {
|
|
std::cout << "Pathological case" << std::endl;
|
|
pathological([](auto ®istry) { return registry.template view<position, velocity, comp<0>>(); });
|
|
}
|
|
|
|
TEST(Benchmark, IteratePathologicalNonOwningGroup) {
|
|
std::cout << "Pathological case (non-owning group)" << std::endl;
|
|
pathological([](auto ®istry) { return registry.template group<>(entt::get<position, velocity, comp<0>>); });
|
|
}
|
|
|
|
TEST(Benchmark, IteratePathologicalFullOwningGroup) {
|
|
std::cout << "Pathological case (full-owning group)" << std::endl;
|
|
pathological([](auto ®istry) { return registry.template group<position, velocity, comp<0>>(); });
|
|
}
|
|
|
|
TEST(Benchmark, IteratePathologicalPartialOwningGroup) {
|
|
std::cout << "Pathological case (partial-owning group)" << std::endl;
|
|
pathological([](auto ®istry) { return registry.template group<position, velocity>(entt::get<comp<0>>); });
|
|
}
|
|
|
|
TEST(Benchmark, SortSingle) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Sort 150000 entities, one component" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 150000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity, i, i);
|
|
}
|
|
|
|
timer timer;
|
|
registry.sort<position>([](const auto &lhs, const auto &rhs) { return lhs.x < rhs.x && lhs.y < rhs.y; });
|
|
timer.elapsed();
|
|
}
|
|
|
|
TEST(Benchmark, SortMulti) {
|
|
entt::registry registry;
|
|
|
|
std::cout << "Sort 150000 entities, two components" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 150000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity, i, i);
|
|
registry.emplace<velocity>(entity, i, i);
|
|
}
|
|
|
|
registry.sort<position>([](const auto &lhs, const auto &rhs) { return lhs.x < rhs.x && lhs.y < rhs.y; });
|
|
|
|
timer timer;
|
|
registry.sort<velocity, position>();
|
|
timer.elapsed();
|
|
}
|
|
|
|
TEST(Benchmark, AlmostSortedStdSort) {
|
|
entt::registry registry;
|
|
entt::entity entities[3]{};
|
|
|
|
std::cout << "Sort 150000 entities, almost sorted, std::sort" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 150000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity, i, i);
|
|
|
|
if(!(i % 50000)) {
|
|
entities[i / 50000] = entity;
|
|
}
|
|
}
|
|
|
|
for(std::uint64_t i = 0; i < 3; ++i) {
|
|
registry.destroy(entities[i]);
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity, 50000 * i, 50000 * i);
|
|
}
|
|
|
|
timer timer;
|
|
registry.sort<position>([](const auto &lhs, const auto &rhs) { return lhs.x > rhs.x && lhs.y > rhs.y; });
|
|
timer.elapsed();
|
|
}
|
|
|
|
TEST(Benchmark, AlmostSortedInsertionSort) {
|
|
entt::registry registry;
|
|
entt::entity entities[3]{};
|
|
|
|
std::cout << "Sort 150000 entities, almost sorted, insertion sort" << std::endl;
|
|
|
|
for(std::uint64_t i = 0; i < 150000L; i++) {
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity, i, i);
|
|
|
|
if(!(i % 50000)) {
|
|
entities[i / 50000] = entity;
|
|
}
|
|
}
|
|
|
|
for(std::uint64_t i = 0; i < 3; ++i) {
|
|
registry.destroy(entities[i]);
|
|
const auto entity = registry.create();
|
|
registry.emplace<position>(entity, 50000 * i, 50000 * i);
|
|
}
|
|
|
|
timer timer;
|
|
registry.sort<position>([](const auto &lhs, const auto &rhs) { return lhs.x > rhs.x && lhs.y > rhs.y; }, entt::insertion_sort{});
|
|
timer.elapsed();
|
|
}
|