sparse_set.cpp 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725
  1. #include <unordered_set>
  2. #include <gtest/gtest.h>
  3. #include <entt/entity/sparse_set.hpp>
  4. TEST(SparseSetNoType, Functionalities) {
  5. entt::SparseSet<unsigned int> set;
  6. const auto &cset = set;
  7. ASSERT_NO_THROW(set.reserve(42));
  8. ASSERT_TRUE(set.empty());
  9. ASSERT_EQ(set.size(), 0u);
  10. ASSERT_EQ(cset.begin(), cset.end());
  11. ASSERT_EQ(set.begin(), set.end());
  12. ASSERT_FALSE(set.has(0));
  13. ASSERT_FALSE(set.has(42));
  14. set.construct(42);
  15. ASSERT_EQ(set.get(42), 0u);
  16. ASSERT_FALSE(set.empty());
  17. ASSERT_EQ(set.size(), 1u);
  18. ASSERT_NE(cset.begin(), cset.end());
  19. ASSERT_NE(set.begin(), set.end());
  20. ASSERT_FALSE(set.has(0));
  21. ASSERT_TRUE(set.has(42));
  22. ASSERT_TRUE(set.fast(42));
  23. ASSERT_EQ(set.get(42), 0u);
  24. set.destroy(42);
  25. ASSERT_TRUE(set.empty());
  26. ASSERT_EQ(set.size(), 0u);
  27. ASSERT_EQ(cset.begin(), cset.end());
  28. ASSERT_EQ(set.begin(), set.end());
  29. ASSERT_FALSE(set.has(0));
  30. ASSERT_FALSE(set.has(42));
  31. set.construct(42);
  32. ASSERT_EQ(set.get(42), 0u);
  33. set.reset();
  34. ASSERT_TRUE(set.empty());
  35. ASSERT_EQ(set.size(), 0u);
  36. ASSERT_EQ(cset.begin(), cset.end());
  37. ASSERT_EQ(set.begin(), set.end());
  38. ASSERT_FALSE(set.has(0));
  39. ASSERT_FALSE(set.has(42));
  40. (void)entt::SparseSet<unsigned int>{std::move(set)};
  41. entt::SparseSet<unsigned int> other;
  42. other = std::move(set);
  43. }
  44. TEST(SparseSetNoType, Clone) {
  45. entt::SparseSet<unsigned int> set;
  46. ASSERT_FALSE(set.has(0));
  47. ASSERT_FALSE(set.has(42));
  48. set.construct(0);
  49. ASSERT_TRUE(set.has(0));
  50. ASSERT_FALSE(set.has(42));
  51. set.clone(42, 0);
  52. ASSERT_TRUE(set.has(0));
  53. ASSERT_TRUE(set.has(42));
  54. }
  55. TEST(SparseSetNoType, DataBeginEnd) {
  56. entt::SparseSet<unsigned int> set;
  57. set.construct(3);
  58. set.construct(12);
  59. set.construct(42);
  60. ASSERT_EQ(set.get(3), 0u);
  61. ASSERT_EQ(set.get(12), 1u);
  62. ASSERT_EQ(set.get(42), 2u);
  63. ASSERT_EQ(*(set.data() + 0u), 3u);
  64. ASSERT_EQ(*(set.data() + 1u), 12u);
  65. ASSERT_EQ(*(set.data() + 2u), 42u);
  66. auto it = set.begin();
  67. ASSERT_EQ(*it, 42u);
  68. ASSERT_EQ(*(it+1), 12u);
  69. ASSERT_EQ(*(it+2), 3u);
  70. ASSERT_EQ(it += 3, set.end());
  71. auto begin = set.begin();
  72. auto end = set.end();
  73. ASSERT_EQ(*(begin++), 42u);
  74. ASSERT_EQ(*(begin++), 12u);
  75. ASSERT_EQ(*(begin++), 3u);
  76. ASSERT_EQ(begin, end);
  77. auto cbegin = set.cbegin();
  78. auto cend = set.cend();
  79. ASSERT_NE(cbegin, cend);
  80. ASSERT_EQ(cbegin+3, cend);
  81. ASSERT_NE(cbegin, cend);
  82. ASSERT_EQ(cbegin += 3, cend);
  83. ASSERT_EQ(cbegin, cend);
  84. }
  85. TEST(SparseSetNoType, RespectDisjoint) {
  86. entt::SparseSet<unsigned int> lhs;
  87. entt::SparseSet<unsigned int> rhs;
  88. const auto &clhs = lhs;
  89. lhs.construct(3);
  90. lhs.construct(12);
  91. lhs.construct(42);
  92. ASSERT_EQ(lhs.get(3), 0u);
  93. ASSERT_EQ(lhs.get(12), 1u);
  94. ASSERT_EQ(lhs.get(42), 2u);
  95. lhs.respect(rhs);
  96. ASSERT_EQ(clhs.get(3), 0u);
  97. ASSERT_EQ(clhs.get(12), 1u);
  98. ASSERT_EQ(clhs.get(42), 2u);
  99. }
  100. TEST(SparseSetNoType, RespectOverlap) {
  101. entt::SparseSet<unsigned int> lhs;
  102. entt::SparseSet<unsigned int> rhs;
  103. const auto &clhs = lhs;
  104. lhs.construct(3);
  105. lhs.construct(12);
  106. lhs.construct(42);
  107. rhs.construct(12);
  108. ASSERT_EQ(lhs.get(3), 0u);
  109. ASSERT_EQ(lhs.get(12), 1u);
  110. ASSERT_EQ(lhs.get(42), 2u);
  111. lhs.respect(rhs);
  112. ASSERT_EQ(clhs.get(3), 0u);
  113. ASSERT_EQ(clhs.get(12), 2u);
  114. ASSERT_EQ(clhs.get(42), 1u);
  115. }
  116. TEST(SparseSetNoType, RespectOrdered) {
  117. entt::SparseSet<unsigned int> lhs;
  118. entt::SparseSet<unsigned int> rhs;
  119. lhs.construct(1);
  120. lhs.construct(2);
  121. lhs.construct(3);
  122. lhs.construct(4);
  123. lhs.construct(5);
  124. ASSERT_EQ(lhs.get(1), 0u);
  125. ASSERT_EQ(lhs.get(2), 1u);
  126. ASSERT_EQ(lhs.get(3), 2u);
  127. ASSERT_EQ(lhs.get(4), 3u);
  128. ASSERT_EQ(lhs.get(5), 4u);
  129. rhs.construct(6);
  130. rhs.construct(1);
  131. rhs.construct(2);
  132. rhs.construct(3);
  133. rhs.construct(4);
  134. rhs.construct(5);
  135. ASSERT_EQ(rhs.get(6), 0u);
  136. ASSERT_EQ(rhs.get(1), 1u);
  137. ASSERT_EQ(rhs.get(2), 2u);
  138. ASSERT_EQ(rhs.get(3), 3u);
  139. ASSERT_EQ(rhs.get(4), 4u);
  140. ASSERT_EQ(rhs.get(5), 5u);
  141. rhs.respect(lhs);
  142. ASSERT_EQ(rhs.get(6), 0u);
  143. ASSERT_EQ(rhs.get(1), 1u);
  144. ASSERT_EQ(rhs.get(2), 2u);
  145. ASSERT_EQ(rhs.get(3), 3u);
  146. ASSERT_EQ(rhs.get(4), 4u);
  147. ASSERT_EQ(rhs.get(5), 5u);
  148. }
  149. TEST(SparseSetNoType, RespectReverse) {
  150. entt::SparseSet<unsigned int> lhs;
  151. entt::SparseSet<unsigned int> rhs;
  152. lhs.construct(1);
  153. lhs.construct(2);
  154. lhs.construct(3);
  155. lhs.construct(4);
  156. lhs.construct(5);
  157. ASSERT_EQ(lhs.get(1), 0u);
  158. ASSERT_EQ(lhs.get(2), 1u);
  159. ASSERT_EQ(lhs.get(3), 2u);
  160. ASSERT_EQ(lhs.get(4), 3u);
  161. ASSERT_EQ(lhs.get(5), 4u);
  162. rhs.construct(5);
  163. rhs.construct(4);
  164. rhs.construct(3);
  165. rhs.construct(2);
  166. rhs.construct(1);
  167. rhs.construct(6);
  168. ASSERT_EQ(rhs.get(5), 0u);
  169. ASSERT_EQ(rhs.get(4), 1u);
  170. ASSERT_EQ(rhs.get(3), 2u);
  171. ASSERT_EQ(rhs.get(2), 3u);
  172. ASSERT_EQ(rhs.get(1), 4u);
  173. ASSERT_EQ(rhs.get(6), 5u);
  174. rhs.respect(lhs);
  175. ASSERT_EQ(rhs.get(6), 0u);
  176. ASSERT_EQ(rhs.get(1), 1u);
  177. ASSERT_EQ(rhs.get(2), 2u);
  178. ASSERT_EQ(rhs.get(3), 3u);
  179. ASSERT_EQ(rhs.get(4), 4u);
  180. ASSERT_EQ(rhs.get(5), 5u);
  181. }
  182. TEST(SparseSetNoType, RespectUnordered) {
  183. entt::SparseSet<unsigned int> lhs;
  184. entt::SparseSet<unsigned int> rhs;
  185. lhs.construct(1);
  186. lhs.construct(2);
  187. lhs.construct(3);
  188. lhs.construct(4);
  189. lhs.construct(5);
  190. ASSERT_EQ(lhs.get(1), 0u);
  191. ASSERT_EQ(lhs.get(2), 1u);
  192. ASSERT_EQ(lhs.get(3), 2u);
  193. ASSERT_EQ(lhs.get(4), 3u);
  194. ASSERT_EQ(lhs.get(5), 4u);
  195. rhs.construct(3);
  196. rhs.construct(2);
  197. rhs.construct(6);
  198. rhs.construct(1);
  199. rhs.construct(4);
  200. rhs.construct(5);
  201. ASSERT_EQ(rhs.get(3), 0u);
  202. ASSERT_EQ(rhs.get(2), 1u);
  203. ASSERT_EQ(rhs.get(6), 2u);
  204. ASSERT_EQ(rhs.get(1), 3u);
  205. ASSERT_EQ(rhs.get(4), 4u);
  206. ASSERT_EQ(rhs.get(5), 5u);
  207. rhs.respect(lhs);
  208. ASSERT_EQ(rhs.get(6), 0u);
  209. ASSERT_EQ(rhs.get(1), 1u);
  210. ASSERT_EQ(rhs.get(2), 2u);
  211. ASSERT_EQ(rhs.get(3), 3u);
  212. ASSERT_EQ(rhs.get(4), 4u);
  213. ASSERT_EQ(rhs.get(5), 5u);
  214. }
  215. TEST(SparseSetWithType, Functionalities) {
  216. entt::SparseSet<unsigned int, int> set;
  217. const auto &cset = set;
  218. ASSERT_NO_THROW(set.reserve(42));
  219. ASSERT_TRUE(set.empty());
  220. ASSERT_EQ(set.size(), 0u);
  221. ASSERT_EQ(cset.begin(), cset.end());
  222. ASSERT_EQ(set.begin(), set.end());
  223. ASSERT_FALSE(set.has(0));
  224. ASSERT_FALSE(set.has(42));
  225. set.construct(42, 3);
  226. ASSERT_FALSE(set.empty());
  227. ASSERT_EQ(set.size(), 1u);
  228. ASSERT_NE(cset.begin(), cset.end());
  229. ASSERT_NE(set.begin(), set.end());
  230. ASSERT_FALSE(set.has(0));
  231. ASSERT_TRUE(set.has(42));
  232. ASSERT_TRUE(set.fast(42));
  233. ASSERT_EQ(set.get(42), 3);
  234. set.destroy(42);
  235. ASSERT_TRUE(set.empty());
  236. ASSERT_EQ(set.size(), 0u);
  237. ASSERT_EQ(cset.begin(), cset.end());
  238. ASSERT_EQ(set.begin(), set.end());
  239. ASSERT_FALSE(set.has(0));
  240. ASSERT_FALSE(set.has(42));
  241. set.construct(42, 12);
  242. ASSERT_EQ(set.get(42), 12);
  243. set.reset();
  244. ASSERT_TRUE(set.empty());
  245. ASSERT_EQ(set.size(), 0u);
  246. ASSERT_EQ(cset.begin(), cset.end());
  247. ASSERT_EQ(set.begin(), set.end());
  248. ASSERT_FALSE(set.has(0));
  249. ASSERT_FALSE(set.has(42));
  250. (void)entt::SparseSet<unsigned int>{std::move(set)};
  251. entt::SparseSet<unsigned int> other;
  252. other = std::move(set);
  253. }
  254. TEST(SparseSetWithType, Clone) {
  255. entt::SparseSet<unsigned int, int> set;
  256. ASSERT_FALSE(set.has(0));
  257. ASSERT_FALSE(set.has(42));
  258. set.construct(0, 3);
  259. ASSERT_TRUE(set.has(0));
  260. ASSERT_FALSE(set.has(42));
  261. ASSERT_EQ(set.get(0), 3);
  262. set.clone(42, 0);
  263. ASSERT_TRUE(set.has(0));
  264. ASSERT_TRUE(set.has(42));
  265. ASSERT_EQ(set.get(0), set.get(42));
  266. ASSERT_EQ(set.get(42), 3);
  267. }
  268. TEST(SparseSetWithType, AggregatesMustWork) {
  269. struct AggregateType { int value; };
  270. // the goal of this test is to enforce the requirements for aggregate types
  271. entt::SparseSet<unsigned int, AggregateType>{}.construct(0, 42);
  272. }
  273. TEST(SparseSetWithType, TypesFromStandardTemplateLibraryMustWork) {
  274. // see #37 - this test shouldn't crash, that's all
  275. entt::SparseSet<unsigned int, std::unordered_set<int>> set;
  276. set.construct(0).insert(42);
  277. set.destroy(0);
  278. }
  279. TEST(SparseSetWithType, RawBeginEnd) {
  280. entt::SparseSet<unsigned int, int> set;
  281. set.construct(3, 3);
  282. set.construct(12, 6);
  283. set.construct(42, 9);
  284. ASSERT_EQ(set.get(3), 3);
  285. ASSERT_EQ(set.get(12), 6);
  286. ASSERT_EQ(set.get(42), 9);
  287. ASSERT_EQ(*(set.raw() + 0u), 3);
  288. ASSERT_EQ(*(set.raw() + 1u), 6);
  289. ASSERT_EQ(*(set.raw() + 2u), 9);
  290. auto begin = set.begin();
  291. auto end = set.end();
  292. ASSERT_EQ(*(begin++), 9);
  293. ASSERT_EQ(*(begin++), 6);
  294. ASSERT_EQ(*(begin++), 3);
  295. ASSERT_EQ(begin, end);
  296. auto cbegin = set.cbegin();
  297. auto cend = set.cend();
  298. ASSERT_NE(cbegin, cend);
  299. ASSERT_EQ(cbegin+3, cend);
  300. ASSERT_NE(cbegin, cend);
  301. ASSERT_EQ(cbegin += 3, cend);
  302. ASSERT_EQ(cbegin, cend);
  303. }
  304. TEST(SparseSetWithType, SortOrdered) {
  305. entt::SparseSet<unsigned int, int> set;
  306. set.construct(12, 12);
  307. set.construct(42, 9);
  308. set.construct(7, 6);
  309. set.construct(3, 3);
  310. set.construct(9, 1);
  311. ASSERT_EQ(set.get(12), 12);
  312. ASSERT_EQ(set.get(42), 9);
  313. ASSERT_EQ(set.get(7), 6);
  314. ASSERT_EQ(set.get(3), 3);
  315. ASSERT_EQ(set.get(9), 1);
  316. set.sort([](auto lhs, auto rhs) {
  317. return lhs < rhs;
  318. });
  319. ASSERT_EQ(*(set.raw() + 0u), 12);
  320. ASSERT_EQ(*(set.raw() + 1u), 9);
  321. ASSERT_EQ(*(set.raw() + 2u), 6);
  322. ASSERT_EQ(*(set.raw() + 3u), 3);
  323. ASSERT_EQ(*(set.raw() + 4u), 1);
  324. auto begin = set.begin();
  325. auto end = set.end();
  326. ASSERT_EQ(*(begin++), 1);
  327. ASSERT_EQ(*(begin++), 3);
  328. ASSERT_EQ(*(begin++), 6);
  329. ASSERT_EQ(*(begin++), 9);
  330. ASSERT_EQ(*(begin++), 12);
  331. ASSERT_EQ(begin, end);
  332. }
  333. TEST(SparseSetWithType, SortReverse) {
  334. entt::SparseSet<unsigned int, int> set;
  335. set.construct(12, 1);
  336. set.construct(42, 3);
  337. set.construct(7, 6);
  338. set.construct(3, 9);
  339. set.construct(9, 12);
  340. ASSERT_EQ(set.get(12), 1);
  341. ASSERT_EQ(set.get(42), 3);
  342. ASSERT_EQ(set.get(7), 6);
  343. ASSERT_EQ(set.get(3), 9);
  344. ASSERT_EQ(set.get(9), 12);
  345. set.sort([](auto lhs, auto rhs) {
  346. return lhs < rhs;
  347. });
  348. ASSERT_EQ(*(set.raw() + 0u), 12);
  349. ASSERT_EQ(*(set.raw() + 1u), 9);
  350. ASSERT_EQ(*(set.raw() + 2u), 6);
  351. ASSERT_EQ(*(set.raw() + 3u), 3);
  352. ASSERT_EQ(*(set.raw() + 4u), 1);
  353. auto begin = set.begin();
  354. auto end = set.end();
  355. ASSERT_EQ(*(begin++), 1);
  356. ASSERT_EQ(*(begin++), 3);
  357. ASSERT_EQ(*(begin++), 6);
  358. ASSERT_EQ(*(begin++), 9);
  359. ASSERT_EQ(*(begin++), 12);
  360. ASSERT_EQ(begin, end);
  361. }
  362. TEST(SparseSetWithType, SortUnordered) {
  363. entt::SparseSet<unsigned int, int> set;
  364. set.construct(12, 6);
  365. set.construct(42, 3);
  366. set.construct(7, 1);
  367. set.construct(3, 9);
  368. set.construct(9, 12);
  369. ASSERT_EQ(set.get(12), 6);
  370. ASSERT_EQ(set.get(42), 3);
  371. ASSERT_EQ(set.get(7), 1);
  372. ASSERT_EQ(set.get(3), 9);
  373. ASSERT_EQ(set.get(9), 12);
  374. set.sort([](auto lhs, auto rhs) {
  375. return lhs < rhs;
  376. });
  377. ASSERT_EQ(*(set.raw() + 0u), 12);
  378. ASSERT_EQ(*(set.raw() + 1u), 9);
  379. ASSERT_EQ(*(set.raw() + 2u), 6);
  380. ASSERT_EQ(*(set.raw() + 3u), 3);
  381. ASSERT_EQ(*(set.raw() + 4u), 1);
  382. auto begin = set.begin();
  383. auto end = set.end();
  384. ASSERT_EQ(*(begin++), 1);
  385. ASSERT_EQ(*(begin++), 3);
  386. ASSERT_EQ(*(begin++), 6);
  387. ASSERT_EQ(*(begin++), 9);
  388. ASSERT_EQ(*(begin++), 12);
  389. ASSERT_EQ(begin, end);
  390. }
  391. TEST(SparseSetWithType, RespectDisjoint) {
  392. entt::SparseSet<unsigned int, int> lhs;
  393. entt::SparseSet<unsigned int, int> rhs;
  394. const auto &clhs = lhs;
  395. lhs.construct(3, 3);
  396. lhs.construct(12, 6);
  397. lhs.construct(42, 9);
  398. ASSERT_EQ(clhs.get(3), 3);
  399. ASSERT_EQ(clhs.get(12), 6);
  400. ASSERT_EQ(clhs.get(42), 9);
  401. lhs.respect(rhs);
  402. ASSERT_EQ(*(clhs.raw() + 0u), 3);
  403. ASSERT_EQ(*(clhs.raw() + 1u), 6);
  404. ASSERT_EQ(*(clhs.raw() + 2u), 9);
  405. auto begin = lhs.begin();
  406. auto end = lhs.end();
  407. ASSERT_EQ(*(begin++), 9);
  408. ASSERT_EQ(*(begin++), 6);
  409. ASSERT_EQ(*(begin++), 3);
  410. ASSERT_EQ(begin, end);
  411. }
  412. TEST(SparseSetWithType, RespectOverlap) {
  413. entt::SparseSet<unsigned int, int> lhs;
  414. entt::SparseSet<unsigned int, int> rhs;
  415. const auto &clhs = lhs;
  416. lhs.construct(3, 3);
  417. lhs.construct(12, 6);
  418. lhs.construct(42, 9);
  419. rhs.construct(12, 6);
  420. ASSERT_EQ(clhs.get(3), 3);
  421. ASSERT_EQ(clhs.get(12), 6);
  422. ASSERT_EQ(clhs.get(42), 9);
  423. ASSERT_EQ(rhs.get(12), 6);
  424. lhs.respect(rhs);
  425. ASSERT_EQ(*(clhs.raw() + 0u), 3);
  426. ASSERT_EQ(*(clhs.raw() + 1u), 9);
  427. ASSERT_EQ(*(clhs.raw() + 2u), 6);
  428. auto begin = lhs.begin();
  429. auto end = lhs.end();
  430. ASSERT_EQ(*(begin++), 6);
  431. ASSERT_EQ(*(begin++), 9);
  432. ASSERT_EQ(*(begin++), 3);
  433. ASSERT_EQ(begin, end);
  434. }
  435. TEST(SparseSetWithType, RespectOrdered) {
  436. entt::SparseSet<unsigned int, int> lhs;
  437. entt::SparseSet<unsigned int, int> rhs;
  438. lhs.construct(1, 0);
  439. lhs.construct(2, 0);
  440. lhs.construct(3, 0);
  441. lhs.construct(4, 0);
  442. lhs.construct(5, 0);
  443. ASSERT_EQ(lhs.get(1), 0);
  444. ASSERT_EQ(lhs.get(2), 0);
  445. ASSERT_EQ(lhs.get(3), 0);
  446. ASSERT_EQ(lhs.get(4), 0);
  447. ASSERT_EQ(lhs.get(5), 0);
  448. rhs.construct(6, 0);
  449. rhs.construct(1, 0);
  450. rhs.construct(2, 0);
  451. rhs.construct(3, 0);
  452. rhs.construct(4, 0);
  453. rhs.construct(5, 0);
  454. ASSERT_EQ(rhs.get(6), 0);
  455. ASSERT_EQ(rhs.get(1), 0);
  456. ASSERT_EQ(rhs.get(2), 0);
  457. ASSERT_EQ(rhs.get(3), 0);
  458. ASSERT_EQ(rhs.get(4), 0);
  459. ASSERT_EQ(rhs.get(5), 0);
  460. rhs.respect(lhs);
  461. ASSERT_EQ(*(lhs.data() + 0u), 1u);
  462. ASSERT_EQ(*(lhs.data() + 1u), 2u);
  463. ASSERT_EQ(*(lhs.data() + 2u), 3u);
  464. ASSERT_EQ(*(lhs.data() + 3u), 4u);
  465. ASSERT_EQ(*(lhs.data() + 4u), 5u);
  466. ASSERT_EQ(*(rhs.data() + 0u), 6u);
  467. ASSERT_EQ(*(rhs.data() + 1u), 1u);
  468. ASSERT_EQ(*(rhs.data() + 2u), 2u);
  469. ASSERT_EQ(*(rhs.data() + 3u), 3u);
  470. ASSERT_EQ(*(rhs.data() + 4u), 4u);
  471. ASSERT_EQ(*(rhs.data() + 5u), 5u);
  472. }
  473. TEST(SparseSetWithType, RespectReverse) {
  474. entt::SparseSet<unsigned int, int> lhs;
  475. entt::SparseSet<unsigned int, int> rhs;
  476. lhs.construct(1, 0);
  477. lhs.construct(2, 0);
  478. lhs.construct(3, 0);
  479. lhs.construct(4, 0);
  480. lhs.construct(5, 0);
  481. ASSERT_EQ(lhs.get(1), 0);
  482. ASSERT_EQ(lhs.get(2), 0);
  483. ASSERT_EQ(lhs.get(3), 0);
  484. ASSERT_EQ(lhs.get(4), 0);
  485. ASSERT_EQ(lhs.get(5), 0);
  486. rhs.construct(5, 0);
  487. rhs.construct(4, 0);
  488. rhs.construct(3, 0);
  489. rhs.construct(2, 0);
  490. rhs.construct(1, 0);
  491. rhs.construct(6, 0);
  492. ASSERT_EQ(rhs.get(5), 0);
  493. ASSERT_EQ(rhs.get(4), 0);
  494. ASSERT_EQ(rhs.get(3), 0);
  495. ASSERT_EQ(rhs.get(2), 0);
  496. ASSERT_EQ(rhs.get(1), 0);
  497. ASSERT_EQ(rhs.get(6), 0);
  498. rhs.respect(lhs);
  499. ASSERT_EQ(*(lhs.data() + 0u), 1u);
  500. ASSERT_EQ(*(lhs.data() + 1u), 2u);
  501. ASSERT_EQ(*(lhs.data() + 2u), 3u);
  502. ASSERT_EQ(*(lhs.data() + 3u), 4u);
  503. ASSERT_EQ(*(lhs.data() + 4u), 5u);
  504. ASSERT_EQ(*(rhs.data() + 0u), 6u);
  505. ASSERT_EQ(*(rhs.data() + 1u), 1u);
  506. ASSERT_EQ(*(rhs.data() + 2u), 2u);
  507. ASSERT_EQ(*(rhs.data() + 3u), 3u);
  508. ASSERT_EQ(*(rhs.data() + 4u), 4u);
  509. ASSERT_EQ(*(rhs.data() + 5u), 5u);
  510. }
  511. TEST(SparseSetWithType, RespectUnordered) {
  512. entt::SparseSet<unsigned int, int> lhs;
  513. entt::SparseSet<unsigned int, int> rhs;
  514. lhs.construct(1, 0);
  515. lhs.construct(2, 0);
  516. lhs.construct(3, 0);
  517. lhs.construct(4, 0);
  518. lhs.construct(5, 0);
  519. ASSERT_EQ(lhs.get(1), 0);
  520. ASSERT_EQ(lhs.get(2), 0);
  521. ASSERT_EQ(lhs.get(3), 0);
  522. ASSERT_EQ(lhs.get(4), 0);
  523. ASSERT_EQ(lhs.get(5), 0);
  524. rhs.construct(3, 0);
  525. rhs.construct(2, 0);
  526. rhs.construct(6, 0);
  527. rhs.construct(1, 0);
  528. rhs.construct(4, 0);
  529. rhs.construct(5, 0);
  530. ASSERT_EQ(rhs.get(3), 0);
  531. ASSERT_EQ(rhs.get(2), 0);
  532. ASSERT_EQ(rhs.get(6), 0);
  533. ASSERT_EQ(rhs.get(1), 0);
  534. ASSERT_EQ(rhs.get(4), 0);
  535. ASSERT_EQ(rhs.get(5), 0);
  536. rhs.respect(lhs);
  537. ASSERT_EQ(*(lhs.data() + 0u), 1u);
  538. ASSERT_EQ(*(lhs.data() + 1u), 2u);
  539. ASSERT_EQ(*(lhs.data() + 2u), 3u);
  540. ASSERT_EQ(*(lhs.data() + 3u), 4u);
  541. ASSERT_EQ(*(lhs.data() + 4u), 5u);
  542. ASSERT_EQ(*(rhs.data() + 0u), 6u);
  543. ASSERT_EQ(*(rhs.data() + 1u), 1u);
  544. ASSERT_EQ(*(rhs.data() + 2u), 2u);
  545. ASSERT_EQ(*(rhs.data() + 3u), 3u);
  546. ASSERT_EQ(*(rhs.data() + 4u), 4u);
  547. ASSERT_EQ(*(rhs.data() + 5u), 5u);
  548. }
  549. TEST(SparseSetWithType, ReferencesGuaranteed) {
  550. struct InternalType { int value; };
  551. entt::SparseSet<unsigned int, InternalType> set;
  552. set.construct(0, 0);
  553. set.construct(1, 1);
  554. ASSERT_EQ(set.get(0).value, 0);
  555. ASSERT_EQ(set.get(1).value, 1);
  556. for(auto &&type: set) {
  557. if(type.value) {
  558. type.value = 42;
  559. }
  560. }
  561. ASSERT_EQ(set.get(0).value, 0);
  562. ASSERT_EQ(set.get(1).value, 42);
  563. auto begin = set.begin();
  564. while(begin != set.end()) {
  565. (begin++)->value = 3;
  566. }
  567. ASSERT_EQ(set.get(0).value, 3);
  568. ASSERT_EQ(set.get(1).value, 3);
  569. }