1
0

benchmark.cpp 33 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094
  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 { int x; };
  19. struct timer final {
  20. timer()
  21. : start{std::chrono::system_clock::now()} {}
  22. void elapsed() {
  23. auto now = std::chrono::system_clock::now();
  24. std::cout << std::chrono::duration<double>(now - start).count() << " seconds" << std::endl;
  25. }
  26. private:
  27. std::chrono::time_point<std::chrono::system_clock> start;
  28. };
  29. template<typename Iterable, typename Func>
  30. void generic(Iterable &&iterable, Func func) {
  31. timer timer;
  32. std::forward<Iterable>(iterable).each(func);
  33. timer.elapsed();
  34. }
  35. template<typename Func>
  36. void pathological(Func func) {
  37. entt::registry registry;
  38. for(std::uint64_t i = 0; i < 500000L; i++) {
  39. const auto entity = registry.create();
  40. registry.emplace<position>(entity);
  41. registry.emplace<velocity>(entity);
  42. registry.emplace<comp<0>>(entity);
  43. }
  44. for(auto i = 0; i < 10; ++i) {
  45. registry.each([i = 0, &registry](const auto entity) mutable {
  46. if(!(++i % 7)) { registry.remove<position>(entity); }
  47. if(!(++i % 11)) { registry.remove<velocity>(entity); }
  48. if(!(++i % 13)) { registry.remove<comp<0>>(entity); }
  49. if(!(++i % 17)) { registry.destroy(entity); }
  50. });
  51. for(std::uint64_t j = 0; j < 50000L; j++) {
  52. const auto entity = registry.create();
  53. registry.emplace<position>(entity);
  54. registry.emplace<velocity>(entity);
  55. registry.emplace<comp<0>>(entity);
  56. }
  57. }
  58. timer timer;
  59. func(registry).each([](auto &...comp) { ((comp.x = {}), ...); });
  60. timer.elapsed();
  61. }
  62. TEST(Benchmark, Create) {
  63. entt::registry registry;
  64. std::cout << "Creating 1000000 entities" << std::endl;
  65. timer timer;
  66. for(std::uint64_t i = 0; i < 1000000L; i++) {
  67. static_cast<void>(registry.create());
  68. }
  69. timer.elapsed();
  70. }
  71. TEST(Benchmark, CreateMany) {
  72. entt::registry registry;
  73. std::vector<entt::entity> entities(1000000);
  74. std::cout << "Creating 1000000 entities at once" << std::endl;
  75. timer timer;
  76. registry.create(entities.begin(), entities.end());
  77. timer.elapsed();
  78. }
  79. TEST(Benchmark, CreateManyAndEmplaceComponents) {
  80. entt::registry registry;
  81. std::vector<entt::entity> entities(1000000);
  82. std::cout << "Creating 1000000 entities at once and emplace components" << std::endl;
  83. timer timer;
  84. registry.create(entities.begin(), entities.end());
  85. for(const auto entity: entities) {
  86. registry.emplace<position>(entity);
  87. registry.emplace<velocity>(entity);
  88. }
  89. timer.elapsed();
  90. }
  91. TEST(Benchmark, CreateManyWithComponents) {
  92. entt::registry registry;
  93. std::vector<entt::entity> entities(1000000);
  94. std::cout << "Creating 1000000 entities at once with components" << std::endl;
  95. timer timer;
  96. registry.create(entities.begin(), entities.end());
  97. registry.insert<position>(entities.begin(), entities.end());
  98. registry.insert<velocity>(entities.begin(), entities.end());
  99. timer.elapsed();
  100. }
  101. TEST(Benchmark, Erase) {
  102. entt::registry registry;
  103. std::vector<entt::entity> entities(1000000);
  104. auto view = registry.view<int>();
  105. std::cout << "Erasing 1000000 components from their entities" << std::endl;
  106. registry.create(entities.begin(), entities.end());
  107. registry.insert<int>(entities.begin(), entities.end());
  108. timer timer;
  109. for(auto entity: view) {
  110. registry.erase<int>(entity);
  111. }
  112. timer.elapsed();
  113. }
  114. TEST(Benchmark, EraseMany) {
  115. entt::registry registry;
  116. std::vector<entt::entity> entities(1000000);
  117. auto view = registry.view<int>();
  118. std::cout << "Erasing 1000000 components from their entities at once" << std::endl;
  119. registry.create(entities.begin(), entities.end());
  120. registry.insert<int>(entities.begin(), entities.end());
  121. timer timer;
  122. registry.erase<int>(view.begin(), view.end());
  123. timer.elapsed();
  124. }
  125. TEST(Benchmark, Remove) {
  126. entt::registry registry;
  127. std::vector<entt::entity> entities(1000000);
  128. auto view = registry.view<int>();
  129. std::cout << "Removing 1000000 components from their entities" << std::endl;
  130. registry.create(entities.begin(), entities.end());
  131. registry.insert<int>(entities.begin(), entities.end());
  132. timer timer;
  133. for(auto entity: view) {
  134. registry.remove<int>(entity);
  135. }
  136. timer.elapsed();
  137. }
  138. TEST(Benchmark, RemoveMany) {
  139. entt::registry registry;
  140. std::vector<entt::entity> entities(1000000);
  141. auto view = registry.view<int>();
  142. std::cout << "Removing 1000000 components from their entities at once" << std::endl;
  143. registry.create(entities.begin(), entities.end());
  144. registry.insert<int>(entities.begin(), entities.end());
  145. timer timer;
  146. registry.remove<int>(view.begin(), view.end());
  147. timer.elapsed();
  148. }
  149. TEST(Benchmark, Clear) {
  150. entt::registry registry;
  151. std::vector<entt::entity> entities(1000000);
  152. std::cout << "Clearing 1000000 components from their entities" << std::endl;
  153. registry.create(entities.begin(), entities.end());
  154. registry.insert<int>(entities.begin(), entities.end());
  155. timer timer;
  156. registry.clear<int>();
  157. timer.elapsed();
  158. }
  159. TEST(Benchmark, Recycle) {
  160. entt::registry registry;
  161. std::vector<entt::entity> entities(1000000);
  162. std::cout << "Recycling 1000000 entities" << std::endl;
  163. registry.create(entities.begin(), entities.end());
  164. registry.each([&registry](auto entity) {
  165. registry.destroy(entity);
  166. });
  167. timer timer;
  168. for(auto next = entities.size(); next; --next) {
  169. static_cast<void>(registry.create());
  170. }
  171. timer.elapsed();
  172. }
  173. TEST(Benchmark, RecycleMany) {
  174. entt::registry registry;
  175. std::vector<entt::entity> entities(1000000);
  176. std::cout << "Recycling 1000000 entities" << std::endl;
  177. registry.create(entities.begin(), entities.end());
  178. registry.each([&registry](auto entity) {
  179. registry.destroy(entity);
  180. });
  181. timer timer;
  182. registry.create(entities.begin(), entities.end());
  183. timer.elapsed();
  184. }
  185. TEST(Benchmark, Destroy) {
  186. entt::registry registry;
  187. std::vector<entt::entity> entities(1000000);
  188. auto view = registry.view<int>();
  189. std::cout << "Destroying 1000000 entities" << std::endl;
  190. registry.create(entities.begin(), entities.end());
  191. registry.insert<int>(entities.begin(), entities.end());
  192. timer timer;
  193. for(auto entity: view) {
  194. registry.destroy(entity);
  195. }
  196. timer.elapsed();
  197. }
  198. TEST(Benchmark, DestroyMany) {
  199. entt::registry registry;
  200. std::vector<entt::entity> entities(1000000);
  201. auto view = registry.view<int>();
  202. std::cout << "Destroying 1000000 entities at once" << std::endl;
  203. registry.create(entities.begin(), entities.end());
  204. registry.insert<int>(entities.begin(), entities.end());
  205. timer timer;
  206. registry.destroy(view.begin(), view.end());
  207. timer.elapsed();
  208. }
  209. TEST(Benchmark, DestroyManyFastPath) {
  210. entt::registry registry;
  211. std::vector<entt::entity> entities(1000000);
  212. std::cout << "Destroying 1000000 entities at once, fast path" << std::endl;
  213. registry.create(entities.begin(), entities.end());
  214. registry.insert<int>(entities.begin(), entities.end());
  215. timer timer;
  216. registry.destroy(entities.begin(), entities.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. }