benchmark.cpp 35 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164
  1. #include <chrono>
  2. #include <cstdint>
  3. #include <iostream>
  4. #include <utility>
  5. #include <vector>
  6. #include <gtest/gtest.h>
  7. #include <entt/entity/registry.hpp>
  8. #include <entt/entity/runtime_view.hpp>
  9. struct position {
  10. std::uint64_t x;
  11. std::uint64_t y;
  12. };
  13. struct velocity: position {};
  14. struct stable_position: position {
  15. static constexpr auto in_place_delete = true;
  16. };
  17. template<auto>
  18. struct comp {
  19. int x;
  20. };
  21. struct timer final {
  22. timer()
  23. : start{std::chrono::system_clock::now()} {}
  24. void elapsed() {
  25. auto now = std::chrono::system_clock::now();
  26. std::cout << std::chrono::duration<double>(now - start).count() << " seconds" << std::endl;
  27. }
  28. private:
  29. std::chrono::time_point<std::chrono::system_clock> start;
  30. };
  31. template<typename Iterable, typename Func>
  32. void generic(Iterable &&iterable, Func func) {
  33. timer timer;
  34. std::forward<Iterable>(iterable).each(func);
  35. timer.elapsed();
  36. }
  37. template<typename Func>
  38. void pathological(Func func) {
  39. entt::registry registry;
  40. for(std::uint64_t i = 0; i < 500000L; i++) {
  41. const auto entity = registry.create();
  42. registry.emplace<position>(entity);
  43. registry.emplace<velocity>(entity);
  44. registry.emplace<comp<0>>(entity);
  45. }
  46. for(auto i = 0; i < 10; ++i) {
  47. registry.each([i = 0, &registry](const auto entity) mutable {
  48. if(!(++i % 7)) {
  49. registry.remove<position>(entity);
  50. }
  51. if(!(++i % 11)) {
  52. registry.remove<velocity>(entity);
  53. }
  54. if(!(++i % 13)) {
  55. registry.remove<comp<0>>(entity);
  56. }
  57. if(!(++i % 17)) {
  58. registry.destroy(entity);
  59. }
  60. });
  61. for(std::uint64_t j = 0; j < 50000L; j++) {
  62. const auto entity = registry.create();
  63. registry.emplace<position>(entity);
  64. registry.emplace<velocity>(entity);
  65. registry.emplace<comp<0>>(entity);
  66. }
  67. }
  68. timer timer;
  69. func(registry).each([](auto &...comp) { ((comp.x = {}), ...); });
  70. timer.elapsed();
  71. }
  72. TEST(Benchmark, Create) {
  73. entt::registry registry;
  74. std::cout << "Creating 1000000 entities" << std::endl;
  75. timer timer;
  76. for(std::uint64_t i = 0; i < 1000000L; i++) {
  77. static_cast<void>(registry.create());
  78. }
  79. timer.elapsed();
  80. }
  81. TEST(Benchmark, CreateMany) {
  82. entt::registry registry;
  83. std::vector<entt::entity> entities(1000000);
  84. std::cout << "Creating 1000000 entities at once" << std::endl;
  85. timer timer;
  86. registry.create(entities.begin(), entities.end());
  87. timer.elapsed();
  88. }
  89. TEST(Benchmark, CreateManyAndEmplaceComponents) {
  90. entt::registry registry;
  91. std::vector<entt::entity> entities(1000000);
  92. std::cout << "Creating 1000000 entities at once and emplace components" << std::endl;
  93. timer timer;
  94. registry.create(entities.begin(), entities.end());
  95. for(const auto entity: entities) {
  96. registry.emplace<position>(entity);
  97. registry.emplace<velocity>(entity);
  98. }
  99. timer.elapsed();
  100. }
  101. TEST(Benchmark, CreateManyWithComponents) {
  102. entt::registry registry;
  103. std::vector<entt::entity> entities(1000000);
  104. std::cout << "Creating 1000000 entities at once with components" << std::endl;
  105. timer timer;
  106. registry.create(entities.begin(), entities.end());
  107. registry.insert<position>(entities.begin(), entities.end());
  108. registry.insert<velocity>(entities.begin(), entities.end());
  109. timer.elapsed();
  110. }
  111. TEST(Benchmark, Erase) {
  112. entt::registry registry;
  113. std::vector<entt::entity> entities(1000000);
  114. auto view = registry.view<position>();
  115. std::cout << "Erasing 1000000 components from their entities" << std::endl;
  116. registry.create(entities.begin(), entities.end());
  117. registry.insert<position>(entities.begin(), entities.end());
  118. timer timer;
  119. for(auto entity: view) {
  120. registry.erase<position>(entity);
  121. }
  122. timer.elapsed();
  123. }
  124. TEST(Benchmark, EraseMany) {
  125. entt::registry registry;
  126. std::vector<entt::entity> entities(1000000);
  127. auto view = registry.view<position>();
  128. std::cout << "Erasing 1000000 components from their entities at once" << std::endl;
  129. registry.create(entities.begin(), entities.end());
  130. registry.insert<position>(entities.begin(), entities.end());
  131. timer timer;
  132. registry.erase<position>(view.begin(), view.end());
  133. timer.elapsed();
  134. }
  135. TEST(Benchmark, EraseManyMulti) {
  136. entt::registry registry;
  137. std::vector<entt::entity> entities(1000000);
  138. auto view = registry.view<position>();
  139. std::cout << "Erasing 1000000 components per type from their entities at once" << std::endl;
  140. registry.create(entities.begin(), entities.end());
  141. registry.insert<position>(entities.begin(), entities.end());
  142. registry.insert<velocity>(entities.begin(), entities.end());
  143. timer timer;
  144. registry.erase<position, velocity>(view.begin(), view.end());
  145. timer.elapsed();
  146. }
  147. TEST(Benchmark, Remove) {
  148. entt::registry registry;
  149. std::vector<entt::entity> entities(1000000);
  150. auto view = registry.view<position>();
  151. std::cout << "Removing 1000000 components from their entities" << std::endl;
  152. registry.create(entities.begin(), entities.end());
  153. registry.insert<position>(entities.begin(), entities.end());
  154. timer timer;
  155. for(auto entity: view) {
  156. registry.remove<position>(entity);
  157. }
  158. timer.elapsed();
  159. }
  160. TEST(Benchmark, RemoveMany) {
  161. entt::registry registry;
  162. std::vector<entt::entity> entities(1000000);
  163. auto view = registry.view<position>();
  164. std::cout << "Removing 1000000 components from their entities at once" << std::endl;
  165. registry.create(entities.begin(), entities.end());
  166. registry.insert<position>(entities.begin(), entities.end());
  167. timer timer;
  168. registry.remove<position>(view.begin(), view.end());
  169. timer.elapsed();
  170. }
  171. TEST(Benchmark, RemoveManyMulti) {
  172. entt::registry registry;
  173. std::vector<entt::entity> entities(1000000);
  174. auto view = registry.view<position>();
  175. std::cout << "Removing 1000000 components per type from their entities at once" << std::endl;
  176. registry.create(entities.begin(), entities.end());
  177. registry.insert<position>(entities.begin(), entities.end());
  178. registry.insert<velocity>(entities.begin(), entities.end());
  179. timer timer;
  180. registry.remove<position, velocity>(view.begin(), view.end());
  181. timer.elapsed();
  182. }
  183. TEST(Benchmark, Clear) {
  184. entt::registry registry;
  185. std::vector<entt::entity> entities(1000000);
  186. std::cout << "Clearing 1000000 components from their entities" << std::endl;
  187. registry.create(entities.begin(), entities.end());
  188. registry.insert<position>(entities.begin(), entities.end());
  189. timer timer;
  190. registry.clear<position>();
  191. timer.elapsed();
  192. }
  193. TEST(Benchmark, ClearMulti) {
  194. entt::registry registry;
  195. std::vector<entt::entity> entities(1000000);
  196. std::cout << "Clearing 1000000 components per type from their entities" << std::endl;
  197. registry.create(entities.begin(), entities.end());
  198. registry.insert<position>(entities.begin(), entities.end());
  199. registry.insert<velocity>(entities.begin(), entities.end());
  200. timer timer;
  201. registry.clear<position, velocity>();
  202. timer.elapsed();
  203. }
  204. TEST(Benchmark, ClearStable) {
  205. entt::registry registry;
  206. std::vector<entt::entity> entities(1000000);
  207. std::cout << "Clearing 1000000 stable components from their entities" << std::endl;
  208. registry.create(entities.begin(), entities.end());
  209. registry.insert<stable_position>(entities.begin(), entities.end());
  210. timer timer;
  211. registry.clear<stable_position>();
  212. timer.elapsed();
  213. }
  214. TEST(Benchmark, Recycle) {
  215. entt::registry registry;
  216. std::vector<entt::entity> entities(1000000);
  217. std::cout << "Recycling 1000000 entities" << std::endl;
  218. registry.create(entities.begin(), entities.end());
  219. registry.destroy(entities.begin(), entities.end());
  220. timer timer;
  221. for(auto next = entities.size(); next; --next) {
  222. entities[next] = registry.create();
  223. }
  224. timer.elapsed();
  225. }
  226. TEST(Benchmark, RecycleMany) {
  227. entt::registry registry;
  228. std::vector<entt::entity> entities(1000000);
  229. std::cout << "Recycling 1000000 entities" << std::endl;
  230. registry.create(entities.begin(), entities.end());
  231. registry.destroy(entities.begin(), entities.end());
  232. timer timer;
  233. registry.create(entities.begin(), entities.end());
  234. timer.elapsed();
  235. }
  236. TEST(Benchmark, Destroy) {
  237. entt::registry registry;
  238. std::vector<entt::entity> entities(1000000);
  239. auto view = registry.view<position>();
  240. std::cout << "Destroying 1000000 entities" << std::endl;
  241. registry.create(entities.begin(), entities.end());
  242. registry.insert<position>(entities.begin(), entities.end());
  243. timer timer;
  244. for(auto entity: view) {
  245. registry.destroy(entity);
  246. }
  247. timer.elapsed();
  248. }
  249. TEST(Benchmark, DestroyMany) {
  250. entt::registry registry;
  251. std::vector<entt::entity> entities(1000000);
  252. auto view = registry.view<position>();
  253. std::cout << "Destroying 1000000 entities at once" << std::endl;
  254. registry.create(entities.begin(), entities.end());
  255. registry.insert<position>(entities.begin(), entities.end());
  256. timer timer;
  257. registry.destroy(view.begin(), view.end());
  258. timer.elapsed();
  259. }
  260. TEST(Benchmark, DestroyManyMulti) {
  261. entt::registry registry;
  262. std::vector<entt::entity> entities(1000000);
  263. auto view = registry.view<position>();
  264. std::cout << "Destroying 1000000 entities at once, multiple components" << std::endl;
  265. registry.create(entities.begin(), entities.end());
  266. registry.insert<position>(entities.begin(), entities.end());
  267. registry.insert<velocity>(entities.begin(), entities.end());
  268. timer timer;
  269. registry.destroy(view.begin(), view.end());
  270. timer.elapsed();
  271. }
  272. TEST(Benchmark, IterateSingleComponent1M) {
  273. entt::registry registry;
  274. std::cout << "Iterating over 1000000 entities, one component" << std::endl;
  275. for(std::uint64_t i = 0; i < 1000000L; i++) {
  276. const auto entity = registry.create();
  277. registry.emplace<position>(entity);
  278. }
  279. generic(registry.view<position>(), [](auto &...comp) {
  280. ((comp.x = {}), ...);
  281. });
  282. }
  283. TEST(Benchmark, IterateSingleStableComponent1M) {
  284. entt::registry registry;
  285. std::cout << "Iterating over 1000000 entities, one stable component" << std::endl;
  286. for(std::uint64_t i = 0; i < 1000000L; i++) {
  287. const auto entity = registry.create();
  288. registry.emplace<stable_position>(entity);
  289. }
  290. generic(registry.view<stable_position>(), [](auto &...comp) {
  291. ((comp.x = {}), ...);
  292. });
  293. }
  294. TEST(Benchmark, IterateSingleComponentRuntime1M) {
  295. entt::registry registry;
  296. std::cout << "Iterating over 1000000 entities, one component, runtime view" << std::endl;
  297. for(std::uint64_t i = 0; i < 1000000L; i++) {
  298. const auto entity = registry.create();
  299. registry.emplace<position>(entity);
  300. }
  301. entt::runtime_view view{};
  302. view.iterate(registry.storage<position>());
  303. generic(view, [&registry](auto entity) {
  304. registry.get<position>(entity).x = {};
  305. });
  306. }
  307. TEST(Benchmark, IterateTwoComponents1M) {
  308. entt::registry registry;
  309. std::cout << "Iterating over 1000000 entities, two components" << std::endl;
  310. for(std::uint64_t i = 0; i < 1000000L; i++) {
  311. const auto entity = registry.create();
  312. registry.emplace<position>(entity);
  313. registry.emplace<velocity>(entity);
  314. }
  315. generic(registry.view<position, velocity>(), [](auto &...comp) {
  316. ((comp.x = {}), ...);
  317. });
  318. }
  319. TEST(Benchmark, IterateTwoStableComponents1M) {
  320. entt::registry registry;
  321. std::cout << "Iterating over 1000000 entities, two stable components" << std::endl;
  322. for(std::uint64_t i = 0; i < 1000000L; i++) {
  323. const auto entity = registry.create();
  324. registry.emplace<stable_position>(entity);
  325. registry.emplace<velocity>(entity);
  326. }
  327. generic(registry.view<stable_position, velocity>(), [](auto &...comp) {
  328. ((comp.x = {}), ...);
  329. });
  330. }
  331. TEST(Benchmark, IterateTwoComponents1MHalf) {
  332. entt::registry registry;
  333. std::cout << "Iterating over 1000000 entities, two components, half of the entities have all the components" << std::endl;
  334. for(std::uint64_t i = 0; i < 1000000L; i++) {
  335. const auto entity = registry.create();
  336. registry.emplace<velocity>(entity);
  337. if(i % 2) {
  338. registry.emplace<position>(entity);
  339. }
  340. }
  341. generic(registry.view<position, velocity>(), [](auto &...comp) {
  342. ((comp.x = {}), ...);
  343. });
  344. }
  345. TEST(Benchmark, IterateTwoComponents1MOne) {
  346. entt::registry registry;
  347. std::cout << "Iterating over 1000000 entities, two components, only one entity has all the components" << std::endl;
  348. for(std::uint64_t i = 0; i < 1000000L; i++) {
  349. const auto entity = registry.create();
  350. registry.emplace<velocity>(entity);
  351. if(i == 500000L) {
  352. registry.emplace<position>(entity);
  353. }
  354. }
  355. generic(registry.view<position, velocity>(), [](auto &...comp) {
  356. ((comp.x = {}), ...);
  357. });
  358. }
  359. TEST(Benchmark, IterateTwoComponentsNonOwningGroup1M) {
  360. entt::registry registry;
  361. std::cout << "Iterating over 1000000 entities, two components, non owning group" << std::endl;
  362. for(std::uint64_t i = 0; i < 1000000L; i++) {
  363. const auto entity = registry.create();
  364. registry.emplace<position>(entity);
  365. registry.emplace<velocity>(entity);
  366. }
  367. generic(registry.group<>(entt::get<position, velocity>), [](auto &...comp) {
  368. ((comp.x = {}), ...);
  369. });
  370. }
  371. TEST(Benchmark, IterateTwoComponentsFullOwningGroup1M) {
  372. entt::registry registry;
  373. std::cout << "Iterating over 1000000 entities, two components, full owning group" << std::endl;
  374. for(std::uint64_t i = 0; i < 1000000L; i++) {
  375. const auto entity = registry.create();
  376. registry.emplace<position>(entity);
  377. registry.emplace<velocity>(entity);
  378. }
  379. generic(registry.group<position, velocity>(), [](auto &...comp) {
  380. ((comp.x = {}), ...);
  381. });
  382. }
  383. TEST(Benchmark, IterateTwoComponentsPartialOwningGroup1M) {
  384. entt::registry registry;
  385. std::cout << "Iterating over 1000000 entities, two components, partial owning group" << std::endl;
  386. for(std::uint64_t i = 0; i < 1000000L; i++) {
  387. const auto entity = registry.create();
  388. registry.emplace<position>(entity);
  389. registry.emplace<velocity>(entity);
  390. }
  391. generic(registry.group<position>(entt::get<velocity>), [](auto &...comp) {
  392. ((comp.x = {}), ...);
  393. });
  394. }
  395. TEST(Benchmark, IterateTwoComponentsRuntime1M) {
  396. entt::registry registry;
  397. std::cout << "Iterating over 1000000 entities, two components, runtime view" << std::endl;
  398. for(std::uint64_t i = 0; i < 1000000L; i++) {
  399. const auto entity = registry.create();
  400. registry.emplace<position>(entity);
  401. registry.emplace<velocity>(entity);
  402. }
  403. entt::runtime_view view{};
  404. view.iterate(registry.storage<position>())
  405. .iterate(registry.storage<velocity>());
  406. generic(view, [&registry](auto entity) {
  407. registry.get<position>(entity).x = {};
  408. registry.get<velocity>(entity).x = {};
  409. });
  410. }
  411. TEST(Benchmark, IterateTwoComponentsRuntime1MHalf) {
  412. entt::registry registry;
  413. std::cout << "Iterating over 1000000 entities, two components, half of the entities have all the components, runtime view" << std::endl;
  414. for(std::uint64_t i = 0; i < 1000000L; i++) {
  415. const auto entity = registry.create();
  416. registry.emplace<velocity>(entity);
  417. if(i % 2) {
  418. registry.emplace<position>(entity);
  419. }
  420. }
  421. entt::runtime_view view{};
  422. view.iterate(registry.storage<position>())
  423. .iterate(registry.storage<velocity>());
  424. generic(view, [&registry](auto entity) {
  425. registry.get<position>(entity).x = {};
  426. registry.get<velocity>(entity).x = {};
  427. });
  428. }
  429. TEST(Benchmark, IterateTwoComponentsRuntime1MOne) {
  430. entt::registry registry;
  431. std::cout << "Iterating over 1000000 entities, two components, only one entity has all the components, runtime view" << std::endl;
  432. for(std::uint64_t i = 0; i < 1000000L; i++) {
  433. const auto entity = registry.create();
  434. registry.emplace<velocity>(entity);
  435. if(i == 500000L) {
  436. registry.emplace<position>(entity);
  437. }
  438. }
  439. entt::runtime_view view{};
  440. view.iterate(registry.storage<position>())
  441. .iterate(registry.storage<velocity>());
  442. generic(view, [&registry](auto entity) {
  443. registry.get<position>(entity).x = {};
  444. registry.get<velocity>(entity).x = {};
  445. });
  446. }
  447. TEST(Benchmark, IterateThreeComponents1M) {
  448. entt::registry registry;
  449. std::cout << "Iterating over 1000000 entities, three components" << std::endl;
  450. for(std::uint64_t i = 0; i < 1000000L; i++) {
  451. const auto entity = registry.create();
  452. registry.emplace<position>(entity);
  453. registry.emplace<velocity>(entity);
  454. registry.emplace<comp<0>>(entity);
  455. }
  456. generic(registry.view<position, velocity, comp<0>>(), [](auto &...comp) {
  457. ((comp.x = {}), ...);
  458. });
  459. }
  460. TEST(Benchmark, IterateThreeStableComponents1M) {
  461. entt::registry registry;
  462. std::cout << "Iterating over 1000000 entities, three stable components" << std::endl;
  463. for(std::uint64_t i = 0; i < 1000000L; i++) {
  464. const auto entity = registry.create();
  465. registry.emplace<stable_position>(entity);
  466. registry.emplace<velocity>(entity);
  467. registry.emplace<comp<0>>(entity);
  468. }
  469. generic(registry.view<stable_position, velocity, comp<0>>(), [](auto &...comp) {
  470. ((comp.x = {}), ...);
  471. });
  472. }
  473. TEST(Benchmark, IterateThreeComponents1MHalf) {
  474. entt::registry registry;
  475. std::cout << "Iterating over 1000000 entities, three components, half of the entities have all the components" << std::endl;
  476. for(std::uint64_t i = 0; i < 1000000L; i++) {
  477. const auto entity = registry.create();
  478. registry.emplace<velocity>(entity);
  479. registry.emplace<comp<0>>(entity);
  480. if(i % 2) {
  481. registry.emplace<position>(entity);
  482. }
  483. }
  484. generic(registry.view<position, velocity, comp<0>>(), [](auto &...comp) {
  485. ((comp.x = {}), ...);
  486. });
  487. }
  488. TEST(Benchmark, IterateThreeComponents1MOne) {
  489. entt::registry registry;
  490. std::cout << "Iterating over 1000000 entities, three components, only one entity has all the components" << std::endl;
  491. for(std::uint64_t i = 0; i < 1000000L; i++) {
  492. const auto entity = registry.create();
  493. registry.emplace<velocity>(entity);
  494. registry.emplace<comp<0>>(entity);
  495. if(i == 500000L) {
  496. registry.emplace<position>(entity);
  497. }
  498. }
  499. generic(registry.view<position, velocity, comp<0>>(), [](auto &...comp) {
  500. ((comp.x = {}), ...);
  501. });
  502. }
  503. TEST(Benchmark, IterateThreeComponentsNonOwningGroup1M) {
  504. entt::registry registry;
  505. std::cout << "Iterating over 1000000 entities, three components, non owning group" << std::endl;
  506. for(std::uint64_t i = 0; i < 1000000L; i++) {
  507. const auto entity = registry.create();
  508. registry.emplace<position>(entity);
  509. registry.emplace<velocity>(entity);
  510. registry.emplace<comp<0>>(entity);
  511. }
  512. generic(registry.group<>(entt::get<position, velocity, comp<0>>), [](auto &...comp) {
  513. ((comp.x = {}), ...);
  514. });
  515. }
  516. TEST(Benchmark, IterateThreeComponentsFullOwningGroup1M) {
  517. entt::registry registry;
  518. std::cout << "Iterating over 1000000 entities, three components, full owning group" << std::endl;
  519. for(std::uint64_t i = 0; i < 1000000L; i++) {
  520. const auto entity = registry.create();
  521. registry.emplace<position>(entity);
  522. registry.emplace<velocity>(entity);
  523. registry.emplace<comp<0>>(entity);
  524. }
  525. generic(registry.group<position, velocity, comp<0>>(), [](auto &...comp) {
  526. ((comp.x = {}), ...);
  527. });
  528. }
  529. TEST(Benchmark, IterateThreeComponentsPartialOwningGroup1M) {
  530. entt::registry registry;
  531. std::cout << "Iterating over 1000000 entities, three components, partial owning group" << std::endl;
  532. for(std::uint64_t i = 0; i < 1000000L; i++) {
  533. const auto entity = registry.create();
  534. registry.emplace<position>(entity);
  535. registry.emplace<velocity>(entity);
  536. registry.emplace<comp<0>>(entity);
  537. }
  538. generic(registry.group<position, velocity>(entt::get<comp<0>>), [](auto &...comp) {
  539. ((comp.x = {}), ...);
  540. });
  541. }
  542. TEST(Benchmark, IterateThreeComponentsRuntime1M) {
  543. entt::registry registry;
  544. std::cout << "Iterating over 1000000 entities, three components, runtime view" << std::endl;
  545. for(std::uint64_t i = 0; i < 1000000L; i++) {
  546. const auto entity = registry.create();
  547. registry.emplace<position>(entity);
  548. registry.emplace<velocity>(entity);
  549. registry.emplace<comp<0>>(entity);
  550. }
  551. entt::runtime_view view{};
  552. view.iterate(registry.storage<position>())
  553. .iterate(registry.storage<velocity>())
  554. .iterate(registry.storage<comp<0>>());
  555. generic(view, [&registry](auto entity) {
  556. registry.get<position>(entity).x = {};
  557. registry.get<velocity>(entity).x = {};
  558. registry.get<comp<0>>(entity).x = {};
  559. });
  560. }
  561. TEST(Benchmark, IterateThreeComponentsRuntime1MHalf) {
  562. entt::registry registry;
  563. std::cout << "Iterating over 1000000 entities, three components, half of the entities have all the components, runtime view" << std::endl;
  564. for(std::uint64_t i = 0; i < 1000000L; i++) {
  565. const auto entity = registry.create();
  566. registry.emplace<velocity>(entity);
  567. registry.emplace<comp<0>>(entity);
  568. if(i % 2) {
  569. registry.emplace<position>(entity);
  570. }
  571. }
  572. entt::runtime_view view{};
  573. view.iterate(registry.storage<position>())
  574. .iterate(registry.storage<velocity>())
  575. .iterate(registry.storage<comp<0>>());
  576. generic(view, [&registry](auto entity) {
  577. registry.get<position>(entity).x = {};
  578. registry.get<velocity>(entity).x = {};
  579. registry.get<comp<0>>(entity).x = {};
  580. });
  581. }
  582. TEST(Benchmark, IterateThreeComponentsRuntime1MOne) {
  583. entt::registry registry;
  584. std::cout << "Iterating over 1000000 entities, three components, only one entity has all the components, runtime view" << std::endl;
  585. for(std::uint64_t i = 0; i < 1000000L; i++) {
  586. const auto entity = registry.create();
  587. registry.emplace<velocity>(entity);
  588. registry.emplace<comp<0>>(entity);
  589. if(i == 500000L) {
  590. registry.emplace<position>(entity);
  591. }
  592. }
  593. entt::runtime_view view{};
  594. view.iterate(registry.storage<position>())
  595. .iterate(registry.storage<velocity>())
  596. .iterate(registry.storage<comp<0>>());
  597. generic(view, [&registry](auto entity) {
  598. registry.get<position>(entity).x = {};
  599. registry.get<velocity>(entity).x = {};
  600. registry.get<comp<0>>(entity).x = {};
  601. });
  602. }
  603. TEST(Benchmark, IterateFiveComponents1M) {
  604. entt::registry registry;
  605. std::cout << "Iterating over 1000000 entities, five components" << std::endl;
  606. for(std::uint64_t i = 0; i < 1000000L; i++) {
  607. const auto entity = registry.create();
  608. registry.emplace<position>(entity);
  609. registry.emplace<velocity>(entity);
  610. registry.emplace<comp<0>>(entity);
  611. registry.emplace<comp<1>>(entity);
  612. registry.emplace<comp<2>>(entity);
  613. }
  614. generic(registry.view<position, velocity, comp<0>, comp<1>, comp<2>>(), [](auto &...comp) {
  615. ((comp.x = {}), ...);
  616. });
  617. }
  618. TEST(Benchmark, IterateFiveStableComponents1M) {
  619. entt::registry registry;
  620. std::cout << "Iterating over 1000000 entities, five stable components" << std::endl;
  621. for(std::uint64_t i = 0; i < 1000000L; i++) {
  622. const auto entity = registry.create();
  623. registry.emplace<stable_position>(entity);
  624. registry.emplace<velocity>(entity);
  625. registry.emplace<comp<0>>(entity);
  626. registry.emplace<comp<1>>(entity);
  627. registry.emplace<comp<2>>(entity);
  628. }
  629. generic(registry.view<stable_position, velocity, comp<0>, comp<1>, comp<2>>(), [](auto &...comp) {
  630. ((comp.x = {}), ...);
  631. });
  632. }
  633. TEST(Benchmark, IterateFiveComponents1MHalf) {
  634. entt::registry registry;
  635. std::cout << "Iterating over 1000000 entities, five components, half of the entities have all the components" << std::endl;
  636. for(std::uint64_t i = 0; i < 1000000L; i++) {
  637. const auto entity = registry.create();
  638. registry.emplace<velocity>(entity);
  639. registry.emplace<comp<0>>(entity);
  640. registry.emplace<comp<1>>(entity);
  641. registry.emplace<comp<2>>(entity);
  642. if(i % 2) {
  643. registry.emplace<position>(entity);
  644. }
  645. }
  646. generic(registry.view<position, velocity, comp<0>, comp<1>, comp<2>>(), [](auto &...comp) {
  647. ((comp.x = {}), ...);
  648. });
  649. }
  650. TEST(Benchmark, IterateFiveComponents1MOne) {
  651. entt::registry registry;
  652. std::cout << "Iterating over 1000000 entities, five components, only one entity has all the components" << std::endl;
  653. for(std::uint64_t i = 0; i < 1000000L; i++) {
  654. const auto entity = registry.create();
  655. registry.emplace<velocity>(entity);
  656. registry.emplace<comp<0>>(entity);
  657. registry.emplace<comp<1>>(entity);
  658. registry.emplace<comp<2>>(entity);
  659. if(i == 500000L) {
  660. registry.emplace<position>(entity);
  661. }
  662. }
  663. generic(registry.view<position, velocity, comp<0>, comp<1>, comp<2>>(), [](auto &...comp) {
  664. ((comp.x = {}), ...);
  665. });
  666. }
  667. TEST(Benchmark, IterateFiveComponentsNonOwningGroup1M) {
  668. entt::registry registry;
  669. std::cout << "Iterating over 1000000 entities, five components, non owning group" << std::endl;
  670. for(std::uint64_t i = 0; i < 1000000L; i++) {
  671. const auto entity = registry.create();
  672. registry.emplace<position>(entity);
  673. registry.emplace<velocity>(entity);
  674. registry.emplace<comp<0>>(entity);
  675. registry.emplace<comp<1>>(entity);
  676. registry.emplace<comp<2>>(entity);
  677. }
  678. generic(registry.group<>(entt::get<position, velocity, comp<0>, comp<1>, comp<2>>), [](auto &...comp) {
  679. ((comp.x = {}), ...);
  680. });
  681. }
  682. TEST(Benchmark, IterateFiveComponentsFullOwningGroup1M) {
  683. entt::registry registry;
  684. std::cout << "Iterating over 1000000 entities, five components, full owning group" << std::endl;
  685. for(std::uint64_t i = 0; i < 1000000L; i++) {
  686. const auto entity = registry.create();
  687. registry.emplace<position>(entity);
  688. registry.emplace<velocity>(entity);
  689. registry.emplace<comp<0>>(entity);
  690. registry.emplace<comp<1>>(entity);
  691. registry.emplace<comp<2>>(entity);
  692. }
  693. generic(registry.group<position, velocity, comp<0>, comp<1>, comp<2>>(), [](auto &...comp) {
  694. ((comp.x = {}), ...);
  695. });
  696. }
  697. TEST(Benchmark, IterateFiveComponentsPartialFourOfFiveOwningGroup1M) {
  698. entt::registry registry;
  699. std::cout << "Iterating over 1000000 entities, five components, partial (4 of 5) owning group" << std::endl;
  700. for(std::uint64_t i = 0; i < 1000000L; i++) {
  701. const auto entity = registry.create();
  702. registry.emplace<position>(entity);
  703. registry.emplace<velocity>(entity);
  704. registry.emplace<comp<0>>(entity);
  705. registry.emplace<comp<1>>(entity);
  706. registry.emplace<comp<2>>(entity);
  707. }
  708. generic(registry.group<position, velocity, comp<0>, comp<1>>(entt::get<comp<2>>), [](auto &...comp) {
  709. ((comp.x = {}), ...);
  710. });
  711. }
  712. TEST(Benchmark, IterateFiveComponentsPartialThreeOfFiveOwningGroup1M) {
  713. entt::registry registry;
  714. std::cout << "Iterating over 1000000 entities, five components, partial (3 of 5) owning group" << std::endl;
  715. for(std::uint64_t i = 0; i < 1000000L; i++) {
  716. const auto entity = registry.create();
  717. registry.emplace<position>(entity);
  718. registry.emplace<velocity>(entity);
  719. registry.emplace<comp<0>>(entity);
  720. registry.emplace<comp<1>>(entity);
  721. registry.emplace<comp<2>>(entity);
  722. }
  723. generic(registry.group<position, velocity, comp<0>>(entt::get<comp<1>, comp<2>>), [](auto &...comp) {
  724. ((comp.x = {}), ...);
  725. });
  726. }
  727. TEST(Benchmark, IterateFiveComponentsRuntime1M) {
  728. entt::registry registry;
  729. std::cout << "Iterating over 1000000 entities, five components, runtime view" << std::endl;
  730. for(std::uint64_t i = 0; i < 1000000L; i++) {
  731. const auto entity = registry.create();
  732. registry.emplace<position>(entity);
  733. registry.emplace<velocity>(entity);
  734. registry.emplace<comp<0>>(entity);
  735. registry.emplace<comp<1>>(entity);
  736. registry.emplace<comp<2>>(entity);
  737. }
  738. entt::runtime_view view{};
  739. view.iterate(registry.storage<position>())
  740. .iterate(registry.storage<velocity>())
  741. .iterate(registry.storage<comp<0>>())
  742. .iterate(registry.storage<comp<1>>())
  743. .iterate(registry.storage<comp<2>>());
  744. generic(view, [&registry](auto entity) {
  745. registry.get<position>(entity).x = {};
  746. registry.get<velocity>(entity).x = {};
  747. registry.get<comp<0>>(entity).x = {};
  748. registry.get<comp<1>>(entity).x = {};
  749. registry.get<comp<2>>(entity).x = {};
  750. });
  751. }
  752. TEST(Benchmark, IterateFiveComponentsRuntime1MHalf) {
  753. entt::registry registry;
  754. std::cout << "Iterating over 1000000 entities, five components, half of the entities have all the components, runtime view" << std::endl;
  755. for(std::uint64_t i = 0; i < 1000000L; i++) {
  756. const auto entity = registry.create();
  757. registry.emplace<velocity>(entity);
  758. registry.emplace<comp<0>>(entity);
  759. registry.emplace<comp<1>>(entity);
  760. registry.emplace<comp<2>>(entity);
  761. if(i % 2) {
  762. registry.emplace<position>(entity);
  763. }
  764. }
  765. entt::runtime_view view{};
  766. view.iterate(registry.storage<position>())
  767. .iterate(registry.storage<velocity>())
  768. .iterate(registry.storage<comp<0>>())
  769. .iterate(registry.storage<comp<1>>())
  770. .iterate(registry.storage<comp<2>>());
  771. generic(view, [&registry](auto entity) {
  772. registry.get<position>(entity).x = {};
  773. registry.get<velocity>(entity).x = {};
  774. registry.get<comp<0>>(entity).x = {};
  775. registry.get<comp<1>>(entity).x = {};
  776. registry.get<comp<2>>(entity).x = {};
  777. });
  778. }
  779. TEST(Benchmark, IterateFiveComponentsRuntime1MOne) {
  780. entt::registry registry;
  781. std::cout << "Iterating over 1000000 entities, five components, only one entity has all the components, runtime view" << std::endl;
  782. for(std::uint64_t i = 0; i < 1000000L; i++) {
  783. const auto entity = registry.create();
  784. registry.emplace<velocity>(entity);
  785. registry.emplace<comp<0>>(entity);
  786. registry.emplace<comp<1>>(entity);
  787. registry.emplace<comp<2>>(entity);
  788. if(i == 500000L) {
  789. registry.emplace<position>(entity);
  790. }
  791. }
  792. entt::runtime_view view{};
  793. view.iterate(registry.storage<position>())
  794. .iterate(registry.storage<velocity>())
  795. .iterate(registry.storage<comp<0>>())
  796. .iterate(registry.storage<comp<1>>())
  797. .iterate(registry.storage<comp<2>>());
  798. generic(view, [&registry](auto entity) {
  799. registry.get<position>(entity).x = {};
  800. registry.get<velocity>(entity).x = {};
  801. registry.get<comp<0>>(entity).x = {};
  802. registry.get<comp<1>>(entity).x = {};
  803. registry.get<comp<2>>(entity).x = {};
  804. });
  805. }
  806. TEST(Benchmark, IteratePathological) {
  807. std::cout << "Pathological case" << std::endl;
  808. pathological([](auto &registry) { return registry.template view<position, velocity, comp<0>>(); });
  809. }
  810. TEST(Benchmark, IteratePathologicalNonOwningGroup) {
  811. std::cout << "Pathological case (non-owning group)" << std::endl;
  812. pathological([](auto &registry) { return registry.template group<>(entt::get<position, velocity, comp<0>>); });
  813. }
  814. TEST(Benchmark, IteratePathologicalFullOwningGroup) {
  815. std::cout << "Pathological case (full-owning group)" << std::endl;
  816. pathological([](auto &registry) { return registry.template group<position, velocity, comp<0>>(); });
  817. }
  818. TEST(Benchmark, IteratePathologicalPartialOwningGroup) {
  819. std::cout << "Pathological case (partial-owning group)" << std::endl;
  820. pathological([](auto &registry) { return registry.template group<position, velocity>(entt::get<comp<0>>); });
  821. }
  822. TEST(Benchmark, SortSingle) {
  823. entt::registry registry;
  824. std::cout << "Sort 150000 entities, one component" << std::endl;
  825. for(std::uint64_t i = 0; i < 150000L; i++) {
  826. const auto entity = registry.create();
  827. registry.emplace<position>(entity, i, i);
  828. }
  829. timer timer;
  830. registry.sort<position>([](const auto &lhs, const auto &rhs) { return lhs.x < rhs.x && lhs.y < rhs.y; });
  831. timer.elapsed();
  832. }
  833. TEST(Benchmark, SortMulti) {
  834. entt::registry registry;
  835. std::cout << "Sort 150000 entities, two components" << std::endl;
  836. for(std::uint64_t i = 0; i < 150000L; i++) {
  837. const auto entity = registry.create();
  838. registry.emplace<position>(entity, i, i);
  839. registry.emplace<velocity>(entity, i, i);
  840. }
  841. registry.sort<position>([](const auto &lhs, const auto &rhs) { return lhs.x < rhs.x && lhs.y < rhs.y; });
  842. timer timer;
  843. registry.sort<velocity, position>();
  844. timer.elapsed();
  845. }
  846. TEST(Benchmark, AlmostSortedStdSort) {
  847. entt::registry registry;
  848. entt::entity entities[3]{};
  849. std::cout << "Sort 150000 entities, almost sorted, std::sort" << std::endl;
  850. for(std::uint64_t i = 0; i < 150000L; i++) {
  851. const auto entity = registry.create();
  852. registry.emplace<position>(entity, i, i);
  853. if(!(i % 50000)) {
  854. entities[i / 50000] = entity;
  855. }
  856. }
  857. for(std::uint64_t i = 0; i < 3; ++i) {
  858. registry.destroy(entities[i]);
  859. const auto entity = registry.create();
  860. registry.emplace<position>(entity, 50000 * i, 50000 * i);
  861. }
  862. timer timer;
  863. registry.sort<position>([](const auto &lhs, const auto &rhs) { return lhs.x > rhs.x && lhs.y > rhs.y; });
  864. timer.elapsed();
  865. }
  866. TEST(Benchmark, AlmostSortedInsertionSort) {
  867. entt::registry registry;
  868. entt::entity entities[3]{};
  869. std::cout << "Sort 150000 entities, almost sorted, insertion sort" << std::endl;
  870. for(std::uint64_t i = 0; i < 150000L; i++) {
  871. const auto entity = registry.create();
  872. registry.emplace<position>(entity, i, i);
  873. if(!(i % 50000)) {
  874. entities[i / 50000] = entity;
  875. }
  876. }
  877. for(std::uint64_t i = 0; i < 3; ++i) {
  878. registry.destroy(entities[i]);
  879. const auto entity = registry.create();
  880. registry.emplace<position>(entity, 50000 * i, 50000 * i);
  881. }
  882. timer timer;
  883. registry.sort<position>([](const auto &lhs, const auto &rhs) { return lhs.x > rhs.x && lhs.y > rhs.y; }, entt::insertion_sort{});
  884. timer.elapsed();
  885. }