| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602 |
- #include <iostream>
- #include <cstddef>
- #include <cstdint>
- #include <chrono>
- #include <gtest/gtest.h>
- #include <entt/entity/registry.hpp>
- struct Position {
- std::uint64_t x;
- std::uint64_t y;
- };
- struct Velocity {
- std::uint64_t x;
- std::uint64_t y;
- };
- template<std::size_t>
- 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;
- };
- TEST(Benchmark, Construct) {
- entt::DefaultRegistry registry;
- std::cout << "Constructing 1000000 entities" << std::endl;
- Timer timer;
- for(std::uint64_t i = 0; i < 1000000L; i++) {
- registry.create();
- }
- timer.elapsed();
- }
- TEST(Benchmark, Destroy) {
- entt::DefaultRegistry registry;
- std::cout << "Destroying 1000000 entities" << std::endl;
- for(std::uint64_t i = 0; i < 1000000L; i++) {
- registry.create();
- }
- Timer timer;
- registry.each([®istry](auto entity) {
- registry.destroy(entity);
- });
- timer.elapsed();
- }
- TEST(Benchmark, IterateCreateDeleteSingleComponent) {
- entt::DefaultRegistry registry;
- std::cout << "Looping 10000 times creating and deleting a random number of entities" << std::endl;
- Timer timer;
- auto view = registry.view<Position>();
- for(int i = 0; i < 10000; i++) {
- for(int j = 0; j < 10000; j++) {
- const auto entity = registry.create();
- registry.assign<Position>(entity);
- }
- for(auto entity: view) {
- if(rand() % 2 == 0) {
- registry.destroy(entity);
- }
- }
- }
- timer.elapsed();
- }
- TEST(Benchmark, IterateSingleComponent1M) {
- entt::DefaultRegistry 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.assign<Position>(entity);
- }
- auto test = [®istry](auto func) {
- Timer timer;
- registry.view<Position>().each(func);
- timer.elapsed();
- };
- test([](auto, const auto &) {});
- test([](auto, auto &... comp) {
- using accumulator_type = int[];
- accumulator_type accumulator = { (comp.x = {}, 0)... };
- (void)accumulator;
- });
- }
- TEST(Benchmark, IterateSingleComponentRaw1M) {
- entt::DefaultRegistry registry;
- std::cout << "Iterating over 1000000 entities, one component, raw view" << std::endl;
- for(std::uint64_t i = 0; i < 1000000L; i++) {
- const auto entity = registry.create();
- registry.assign<Position>(entity);
- }
- auto test = [®istry](auto func) {
- Timer timer;
- registry.view<Position>(entt::raw_t{}).each(func);
- timer.elapsed();
- };
- test([](const auto &) {});
- test([](auto &... comp) {
- using accumulator_type = int[];
- accumulator_type accumulator = { (comp.x = {}, 0)... };
- (void)accumulator;
- });
- }
- TEST(Benchmark, IterateTwoComponents1M) {
- entt::DefaultRegistry 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.assign<Position>(entity);
- registry.assign<Velocity>(entity);
- }
- auto test = [®istry](auto func) {
- Timer timer;
- registry.view<Position, Velocity>().each(func);
- timer.elapsed();
- };
- test([](auto, const auto &...) {});
- test([](auto, auto &... comp) {
- using accumulator_type = int[];
- accumulator_type accumulator = { (comp.x = {}, 0)... };
- (void)accumulator;
- });
- }
- TEST(Benchmark, IterateTwoComponents1MHalf) {
- entt::DefaultRegistry 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.assign<Velocity>(entity);
- if(i % 2) {
- registry.assign<Position>(entity);
- }
- }
- auto test = [®istry](auto func) {
- Timer timer;
- registry.view<Position, Velocity>().each(func);
- timer.elapsed();
- };
- test([](auto, const auto &...) {});
- test([](auto, auto &... comp) {
- using accumulator_type = int[];
- accumulator_type accumulator = { (comp.x = {}, 0)... };
- (void)accumulator;
- });
- }
- TEST(Benchmark, IterateTwoComponents1MOne) {
- entt::DefaultRegistry 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.assign<Velocity>(entity);
- if(i == 5000000L) {
- registry.assign<Position>(entity);
- }
- }
- auto test = [®istry](auto func) {
- Timer timer;
- registry.view<Position, Velocity>().each(func);
- timer.elapsed();
- };
- test([](auto, const auto &...) {});
- test([](auto, auto &... comp) {
- using accumulator_type = int[];
- accumulator_type accumulator = { (comp.x = {}, 0)... };
- (void)accumulator;
- });
- }
- TEST(Benchmark, IterateTwoComponentsPersistent1M) {
- entt::DefaultRegistry registry;
- registry.prepare<Position, Velocity>();
- std::cout << "Iterating over 1000000 entities, two components, persistent view" << std::endl;
- for(std::uint64_t i = 0; i < 1000000L; i++) {
- const auto entity = registry.create();
- registry.assign<Position>(entity);
- registry.assign<Velocity>(entity);
- }
- auto test = [®istry](auto func) {
- Timer timer;
- registry.view<Position, Velocity>(entt::persistent_t{}).each(func);
- timer.elapsed();
- };
- test([](auto, const auto &...) {});
- test([](auto, auto &... comp) {
- using accumulator_type = int[];
- accumulator_type accumulator = { (comp.x = {}, 0)... };
- (void)accumulator;
- });
- }
- TEST(Benchmark, IterateFiveComponents1M) {
- entt::DefaultRegistry 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.assign<Position>(entity);
- registry.assign<Velocity>(entity);
- registry.assign<Comp<1>>(entity);
- registry.assign<Comp<2>>(entity);
- registry.assign<Comp<3>>(entity);
- }
- auto test = [®istry](auto func) {
- Timer timer;
- registry.view<Position, Velocity, Comp<1>, Comp<2>, Comp<3>>().each(func);
- timer.elapsed();
- };
- test([](auto, const auto &...) {});
- test([](auto, auto &... comp) {
- using accumulator_type = int[];
- accumulator_type accumulator = { (comp.x = {}, 0)... };
- (void)accumulator;
- });
- }
- TEST(Benchmark, IterateFiveComponents1MHalf) {
- entt::DefaultRegistry 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.assign<Velocity>(entity);
- registry.assign<Comp<1>>(entity);
- registry.assign<Comp<2>>(entity);
- registry.assign<Comp<3>>(entity);
- if(i % 2) {
- registry.assign<Position>(entity);
- }
- }
- auto test = [®istry](auto func) {
- Timer timer;
- registry.view<Position, Velocity, Comp<1>, Comp<2>, Comp<3>>().each(func);
- timer.elapsed();
- };
- test([](auto, const auto &...) {});
- test([](auto, auto &... comp) {
- using accumulator_type = int[];
- accumulator_type accumulator = { (comp.x = {}, 0)... };
- (void)accumulator;
- });
- }
- TEST(Benchmark, IterateFiveComponents1MOne) {
- entt::DefaultRegistry 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.assign<Velocity>(entity);
- registry.assign<Comp<1>>(entity);
- registry.assign<Comp<2>>(entity);
- registry.assign<Comp<3>>(entity);
- if(i == 5000000L) {
- registry.assign<Position>(entity);
- }
- }
- auto test = [®istry](auto func) {
- Timer timer;
- registry.view<Position, Velocity, Comp<1>, Comp<2>, Comp<3>>().each(func);
- timer.elapsed();
- };
- test([](auto, const auto &...) {});
- test([](auto, auto &... comp) {
- using accumulator_type = int[];
- accumulator_type accumulator = { (comp.x = {}, 0)... };
- (void)accumulator;
- });
- }
- TEST(Benchmark, IterateFiveComponentsPersistent1M) {
- entt::DefaultRegistry registry;
- registry.prepare<Position, Velocity, Comp<1>, Comp<2>, Comp<3>>();
- std::cout << "Iterating over 1000000 entities, five components, persistent view" << std::endl;
- for(std::uint64_t i = 0; i < 1000000L; i++) {
- const auto entity = registry.create();
- registry.assign<Position>(entity);
- registry.assign<Velocity>(entity);
- registry.assign<Comp<1>>(entity);
- registry.assign<Comp<2>>(entity);
- registry.assign<Comp<3>>(entity);
- }
- auto test = [®istry](auto func) {
- Timer timer;
- registry.view<Position, Velocity, Comp<1>, Comp<2>, Comp<3>>(entt::persistent_t{}).each(func);
- timer.elapsed();
- };
- test([](auto, const auto &...) {});
- test([](auto, auto &... comp) {
- using accumulator_type = int[];
- accumulator_type accumulator = { (comp.x = {}, 0)... };
- (void)accumulator;
- });
- }
- TEST(Benchmark, IterateTenComponents1M) {
- entt::DefaultRegistry registry;
- std::cout << "Iterating over 1000000 entities, ten components" << std::endl;
- for(std::uint64_t i = 0; i < 1000000L; i++) {
- const auto entity = registry.create();
- registry.assign<Position>(entity);
- registry.assign<Velocity>(entity);
- registry.assign<Comp<1>>(entity);
- registry.assign<Comp<2>>(entity);
- registry.assign<Comp<3>>(entity);
- registry.assign<Comp<4>>(entity);
- registry.assign<Comp<5>>(entity);
- registry.assign<Comp<6>>(entity);
- registry.assign<Comp<7>>(entity);
- registry.assign<Comp<8>>(entity);
- }
- auto test = [®istry](auto func) {
- Timer timer;
- registry.view<Position, Velocity, Comp<1>, Comp<2>, Comp<3>, Comp<4>, Comp<5>, Comp<6>, Comp<7>, Comp<8>>().each(func);
- timer.elapsed();
- };
- test([](auto, const auto &...) {});
- test([](auto, auto &... comp) {
- using accumulator_type = int[];
- accumulator_type accumulator = { (comp.x = {}, 0)... };
- (void)accumulator;
- });
- }
- TEST(Benchmark, IterateTenComponents1MHalf) {
- entt::DefaultRegistry registry;
- std::cout << "Iterating over 1000000 entities, ten 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.assign<Velocity>(entity);
- registry.assign<Comp<1>>(entity);
- registry.assign<Comp<2>>(entity);
- registry.assign<Comp<3>>(entity);
- registry.assign<Comp<4>>(entity);
- registry.assign<Comp<5>>(entity);
- registry.assign<Comp<6>>(entity);
- registry.assign<Comp<7>>(entity);
- registry.assign<Comp<8>>(entity);
- if(i % 2) {
- registry.assign<Position>(entity);
- }
- }
- auto test = [®istry](auto func) {
- Timer timer;
- registry.view<Position, Velocity, Comp<1>, Comp<2>, Comp<3>, Comp<4>, Comp<5>, Comp<6>, Comp<7>, Comp<8>>().each(func);
- timer.elapsed();
- };
- test([](auto, auto &...) {});
- test([](auto, auto &... comp) {
- using accumulator_type = int[];
- accumulator_type accumulator = { (comp.x = {}, 0)... };
- (void)accumulator;
- });
- }
- TEST(Benchmark, IterateTenComponents1MOne) {
- entt::DefaultRegistry registry;
- std::cout << "Iterating over 1000000 entities, ten 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.assign<Velocity>(entity);
- registry.assign<Comp<1>>(entity);
- registry.assign<Comp<2>>(entity);
- registry.assign<Comp<3>>(entity);
- registry.assign<Comp<4>>(entity);
- registry.assign<Comp<5>>(entity);
- registry.assign<Comp<6>>(entity);
- registry.assign<Comp<7>>(entity);
- registry.assign<Comp<8>>(entity);
- if(i == 5000000L) {
- registry.assign<Position>(entity);
- }
- }
- auto test = [®istry](auto func) {
- Timer timer;
- registry.view<Position, Velocity, Comp<1>, Comp<2>, Comp<3>, Comp<4>, Comp<5>, Comp<6>, Comp<7>, Comp<8>>().each(func);
- timer.elapsed();
- };
- test([](auto, const auto &...) {});
- test([](auto, auto &... comp) {
- using accumulator_type = int[];
- accumulator_type accumulator = { (comp.x = {}, 0)... };
- (void)accumulator;
- });
- }
- TEST(Benchmark, IterateTenComponentsPersistent1M) {
- entt::DefaultRegistry registry;
- registry.prepare<Position, Velocity, Comp<1>, Comp<2>, Comp<3>, Comp<4>, Comp<5>, Comp<6>, Comp<7>, Comp<8>>();
- std::cout << "Iterating over 1000000 entities, ten components, persistent view" << std::endl;
- for(std::uint64_t i = 0; i < 1000000L; i++) {
- const auto entity = registry.create();
- registry.assign<Position>(entity);
- registry.assign<Velocity>(entity);
- registry.assign<Comp<1>>(entity);
- registry.assign<Comp<2>>(entity);
- registry.assign<Comp<3>>(entity);
- registry.assign<Comp<4>>(entity);
- registry.assign<Comp<5>>(entity);
- registry.assign<Comp<6>>(entity);
- registry.assign<Comp<7>>(entity);
- registry.assign<Comp<8>>(entity);
- }
- auto test = [®istry](auto func) {
- Timer timer;
- registry.view<Position, Velocity, Comp<1>, Comp<2>, Comp<3>, Comp<4>, Comp<5>, Comp<6>, Comp<7>, Comp<8>>(entt::persistent_t{}).each(func);
- timer.elapsed();
- };
- test([](auto, const auto &...) {});
- test([](auto, auto &... comp) {
- using accumulator_type = int[];
- accumulator_type accumulator = { (comp.x = {}, 0)... };
- (void)accumulator;
- });
- }
- TEST(Benchmark, SortSingle) {
- entt::DefaultRegistry 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.assign<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::DefaultRegistry 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.assign<Position>(entity, i, i);
- registry.assign<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::DefaultRegistry registry;
- entt::DefaultRegistry::entity_type 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.assign<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.assign<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::DefaultRegistry registry;
- entt::DefaultRegistry::entity_type 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.assign<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.assign<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::InsertionSort{});
- timer.elapsed();
- }
|