tomato-testing/test/entt/entity/registry.cpp
Green Sky 90ce4bda4e Squashed 'external/entt/entt/' changes from fef921132..344e03ac6
344e03ac6 update single include file to v3.12.2
da56665b0 registry: make ::valid backward compatible
f6f01ef1b snapshot: avoid warnings due to deprecated functions
0ed514628 now working on v3.12.2
a41421d86 update single include file to v3.12.1
c1f6b11f7 snapshot: reintroduce support to storage listeners
b2233064a now working on version v3.12.1
cb974bf56 adjacency_matrix: fix in_edges() is off by 1 in some cases (close #1019)
7b7d82e6f doc: snapshot (close #984)
05c6898fc test: self-fixing archive example for snapshot classes
7ffa459a6 snapshot: drop ::get member template parameter
93e8e94e6 test: basic continuous loader
c4e241662 snapshot: review basic_continuous_loader (and drop shrink)
9c25419b9 test: more on basic_snapshot_loader
1879830df snapshot: drop pointless assert
29298c0eb test: guarantee code coverage, we'll update the test later on
247abef1d test: rollback for code coverage purposes on the snapshot class
6994d98d2 test: typo
9a600ece2 test: snapshot
f91226ef4 snapshot: share ::orphans implementation (to deprecate in future though)
e366ffbd3 doc: snapshot
63b300d39 snapshot: again, dense_map::contains is a thing
afb70d157 test: avoid warnings due to unused variables
49534eec0 snapshot: dense_map::contains is a thing fortunately
3f1277f7b snapshot: use the right allocator for the remote-local mapping
26fad4c38 test: basic snapshot loader
25b3afacf test: basic snapshot
2d25bbb09 snapshot: check registry type
0eb834582 snapshot: small cleanup
124a44052 test: use the new snapshot get functions in the test suite
5c704636e test: use the new snapshot get functions in the test suite
31fd94cc3 snapshot: cleanup to get ready to drop an internal function
573e43272 snapshot: reduce storage lookups
1d8943481 snapshot: drop useless function
e0a1ef7c1 snapshot: check on member type class
48ac0e0eb snapshot: add basic_continuous_loader::get, deprecate ::entities and ::component
bcb6234d9 snapshot: add basic_snapshot_loader::get, deprecate ::entities and ::component
f96796326 snapshot: reject entity type in the range-get (now get instead of get_sparse)
b22c55dd2 doc: typo
4ff5a536c snapshot: add basic_snapshot::get, deprecate ::entities and ::component
fff5f578a test: avoid using deprecated functions in an example
0f44c8c92 doc: reflect recent changes
0b6ad0315 snapshot: * single element only archive functions required * avoid iterating elements more than once
2450b0bc6 test: minor changes (waiting for a rework)
fc8eebf36 snapshot: use component_traits instead of is_empty_v
e4f51f2b7 snapshot: avoid multiple lookups of the same storage
2c2216a89 doc: typo
cafe85180 snapshot: deprecate multi-type component loading function
35e338cc9 snapshot: deprecate multi-type component loading function
8feeaaef7 doc: minor changes
e7a3c4e37 snapshot: add missing [[deprecate(...)]]
ea5c558bd snapshot: cleanup (waiting for further improvements)
94f0ed179 snapshot: deprecate multi-type component loading function
244c35949 snapshot: deprecate multi-type component loading function
1f24fea21 type_traits: formatting
8deaa09b2 test: perform static checks at compile-time
85bffb714 type_traits: std::tuple traits specialization for entt::type_list and entt::value_list (#1011)
325ca310d view: updated ::refresh
d903e268f snapshot: minor changes
f4b26756c snapshot: improved basic_snapshot::component
fb3a34ee9 *: updated TODO
6902bb6c4 doc: typo
379819b2b test: cleanup
59abfbfb5 meta: refine policy check on value types for non-member data
6e2d87184 registry: avoid casting return types directly to better support empty storage
57ec3c85c registry: erase_if (close #977)
4afdf287f doc: minor changes
2810ac7cb registry: suppress a warning on msvc
e0d27f9bf *: updated TODO
de303c999 test: reverse-each for storage entity
1619e780f test: reverse each for plain storage classes
a1e37eca6 storage: reverse-each
c345e7456 doc: note on reverse iterations
d166c026f snapshot: minor changes
5e639996d doc: minor changes
dac2ef5a9 doc: typo
71d7888e8 snapshot: drop redundant check
84a4df9c4 doc: exclude-only views
95bc20319 doc: entity lifecycle
5a9f6d211 doc: cleanup
a29302faa test: more on entity signals
75efa72c6 registry: cleanup ::erase
58a84665b registry: cleanup ::remove
a5263384d doc: drop redundant comments
c0e6759c6 doc: cleanup a little further
d754f7431 doc: cleanup
1df539943 doc: drop pointless tags
c284e6fee doc: minor changes
500239758 test: typo
319ecd808 organizer: fix organizer::vertex::prepare not creating component pools (#1014)
d7891fabc doc: mention named pools support when registering listeners
e287dd041 helper: minor changes
4dee9dde1 registry: named pools support for on_construct/on_update/on_destroy
9bae6e67b doc: update connection helper doc
aa7a7ce25 doc: minor changes
a969468c5 registry: de-deprecate :) on_construct/on_update/on_destroy
a1e76fc63 doc: more about entity storage
d8ed4ca35 registry: refine how entity storage is used internally
3248e3f91 helper: make sigh_helper work with named pools
f00687e6f doc: updated registry documentation
5240c6b60 registry: deprecate on_construct/on_update/on_destroy
67604a88e natvis: update registry snippet
4242dfb8b registry: use entity storage directly as much as possible
f96d8ee83 registry: prepare to split component storage and entity storage
c147ec37c test: try to make gcc happy again
094ddbba3 meta: avoid shadow warnings
634630ca2 test: add missing template keywords (thanks msvc for ignoring them)
d78c26f26 *: updated TODO
fabc6c9bd test: full cross-registry entity-copy example with meta (not strictly required)
b6e8ddd2a meta: fight against the small nuances of the language :)
cf2bbae6e mixin: make it simpler to modify the underlying type
08799616d *: updated TODO
58bebf78d meta: reduce symbols and their sizes if possible
d534fad3e doc: more about views
871dc7a40 doc: drop references to storage placeholders
1fe7c78f7 test: minor changes
22a65f80f test: cleanup
756ea8a38 *: updated TODO
12186cb40 registry: drop internal static storage variables from ::assure
aa9ffb9ee registry: const ::storage<T>(...) returns a pointer to possibly null storage
dcb5aed90 registry: lazily/partially initialize views in the ::view const function
34f6a747a registry: add support for non-existent pools to try_get
912cb2ad5 snapshot: constness review
885488b3d registry: any_of supports non-existing pools now
3d3d3ef2d registry: all_of supports non-existing pools now
a7120b340 registry: coding style
51915205b test: cover stable multi-type model
4a3ee042e view: refine ::storage function
88a1b8d0d view: stable multi-type view ::each(cb) function
7e18a0f96 view: update ::use function
c367082dd view: unchecked_refresh function
9f94b5306 view: double check on none_of
44ed10c50 view: stable multi type view ::find/::back/::front functions
1b2280941 view: stable multi type view ::begin/::end functions
bdabbaa63 view: stable multi type view ::contains function
c79c109b7 view: stable multi type view ::size_hint function
f1a213382 registry: prepare to remove static storage from const assure
17dc06149 view: stable single type view ::each(cb) function
3b8d82330 view: drop unused return
a20829e70 view: ::handle returns a pointer rather than a reference
5be2fdc15 view: stable single type view ::each() function
873b107e6 -: updated TODO
356bbbe53 view: stable single type view ::find function
e3ce4e156 view: stable single type view ::front/::back functions
e02050c51 view: stable single type view ::rbegin/::rend functions
26930633f view: stable single type view ::begin/::end functions
b7a485767 view: stable single type view ::contains function
f54cdccd4 view: stable single type view ::empty function
41c9a32f3 view: stable single type view ::size function
736ef3580 view: make operator bool work properly with partially initialized views
0128cbb4f test: minor changes
ff0a40715 test: prepare test suite for safe invalid views
34f440386 view: avoid using storage, further prepare for empty safe views
b1c78efb6 nativs: updated signal file
28f03ff9c meta: add missing checks on factory<...>::data
a5fe61adb *: minor changes
457f5e59e view: rollback handle() usage and prepare to safe empty views
422fd284e group: refine group ::find function
6f3222573 view: refine single type view ::find function
366bbceb0 doc: use doxygen-awesome-css
7b7f81e08 doc: update reference.md
cfe955f97 doc: update links.md
684ddc9de doc: minor changes
f5d38a9ae doc: drop redundant doxy variable
447e3693f doc: updated doxy file (doxygen 1.9.6)
909490bf6 view: try to make g++ happy again
d90363e4a view: make view pack also work with empty views
ee5de744c view: add missing [[nodiscard]]
d401c88a0 view: assert on null handles
80563b955 view: allow swapping storage elements of a view
c74900057 sigh_mixin: avoid shadow warnings
78867d5c9 group: make msvc happy with constness on virtual functions
d435fc779 basic_entt_traits: suppress a warning by gcc
e6f76e0f9 view: try to make VS happy again :)
1c6b53360 test: minor changes
5c3d8360c view: turn ::use into a self-contained, non-const function
3882c7d9a view: turn ::refresh into a self contained, non-const function
15726218b view: doc
869bfc82c test: minor changes
0eb3d54b2 group: change signature of ::storage to return a (maybe null) pointer rather than a reference
f83290f76 view: change signature of ::storage to return a (maybe null) pointer rather than a reference
686a3b9d7 registry: make storage_for_type available to the final user
4d57d5c32 registry: make ::storage<T> return type explicit
36c21cf7f registry: drop redundant traits usage
7ab10e193 test: minor changes
41467d35a -: updated TODO
d351252a1 doc: entity storage
c6cd4f701 doc: refine storage section
65889cca4 doc: brief mention of void storage
f1914fd94 doc: rearrange a few things
e53af7bef registry: minor changes
b910cd261 *: updated TODO
58d331ca0 registry: minor changes
17f5b0a33 registry: avoid bumping version on destroy if not requested
de386292b registry: deprecate ::each
88bf26a2f registry: deprecate ::assign
3caad4100 mixin: common internal owner_or_assert function
916203a24 test: stress assert on entity limit
62f1971f7 test: minor changes
4fde96357 natvis: updated registry snippet
c3730b65f group: * unified model * drop group handler's size function (no longer required)
1ea072cd3 group: back to the unified model for group handlers
bbe4582ee meta: minor changes
89ab5c328 meta: operator==/!= for meta_func
3a4672793 meta: operator==/!= for meta_prop
0a0446f35 meta: operator==/!= for meta_data (close #1002)
fc58ff74b meta: operator==/!= for meta_handle (see #1002)
fed6831cd locator: support to opaque structures (close #956)
1605c8d9d natvis: updated entity file
d6641c7d8 -: updated TODO file
5079f38e9 storage: allow on_update signals on entity storage
1eab2a4a8 meta: fix constness detection for static functions in meta_type::invoke
c33110765 test: cleanup
117b0bd67 test: more about storage<...>::patch
9b4a6f877 storage: use allocator_traits::destroy rather than destroy_at
f4e6f2b37 group: suppress shadow warning
5971fb7aa -: updated TODO
10dfe7e93 sigh: allow disconnecting listeners during iterations (close #986)
a9208a956 doc: fixed typo
1cc5b32ca test: cleanup
f8a972a3c signal: drop sink::before
5b7cc2002 group: rollback some (no longer required) changes to the owning_group_descriptor
bd34e7f2c group: drop nested groups support, prepare to the large group review and multi storage support
46fe29c3f group: make matching functions virtual for owning groups
c50e2815c group: make owning_group_descriptor depend on the storage base type
fbfee632d group: minor changes
77c59aabf group: group_handler::size function for owning groups
ebb1e8a72 group: single check function for group handlers
1646217f0 group: make types explicit for the next/prev functions
645edfb2b group: decouple constructing and setting prev/next links
61f28298c group/registry: minor changes
d19f97bf2 group: use ::handle() if possible
70c611a84 group: cleanup
286428c19 group: make common_type base of non-owning group handlers
6ec719bcf group: reduce the footprint of non-owning group handlers
11f9bb2d7 registry: use shared_ptr<void> for non-owning groups (prepare to drop the basic handler dependency)
5a1ba5ad7 regisrtry: decouple container types for groups
cf094e7ef registry: finally split owning and non-owning groups as it ought to be
31808bd9a sigh: flip the last commit on its head and drop redundant functions rather than merging them
61a5173a7 sigh: merge a couple of functions
ed6fe9e65 sigh/sink: refine internal definition
e30fa8520 doc: cleanup
ca1069e18 snapshot: avoid allocations if possible
70f73a094 snapshot: drop pointless checks
710fff0e3 entity: make get_t, exclude_t and owned_t constexpr constructible
660bc5843 entity: turn get_t, exclude_t and owned_t into proper classes (close #998)
13295a14e type_traits: v141 toolset workaround for value_list_diff
9ce07ff61 type_traits: value_list_diff[_t]
b272e04ba type_traits: value_list_contains[_v]
28b11912a test: cleanup
b9f096d12 type_traits: value_list_unique[_t]
8c60faa1d type_traits: value_list_index[_v]
1f93ea4ee snapshot: avoid unnecessary lookups
7ca77e53f snapshot: avoid unnecessary lookups
69397f365 snapshot: avoid unnecessary lookups
f907bc066 snapshot: drop redundant checks and avoid unnecessary lookups
bda52701f snapshot: avoid unnecessary lookups
d26f7684c snapshot: minor changes
63d6c2bff snapshot: avoid unnecessary lookups
cc45e7341 snapshot: also avoid using views if not required
5d092bcb1 snapshot: avoid unnecessary lookups
295c68841 snapshot: review ::orphans functions
2664b5255 observer: allocator support
dd3632833 observer: configurable mask type
c8c929e4a group: use type members properly
d1ef7bf15 view: use type members properly
1ab23f17d group: early exit on signal races
a72eb4693 group: minor changes
67579d062 -: updated TODO
766a233f3 view: base_type -> common_type
905671c23 runtime_view: base_type -> common_type
27c1383e4 group: base_type -> common_type
029ccc8f7 registry: base_type -> common_type
cde40d586 group: drop unused using decl
6a16a8a20 group: auto init for owning groups
1a12dede6 group: auto init for non-owning groups
35a78b65e group: cleanup
ada19432f group: support for index based sort
4998e9087 doc: minor changes
471c11c6d sparse_set: respect -> sort_as (naming is hard, you know)
3e13e0b59 group: sort/respect -> sort_as (also decoupled from group types)
53cd105f2 group: reuse pools as much as possible
24b31c379 group: reuse pools as much as possible
def82b534 group: index based get
a424f4ebf view: review get
b8f0a8d8e doc: a couple of interesting articles/series (close #994)
7941226ef group: try to reuse pools when sorting and also please all compilers out there at the same time (aka me figthing ICEs again)
86bbb2f6b group: reuse pools when sorting
3c176f725 test: suppress warnings due to unused variables
3642c8a78 registry: drop [[nodiscard]] from ::group (close #991)
0e80d90a7 group: use storage<idx> as much as possible
4fdf2dccd group: update doc
f8a997e6c group: minor changes
40f676ed1 test: drop unused include
5e346748e test: code coverage for groups and registry
3ef61fe01 meta: support meta member functions on primitive types
3885d280d test: cleanup
f41b91419 meta: allow updating values on meta properties
e0684f634 registry: cleanup/minor changes
fb980a78c registry: further refine the group function(s)
c2430ab48 doc: minor changes
d36d9cb39 registry: further cleanup group functions
0017c08bb group: get pools from handlers
e737ff747 group: get filter from handlers
945dc4093 group: split group handler functions
7ef008511 registry: drop group_data
d2fa68813 registry/group: prepare to get rid of group_data
f22a09a9a group: in-between change to simplify dropping group_data
b0aba79a5 snapshot: minor changes
7c23e4a2f registry: minor changes
7fe035ce4 group: move group size from registry group_data to basic_group_handler
3e7160eda group: minor changes
aaeb686ec group: common base class for group handlers
3fdf4884d group: prepare for group handler common base class
1b23ff4b9 registry: use common group handler types as keys for the group set
88dac318e group: wrap the len of owning groups to avoid changing it by mistake
520c2e660 group: make group handlers work with multiple storage of the same type
f5d0d451b group: split pools and filter in the group handlers
8af6fc0cc group: use ::handle internally if possible
c04b97a31 group: add ::handle function to all group types
1d85414dc doc: drop refs to registry::version (close #992)
c6533827f group: fight with clang format from time to time :)
b5803451b group: make owning groups work with their handlers
3417d66b2 group: make non-owning groups work with their handlers
1e61204e8 registry: deduce group handler type from group type
19c4857ef group: cleanup
66ea94898 registry/group: move group handler to group file as it ought to be
ced6d21c3 registry: break dependency between registry and group handlers
429c7c45c registry: further cleanup things
c03b1111a registry: small cleanup
ebd7d3acd registry: storage based model with pools for groups
5aeec60cf registry: prepare to switch to storage based group handlers
620b4f751 registry: pass handlers to group callbacks
6d58004c1 registry: minor changes to simplify the implementation slightly
df6d926de registry: prepare for a storage based group handler
e63af24cb registry: turn the non-owning group handler in a storage
068d9f8ae registry: discard unused arguments from listeners if possible
c19c848c4 test: suppress warnings due to unused variables
0bf0a0a8f doc: delegate
743e8678e delegate: also support functions that skip first elements (on second attempt only)
a7ad1c06f delegate: prepare to support filtering on both sides
b1af70e70 registry: avoid checking pools in the group handler if possible
c87c3533e registry: avoid checking pools in the group handler if possible
4839a0ee6 registry: cleanup
a0f0c44e6 registry: minor changes
74691dc1d group: just use meaningful names :)
e4957badb registry: split group handler to further refine group management
46791c4c3 registry: turn group handler functions into static ones
56c391784 registry: prepare to rework groups
1fb13d3e9 doc: minor changes
535beb4e2 storage: drop unnecessary use of integral_constant
2d318b88c -: updated TODO
b7f0b76ce entity/mixin: add missing include
d30312f51 entity/helper: add missing include, drop unnecessary traits calls
30772848e meta: avoid unnecessary calls to std::move
eca01a397 doc: add vcpkg badge and vcpkg.link (#985)
35ef0b7ac core: reduces the number of instantiations a bit
19ccba3a6 meta: reduces the number of instantiations a bit
207b7674a doc: fix typo
631c55ba9 storage: minor changes/tests
e7b30fd36 storage: return iterator to elements rather than entities and only if it makes sense
3e959007b storage: ::insert returns an iterator to the range of inserted entities
07ec4ca23 -: updated TODO
6e4946b68 storage: uniform interface to simplify mixin implementation
47ea16f17 test: signals on entity creation/destruction
722857fc0 test: get rid of pointless template parameters
2125b3838 test: minor changes
289de7d57 test: exclude only views
25ecd8e79 test: minor changes
319dfdb07 test: filtered registry view
9dbbcac01 -: updated TODO
f545c8e05 registry: deprecate ::release
c68fa6a65 registry: make ::destroy work without ::release (the latter to be deprecated)
d288ecd70 registry: make ::release use ::bump return value
312d3aba8 sparse_set: bump returns the version in use (for convenience)
4d2b2c6de registry: use traits_type::next if possible
80d55a226 test: increase code coverage
d86a53935 test: suppress warnings due to unused variables
0f7098d0e -: updated TODO
8c96be1e9 registry: deprecate a bunch of functions because of the entity storage
37f396bfe registry: make entity storage storage as any other
75894dc40 storage: update traits_type for entity storage
cdee000ce any: rollback a change that turns vs toolset v141 crazy
54ca62600 dispatcher: refine aggregate check
6f4280ed5 any: refine aggregate check
ddf56b78c storage: backward compatibility on component requirements
53a854f54 any: just cleanup the code to make it easier to work with
4896acac7 storage: typo
e3defeba2 test: suppress warnings due to unused variables
62079908c storage: use proper value type for entity storage
e65a8f2e5 doc: add link to koala engine :)
9f27fb1e5 registry: further prepare to turn the entity storage into a plain pool
04d734e76 registry: prepare to turn the entity pool in a plain storage
df50fa1b5 natvis: cleanup
051872b8c natvis: update registry definition
57ab9e7be registry: avoid using assure if not required
69d95ba75 test: more bench to stress a little an upcoming feature
9caf66d7c test: cleanup
74cb0d40c test: internal rework
deac7f34b dispatcher: refine aggregate support
a9883f27c storage: refine transparent aggregate support
85b1e57d8 sparse_set: drop fast_compact, expect full clear
b7d8e0186 storage: make the entity storage perform a full clear rather than a fake one (still viable via erase)
390a56176 -: updated TODO file
a1b888cce natvis: add optiona storage length item for entity storage
2107dd689 natvis: fix already existing errors due to renaming or design changes
1fca56afe storage: make it easier to refine the natvis file
c0762a6a5 storage: add get/get_as_tuple to entity storage to make it suitable for use with views
f48de1bac test: stress get/get_as_tuple for empty types
c7dfce89e sigh_mixin: refine pop_all
822fafcd4 view: uniform implementation to simplify upcoming changes
1476d4ea9 sparse_set: refine ::respect
c1c63777e -: updated TODO
2fab25ae8 registry: refine internal check
75d449152 -: updated TODO
c7866fb21 storage: use entt traits next function if possible
87987bacd entity: added basic_entt_traits::next (with tests)
bde0219fe snapshot: review basic_continuous_loader::entities
ad64c849b storage: suppress warnings
b808bb83b test: suppress warnings
d0090d35f snapshot: try to make sizes an opaque value to the caller
7a1a06a24 sigh_mixin: avoid shadow warnings
000b17881 -: updated TODO
068b6ed49 registry: first (almost) backward compatible version with opaque hidden entity storage
0187fb48a test: sigh mixin for entity storage types
35a2b3844 sigh_mixin: also support entity storage types
4747c9a4c registry: extended checks to support swap-only entity storage types
7be8d8327 registry: make a couple of conditions opaque
a5d6757d6 registry: prepare to get rid of the vector of entities
3f09d47c8 storage: remove redundant typename keyword
9c06d6ba0 registry: use type member names
b7c819bf4 test: entity storage
9f31803ba storage: swap-only entity storage
1e7deff9c test: drop redundant checks
04ac15d8d test: minor changes
376218991 sigh_mixin: make pop_all use narrow view iterators if any
18d6e466d -: [[nodiscard]]  as appropriate
095ecf314 group: extended_group_iterator::base to return the underlying iterator
433ed863e view: extended_view_iterator::base to return the underlying iterator
0dba68e75 storage: coding style/minor changes
1ab281582 storage: extended_storage_iterator::base to return the underlying iterator
2af5a725e doc: * updated copyright * udpated TODO list
a86bf1332 test: try to make lcov happy
831054bff test: share as much as possible
f94de1c06 test: rework lib stuff to share common files
a3d9503a1 test: try to make lcov happy
3f2b15f9f test: try to make lcov happy
e48817d51 test: try to make lcov happy
d11cebe30 view: uniform design to also help natvis without having to poke into stl internals
77a5efb32 natvis: updated to_entity intrinsic
851006efe -: updated TODO
6fc6b2fb3 sigh_mixin: further improve ::pop_all
ed17a2c48 sparse_set: ::contiguous function
bd00e797a sparse_set: further refine pop_all to make it even faster
e645c4928 -: updated TODO
a425878e8 sparse_set/storage: clear is backward compatible now
f3cd9d374 storage: fixed clear_all counter
b3e93b084 registry: naming convention
314c189c4 test: minor changes
2bb2c5566 build: try to make lcov happy again
d13c126e9 view: avoid name clashes
9b54ee37a flow: propagate allocator to generated graph + internal rework
e1ead9d3e build: update coverage workflow
cf61068dc mixin: suppress a warning with gcc11
82863f829 test: code coverage for range functionalities
e4de59827 test: try to make lcov happy
ccea4c920 memory: code coverage
89166f0e4 build: refine analyzer workflow
7a05a16c5 registry: slightly better destroy (yet not quite there though)
d0854646c test: yet another test to stress the upcoming changes
1e9c9fe5f registry: better, faster range-remove + refine range-erase
80fac8d8e test: minor changes
c774b9838 -: updated TODO
3fd0403cc registry: faster, better range-erase
6eb3347a3 test: a couple of extra functions to stress the upcoming changes
89bceaff7 -: updated TODO
dc25c9c1a sparse_set: invoke release_sparse_pages before clearing the sparse array
e68ba5870 sigh_mixin: add a missing include
c68cb3375 entity: make deletion_policy publicly available via fwd.hpp
59f807fd0 sparse_set: suppress warnings due to unused expressions
232ffebc1 sparse_set: internal clear_all function
3cea845a0 sparse_set: sparse_set_iterator::data function
295f3b32e registry: a couple of extra move calls here and there
254da2c3c sparse_set: better, faster range remove
ecd3b8d93 sparse_set: prevent rework errors as much as possible
c673b9b17 sigh_mixin: slightly improved pop + review insert
cd28de0d6 test: clear-stable bench
672f6a711 test: minor changes
3b50672b7 storage: restore storage_for/storage_type duality, it turned out to be very useful in practice
f0613b1c6 sparse_set/storage: minor changes to reuse type members
2197e160e -: drop file pushed by mistake :)
2dccd9016 handle: discard entity on destruction
2f873f2dd -: storage_mixin.hpp -> mixin.hpp (non-storage mixins are also a thing)
fde1a524e sparse_set: ::get -> ::value (to avoid hiding from derived classes)
055801047 doc: drop references to docsforge + minor changes
79a054a52 sigh_mixin: scope base_type properly
d94e443a1 doc: drop outdated section
3862184e8 sigh_mixin: support self managed storage classes
f40fa3c2f test: * use range destroy * avoid compiler optimizations
01bc93459 test (bench): the new entity storage enables the fast path in all cases
151bd0739 sparse_set: revert optmized range push, it prevents self-managed storage classes
935393aae sparse_set: better, faster range push
fbfde4347 snapshot: avoid unused variable warnings
2ffbe115b component_traits: revert entity customization support
645973eb7 sparse_set: insert -> push
133230797 sparse_set: emplace -> push
b700f5eb5 doc: typo
e60dbdc52 sparse_set/storage: * rename swap_at in swap_or_move to capture the real purpose * define swap_at as a protected function to allow swapping from above
c66623b33 sigh_mixin: avoid hiding basic_iterator type meber
62246d879 storage: avoid hiding basic_iterator type meber
b35f13130 sparse_set: support swap-only mixins
3dd82633a -: drop storage_mixin.cpp, I forgot to do it a couple of commits ago :)
00231bf8a storage: make swap_at non-final to support checks on derived classes
58d392e81 -: minor changes
1d4d99d09 mixin: sigh_storage_mixin -> sigh_mixin
fe3edf2c8 -: minor changes
0864ba042 -: drop useless typename
3a9698001 build: minor changes
423f7a555 is_equality_comparable: detect C-style arrays directly
5db8ad53a build: update gh workflow
c2ab35780 view: make also VS toolset v141 happy
4fb558f14 view: further reduce instantiations
5762a8a08 view: reuse internal functions if possible
ed4c67521 sparse_set/storage: drop move_element
f15789846 config: ENTT_FAIL(msg) -> ENTT_ASSERT(false, msg)
6d20709e0 storage: minor changes
a9a9853c0 sigh_storage_mixin: use entity_type from Type
af14aa4c9 doc: more about signals (sigh_storage_mixin)
24d6b9881 test: minor changes
899f4baa6 storage: * drop storage_for]_t] * make storage_type[_t] deal with constness
c1ab7ba02 sigh_storage_mixin: make all virtual member functions final
9d38f6020 registry: thanks MSVC for accepting invalid C++ code
0efa25cf6 sigh: cool, I keep doing the same error again and again apparently :)
6316b6045 registry: make it work with storage<void> also in C++17
f268fb60a entity: avoid breaking changes due to type members renaming
3520d6915 entity: add base_type
4da7a8451 entity: make checks work with 64b identifiers :)
382dfc3bb entity: strict check on entity/version masks
b6dcdc816 entity: * also expose entity_mask and version mask to the final user * avoid default args with entt_traits::construct for backward compatibility
c9d544089 doc: review/cleanup entity.md a bit (done)
3eb5faeed doc: review/cleanup entity.md a bit (work in progress)
7a328c7ed doc: updated links
6567aa195 doc: a note about listeners disconnection (close #958)
92319f011 entt_traits: split basic impl, simplify def
782d86b6e entt_traits: value_type -> type (cuz it's not a value type after all)
c2cae37c1 entity_traits: make page_size type explicit
1026d26ec entt_traits: drop reserved value
7156803db test: local non-static constexpr variables
f54ed5424 helper: local non-static constexpr variables
f30b50195 algorithm: local non-static constexpr variables
c90ab9aff sparse_set: * break dependency on traits_type::reserved * use a tombstone if all I need is a tombstone
c2f6ca43f doc: graph (close #957)
3e5e41d88 test: cover some corner cases of the flow class
9eafc0431 flow: minor changes
0a82b777b component_traits: support specializations based on entity type
32bcc01a4 component: * make component_traits treat void properly * drop ignore_as_empty_v
9c3fe3546 nativs: entity module
83f8aed58 helper: use traits_type from storage class directly
2fd660274 snapshot: use public registry traits_type member type
a554d406e registry: * public traits_type member type * break dependency on component_traits * use public storage traits_type member type
5f12f872e test: minor changes
be4eb68a3 helper: * break dependency on component_traits * use public storage traits_type member type
df5284d9e view: * break dependency on component_traits * use public storage traits_type member type
0e27d33e7 storage: public traits_type member type
fe6e6ae73 sparse_set: public traits_type member type
9d29713ea entity: naming convention
270d0277d group: cleanup
0bd06c8d5 hashed_string: naming convention
733f215cc storage: break dependency between component_traits and storage_iterator
ad01a69fe *: renaming/coding style
dd9c1dade sparse_set: no need to differentiate template args for sparse_set_iterator
b8f70519f doc: fixed typo
9b9d212dd *: coding style
3fe15969d doc: cleanup
ec4bf222c meta: avoid the +1u trick for 0-sized arrays
1173908ee meta: avoid rebinding when forwarding requests
2595b8a92 doc: sigh_helper
f4e2a8c76 sigh_builder: add all missing .template that msvc kindly accepted anyway
66e1a0565 entity: sigh_helper utility with tests (close #928)
87283dc41 storage: simplified impl in order to introduce multi-type storage more easily
a802ebffe storage: * move storage_type[_t] and storage_for[_t] to fwd.hpp * no need to include storage.hpp when forward defining views
b84b09421 doc: add Arch ECS to references.md (#954)
940fd0939 todo: add a note for a (soon to be released) change
920338be5 doc: add ecsact to links.md (thanks @zaucy for pointing this out)
bcd1155b7 gh: add more gcc and clang versions
1dc88109e gh: update workflows
262c1f53c cmake: only enable -Wdocumentation for clang-cl
4af0a3a0d doc: cleanup
be1641828 doc: cleanup
b54a52fbf doc: fixed typo
ae8815995 doc: fixed typo
62c764f68 doc: fixed typo
2c48cc10a cmake: enable documentation diagnostic for clang
82f286678 sigh: drop redundant function
d56e5a269 registry: propagate allocator to context
1517b2951 doc: document delegate raw access
bea7b43a1 delegate: target member function
2f878f8b5 sigh: refine ::collect
fc68c1b29 view/group: cleanup
9081c185d meta: minor changes
7c4493f23 group: make filter storage available
da4e73ab8 view: make filter storage available
f3e7f98b4 registry: extra check when moving a registry
3925fc612 emitter: extra allocator check when moving
c639130c1 dispatcher: extra allocator check when moving
75c311600 registry: cleanup
e9e14eb49 meta: [[nodiscard]]
d1558304f any: [[nodiscard]]
0531b530b snapshot: minor changes
f9d0178dd workflow: bump iwyu version
b66b8d37e test: suppress warning
05ef4c29d storage: minor changes
9c3d75669 test: cleanup include directives
93651e46f registry: drop [[deprecated]] functions
ea901cbfa test: code coverage
d5dc4f43e doc: meta.md
498e02f15 doc: core.md
d0ea8f4f9 cmake: suppress some warnings for clang-cl, it goes a little wrong otherwise
dec3b7bb3 test: suppress warnings
10bc8b05a test: use /W1 with VS (but for toolset v141, too bugged for that)
ad77b54dc cmake: bump version to get some cool feature/update
b6724b028 group: pass filter storage to groups (in-between change for full storage access)
54270b103 group: make them easily copyable/movable
31dc732a7 doc: graph.md
f0e02d6d3 doc: container.md
156d6e4ea doc: poly.md
4375c1c3d doc: lib.md
24a9cd67e scheduler: forgot to add the fwd file to the previous commit :)
ba8d522c1 doc: add the worst engine (love the name) to the list of links
3ae46214a doc: review process.md
5119fe8d7 scheduler: basic type model with default for common cases
ed0319cdd view: avoid shadow warnings
bc50da6a7 storage: suppress warnings with non copyable nor default constructible types
52b3b4c24 group: suppress warnings for unused variables in case of empty types
74bab529d test: minor changes
b1b143917 meta: [[maybe_unused]] variable to avoid warnings with corner cases
7beb4c85c test: suppress a few warnings (entity)
f3beb5670 test: suppress a few warnings (container)
446c67b69 test: suppress a few warnings (resource)
c4507bd17 test: suppress a few warnings (poly)
61e872bb4 test: suppress a few warnings (meta)
9f22a3e23 test: suppress a few warnings (memory)
653dd5cd4 test: suppress a few warnings (tuple)
bc53ed3be test: suppress a few warnings (flow)
f935bbcce dense_set: suppress warnings due to possible narrowing conversions
c7d505353 dense_map: suppress warnings due to possible narrowing conversions
ea78f1d97 now working on version 3.12
REVERT: fef921132 update single include file
REVERT: e52a93f8a ready to cut v3.11.1
REVERT: cd541f335 storage: * move storage_type[_t] and storage_for[_t] to fwd.hpp * no need to include storage.hpp when forward defining views
REVERT: 255b8be8c view: avoid shadow warnings
REVERT: 8cd7f064a storage: suppress warnings with non copyable nor default constructible types
REVERT: 58ae4117c group: suppress warnings for unused variables in case of empty types
REVERT: cfa1e805b meta: [[maybe_unused]] variable to avoid warnings with corner cases
REVERT: ccedacec8 dense_set: suppress warnings due to possible narrowing conversions
REVERT: 17578dc8c dense_map: suppress warnings due to possible narrowing conversions

git-subtree-dir: external/entt/entt
git-subtree-split: 344e03ac64a1f78424ab1150e2d4778e8df8431d
2023-10-02 15:30:10 +02:00

2360 lines
73 KiB
C++

#include <cstddef>
#include <functional>
#include <iterator>
#include <memory>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <utility>
#include <gtest/gtest.h>
#include <entt/core/hashed_string.hpp>
#include <entt/core/type_info.hpp>
#include <entt/entity/entity.hpp>
#include <entt/entity/registry.hpp>
#include "../common/config.h"
struct empty_type {};
struct no_eto_type {
static constexpr std::size_t page_size = 1024u;
};
bool operator==(const no_eto_type &lhs, const no_eto_type &rhs) {
return &lhs == &rhs;
}
struct stable_type {
static constexpr auto in_place_delete = true;
int value;
};
struct non_default_constructible {
non_default_constructible(int v)
: value{v} {}
int value;
};
struct aggregate {
int value{};
};
struct listener {
template<typename Type>
static void sort(entt::registry &registry) {
registry.sort<Type>([](auto lhs, auto rhs) { return lhs < rhs; });
}
void incr(const entt::registry &, entt::entity entity) {
last = entity;
++counter;
}
void decr(const entt::registry &, entt::entity entity) {
last = entity;
--counter;
}
entt::entity last{entt::null};
int counter{0};
};
struct owner {
void receive(const entt::registry &ref) {
parent = &ref;
}
const entt::registry *parent{nullptr};
};
struct destruction_order {
using ctx_check_type = int;
destruction_order(const entt::registry &ref, bool &ctx)
: registry{&ref},
ctx_check{&ctx} {
*ctx_check = (registry->ctx().find<ctx_check_type>() != nullptr);
}
~destruction_order() {
*ctx_check = *ctx_check && (registry->ctx().find<ctx_check_type>() != nullptr);
}
private:
const entt::registry *registry;
bool *ctx_check{};
};
enum class small_entity : std::uint32_t {};
struct small_entity_traits {
using value_type = small_entity;
using entity_type = uint32_t;
using version_type = uint16_t;
static constexpr entity_type entity_mask = 0xFF;
static constexpr entity_type version_mask = 0x00;
};
template<>
struct entt::entt_traits<small_entity>: entt::basic_entt_traits<small_entity_traits> {
using base_type = entt::basic_entt_traits<small_entity_traits>;
static constexpr auto page_size = ENTT_SPARSE_PAGE;
};
TEST(Registry, Context) {
entt::registry registry;
auto &ctx = registry.ctx();
const auto &cctx = std::as_const(registry).ctx();
ASSERT_FALSE(ctx.contains<char>());
ASSERT_FALSE(cctx.contains<const int>());
ASSERT_EQ(ctx.find<char>(), nullptr);
ASSERT_EQ(cctx.find<const int>(), nullptr);
ctx.emplace<char>();
ctx.emplace<int>();
ASSERT_TRUE(ctx.contains<char>());
ASSERT_TRUE(cctx.contains<int>());
ASSERT_NE(ctx.find<const char>(), nullptr);
ASSERT_NE(cctx.find<const int>(), nullptr);
ASSERT_FALSE(ctx.erase<double>());
ASSERT_TRUE(ctx.erase<int>());
ASSERT_TRUE(ctx.contains<const char>());
ASSERT_FALSE(cctx.contains<const int>());
ASSERT_NE(ctx.find<char>(), nullptr);
ASSERT_EQ(cctx.find<int>(), nullptr);
ASSERT_FALSE(ctx.erase<int>());
ASSERT_TRUE(ctx.erase<char>());
ctx.emplace<char>('c');
ctx.emplace<int>(42);
ASSERT_EQ(ctx.emplace<char>('a'), 'c');
ASSERT_EQ(ctx.find<const char>(), cctx.find<char>());
ASSERT_EQ(ctx.get<char>(), cctx.get<const char>());
ASSERT_EQ(ctx.get<char>(), 'c');
ASSERT_EQ(ctx.emplace<const int>(0), 42);
ASSERT_EQ(ctx.find<const int>(), cctx.find<int>());
ASSERT_EQ(ctx.get<int>(), cctx.get<const int>());
ASSERT_EQ(ctx.get<int>(), 42);
ASSERT_EQ(ctx.find<double>(), nullptr);
ASSERT_EQ(cctx.find<double>(), nullptr);
ASSERT_EQ(ctx.insert_or_assign<char>('a'), 'a');
ASSERT_EQ(ctx.find<const char>(), cctx.find<char>());
ASSERT_EQ(ctx.get<char>(), cctx.get<const char>());
ASSERT_EQ(ctx.get<const char>(), 'a');
ASSERT_EQ(ctx.insert_or_assign<const int>(0), 0);
ASSERT_EQ(ctx.find<const int>(), cctx.find<int>());
ASSERT_EQ(ctx.get<int>(), cctx.get<const int>());
ASSERT_EQ(ctx.get<int>(), 0);
}
TEST(Registry, ContextHint) {
using namespace entt::literals;
entt::registry registry;
auto &ctx = registry.ctx();
const auto &cctx = std::as_const(registry).ctx();
ctx.emplace<int>(42);
ctx.emplace_as<int>("other"_hs, 3);
ASSERT_TRUE(ctx.contains<int>());
ASSERT_TRUE(cctx.contains<const int>("other"_hs));
ASSERT_FALSE(ctx.contains<char>("other"_hs));
ASSERT_NE(cctx.find<const int>(), nullptr);
ASSERT_NE(ctx.find<int>("other"_hs), nullptr);
ASSERT_EQ(cctx.find<const char>("other"_hs), nullptr);
ASSERT_EQ(ctx.get<int>(), 42);
ASSERT_EQ(cctx.get<const int>("other"_hs), 3);
ctx.insert_or_assign(3);
ctx.insert_or_assign("other"_hs, 42);
ASSERT_EQ(ctx.get<const int>(), 3);
ASSERT_EQ(cctx.get<int>("other"_hs), 42);
ASSERT_FALSE(ctx.erase<char>("other"_hs));
ASSERT_TRUE(ctx.erase<int>());
ASSERT_TRUE(cctx.contains<int>("other"_hs));
ASSERT_EQ(ctx.get<int>("other"_hs), 42);
ASSERT_TRUE(ctx.erase<int>("other"_hs));
ASSERT_FALSE(cctx.contains<int>("other"_hs));
ASSERT_EQ(ctx.find<int>("other"_hs), nullptr);
}
TEST(Registry, ContextAsRef) {
entt::registry registry;
int value{3};
registry.ctx().emplace<int &>(value);
ASSERT_NE(registry.ctx().find<int>(), nullptr);
ASSERT_NE(registry.ctx().find<const int>(), nullptr);
ASSERT_NE(std::as_const(registry).ctx().find<const int>(), nullptr);
ASSERT_EQ(registry.ctx().get<const int>(), 3);
ASSERT_EQ(registry.ctx().get<int>(), 3);
registry.ctx().get<int>() = 42;
ASSERT_EQ(registry.ctx().get<int>(), 42);
ASSERT_EQ(value, 42);
value = 3;
ASSERT_EQ(std::as_const(registry).ctx().get<const int>(), 3);
}
TEST(Registry, ContextAsConstRef) {
entt::registry registry;
int value{3};
registry.ctx().emplace<const int &>(value);
ASSERT_EQ(registry.ctx().find<int>(), nullptr);
ASSERT_NE(registry.ctx().find<const int>(), nullptr);
ASSERT_NE(std::as_const(registry).ctx().find<const int>(), nullptr);
ASSERT_EQ(registry.ctx().get<const int>(), 3);
value = 42;
ASSERT_EQ(std::as_const(registry).ctx().get<const int>(), 42);
}
TEST(Registry, Functionalities) {
using traits_type = entt::entt_traits<entt::entity>;
entt::registry registry;
ASSERT_NO_FATAL_FAILURE([[maybe_unused]] auto alloc = registry.get_allocator());
ASSERT_EQ(registry.size(), 0u);
ASSERT_EQ(registry.alive(), 0u);
ASSERT_NO_FATAL_FAILURE(registry.reserve(42));
ASSERT_EQ(registry.capacity(), 42u);
ASSERT_TRUE(registry.empty());
ASSERT_EQ(registry.storage<int>().size(), 0u);
ASSERT_EQ(registry.storage<char>().size(), 0u);
ASSERT_TRUE(registry.storage<int>().empty());
ASSERT_TRUE(registry.storage<char>().empty());
const auto e0 = registry.create();
const auto e1 = registry.create();
registry.emplace<int>(e1);
registry.emplace<char>(e1);
ASSERT_TRUE(registry.all_of<>(e0));
ASSERT_FALSE(registry.any_of<>(e1));
ASSERT_EQ(registry.storage<int>().size(), 1u);
ASSERT_EQ(registry.storage<char>().size(), 1u);
ASSERT_FALSE(registry.storage<int>().empty());
ASSERT_FALSE(registry.storage<char>().empty());
ASSERT_NE(e0, e1);
ASSERT_FALSE((registry.all_of<int, const char>(e0)));
ASSERT_TRUE((registry.all_of<const int, char>(e1)));
ASSERT_FALSE((registry.any_of<int, const double>(e0)));
ASSERT_TRUE((registry.any_of<const int, double>(e1)));
ASSERT_EQ(registry.try_get<int>(e0), nullptr);
ASSERT_NE(registry.try_get<int>(e1), nullptr);
ASSERT_EQ(registry.try_get<char>(e0), nullptr);
ASSERT_NE(registry.try_get<char>(e1), nullptr);
ASSERT_EQ(registry.try_get<double>(e0), nullptr);
ASSERT_EQ(registry.try_get<double>(e1), nullptr);
ASSERT_EQ(registry.emplace<int>(e0, 42), 42);
ASSERT_EQ(registry.emplace<char>(e0, 'c'), 'c');
ASSERT_NO_FATAL_FAILURE(registry.erase<int>(e1));
ASSERT_NO_FATAL_FAILURE(registry.erase<char>(e1));
ASSERT_TRUE((registry.all_of<const int, char>(e0)));
ASSERT_FALSE((registry.all_of<int, const char>(e1)));
ASSERT_TRUE((registry.any_of<const int, double>(e0)));
ASSERT_FALSE((registry.any_of<int, const double>(e1)));
const auto e2 = registry.create();
registry.emplace_or_replace<int>(e2, registry.get<int>(e0));
registry.emplace_or_replace<char>(e2, registry.get<char>(e0));
ASSERT_TRUE((registry.all_of<int, char>(e2)));
ASSERT_EQ(registry.get<int>(e0), 42);
ASSERT_EQ(registry.get<char>(e0), 'c');
ASSERT_NE(registry.try_get<int>(e0), nullptr);
ASSERT_NE(registry.try_get<char>(e0), nullptr);
ASSERT_EQ(registry.try_get<double>(e0), nullptr);
ASSERT_EQ(*registry.try_get<int>(e0), 42);
ASSERT_EQ(*registry.try_get<char>(e0), 'c');
ASSERT_EQ(std::get<0>(registry.get<int, char>(e0)), 42);
ASSERT_EQ(*std::get<0>(registry.try_get<int, char, double>(e0)), 42);
ASSERT_EQ(std::get<1>(static_cast<const entt::registry &>(registry).get<int, char>(e0)), 'c');
ASSERT_EQ(*std::get<1>(static_cast<const entt::registry &>(registry).try_get<int, char, double>(e0)), 'c');
ASSERT_EQ(registry.get<int>(e0), registry.get<int>(e2));
ASSERT_EQ(registry.get<char>(e0), registry.get<char>(e2));
ASSERT_NE(&registry.get<int>(e0), &registry.get<int>(e2));
ASSERT_NE(&registry.get<char>(e0), &registry.get<char>(e2));
ASSERT_EQ(registry.patch<int>(e0, [](auto &instance) { instance = 2; }), 2);
ASSERT_EQ(registry.replace<int>(e0, 3), 3);
ASSERT_NO_FATAL_FAILURE(registry.emplace_or_replace<int>(e0, 1));
ASSERT_NO_FATAL_FAILURE(registry.emplace_or_replace<int>(e1, 1));
ASSERT_EQ(static_cast<const entt::registry &>(registry).get<int>(e0), 1);
ASSERT_EQ(static_cast<const entt::registry &>(registry).get<int>(e1), 1);
ASSERT_EQ(registry.size(), 3u);
ASSERT_EQ(registry.alive(), 3u);
ASSERT_FALSE(registry.empty());
ASSERT_EQ(traits_type::to_version(e2), 0u);
ASSERT_EQ(registry.current(e2), 0u);
ASSERT_NO_FATAL_FAILURE(registry.destroy(e2));
ASSERT_EQ(traits_type::to_version(e2), 0u);
ASSERT_EQ(registry.current(e2), 1u);
ASSERT_TRUE(registry.valid(e0));
ASSERT_TRUE(registry.valid(e1));
ASSERT_FALSE(registry.valid(e2));
ASSERT_EQ(registry.size(), 3u);
ASSERT_EQ(registry.alive(), 2u);
ASSERT_FALSE(registry.empty());
ASSERT_NO_FATAL_FAILURE(registry.clear());
ASSERT_EQ(registry.size(), 3u);
ASSERT_EQ(registry.alive(), 0u);
ASSERT_TRUE(registry.empty());
const auto e3 = registry.create();
ASSERT_EQ(registry.get_or_emplace<int>(e3, 3), 3);
ASSERT_EQ(registry.get_or_emplace<char>(e3, 'c'), 'c');
ASSERT_EQ(registry.storage<int>().size(), 1u);
ASSERT_EQ(registry.storage<char>().size(), 1u);
ASSERT_FALSE(registry.storage<int>().empty());
ASSERT_FALSE(registry.storage<char>().empty());
ASSERT_TRUE((registry.all_of<int, char>(e3)));
ASSERT_EQ(registry.get<int>(e3), 3);
ASSERT_EQ(registry.get<char>(e3), 'c');
ASSERT_NO_FATAL_FAILURE(registry.clear<int>());
ASSERT_EQ(registry.storage<int>().size(), 0u);
ASSERT_EQ(registry.storage<char>().size(), 1u);
ASSERT_TRUE(registry.storage<int>().empty());
ASSERT_FALSE(registry.storage<char>().empty());
ASSERT_NO_FATAL_FAILURE(registry.clear());
ASSERT_EQ(registry.storage<int>().size(), 0u);
ASSERT_EQ(registry.storage<char>().size(), 0u);
ASSERT_TRUE(registry.storage<int>().empty());
ASSERT_TRUE(registry.storage<char>().empty());
const auto e4 = registry.create();
const auto e5 = registry.create();
registry.emplace<int>(e4);
ASSERT_EQ(registry.remove<int>(e4), 1u);
ASSERT_EQ(registry.remove<int>(e5), 0u);
ASSERT_EQ(registry.storage<int>().size(), 0u);
ASSERT_EQ(registry.storage<char>().size(), 0u);
ASSERT_TRUE(registry.storage<int>().empty());
}
TEST(Registry, Constructors) {
entt::registry registry;
entt::registry other{42};
ASSERT_TRUE(registry.empty());
ASSERT_TRUE(other.empty());
ASSERT_EQ(registry.released(), 0u);
ASSERT_EQ(other.released(), 0u);
}
TEST(Registry, Move) {
entt::registry registry;
const auto entity = registry.create();
owner test{};
registry.on_construct<int>().connect<&owner::receive>(test);
registry.on_destroy<int>().connect<&owner::receive>(test);
ASSERT_EQ(test.parent, nullptr);
registry.emplace<int>(entity);
ASSERT_EQ(test.parent, &registry);
entt::registry other{std::move(registry)};
other.erase<int>(entity);
registry = {};
registry.emplace<int>(registry.create(entity));
ASSERT_EQ(test.parent, &other);
registry = std::move(other);
registry.emplace<int>(entity);
registry.emplace<int>(registry.create(entity));
ASSERT_EQ(test.parent, &registry);
}
TEST(Registry, Swap) {
entt::registry registry;
const auto entity = registry.create();
owner test{};
registry.on_construct<int>().connect<&owner::receive>(test);
registry.on_destroy<int>().connect<&owner::receive>(test);
ASSERT_EQ(test.parent, nullptr);
registry.emplace<int>(entity);
ASSERT_EQ(test.parent, &registry);
entt::registry other;
other.swap(registry);
other.erase<int>(entity);
registry = {};
registry.emplace<int>(registry.create(entity));
ASSERT_EQ(test.parent, &other);
registry.swap(other);
registry.emplace<int>(entity);
registry.emplace<int>(registry.create(entity));
ASSERT_EQ(test.parent, &registry);
}
TEST(Registry, ReplaceAggregate) {
entt::registry registry;
const auto entity = registry.create();
registry.emplace<aggregate>(entity, 0);
auto &instance = registry.replace<aggregate>(entity, 42);
ASSERT_EQ(instance.value, 42);
}
TEST(Registry, EmplaceOrReplaceAggregate) {
entt::registry registry;
const auto entity = registry.create();
auto &instance = registry.emplace_or_replace<aggregate>(entity, 42);
ASSERT_EQ(instance.value, 42);
}
TEST(Registry, Identifiers) {
using traits_type = entt::entt_traits<entt::entity>;
entt::registry registry;
const auto pre = registry.create();
ASSERT_EQ(traits_type::to_integral(pre), traits_type::to_entity(pre));
registry.release(pre);
const auto post = registry.create();
ASSERT_NE(pre, post);
ASSERT_EQ(traits_type::to_entity(pre), traits_type::to_entity(post));
ASSERT_NE(traits_type::to_version(pre), traits_type::to_version(post));
ASSERT_NE(traits_type::to_version(pre), registry.current(pre));
ASSERT_EQ(traits_type::to_version(post), registry.current(post));
const auto invalid = traits_type::combine(traits_type::to_entity(post) + 1u, {});
ASSERT_EQ(traits_type::to_version(invalid), typename traits_type::version_type{});
ASSERT_EQ(registry.current(invalid), traits_type::to_version(entt::tombstone));
}
TEST(Registry, Data) {
using traits_type = entt::entt_traits<entt::entity>;
entt::registry registry;
ASSERT_EQ(std::as_const(registry).data(), nullptr);
const auto entity = registry.create();
ASSERT_EQ(*std::as_const(registry).data(), entity);
const auto other = registry.create();
registry.release(entity);
ASSERT_EQ(*std::as_const(registry).data(), other);
ASSERT_EQ(*(std::as_const(registry).data() + 1u), traits_type::next(entity));
}
TEST(Registry, CreateManyEntitiesAtOnce) {
using traits_type = entt::entt_traits<entt::entity>;
entt::registry registry;
entt::entity entities[3];
const auto entity = registry.create();
registry.release(registry.create());
registry.release(entity);
registry.release(registry.create());
registry.create(std::begin(entities), std::end(entities));
ASSERT_TRUE(registry.valid(entities[0]));
ASSERT_TRUE(registry.valid(entities[1]));
ASSERT_TRUE(registry.valid(entities[2]));
ASSERT_EQ(traits_type::to_entity(entities[0]), 0u);
ASSERT_EQ(traits_type::to_version(entities[0]), 2u);
ASSERT_EQ(traits_type::to_entity(entities[1]), 1u);
ASSERT_EQ(traits_type::to_version(entities[1]), 1u);
ASSERT_EQ(traits_type::to_entity(entities[2]), 2u);
ASSERT_EQ(traits_type::to_version(entities[2]), 0u);
}
TEST(Registry, CreateManyEntitiesAtOnceWithListener) {
entt::registry registry;
entt::entity entities[3];
listener listener;
registry.on_construct<int>().connect<&listener::incr>(listener);
registry.create(std::begin(entities), std::end(entities));
registry.insert(std::begin(entities), std::end(entities), 42);
registry.insert(std::begin(entities), std::end(entities), 'c');
ASSERT_EQ(registry.get<int>(entities[0]), 42);
ASSERT_EQ(registry.get<char>(entities[1]), 'c');
ASSERT_EQ(listener.counter, 3);
registry.on_construct<int>().disconnect<&listener::incr>(listener);
registry.on_construct<empty_type>().connect<&listener::incr>(listener);
registry.create(std::begin(entities), std::end(entities));
registry.insert(std::begin(entities), std::end(entities), 'a');
registry.insert<empty_type>(std::begin(entities), std::end(entities));
ASSERT_TRUE(registry.all_of<empty_type>(entities[0]));
ASSERT_EQ(registry.get<char>(entities[2]), 'a');
ASSERT_EQ(listener.counter, 6);
}
TEST(Registry, CreateWithHint) {
using traits_type = entt::entt_traits<entt::entity>;
entt::registry registry;
auto e3 = registry.create(entt::entity{3});
auto e2 = registry.create(entt::entity{3});
ASSERT_EQ(e2, entt::entity{1});
ASSERT_FALSE(registry.valid(entt::entity{0}));
ASSERT_FALSE(registry.valid(entt::entity{2}));
ASSERT_EQ(e3, entt::entity{3});
registry.release(e2);
ASSERT_EQ(traits_type::to_version(e2), 0u);
ASSERT_EQ(registry.current(e2), 1u);
e2 = registry.create();
auto e1 = registry.create(entt::entity{2});
ASSERT_EQ(traits_type::to_entity(e2), 1u);
ASSERT_EQ(traits_type::to_version(e2), 1u);
ASSERT_EQ(traits_type::to_entity(e1), 2u);
ASSERT_EQ(traits_type::to_version(e1), 0u);
registry.release(e1);
registry.release(e2);
auto e0 = registry.create(entt::entity{0});
ASSERT_EQ(e0, entt::entity{0});
ASSERT_EQ(traits_type::to_version(e0), 0u);
}
TEST(Registry, CreateClearCycle) {
using traits_type = entt::entt_traits<entt::entity>;
entt::registry registry;
entt::entity pre{}, post{};
for(int i = 0; i < 10; ++i) {
const auto entity = registry.create();
registry.emplace<double>(entity);
}
registry.clear();
for(int i = 0; i < 7; ++i) {
const auto entity = registry.create();
registry.emplace<int>(entity);
if(i == 3) {
pre = entity;
}
}
registry.clear();
for(int i = 0; i < 5; ++i) {
const auto entity = registry.create();
if(i == 3) {
post = entity;
}
}
ASSERT_FALSE(registry.valid(pre));
ASSERT_TRUE(registry.valid(post));
ASSERT_NE(traits_type::to_version(pre), traits_type::to_version(post));
ASSERT_EQ(traits_type::to_version(pre) + 1, traits_type::to_version(post));
ASSERT_EQ(registry.current(pre), registry.current(post));
}
TEST(Registry, CreateDestroyReleaseCornerCase) {
entt::registry registry;
const auto e0 = registry.create();
const auto e1 = registry.create();
registry.destroy(e0);
registry.release(e1);
registry.each([](auto) { FAIL(); });
ASSERT_EQ(registry.current(e0), 1u);
ASSERT_EQ(registry.current(e1), 1u);
}
ENTT_DEBUG_TEST(RegistryDeathTest, CreateTooManyEntities) {
entt::basic_registry<small_entity> registry;
std::vector<small_entity> entities(entt::entt_traits<small_entity>::to_entity(entt::null));
registry.create(entities.begin(), entities.end());
ASSERT_DEATH([[maybe_unused]] const auto entity = registry.create(), "");
}
TEST(Registry, DestroyVersion) {
entt::registry registry;
const auto e0 = registry.create();
const auto e1 = registry.create();
ASSERT_EQ(registry.current(e0), 0u);
ASSERT_EQ(registry.current(e1), 0u);
registry.destroy(e0);
registry.destroy(e1, 3);
ASSERT_EQ(registry.current(e0), 1u);
ASSERT_EQ(registry.current(e1), 3u);
}
ENTT_DEBUG_TEST(RegistryDeathTest, DestroyVersion) {
entt::registry registry;
const auto entity = registry.create();
registry.destroy(entity);
ASSERT_DEATH(registry.destroy(entity), "");
ASSERT_DEATH(registry.destroy(entity, 3), "");
}
TEST(Registry, DestroyRange) {
entt::registry registry;
const auto iview = registry.view<int>();
const auto icview = registry.view<int, char>();
entt::entity entities[3u];
registry.create(std::begin(entities), std::end(entities));
registry.emplace<int>(entities[0u]);
registry.emplace<char>(entities[0u]);
registry.emplace<double>(entities[0u]);
registry.emplace<int>(entities[1u]);
registry.emplace<char>(entities[1u]);
registry.emplace<int>(entities[2u]);
ASSERT_TRUE(registry.valid(entities[0u]));
ASSERT_TRUE(registry.valid(entities[1u]));
ASSERT_TRUE(registry.valid(entities[2u]));
registry.destroy(icview.begin(), icview.end());
ASSERT_FALSE(registry.valid(entities[0u]));
ASSERT_FALSE(registry.valid(entities[1u]));
ASSERT_TRUE(registry.valid(entities[2u]));
ASSERT_EQ(registry.storage<int>().size(), 1u);
ASSERT_EQ(registry.storage<char>().size(), 0u);
ASSERT_EQ(registry.storage<double>().size(), 0u);
registry.destroy(iview.begin(), iview.end());
ASSERT_FALSE(registry.valid(entities[2u]));
ASSERT_NO_FATAL_FAILURE(registry.destroy(iview.rbegin(), iview.rend()));
ASSERT_EQ(iview.size(), 0u);
ASSERT_EQ(icview.size_hint(), 0u);
ASSERT_EQ(registry.storage<int>().size(), 0u);
ASSERT_EQ(registry.storage<char>().size(), 0u);
ASSERT_EQ(registry.storage<double>().size(), 0u);
registry.create(std::begin(entities), std::end(entities));
registry.insert<int>(std::begin(entities), std::end(entities));
ASSERT_TRUE(registry.valid(entities[0u]));
ASSERT_TRUE(registry.valid(entities[1u]));
ASSERT_TRUE(registry.valid(entities[2u]));
ASSERT_EQ(registry.storage<int>().size(), 3u);
registry.destroy(std::begin(entities), std::end(entities));
ASSERT_FALSE(registry.valid(entities[0u]));
ASSERT_FALSE(registry.valid(entities[1u]));
ASSERT_FALSE(registry.valid(entities[2u]));
ASSERT_EQ(registry.storage<int>().size(), 0u);
entt::sparse_set managed{};
registry.create(std::begin(entities), std::end(entities));
managed.push(std::begin(entities), std::end(entities));
registry.insert<int>(managed.begin(), managed.end());
ASSERT_TRUE(registry.valid(managed[0u]));
ASSERT_TRUE(registry.valid(managed[1u]));
ASSERT_TRUE(registry.valid(managed[2u]));
ASSERT_EQ(registry.storage<int>().size(), 3u);
registry.destroy(managed.begin(), managed.end());
ASSERT_FALSE(registry.valid(managed[0u]));
ASSERT_FALSE(registry.valid(managed[1u]));
ASSERT_FALSE(registry.valid(managed[2u]));
ASSERT_EQ(registry.storage<int>().size(), 0u);
}
TEST(Registry, StableDestroy) {
entt::registry registry;
const auto iview = registry.view<int>();
const auto icview = registry.view<int, stable_type>();
entt::entity entities[3u];
registry.create(std::begin(entities), std::end(entities));
registry.emplace<int>(entities[0u]);
registry.emplace<stable_type>(entities[0u]);
registry.emplace<double>(entities[0u]);
registry.emplace<int>(entities[1u]);
registry.emplace<stable_type>(entities[1u]);
registry.emplace<int>(entities[2u]);
ASSERT_TRUE(registry.valid(entities[0u]));
ASSERT_TRUE(registry.valid(entities[1u]));
ASSERT_TRUE(registry.valid(entities[2u]));
registry.destroy(icview.begin(), icview.end());
ASSERT_FALSE(registry.valid(entities[0u]));
ASSERT_FALSE(registry.valid(entities[1u]));
ASSERT_TRUE(registry.valid(entities[2u]));
ASSERT_EQ(registry.storage<int>().size(), 1u);
ASSERT_EQ(registry.storage<stable_type>().size(), 2u);
ASSERT_EQ(registry.storage<double>().size(), 0u);
registry.destroy(iview.begin(), iview.end());
ASSERT_FALSE(registry.valid(entities[2u]));
ASSERT_EQ(iview.size(), 0u);
ASSERT_EQ(icview.size_hint(), 0u);
ASSERT_EQ(registry.storage<int>().size(), 0u);
ASSERT_EQ(registry.storage<stable_type>().size(), 2u);
ASSERT_EQ(registry.storage<double>().size(), 0u);
}
TEST(Registry, ReleaseVersion) {
entt::registry registry;
entt::entity entities[2u];
registry.create(std::begin(entities), std::end(entities));
ASSERT_EQ(registry.current(entities[0u]), 0u);
ASSERT_EQ(registry.current(entities[1u]), 0u);
registry.release(entities[0u]);
registry.release(entities[1u], 3);
ASSERT_EQ(registry.current(entities[0u]), 1u);
ASSERT_EQ(registry.current(entities[1u]), 3u);
}
ENTT_DEBUG_TEST(RegistryDeathTest, ReleaseVersion) {
entt::registry registry;
entt::entity entity = registry.create();
registry.release(entity);
ASSERT_DEATH(registry.release(entity), "");
ASSERT_DEATH(registry.release(entity, 3), "");
}
TEST(Registry, ReleaseRange) {
entt::registry registry;
entt::entity entities[3u];
registry.create(std::begin(entities), std::end(entities));
ASSERT_TRUE(registry.valid(entities[0u]));
ASSERT_TRUE(registry.valid(entities[1u]));
ASSERT_TRUE(registry.valid(entities[2u]));
registry.release(std::begin(entities), std::end(entities) - 1u);
ASSERT_FALSE(registry.valid(entities[0u]));
ASSERT_FALSE(registry.valid(entities[1u]));
ASSERT_TRUE(registry.valid(entities[2u]));
registry.release(std::end(entities) - 1u, std::end(entities));
ASSERT_FALSE(registry.valid(entities[2u]));
}
TEST(Registry, VersionOverflow) {
using traits_type = entt::entt_traits<entt::entity>;
entt::registry registry;
const auto entity = registry.create();
registry.release(entity);
ASSERT_NE(registry.current(entity), traits_type::to_version(entity));
ASSERT_NE(registry.current(entity), typename traits_type::version_type{});
registry.release(registry.create(), traits_type::to_version(entt::tombstone) - 1u);
registry.release(registry.create());
ASSERT_EQ(registry.current(entity), traits_type::to_version(entity));
ASSERT_EQ(registry.current(entity), typename traits_type::version_type{});
}
TEST(Registry, NullEntity) {
entt::registry registry;
const entt::entity entity = entt::null;
ASSERT_FALSE(registry.valid(entity));
ASSERT_NE(registry.create(entity), entity);
}
TEST(Registry, TombstoneVersion) {
using traits_type = entt::entt_traits<entt::entity>;
entt::registry registry;
const entt::entity entity = entt::tombstone;
ASSERT_FALSE(registry.valid(entity));
const auto other = registry.create();
const auto vers = traits_type::to_version(entity);
const auto required = traits_type::construct(traits_type::to_entity(other), vers);
ASSERT_NE(registry.release(other, vers), vers);
ASSERT_NE(registry.create(required), required);
}
TEST(Registry, Each) {
entt::registry registry;
entt::registry::size_type tot;
entt::registry::size_type match;
static_cast<void>(registry.create());
registry.emplace<int>(registry.create());
static_cast<void>(registry.create());
registry.emplace<int>(registry.create());
static_cast<void>(registry.create());
tot = 0u;
match = 0u;
registry.each([&](auto entity) {
match += registry.all_of<int>(entity);
static_cast<void>(registry.create());
++tot;
});
ASSERT_EQ(tot, 5u);
ASSERT_EQ(match, 2u);
tot = 0u;
match = 0u;
registry.each([&](auto entity) {
if(registry.all_of<int>(entity)) {
registry.destroy(entity);
++match;
}
++tot;
});
ASSERT_EQ(tot, 10u);
ASSERT_EQ(match, 2u);
tot = 0u;
match = 0u;
registry.each([&](auto entity) {
match += registry.all_of<int>(entity);
registry.destroy(entity);
++tot;
});
ASSERT_EQ(tot, 8u);
ASSERT_EQ(match, 0u);
registry.each([&](auto) { FAIL(); });
}
TEST(Registry, Orphans) {
entt::registry registry;
entt::entity entities[3u]{};
registry.create(std::begin(entities), std::end(entities));
registry.emplace<int>(entities[0u]);
registry.emplace<int>(entities[2u]);
registry.each([&](const auto entt) {
ASSERT_TRUE(entt != entities[1u] || registry.orphan(entt));
});
registry.erase<int>(entities[0u]);
registry.erase<int>(entities[2u]);
registry.each([&](const auto entt) {
ASSERT_TRUE(registry.orphan(entt));
});
}
TEST(Registry, View) {
entt::registry registry;
entt::entity entities[3u];
auto iview = registry.view<int>();
auto cview = registry.view<char>();
auto mview = registry.view<int, char>();
auto fview = registry.view<int>(entt::exclude<char>);
registry.create(std::begin(entities), std::end(entities));
registry.emplace<int>(entities[0u], 0);
registry.emplace<char>(entities[0u], 'c');
registry.emplace<int>(entities[1u], 0);
registry.emplace<int>(entities[2u], 0);
registry.emplace<char>(entities[2u], 'c');
ASSERT_EQ(iview.size(), 3u);
ASSERT_EQ(cview.size(), 2u);
ASSERT_EQ(mview.size_hint(), 3u);
ASSERT_EQ(fview.size_hint(), 3u);
mview.refresh();
fview.refresh();
ASSERT_EQ(mview.size_hint(), 2u);
ASSERT_EQ(fview.size_hint(), 3u);
ASSERT_NE(mview.begin(), mview.end());
ASSERT_NE(fview.begin(), fview.end());
ASSERT_EQ(std::distance(mview.begin(), mview.end()), 2);
ASSERT_EQ(std::distance(fview.begin(), fview.end()), 1);
mview.each([&entities, first = true](auto entity, auto &&...) mutable {
ASSERT_EQ(entity, entities[2u * first]);
first = false;
});
fview.each([&entities](auto entity, auto &&...) {
ASSERT_EQ(entity, entities[1u]);
});
}
TEST(Registry, ExcludeOnlyView) {
entt::registry registry;
entt::entity entities[4u];
auto view = registry.view<entt::entity>(entt::exclude<int>);
registry.create(std::begin(entities), std::end(entities));
registry.emplace<int>(entities[0u], 0);
registry.emplace<int>(entities[2u], 0);
registry.emplace<int>(entities[3u], 0);
registry.destroy(entities[3u]);
ASSERT_EQ(view.size_hint(), 4u);
ASSERT_NE(view.begin(), view.end());
// returns all matching identifiers, both in-use and available ones
ASSERT_EQ(std::distance(view.begin(), view.end()), 2);
// skips available identifiers automatically, only returns in-use elements
view.each([&entities](auto entity, auto &&...) {
ASSERT_EQ(entity, entities[1u]);
});
}
TEST(Registry, NonOwningGroupInitOnFirstUse) {
entt::registry registry;
entt::entity entities[3u];
registry.create(std::begin(entities), std::end(entities));
registry.insert<int>(std::begin(entities), std::end(entities), 0);
registry.emplace<char>(entities[0u], 'c');
registry.emplace<char>(entities[2u], 'c');
std::size_t cnt{};
auto group = registry.group(entt::get<int, char>);
group.each([&cnt](auto...) { ++cnt; });
ASSERT_FALSE((registry.owned<int, char>()));
ASSERT_EQ(cnt, 2u);
}
TEST(Registry, NonOwningGroupInitOnEmplace) {
entt::registry registry;
entt::entity entities[3u];
auto group = registry.group(entt::get<int, char>);
registry.create(std::begin(entities), std::end(entities));
registry.insert<int>(std::begin(entities), std::end(entities), 0);
registry.emplace<char>(entities[0u], 'c');
registry.emplace<char>(entities[2u], 'c');
std::size_t cnt{};
group.each([&cnt](auto...) { ++cnt; });
ASSERT_FALSE((registry.owned<int, char>()));
ASSERT_EQ(cnt, 2u);
}
TEST(Registry, FullOwningGroupInitOnFirstUse) {
entt::registry registry;
entt::entity entities[3u];
registry.create(std::begin(entities), std::end(entities));
registry.insert<int>(std::begin(entities), std::end(entities), 0);
registry.emplace<char>(entities[0u], 'c');
registry.emplace<char>(entities[2u], 'c');
std::size_t cnt{};
auto group = registry.group<int, char>();
group.each([&cnt](auto...) { ++cnt; });
ASSERT_TRUE(registry.owned<int>());
ASSERT_TRUE(registry.owned<char>());
ASSERT_FALSE(registry.owned<double>());
ASSERT_EQ(cnt, 2u);
}
TEST(Registry, FullOwningGroupInitOnEmplace) {
entt::registry registry;
entt::entity entities[3u];
auto group = registry.group<int, char>();
registry.create(std::begin(entities), std::end(entities));
registry.insert<int>(std::begin(entities), std::end(entities), 0);
registry.emplace<char>(entities[0u], 'c');
registry.emplace<char>(entities[2u], 'c');
std::size_t cnt{};
group.each([&cnt](auto...) { ++cnt; });
ASSERT_TRUE(registry.owned<int>());
ASSERT_TRUE(registry.owned<char>());
ASSERT_FALSE(registry.owned<double>());
ASSERT_EQ(cnt, 2u);
}
TEST(Registry, PartialOwningGroupInitOnFirstUse) {
entt::registry registry;
entt::entity entities[3u];
registry.create(std::begin(entities), std::end(entities));
registry.insert<int>(std::begin(entities), std::end(entities), 0);
registry.emplace<char>(entities[0u], 'c');
registry.emplace<char>(entities[2u], 'c');
std::size_t cnt{};
auto group = registry.group<int>(entt::get<char>);
group.each([&cnt](auto...) { ++cnt; });
ASSERT_TRUE((registry.owned<int, char>()));
ASSERT_TRUE(registry.owned<int>());
ASSERT_FALSE(registry.owned<char>());
ASSERT_EQ(cnt, 2u);
}
TEST(Registry, PartialOwningGroupInitOnEmplace) {
entt::registry registry;
entt::entity entities[3u];
auto group = registry.group<int>(entt::get<char>);
registry.create(std::begin(entities), std::end(entities));
registry.insert<int>(std::begin(entities), std::end(entities), 0);
registry.emplace<char>(entities[0u], 'c');
registry.emplace<char>(entities[2u], 'c');
std::size_t cnt{};
group.each([&cnt](auto...) { ++cnt; });
ASSERT_TRUE((registry.owned<int, char>()));
ASSERT_TRUE(registry.owned<int>());
ASSERT_FALSE(registry.owned<char>());
ASSERT_EQ(cnt, 2u);
}
TEST(Registry, CleanViewAfterRemoveAndClear) {
entt::registry registry;
auto view = registry.view<int, char>();
const auto entity = registry.create();
registry.emplace<int>(entity);
registry.emplace<char>(entity);
ASSERT_EQ(view.size_hint(), 1u);
registry.erase<char>(entity);
ASSERT_EQ(view.size_hint(), 1u);
registry.emplace<char>(entity);
ASSERT_EQ(view.size_hint(), 1u);
registry.clear<int>();
ASSERT_EQ(view.size_hint(), 0u);
registry.emplace<int>(entity);
ASSERT_EQ(view.size_hint(), 1u);
registry.clear();
ASSERT_EQ(view.size_hint(), 0u);
}
TEST(Registry, CleanNonOwningGroupViewAfterRemoveAndClear) {
entt::registry registry;
auto group = registry.group(entt::get<int, char>);
const auto entity = registry.create();
registry.emplace<int>(entity, 0);
registry.emplace<char>(entity, 'c');
ASSERT_EQ(group.size(), 1u);
registry.erase<char>(entity);
ASSERT_EQ(group.size(), 0u);
registry.emplace<char>(entity, 'c');
ASSERT_EQ(group.size(), 1u);
registry.clear<int>();
ASSERT_EQ(group.size(), 0u);
registry.emplace<int>(entity, 0);
ASSERT_EQ(group.size(), 1u);
registry.clear();
ASSERT_EQ(group.size(), 0u);
}
TEST(Registry, CleanFullOwningGroupViewAfterRemoveAndClear) {
entt::registry registry;
auto group = registry.group<int, char>();
const auto entity = registry.create();
registry.emplace<int>(entity, 0);
registry.emplace<char>(entity, 'c');
ASSERT_EQ(group.size(), 1u);
registry.erase<char>(entity);
ASSERT_EQ(group.size(), 0u);
registry.emplace<char>(entity, 'c');
ASSERT_EQ(group.size(), 1u);
registry.clear<int>();
ASSERT_EQ(group.size(), 0u);
registry.emplace<int>(entity, 0);
ASSERT_EQ(group.size(), 1u);
registry.clear();
ASSERT_EQ(group.size(), 0u);
}
TEST(Registry, CleanPartialOwningGroupViewAfterRemoveAndClear) {
entt::registry registry;
auto group = registry.group<int>(entt::get<char>);
const auto entity = registry.create();
registry.emplace<int>(entity, 0);
registry.emplace<char>(entity, 'c');
ASSERT_EQ(group.size(), 1u);
registry.erase<char>(entity);
ASSERT_EQ(group.size(), 0u);
registry.emplace<char>(entity, 'c');
ASSERT_EQ(group.size(), 1u);
registry.clear<int>();
ASSERT_EQ(group.size(), 0u);
registry.emplace<int>(entity, 0);
ASSERT_EQ(group.size(), 1u);
registry.clear();
ASSERT_EQ(group.size(), 0u);
}
ENTT_DEBUG_TEST(RegistryDeathTest, NestedGroups) {
entt::registry registry;
registry.group<int, double>(entt::get<char>);
ASSERT_DEATH(registry.group<int>(entt::get<char>), "");
ASSERT_DEATH(registry.group<int>(entt::get<char, double>), "");
ASSERT_DEATH(registry.group<int>(entt::get<char>, entt::exclude<double>), "");
ASSERT_DEATH((registry.group<int, double>()), "");
}
ENTT_DEBUG_TEST(RegistryDeathTest, ConflictingGroups) {
entt::registry registry;
registry.group<char>(entt::get<int>, entt::exclude<double>);
ASSERT_DEATH(registry.group<char>(entt::get<float>, entt::exclude<double>), "");
}
TEST(Registry, SortSingle) {
entt::registry registry;
int val = 0;
registry.emplace<int>(registry.create(), val++);
registry.emplace<int>(registry.create(), val++);
registry.emplace<int>(registry.create(), val++);
for(auto entity: registry.view<int>()) {
ASSERT_EQ(registry.get<int>(entity), --val);
}
registry.sort<int>(std::less<int>{});
for(auto entity: registry.view<int>()) {
ASSERT_EQ(registry.get<int>(entity), val++);
}
}
TEST(Registry, SortMulti) {
entt::registry registry;
unsigned int uval = 0u;
int ival = 0;
for(auto i = 0; i < 3; ++i) {
const auto entity = registry.create();
registry.emplace<unsigned int>(entity, uval++);
registry.emplace<int>(entity, ival++);
}
for(auto entity: registry.view<unsigned int>()) {
ASSERT_EQ(registry.get<unsigned int>(entity), --uval);
}
for(auto entity: registry.view<int>()) {
ASSERT_EQ(registry.get<int>(entity), --ival);
}
registry.sort<unsigned int>(std::less<unsigned int>{});
registry.sort<int, unsigned int>();
for(auto entity: registry.view<unsigned int>()) {
ASSERT_EQ(registry.get<unsigned int>(entity), uval++);
}
for(auto entity: registry.view<int>()) {
ASSERT_EQ(registry.get<int>(entity), ival++);
}
}
TEST(Registry, SortEmpty) {
entt::registry registry;
registry.emplace<empty_type>(registry.create());
registry.emplace<empty_type>(registry.create());
registry.emplace<empty_type>(registry.create());
ASSERT_LT(registry.storage<empty_type>().data()[0], registry.storage<empty_type>().data()[1]);
ASSERT_LT(registry.storage<empty_type>().data()[1], registry.storage<empty_type>().data()[2]);
registry.sort<empty_type>(std::less<entt::entity>{});
ASSERT_GT(registry.storage<empty_type>().data()[0], registry.storage<empty_type>().data()[1]);
ASSERT_GT(registry.storage<empty_type>().data()[1], registry.storage<empty_type>().data()[2]);
}
TEST(Registry, ComponentsWithTypesFromStandardTemplateLibrary) {
// see #37 - the test shouldn't crash, that's all
entt::registry registry;
const auto entity = registry.create();
registry.emplace<std::unordered_set<int>>(entity).insert(42);
registry.destroy(entity);
}
TEST(Registry, ConstructWithComponents) {
// it should compile, that's all
entt::registry registry;
const auto value = 0;
registry.emplace<int>(registry.create(), value);
}
TEST(Registry, Signals) {
entt::registry registry;
entt::entity entities[2u];
listener listener;
registry.on_construct<empty_type>().connect<&listener::incr>(listener);
registry.on_destroy<empty_type>().connect<&listener::decr>(listener);
registry.on_construct<int>().connect<&listener::incr>(listener);
registry.on_destroy<int>().connect<&listener::decr>(listener);
registry.create(std::begin(entities), std::end(entities));
registry.insert<empty_type>(std::begin(entities), std::end(entities));
ASSERT_EQ(listener.counter, 2);
ASSERT_EQ(listener.last, entities[1u]);
registry.insert<int>(std::rbegin(entities), std::rend(entities));
ASSERT_EQ(listener.counter, 4);
ASSERT_EQ(listener.last, entities[0u]);
registry.erase<empty_type, int>(entities[0u]);
ASSERT_EQ(listener.counter, 2);
ASSERT_EQ(listener.last, entities[0u]);
registry.on_destroy<empty_type>().disconnect<&listener::decr>(listener);
registry.on_destroy<int>().disconnect<&listener::decr>(listener);
registry.erase<empty_type, int>(entities[1u]);
ASSERT_EQ(listener.counter, 2);
ASSERT_EQ(listener.last, entities[0u]);
registry.on_construct<empty_type>().disconnect<&listener::incr>(listener);
registry.on_construct<int>().disconnect<&listener::incr>(listener);
registry.emplace<empty_type>(entities[1u]);
registry.emplace<int>(entities[1u]);
ASSERT_EQ(listener.counter, 2);
ASSERT_EQ(listener.last, entities[0u]);
registry.on_construct<int>().connect<&listener::incr>(listener);
registry.on_destroy<int>().connect<&listener::decr>(listener);
registry.emplace<int>(entities[0u]);
registry.erase<int>(entities[1u]);
ASSERT_EQ(listener.counter, 2);
ASSERT_EQ(listener.last, entities[1u]);
registry.on_construct<empty_type>().connect<&listener::incr>(listener);
registry.on_destroy<empty_type>().connect<&listener::decr>(listener);
registry.erase<empty_type>(entities[1u]);
registry.emplace<empty_type>(entities[0u]);
ASSERT_EQ(listener.counter, 2);
ASSERT_EQ(listener.last, entities[0u]);
registry.clear<empty_type, int>();
ASSERT_EQ(listener.counter, 0);
ASSERT_EQ(listener.last, entities[0u]);
registry.insert<empty_type>(std::begin(entities), std::end(entities));
registry.insert<int>(std::begin(entities), std::end(entities));
registry.destroy(entities[1u]);
ASSERT_EQ(listener.counter, 2);
ASSERT_EQ(listener.last, entities[1u]);
registry.erase<int, empty_type>(entities[0u]);
registry.emplace_or_replace<int>(entities[0u]);
registry.emplace_or_replace<empty_type>(entities[0u]);
ASSERT_EQ(listener.counter, 2);
ASSERT_EQ(listener.last, entities[0u]);
registry.on_destroy<empty_type>().disconnect<&listener::decr>(listener);
registry.on_destroy<int>().disconnect<&listener::decr>(listener);
registry.emplace_or_replace<empty_type>(entities[0u]);
registry.emplace_or_replace<int>(entities[0u]);
ASSERT_EQ(listener.counter, 2);
ASSERT_EQ(listener.last, entities[0u]);
registry.on_update<empty_type>().connect<&listener::incr>(listener);
registry.on_update<int>().connect<&listener::incr>(listener);
registry.emplace_or_replace<empty_type>(entities[0u]);
registry.emplace_or_replace<int>(entities[0u]);
ASSERT_EQ(listener.counter, 4);
ASSERT_EQ(listener.last, entities[0u]);
registry.replace<empty_type>(entities[0u]);
registry.replace<int>(entities[0u]);
ASSERT_EQ(listener.counter, 6);
ASSERT_EQ(listener.last, entities[0u]);
}
TEST(Registry, SignalsOnRuntimePool) {
using namespace entt::literals;
entt::registry registry;
const auto entity = registry.create();
listener listener;
registry.on_construct<int>("custom"_hs).connect<&listener::incr>(listener);
registry.on_update<int>("custom"_hs).connect<&listener::incr>(listener);
registry.on_destroy<int>("custom"_hs).connect<&listener::incr>(listener);
ASSERT_EQ(listener.counter, 0);
registry.emplace<int>(entity);
registry.patch<int>(entity);
registry.erase<int>(entity);
ASSERT_EQ(listener.counter, 0);
registry.storage<int>("custom"_hs).emplace(entity);
registry.storage<int>("custom"_hs).patch(entity);
registry.storage<int>("custom"_hs).erase(entity);
ASSERT_EQ(listener.counter, 3);
}
TEST(Registry, SignalsOnEntity) {
entt::registry registry;
listener listener;
registry.on_construct<entt::entity>().connect<&listener::incr>(listener);
entt::entity entity = registry.create();
entt::entity other = registry.create();
ASSERT_EQ(listener.counter, 2);
ASSERT_EQ(listener.last, other);
registry.destroy(other);
registry.destroy(entity);
ASSERT_EQ(listener.counter, 2);
ASSERT_EQ(listener.last, other);
registry.on_construct<entt::entity>().disconnect(&listener);
other = registry.create();
entity = registry.create();
ASSERT_EQ(listener.counter, 2);
ASSERT_NE(listener.last, entity);
ASSERT_NE(listener.last, other);
registry.on_update<entt::entity>().connect<&listener::decr>(listener);
registry.patch<entt::entity>(entity);
ASSERT_EQ(listener.counter, 1);
ASSERT_EQ(listener.last, entity);
registry.on_update<entt::entity>().disconnect(&listener);
registry.patch<entt::entity>(other);
ASSERT_EQ(listener.counter, 1);
ASSERT_NE(listener.last, other);
registry.on_destroy<entt::entity>().connect<&listener::decr>(listener);
registry.destroy(entity);
ASSERT_EQ(listener.counter, 0);
ASSERT_EQ(listener.last, entity);
registry.on_destroy<entt::entity>().disconnect(&listener);
registry.destroy(other);
ASSERT_EQ(listener.counter, 0);
ASSERT_NE(listener.last, other);
}
TEST(Registry, SignalWhenDestroying) {
entt::registry registry;
const auto entity = registry.create();
registry.on_destroy<double>().connect<&entt::registry::remove<char>>();
registry.emplace<double>(entity);
registry.emplace<int>(entity);
ASSERT_NE(registry.storage(entt::type_id<double>().hash()), nullptr);
ASSERT_NE(registry.storage(entt::type_id<int>().hash()), nullptr);
ASSERT_EQ(registry.storage(entt::type_id<char>().hash()), nullptr);
ASSERT_TRUE(registry.valid(entity));
registry.destroy(entity);
ASSERT_NE(registry.storage(entt::type_id<char>().hash()), nullptr);
ASSERT_FALSE(registry.valid(entity));
}
TEST(Registry, Insert) {
entt::registry registry;
entt::entity entities[3u];
registry.create(std::begin(entities), std::end(entities));
registry.emplace<int>(entities[0u]);
registry.emplace<char>(entities[0u]);
registry.emplace<double>(entities[0u]);
registry.emplace<int>(entities[1u]);
registry.emplace<char>(entities[1u]);
registry.emplace<int>(entities[2u]);
ASSERT_FALSE(registry.all_of<float>(entities[0u]));
ASSERT_FALSE(registry.all_of<float>(entities[1u]));
ASSERT_FALSE(registry.all_of<float>(entities[2u]));
const auto icview = registry.view<int, char>();
registry.insert(icview.begin(), icview.end(), 3.f);
ASSERT_EQ(registry.get<float>(entities[0u]), 3.f);
ASSERT_EQ(registry.get<float>(entities[1u]), 3.f);
ASSERT_FALSE(registry.all_of<float>(entities[2u]));
registry.clear<float>();
float value[3]{0.f, 1.f, 2.f};
const auto iview = registry.view<int>();
registry.insert<float>(iview.rbegin(), iview.rend(), value);
ASSERT_EQ(registry.get<float>(entities[0u]), 0.f);
ASSERT_EQ(registry.get<float>(entities[1u]), 1.f);
ASSERT_EQ(registry.get<float>(entities[2u]), 2.f);
}
TEST(Registry, Erase) {
entt::registry registry;
const auto iview = registry.view<int>();
const auto icview = registry.view<int, char>();
entt::entity entities[3u];
registry.create(std::begin(entities), std::end(entities));
registry.emplace<int>(entities[0u]);
registry.emplace<char>(entities[0u]);
registry.emplace<double>(entities[0u]);
registry.emplace<int>(entities[1u]);
registry.emplace<char>(entities[1u]);
registry.emplace<int>(entities[2u]);
ASSERT_TRUE(registry.any_of<int>(entities[0u]));
ASSERT_TRUE(registry.all_of<int>(entities[1u]));
ASSERT_TRUE(registry.any_of<int>(entities[2u]));
registry.erase<int, char>(entities[0u]);
registry.erase<int, char>(icview.begin(), icview.end());
ASSERT_FALSE(registry.any_of<int>(entities[0u]));
ASSERT_FALSE(registry.all_of<int>(entities[1u]));
ASSERT_TRUE(registry.any_of<int>(entities[2u]));
ASSERT_EQ(registry.storage<int>().size(), 1u);
ASSERT_EQ(registry.storage<char>().size(), 0u);
ASSERT_EQ(registry.storage<double>().size(), 1u);
registry.erase<int>(iview.begin(), iview.end());
ASSERT_FALSE(registry.any_of<int>(entities[2u]));
ASSERT_NO_FATAL_FAILURE(registry.erase<int>(iview.rbegin(), iview.rend()));
ASSERT_EQ(registry.storage<int>().size(), 0u);
ASSERT_EQ(registry.storage<char>().size(), 0u);
ASSERT_EQ(registry.storage<double>().size(), 1u);
registry.insert<int>(std::begin(entities) + 1, std::end(entities) - 1u);
registry.insert<char>(std::begin(entities) + 1, std::end(entities) - 1u);
ASSERT_EQ(registry.storage<int>().size(), 1u);
ASSERT_EQ(registry.storage<char>().size(), 1u);
registry.erase<int, char>(iview.begin(), iview.end());
ASSERT_EQ(registry.storage<int>().size(), 0u);
ASSERT_EQ(registry.storage<char>().size(), 0u);
registry.insert<int>(std::begin(entities), std::end(entities));
registry.insert<char>(std::begin(entities), std::end(entities));
ASSERT_EQ(registry.storage<int>().size(), 3u);
ASSERT_EQ(registry.storage<char>().size(), 3u);
registry.erase<int, char>(std::begin(entities), std::end(entities));
ASSERT_EQ(registry.storage<int>().size(), 0u);
ASSERT_EQ(registry.storage<char>().size(), 0u);
ASSERT_FALSE(registry.orphan(entities[0u]));
ASSERT_TRUE(registry.orphan(entities[1u]));
ASSERT_TRUE(registry.orphan(entities[2u]));
}
ENTT_DEBUG_TEST(RegistryDeathTest, Erase) {
entt::registry registry;
const entt::entity entities[1u]{registry.create()};
ASSERT_FALSE((registry.any_of<int>(entities[0u])));
ASSERT_DEATH((registry.erase<int>(std::begin(entities), std::end(entities))), "");
ASSERT_DEATH(registry.erase<int>(entities[0u]), "");
}
TEST(Registry, StableErase) {
entt::registry registry;
const auto iview = registry.view<int>();
const auto icview = registry.view<int, stable_type>();
entt::entity entities[3u];
registry.create(std::begin(entities), std::end(entities));
registry.emplace<int>(entities[0u]);
registry.emplace<stable_type>(entities[0u]);
registry.emplace<double>(entities[0u]);
registry.emplace<int>(entities[1u]);
registry.emplace<stable_type>(entities[1u]);
registry.emplace<int>(entities[2u]);
ASSERT_TRUE(registry.any_of<int>(entities[0u]));
ASSERT_TRUE(registry.all_of<int>(entities[1u]));
ASSERT_TRUE(registry.any_of<int>(entities[2u]));
registry.erase<int, stable_type>(entities[0u]);
registry.erase<int, stable_type>(icview.begin(), icview.end());
registry.erase<int, stable_type>(icview.begin(), icview.end());
ASSERT_FALSE(registry.any_of<int>(entities[0u]));
ASSERT_FALSE(registry.all_of<int>(entities[1u]));
ASSERT_TRUE(registry.any_of<int>(entities[2u]));
ASSERT_EQ(registry.storage<int>().size(), 1u);
ASSERT_EQ(registry.storage<stable_type>().size(), 2u);
ASSERT_EQ(registry.storage<double>().size(), 1u);
registry.erase<int>(iview.begin(), iview.end());
ASSERT_FALSE(registry.any_of<int>(entities[2u]));
ASSERT_EQ(registry.storage<int>().size(), 0u);
ASSERT_EQ(registry.storage<stable_type>().size(), 2u);
ASSERT_EQ(registry.storage<double>().size(), 1u);
}
TEST(Registry, EraseIf) {
using namespace entt::literals;
entt::registry registry;
const auto entity = registry.create();
registry.emplace<int>(entity);
registry.storage<int>("other"_hs).emplace(entity);
registry.emplace<char>(entity);
ASSERT_TRUE(registry.storage<int>().contains(entity));
ASSERT_TRUE(registry.storage<int>("other"_hs).contains(entity));
ASSERT_TRUE(registry.storage<char>().contains(entity));
registry.erase_if(entity, [](auto &&...) { return false; });
ASSERT_TRUE(registry.storage<int>().contains(entity));
ASSERT_TRUE(registry.storage<int>("other"_hs).contains(entity));
ASSERT_TRUE(registry.storage<char>().contains(entity));
registry.erase_if(entity, [](entt::id_type id, auto &&...) { return id == "other"_hs; });
ASSERT_TRUE(registry.storage<int>().contains(entity));
ASSERT_FALSE(registry.storage<int>("other"_hs).contains(entity));
ASSERT_TRUE(registry.storage<char>().contains(entity));
registry.erase_if(entity, [](auto, const auto &storage) { return storage.type() == entt::type_id<char>(); });
ASSERT_TRUE(registry.storage<int>().contains(entity));
ASSERT_FALSE(registry.storage<int>("other"_hs).contains(entity));
ASSERT_FALSE(registry.storage<char>().contains(entity));
}
TEST(Registry, Remove) {
entt::registry registry;
const auto iview = registry.view<int>();
const auto icview = registry.view<int, char>();
entt::entity entities[3u];
registry.create(std::begin(entities), std::end(entities));
registry.emplace<int>(entities[0u]);
registry.emplace<char>(entities[0u]);
registry.emplace<double>(entities[0u]);
registry.emplace<int>(entities[1u]);
registry.emplace<char>(entities[1u]);
registry.emplace<int>(entities[2u]);
ASSERT_TRUE(registry.any_of<int>(entities[0u]));
ASSERT_TRUE(registry.all_of<int>(entities[1u]));
ASSERT_TRUE(registry.any_of<int>(entities[2u]));
registry.remove<int, char>(entities[0u]);
ASSERT_EQ((registry.remove<int, char>(icview.begin(), icview.end())), 2u);
ASSERT_EQ((registry.remove<int, char>(icview.begin(), icview.end())), 0u);
ASSERT_FALSE(registry.any_of<int>(entities[0u]));
ASSERT_FALSE(registry.all_of<int>(entities[1u]));
ASSERT_TRUE(registry.any_of<int>(entities[2u]));
ASSERT_EQ(registry.storage<int>().size(), 1u);
ASSERT_EQ(registry.storage<char>().size(), 0u);
ASSERT_EQ(registry.storage<double>().size(), 1u);
ASSERT_EQ((registry.remove<int>(iview.begin(), iview.end())), 1u);
ASSERT_EQ(registry.remove<int>(entities[0u]), 0u);
ASSERT_EQ(registry.remove<int>(entities[1u]), 0u);
ASSERT_FALSE(registry.any_of<int>(entities[2u]));
ASSERT_EQ(registry.remove<int>(iview.begin(), iview.end()), 0u);
ASSERT_EQ(registry.storage<int>().size(), 0u);
ASSERT_EQ(registry.storage<char>().size(), 0u);
ASSERT_EQ(registry.storage<double>().size(), 1u);
registry.insert<int>(std::begin(entities) + 1, std::end(entities) - 1u);
registry.insert<char>(std::begin(entities) + 1, std::end(entities) - 1u);
ASSERT_EQ(registry.storage<int>().size(), 1u);
ASSERT_EQ(registry.storage<char>().size(), 1u);
registry.remove<int, char>(iview.begin(), iview.end());
registry.remove<int, char>(iview.begin(), iview.end());
ASSERT_EQ(registry.storage<int>().size(), 0u);
ASSERT_EQ(registry.storage<char>().size(), 0u);
registry.insert<int>(std::begin(entities), std::end(entities));
registry.insert<char>(std::begin(entities), std::end(entities));
ASSERT_EQ(registry.storage<int>().size(), 3u);
ASSERT_EQ(registry.storage<char>().size(), 3u);
registry.remove<int, char>(std::begin(entities), std::end(entities));
registry.remove<int, char>(std::begin(entities), std::end(entities));
ASSERT_EQ(registry.storage<int>().size(), 0u);
ASSERT_EQ(registry.storage<char>().size(), 0u);
ASSERT_FALSE(registry.orphan(entities[0u]));
ASSERT_TRUE(registry.orphan(entities[1u]));
ASSERT_TRUE(registry.orphan(entities[2u]));
}
TEST(Registry, StableRemove) {
entt::registry registry;
const auto iview = registry.view<int>();
const auto icview = registry.view<int, stable_type>();
entt::entity entities[3u];
registry.create(std::begin(entities), std::end(entities));
registry.emplace<int>(entities[0u]);
registry.emplace<stable_type>(entities[0u]);
registry.emplace<double>(entities[0u]);
registry.emplace<int>(entities[1u]);
registry.emplace<stable_type>(entities[1u]);
registry.emplace<int>(entities[2u]);
ASSERT_TRUE(registry.any_of<int>(entities[0u]));
ASSERT_TRUE(registry.all_of<int>(entities[1u]));
ASSERT_TRUE(registry.any_of<int>(entities[2u]));
registry.remove<int, stable_type>(entities[0u]);
ASSERT_EQ((registry.remove<int, stable_type>(icview.begin(), icview.end())), 2u);
ASSERT_EQ((registry.remove<int, stable_type>(icview.begin(), icview.end())), 0u);
ASSERT_FALSE(registry.any_of<int>(entities[0u]));
ASSERT_FALSE(registry.all_of<int>(entities[1u]));
ASSERT_TRUE(registry.any_of<int>(entities[2u]));
ASSERT_EQ(registry.storage<int>().size(), 1u);
ASSERT_EQ(registry.storage<stable_type>().size(), 2u);
ASSERT_EQ(registry.storage<double>().size(), 1u);
ASSERT_EQ((registry.remove<int>(iview.begin(), iview.end())), 1u);
ASSERT_EQ(registry.remove<int>(entities[0u]), 0u);
ASSERT_EQ(registry.remove<int>(entities[1u]), 0u);
ASSERT_FALSE(registry.any_of<int>(entities[2u]));
ASSERT_EQ(registry.storage<int>().size(), 0u);
ASSERT_EQ(registry.storage<stable_type>().size(), 2u);
ASSERT_EQ(registry.storage<double>().size(), 1u);
}
TEST(Registry, Compact) {
entt::registry registry;
entt::entity entities[2u];
registry.create(std::begin(entities), std::end(entities));
registry.emplace<int>(entities[0u]);
registry.emplace<stable_type>(entities[0u]);
registry.emplace<int>(entities[1u]);
registry.emplace<stable_type>(entities[1u]);
ASSERT_EQ(registry.storage<int>().size(), 2u);
ASSERT_EQ(registry.storage<stable_type>().size(), 2u);
registry.destroy(std::begin(entities), std::end(entities));
ASSERT_EQ(registry.storage<int>().size(), 0u);
ASSERT_EQ(registry.storage<stable_type>().size(), 2u);
registry.compact<int>();
ASSERT_EQ(registry.storage<int>().size(), 0u);
ASSERT_EQ(registry.storage<stable_type>().size(), 2u);
registry.compact();
ASSERT_EQ(registry.storage<int>().size(), 0u);
ASSERT_EQ(registry.storage<stable_type>().size(), 0u);
}
TEST(Registry, NonOwningGroupInterleaved) {
entt::registry registry;
typename entt::entity entity = entt::null;
entity = registry.create();
registry.emplace<int>(entity);
registry.emplace<char>(entity);
const auto group = registry.group(entt::get<int, char>);
entity = registry.create();
registry.emplace<int>(entity);
registry.emplace<char>(entity);
std::size_t cnt{};
group.each([&cnt](auto...) { ++cnt; });
ASSERT_EQ(cnt, 2u);
}
TEST(Registry, FullOwningGroupInterleaved) {
entt::registry registry;
typename entt::entity entity = entt::null;
entity = registry.create();
registry.emplace<int>(entity);
registry.emplace<char>(entity);
const auto group = registry.group<int, char>();
entity = registry.create();
registry.emplace<int>(entity);
registry.emplace<char>(entity);
std::size_t cnt{};
group.each([&cnt](auto...) { ++cnt; });
ASSERT_EQ(cnt, 2u);
}
TEST(Registry, PartialOwningGroupInterleaved) {
entt::registry registry;
typename entt::entity entity = entt::null;
entity = registry.create();
registry.emplace<int>(entity);
registry.emplace<char>(entity);
const auto group = registry.group<int>(entt::get<char>);
entity = registry.create();
registry.emplace<int>(entity);
registry.emplace<char>(entity);
std::size_t cnt{};
group.each([&cnt](auto...) { ++cnt; });
ASSERT_EQ(cnt, 2u);
}
TEST(Registry, NonOwningGroupSortInterleaved) {
entt::registry registry;
const auto group = registry.group(entt::get<int, char>);
const auto e0 = registry.create();
registry.emplace<int>(e0, 0);
registry.emplace<char>(e0, '0');
const auto e1 = registry.create();
registry.emplace<int>(e1, 1);
registry.emplace<char>(e1, '1');
registry.sort<int>(std::greater{});
registry.sort<char>(std::less{});
const auto e2 = registry.create();
registry.emplace<int>(e2, 2);
registry.emplace<char>(e2, '2');
group.each([e0, e1, e2](const auto entity, const auto &i, const auto &c) {
if(entity == e0) {
ASSERT_EQ(i, 0);
ASSERT_EQ(c, '0');
} else if(entity == e1) {
ASSERT_EQ(i, 1);
ASSERT_EQ(c, '1');
} else if(entity == e2) {
ASSERT_EQ(i, 2);
ASSERT_EQ(c, '2');
}
});
}
TEST(Registry, GetOrEmplace) {
entt::registry registry;
const auto entity = registry.create();
const auto value = registry.get_or_emplace<int>(entity, 3);
// get_or_emplace must work for empty types
static_cast<void>(registry.get_or_emplace<empty_type>(entity));
ASSERT_TRUE((registry.all_of<int, empty_type>(entity)));
ASSERT_EQ(registry.get<int>(entity), value);
ASSERT_EQ(registry.get<int>(entity), 3);
}
TEST(Registry, Constness) {
entt::registry registry;
static_assert((std::is_same_v<decltype(registry.emplace<int>({})), int &>));
static_assert((std::is_same_v<decltype(registry.emplace<empty_type>({})), void>));
static_assert((std::is_same_v<decltype(registry.get<>({})), std::tuple<>>));
static_assert((std::is_same_v<decltype(registry.get<int>({})), int &>));
static_assert((std::is_same_v<decltype(registry.get<int, const char>({})), std::tuple<int &, const char &>>));
static_assert((std::is_same_v<decltype(registry.try_get<>({})), std::tuple<>>));
static_assert((std::is_same_v<decltype(registry.try_get<int>({})), int *>));
static_assert((std::is_same_v<decltype(registry.try_get<int, const char>({})), std::tuple<int *, const char *>>));
static_assert((std::is_same_v<decltype(registry.ctx().get<int>()), int &>));
static_assert((std::is_same_v<decltype(registry.ctx().get<const char>()), const char &>));
static_assert((std::is_same_v<decltype(registry.ctx().find<int>()), int *>));
static_assert((std::is_same_v<decltype(registry.ctx().find<const char>()), const char *>));
static_assert((std::is_same_v<decltype(std::as_const(registry).get<>({})), std::tuple<>>));
static_assert((std::is_same_v<decltype(std::as_const(registry).get<int>({})), const int &>));
static_assert((std::is_same_v<decltype(std::as_const(registry).get<int, const char>({})), std::tuple<const int &, const char &>>));
static_assert((std::is_same_v<decltype(std::as_const(registry).try_get<>({})), std::tuple<>>));
static_assert((std::is_same_v<decltype(std::as_const(registry).try_get<int>({})), const int *>));
static_assert((std::is_same_v<decltype(std::as_const(registry).try_get<int, const char>({})), std::tuple<const int *, const char *>>));
static_assert((std::is_same_v<decltype(std::as_const(registry).ctx().get<int>()), const int &>));
static_assert((std::is_same_v<decltype(std::as_const(registry).ctx().get<const char>()), const char &>));
static_assert((std::is_same_v<decltype(std::as_const(registry).ctx().find<int>()), const int *>));
static_assert((std::is_same_v<decltype(std::as_const(registry).ctx().find<const char>()), const char *>));
}
TEST(Registry, MoveOnlyComponent) {
entt::registry registry;
// the purpose is to ensure that move only types are always accepted
registry.emplace<std::unique_ptr<int>>(registry.create());
}
TEST(Registry, NonDefaultConstructibleComponent) {
entt::registry registry;
// the purpose is to ensure that non default constructible type are always accepted
registry.emplace<non_default_constructible>(registry.create(), 42);
}
TEST(Registry, Dependencies) {
entt::registry registry;
const auto entity = registry.create();
// required because of an issue of VS2019
constexpr auto emplace_or_replace = &entt::registry::emplace_or_replace<double>;
constexpr auto remove = &entt::registry::remove<double>;
registry.on_construct<int>().connect<emplace_or_replace>();
registry.on_destroy<int>().connect<remove>();
registry.emplace<double>(entity, .3);
ASSERT_FALSE(registry.all_of<int>(entity));
ASSERT_EQ(registry.get<double>(entity), .3);
registry.emplace<int>(entity);
ASSERT_TRUE(registry.all_of<int>(entity));
ASSERT_EQ(registry.get<double>(entity), .0);
registry.erase<int>(entity);
ASSERT_FALSE((registry.any_of<int, double>(entity)));
registry.on_construct<int>().disconnect<emplace_or_replace>();
registry.on_destroy<int>().disconnect<remove>();
registry.emplace<int>(entity);
ASSERT_TRUE((registry.any_of<int, double>(entity)));
ASSERT_FALSE(registry.all_of<double>(entity));
}
TEST(Registry, StableEmplace) {
entt::registry registry;
registry.on_construct<int>().connect<&listener::sort<int>>();
registry.emplace<int>(registry.create(), 0);
ASSERT_EQ(registry.emplace<int>(registry.create(), 1), 1);
}
TEST(Registry, AssignEntities) {
using traits_type = entt::entt_traits<entt::entity>;
entt::registry registry;
entt::entity entities[3];
registry.create(std::begin(entities), std::end(entities));
registry.release(entities[1]);
registry.release(entities[2]);
entt::registry other;
const auto *data = registry.data();
other.assign(data, data + registry.size(), registry.released());
ASSERT_EQ(registry.size(), other.size());
ASSERT_TRUE(other.valid(entities[0]));
ASSERT_FALSE(other.valid(entities[1]));
ASSERT_FALSE(other.valid(entities[2]));
ASSERT_EQ(registry.create(), other.create());
ASSERT_EQ(traits_type::to_entity(other.create()), traits_type::to_integral(entities[1]));
}
TEST(Registry, ScramblingPoolsIsAllowed) {
entt::registry registry;
registry.on_destroy<int>().connect<&listener::sort<int>>();
for(std::size_t i{}; i < 2u; ++i) {
const auto entity = registry.create();
registry.emplace<int>(entity, static_cast<int>(i));
}
registry.destroy(registry.view<int>().back());
// thanks to @andranik3949 for pointing out this missing test
registry.view<const int>().each([](const auto entity, const auto &value) {
ASSERT_EQ(static_cast<int>(entt::to_integral(entity)), value);
});
}
TEST(Registry, RuntimePools) {
using namespace entt::literals;
entt::registry registry;
auto &storage = registry.storage<empty_type>("other"_hs);
const auto entity = registry.create();
static_assert(std::is_same_v<decltype(registry.storage<empty_type>()), entt::storage_type_t<empty_type> &>);
static_assert(std::is_same_v<decltype(std::as_const(registry).storage<empty_type>()), const entt::storage_type_t<empty_type> *>);
static_assert(std::is_same_v<decltype(registry.storage("other"_hs)), entt::storage_type_t<empty_type>::base_type *>);
static_assert(std::is_same_v<decltype(std::as_const(registry).storage("other"_hs)), const entt::storage_type_t<empty_type>::base_type *>);
ASSERT_NE(registry.storage("other"_hs), nullptr);
ASSERT_EQ(std::as_const(registry).storage("rehto"_hs), nullptr);
ASSERT_EQ(&registry.storage<empty_type>("other"_hs), &storage);
ASSERT_NE(std::as_const(registry).storage<empty_type>(), &storage);
ASSERT_FALSE(registry.any_of<empty_type>(entity));
ASSERT_FALSE(storage.contains(entity));
registry.emplace<empty_type>(entity);
ASSERT_FALSE(storage.contains(entity));
ASSERT_TRUE(registry.any_of<empty_type>(entity));
ASSERT_EQ((entt::basic_view{registry.storage<empty_type>(), storage}.size_hint()), 0u);
storage.emplace(entity);
ASSERT_TRUE(storage.contains(entity));
ASSERT_TRUE(registry.any_of<empty_type>(entity));
ASSERT_EQ((entt::basic_view{registry.storage<empty_type>(), storage}.size_hint()), 1u);
registry.destroy(entity);
ASSERT_EQ(registry.create(entity), entity);
ASSERT_FALSE(storage.contains(entity));
ASSERT_FALSE(registry.any_of<empty_type>(entity));
}
ENTT_DEBUG_TEST(RegistryDeathTest, RuntimePools) {
using namespace entt::literals;
entt::registry registry;
registry.storage<empty_type>("other"_hs);
ASSERT_DEATH(registry.storage<int>("other"_hs), "");
ASSERT_DEATH(std::as_const(registry).storage<int>("other"_hs), "");
}
TEST(Registry, Storage) {
using namespace entt::literals;
entt::registry registry;
const auto entity = registry.create();
auto &storage = registry.storage<int>("int"_hs);
storage.emplace(entity);
for(auto [id, pool]: registry.storage()) {
static_assert(std::is_same_v<decltype(pool), entt::sparse_set &>);
static_assert(std::is_same_v<decltype(id), entt::id_type>);
ASSERT_TRUE(pool.contains(entity));
ASSERT_EQ(std::addressof(storage), std::addressof(pool));
ASSERT_EQ(id, "int"_hs);
}
for(auto &&curr: std::as_const(registry).storage()) {
static_assert(std::is_same_v<decltype(curr.second), const entt::sparse_set &>);
static_assert(std::is_same_v<decltype(curr.first), entt::id_type>);
ASSERT_TRUE(curr.second.contains(entity));
ASSERT_EQ(std::addressof(storage), std::addressof(curr.second));
ASSERT_EQ(curr.first, "int"_hs);
}
}
TEST(Registry, RegistryStorageIterator) {
entt::registry registry;
const auto entity = registry.create();
registry.emplace<int>(entity);
auto test = [entity](auto iterable) {
auto end{iterable.begin()};
decltype(end) begin{};
begin = iterable.end();
std::swap(begin, end);
ASSERT_EQ(begin, iterable.cbegin());
ASSERT_EQ(end, iterable.cend());
ASSERT_NE(begin, end);
ASSERT_EQ(begin++, iterable.begin());
ASSERT_EQ(begin--, iterable.end());
ASSERT_EQ(begin + 1, iterable.end());
ASSERT_EQ(end - 1, iterable.begin());
ASSERT_EQ(++begin, iterable.end());
ASSERT_EQ(--begin, iterable.begin());
ASSERT_EQ(begin += 1, iterable.end());
ASSERT_EQ(begin -= 1, iterable.begin());
ASSERT_EQ(begin + (end - begin), iterable.end());
ASSERT_EQ(begin - (begin - end), iterable.end());
ASSERT_EQ(end - (end - begin), iterable.begin());
ASSERT_EQ(end + (begin - end), iterable.begin());
ASSERT_EQ(begin[0u].first, iterable.begin()->first);
ASSERT_EQ(std::addressof(begin[0u].second), std::addressof((*iterable.begin()).second));
ASSERT_LT(begin, end);
ASSERT_LE(begin, iterable.begin());
ASSERT_GT(end, begin);
ASSERT_GE(end, iterable.end());
ASSERT_EQ(begin[0u].first, entt::type_id<int>().hash());
ASSERT_TRUE(begin[0u].second.contains(entity));
};
test(registry.storage());
test(std::as_const(registry).storage());
decltype(std::as_const(registry).storage().begin()) cit = registry.storage().begin();
ASSERT_EQ(cit, registry.storage().begin());
ASSERT_NE(cit, std::as_const(registry).storage().end());
}
TEST(Registry, RegistryStorageIteratorConversion) {
entt::registry registry;
registry.storage<int>();
auto proxy = registry.storage();
auto cproxy = std::as_const(registry).storage();
typename decltype(proxy)::iterator it = proxy.begin();
typename decltype(cproxy)::iterator cit = it;
static_assert(std::is_same_v<decltype(*it), std::pair<entt::id_type, entt::sparse_set &>>);
static_assert(std::is_same_v<decltype(*cit), std::pair<entt::id_type, const entt::sparse_set &>>);
ASSERT_EQ(it->first, entt::type_id<int>().hash());
ASSERT_EQ((*it).second.type(), entt::type_id<int>());
ASSERT_EQ(it->first, cit->first);
ASSERT_EQ((*it).second.type(), (*cit).second.type());
ASSERT_EQ(it - cit, 0);
ASSERT_EQ(cit - it, 0);
ASSERT_LE(it, cit);
ASSERT_LE(cit, it);
ASSERT_GE(it, cit);
ASSERT_GE(cit, it);
ASSERT_EQ(it, cit);
ASSERT_NE(++cit, it);
}
TEST(Registry, VoidType) {
using namespace entt::literals;
entt::registry registry;
const auto entity = registry.create();
auto &storage = registry.storage<void>("custom"_hs);
storage.emplace(entity);
ASSERT_TRUE(registry.storage<void>().empty());
ASSERT_FALSE(registry.storage<void>("custom"_hs).empty());
ASSERT_TRUE(registry.storage<void>("custom"_hs).contains(entity));
ASSERT_EQ(registry.storage<void>().type(), entt::type_id<void>());
ASSERT_EQ(registry.storage<void>("custom"_hs).type(), entt::type_id<void>());
}
TEST(Registry, NoEtoType) {
entt::registry registry;
const auto entity = registry.create();
registry.emplace<no_eto_type>(entity);
registry.emplace<int>(entity, 42);
ASSERT_NE(registry.storage<no_eto_type>().raw(), nullptr);
ASSERT_NE(registry.try_get<no_eto_type>(entity), nullptr);
ASSERT_EQ(registry.view<no_eto_type>().get(entity), std::as_const(registry).view<const no_eto_type>().get(entity));
auto view = registry.view<no_eto_type, int>();
auto cview = std::as_const(registry).view<const no_eto_type, const int>();
ASSERT_EQ((std::get<0>(view.get<no_eto_type, int>(entity))), (std::get<0>(cview.get<const no_eto_type, const int>(entity))));
}
TEST(Registry, CtxAndPoolMemberDestructionOrder) {
auto registry = std::make_unique<entt::registry>();
const auto entity = registry->create();
bool ctx_check = false;
registry->ctx().emplace<typename destruction_order::ctx_check_type>();
registry->emplace<destruction_order>(entity, *registry, ctx_check);
registry.reset();
ASSERT_TRUE(ctx_check);
}