benchmark.cpp 33 KB

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