benchmark.cpp 32 KB

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