-|
- EnTT
- 3.2.1
-
- |
-
- 1.8.13
-
-
-
diff --git a/actor_8hpp_source.html b/actor_8hpp_source.html
index 196a4ae0a..7eb2a864b 100644
--- a/actor_8hpp_source.html
+++ b/actor_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/algorithm_8hpp_source.html b/algorithm_8hpp_source.html
index 45ad78759..4930dfb18 100644
--- a/algorithm_8hpp_source.html
+++ b/algorithm_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/annotated.html b/annotated.html
index b5a05f9f0..0c358bd52 100644
--- a/annotated.html
+++ b/annotated.html
@@ -1,9 +1,9 @@
-
+
-
+
value to true if a given type is equality comparable, false otherwise value to true if a given type is equality comparable, false otherwise. value to true if a given type is equality comparable, false otherwise. value to true if a given type has a name. In all other cases, value is false value to true if a given type has a name. In all other cases, value is false.
- 1.8.13
+ 1.8.16
diff --git a/attribute_8h_source.html b/attribute_8h_source.html
new file mode 100644
index 000000000..576d452e4
--- /dev/null
+++ b/attribute_8h_source.html
@@ -0,0 +1,114 @@
+
+
+
+
+
+
+
+|
+ EnTT
+ 3.3.0
+
+ |
+
+ 1.8.16
+
+
+
diff --git a/autotoc_md68.html b/autotoc_md68.html
deleted file mode 100644
index bbe033ec1..000000000
--- a/autotoc_md68.html
+++ /dev/null
@@ -1,84 +0,0 @@
-
-
-
-
-
-
-
-|
- EnTT
- 3.2.1
-
- |
-
Usually service locators are tightly bound to the services they expose and it's hard to define a general purpose solution. This template based implementation tries to fill the gap and to get rid of the burden of defining a different specific locator for each application.
- This class is tiny, partially unsafe and thus risky to use. Moreover it doesn't fit probably most of the scenarios in which a service locator is required. Look at it as a small tool that can sometimes be useful if users know how to handle it.
The API is straightforward. The basic idea is that services are implemented by means of interfaces and rely on polymorphism.
- The locator is instantiated with the base type of the service if any and a concrete implementation is provided along with all the parameters required to initialize it. As an example:
The locator can also be queried to know if an active service is currently set and to retrieve it if necessary (either as a pointer or as a reference):
-A common use is to wrap the different locators in a container class, creating aliases for the various services:
-
- 1.8.13
-
-
-
diff --git a/autotoc_md86.html b/autotoc_md86.html
deleted file mode 100644
index 4e971cf96..000000000
--- a/autotoc_md86.html
+++ /dev/null
@@ -1,123 +0,0 @@
-
-
-
-
-
-
-
-|
- EnTT
- 3.2.1
-
- |
-
Resource management is usually one of the most critical part of a software like a game. Solutions are often tuned to the particular application. There exist several approaches and all of them are perfectly fine as long as they fit the requirements of the piece of software in which they are used.
- Examples are loading everything on start, loading on request, predictive loading, and so on.
EnTT doesn't pretend to offer a one-fits-all solution for the different cases. Instead, it offers a minimal and perhaps trivial cache that can be useful most of the time during prototyping and sometimes even in a production environment.
- For those interested in the subject, the plan is to improve it considerably over time in terms of performance, memory usage and functionalities. Hoping to make it, of course, one step at a time.
There are three main actors in the model: the resource, the loader and the cache.
-The resource is whatever users want it to be. An image, a video, an audio, whatever. There are no limits.
- As a minimal example:
A loader is a class the aim of which is to load a specific resource. It has to inherit directly from the dedicated base class as in the following example:
-Where my_resource is the type of resources it creates.
- A resource loader must also expose a public const member function named load that accepts a variable number of arguments and returns a shared pointer to a resource.
- As an example:
In general, resource loaders should not have a state or retain data of any type. They should let the cache manage their resources instead.
- As a side note, base class and CRTP idiom aren't strictly required with the current implementation. One could argue that a cache can easily work with loaders of any type. However, future changes won't be breaking ones by forcing the use of a base class today and that's why the model is already in its place.
Finally, a cache is a specialization of a class template tailored to a specific resource:
-The idea is to create different caches for different types of resources and to manage each one independently in the most appropriate way.
- As a (very) trivial example, audio tracks can survive in most of the scenes of an application while meshes can be associated with a single scene and then discarded when users leave it.
A cache offers a set of basic functionalities to query its internal state and to organize it:
-Besides these member functions, a cache contains what is needed to load, use and discard resources of the given type.
- Before to explore this part of the interface, it makes sense to mention how resources are identified. The type of the identifiers to use is defined as:
Where id_type is an alias for entt::hashed_string::hash_type. Therefore, resource identifiers are created explicitly as in the following example:
The class hashed_string is described in a dedicated section, so I won't go in details here.
Resources are loaded and thus stored in a cache through the load member function. It accepts the loader to use as a template parameter, the resource identifier and the parameters used to construct the resource as arguments:
The function returns a handle to the resource, whether it already exists or is loaded. In case the loader returns an invalid pointer, the handle is invalid as well and therefore it can be easily used with an if statement:
Before trying to load a resource, the contains member function can be used to know if a cache already contains a specific resource:
There exists also a member function to use to force a reload of an already existing resource if needed:
-As above, the function returns a handle to the resource that is invalid in case of errors. The reload member function is a kind of alias of the following snippet:
Where the discard member function is used to get rid of a resource if loaded. In case the cache doesn't contain a resource for the given identifier, discard does nothing and returns immediately.
So far, so good. Resources are finally loaded and stored within the cache.
- They are returned to users in the form of handles. To get one of them later on:
The idea behind a handle is the same of the flyweight pattern. In other terms, resources aren't copied around. Instead, instances are shared between handles. Users of a resource own a handle that guarantees that a resource isn't destroyed until all the handles are destroyed, even if the resource itself is removed from the cache.
- Handles are tiny objects both movable and copyable. They return the contained resource as a const reference on request:
get member function:The resource can also be accessed directly using the arrow operator if required:
-To test if a handle is still valid, the cast operator to bool allows users to use it in a guard:
Finally, in case there is the need to load a resource and thus to get a handle without storing the resource itself in the cache, users can rely on the temp member function template.
- The declaration is similar to that of load, a (possibly invalid) handle for the resource is returned also in this case:
Do not forget to test the handle for validity. Otherwise, getting a reference to the resource it points may result in undefined behavior.
-
- 1.8.13
-
-
-
diff --git a/autotoc_md89.html b/autotoc_md89.html
deleted file mode 100644
index 4a8a3490b..000000000
--- a/autotoc_md89.html
+++ /dev/null
@@ -1,158 +0,0 @@
-
-
-
-
-
-
-
-|
- EnTT
- 3.2.1
-
- |
-
Signals are usually a core part of games and software architectures in general.
- Roughly speaking, they help to decouple the various parts of a system while allowing them to communicate with each other somehow.
The so called _modern C++_ comes with a tool that can be useful in these terms, the std::function. As an example, it can be used to create delegates.
- However, there is no guarantee that an std::function does not perform allocations under the hood and this could be problematic sometimes. Furthermore, it solves a problem but may not adapt well to other requirements that may arise from time to time.
In case that the flexibility and power of an std::function isn't required or if the price to pay for them is too high,EnTT offers a complete set of lightweight classes to solve the same and many other problems.
A delegate can be used as a general purpose invoker with no memory overhead for free functions and members provided along with an instance on which to invoke them.
- It does not claim to be a drop-in replacement for an std::function, so do not expect to use it whenever an std::function fits well. That said, it's most likely even a better fit than an std::function in a lot of cases, so expect to use it quite a lot anyway.
The interface is trivial. It offers a default constructor to create empty delegates:
-All what is needed to create an instance is to specify the type of the function the delegate will contain, that is the signature of the free function or the member one wants to assign to it.
-Attempting to use an empty delegate by invoking its function call operator results in undefined behavior or most likely a crash. Before to use a delegate, it must be initialized.
- There exists a bunch of overloads of the connect member function to do that. As an example of use:
The delegate class accepts also data members, if needed. In this case, the function type of the delegate is such that the parameter list is empty and the value of the data member is at least convertible to the return type.
-Free functions having type equivalent to void(T &, args...) are accepted as well. In this case, T & is considered a payload and the function will receive it back every time it's invoked. In other terms, this works just fine with the above definition:
The function g will be invoked with a reference to c and 42. However, the function type of the delegate is still void(int). This is also the signature of its function call operator.
Another interesting aspect of the delegate class is that it accepts also functions with a list of parameters that is shorter than that of the function type used to specialize the delegate itself.
- The following code is therefore perfectly valid:
Where the function type of the delegate is void(int) as above. It goes without saying that the extra arguments are silently discarded internally.
-v This is a nice-to-have feature in a lot of cases, as an example when the delegate class is used as a building block of a signal-slot system.
To create and initialize a delegate at once, there are a few specialized constructors. Because of the rules of the language, the listener is provided by means of the entt::connect_arg variable template:
Aside connect, a disconnect counterpart isn't provided. Instead, there exists a reset member function to use to clear a delegate.
- To know if a delegate is empty, it can be used explicitly in every conditional statement:
Finally, to invoke a delegate, the function call operator is the way to go as already shown in the examples above:
-In all cases, the listeners don't have to strictly follow the signature of the delegate. As long as a listener can be invoked with the given arguments to yield a result that is convertible to the given result type, everything works just fine.
-Signal handlers work with references to classes, function pointers and pointers to members. Listeners can be any kind of objects and users are in charge of connecting and disconnecting them from a signal to avoid crashes due to different lifetimes. On the other side, performance shouldn't be affected that much by the presence of such a signal handler.
- Signals make use of delegates internally and therefore they undergo the same rules and offer similar functionalities. It may be a good idea to consult the documentation of the delegate class for further information.
A signal handler can be used as a private data member without exposing any publish functionality to the clients of a class. The basic idea is to impose a clear separation between the signal itself and the sink class, that is a tool to be used to connect and disconnect listeners on the fly.
The API of a signal handler is straightforward. If a collector is supplied to the signal when something is published, all the values returned by the listeners can be literally collected and used later by the caller. Otherwise, the class works just like a plain signal that emits events from time to time.
- To create instances of signal handlers it is sufficient to provide the type of function to which they refer:
Signals offer all the basic functionalities required to know how many listeners they contain (size) or if they contain at least a listener (empty), as well as a function to use to swap handlers (swap).
Besides them, there are member functions to use both to connect and disconnect listeners in all their forms by means of a sink:
-As shown above, the listeners don't have to strictly follow the signature of the signal. As long as a listener can be invoked with the given arguments to yield a result that is convertible to the given return type, everything works just fine.
- It's also possible to connect a listener before other listeners already contained by the signal. The before function returns a sink object correctly initialized for the purpose that can be used to connect one or more listeners in order and in the desired position:
In all cases, the connect member function returns by default a connection object to be used as an alternative to break a connection by means of its release member function. A scoped_connection can also be created from a connection. In this case, the link is broken automatically as soon as the object goes out of scope.
Once listeners are attached (or even if there are no listeners at all), events and data in general can be published through a signal by means of the publish member function:
To collect data, the collect member function should be used instead. Below is a minimal example to show how to use it:
A collector must expose a function operator that accepts as an argument a type to which the return type of the listeners can be converted. Moreover, it can optionally return a boolean value that is true to stop collecting data, false otherwise. This way one can avoid calling all the listeners in case it isn't necessary.
- Functors can also be used in place of a lambda. Since the collector is copied when invoking the collect member function, std::ref is the way to go in this case:
The event dispatcher class is designed so as to be used in a loop. It allows users both to trigger immediate events or to queue events to be published all together once per tick.
- This class shares part of its API with the one of the signal handler, but it doesn't require that all the types of events are specified when declared:
In order to register an instance of a class to a dispatcher, its type must expose one or more member functions the arguments of which are such that const E & can be converted to them for each type of event E, no matter what the return value is.
- The name of the member function aimed to receive the event must be provided to the connect member function of the sink in charge for the specific event:
The disconnect member function follows the same pattern and can be used to remove one listener at a time or all of them at once:
The trigger member function serves the purpose of sending an immediate event to all the listeners registered so far. It offers a convenient approach that relieves users from having to create the event itself. Instead, it's enough to specify the type of event and provide all the parameters required to construct it.
- As an example:
Listeners are invoked immediately, order of execution isn't guaranteed. This method can be used to push around urgent messages like an is terminating notification on a mobile app.
-On the other hand, the enqueue member function queues messages together and allows to maintain control over the moment they are sent to listeners. The signature of this method is more or less the same of trigger:
Events are stored aside until the update member function is invoked, then all the messages that are still pending are sent to the listeners at once:
This way users can embed the dispatcher in a loop and literally dispatch events once per tick to their systems.
-A general purpose event emitter thought mainly for those cases where it comes to working with asynchronous stuff.
- Originally designed to fit the requirements of uvw (a wrapper for libuv written in modern C++), it was adapted later to be included in this library.
To create a custom emitter type, derived classes must inherit directly from the base class as:
-The full list of accepted types of events isn't required. Handlers are created internally on the fly and thus each type of event is accepted by default.
-Whenever an event is published, an emitter provides the listeners with a reference to itself along with a const reference to the event. Therefore listeners have an handy way to work with it without incurring in the need of capturing a reference to the emitter itself.
- In addition, an opaque object is returned each time a connection is established between an emitter and a listener, allowing the caller to disconnect them at a later time.
- The opaque object used to handle connections is both movable and copyable. On the other side, an event emitter is movable but not copyable by default.
To create new instances of an emitter, no arguments are required:
-Listeners must be movable and callable objects (free functions, lambdas, functors, std::functions, whatever) whose function type is:
Where Event is the type of event they want to listen.
- There are two ways to attach a listener to an event emitter that differ slightly from each other:
on member function. It is meant to register a listener designed to be invoked more than once for the given event type.The connection object can be freely discarded. Otherwise, it can be used later to disconnect the listener if required.
-once member function. It is meant to register a listener designed to be invoked only once for the given event type. The listener is automatically disconnected after the first invocation.The connection object can be freely discarded. Otherwise, it can be used later to disconnect the listener if required.
-In both cases, the connection object can be used with the erase member function:
There are also two member functions to use either to disconnect all the listeners for a given type of event or to clear the emitter:
-To send an event to all the listeners that are interested in it, the publish member function offers a convenient approach that relieves users from having to create the event:
Finally, the empty member function tests if there exists at least either a listener registered with the event emitter or to a given type of event:
In general, the event emitter is a handy tool when the derived classes wrap asynchronous operations, because it introduces a nice-to-have model based on events and listeners that kindly hides the complexity behind the scenes. However it is not limited to such uses.
-
- 1.8.13
-
-
-
diff --git a/cache_8hpp_source.html b/cache_8hpp_source.html
index 46e9966dd..899e4d372 100644
--- a/cache_8hpp_source.html
+++ b/cache_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1basic__continuous__loader-members.html b/classentt_1_1basic__continuous__loader-members.html
index e07c8d813..de6a94092 100644
--- a/classentt_1_1basic__continuous__loader-members.html
+++ b/classentt_1_1basic__continuous__loader-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1basic__continuous__loader.html b/classentt_1_1basic__continuous__loader.html
index 6615493a3..d76292bb0 100644
--- a/classentt_1_1basic__continuous__loader.html
+++ b/classentt_1_1basic__continuous__loader.html
@@ -1,9 +1,9 @@
-
+
-
+
Utility class for continuous loading.
-A continuous loader is designed to load data from a source registry to a (possibly) non-empty destination. The loader can accomodate in a registry more than one snapshot in a sort of continuous loading that updates the destination one step at a time.
- Identifiers that entities originally had are not transferred to the target. Instead, the loader maps remote identifiers to local ones while restoring a snapshot.
+
A continuous loader is designed to load data from a source registry to a (possibly) non-empty destination. The loader can accomodate in a registry more than one snapshot in a sort of continuous loading that updates the destination one step at a time.
+ Identifiers that entities originally had are not transferred to the target. Instead, the loader maps remote identifiers to local ones while restoring a snapshot.
An example of use is the implementation of a client-server applications with the requirement of transferring somehow parts of the representation side to side.
| Entity | A valid entity type (see entt_traits for more details). |
| Entity | A valid entity type (see entt_traits for more details). |
Restores components and assigns them to the right entities.
-The template parameter list must be exactly the same used during serialization. In the event that the entity to which the component is assigned doesn't exist yet, the loader will take care to create a local counterpart for it.
+
The template parameter list must be exactly the same used during serialization. In the event that the entity to which the component is assigned doesn't exist yet, the loader will take care to create a local counterpart for it.
Members can be either data members of type entity_type or containers of entities. In both cases, the loader will visit them and update the entities by replacing each one with its local counterpart.
|
EnTT
- 3.2.1
+ 3.2.2
|
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1basic__group_3_01Entity_00_01exclude__t_3_01Exclude_8_8_8_01_4_00_01get__t_3_01Get_1aada3a14110654dc27700c17c9c2396.html b/classentt_1_1basic__group_3_01Entity_00_01exclude__t_3_01Exclude_8_8_8_01_4_00_01get__t_3_01Get_1aada3a14110654dc27700c17c9c2396.html
index d54408301..f59ff6324 100644
--- a/classentt_1_1basic__group_3_01Entity_00_01exclude__t_3_01Exclude_8_8_8_01_4_00_01get__t_3_01Get_1aada3a14110654dc27700c17c9c2396.html
+++ b/classentt_1_1basic__group_3_01Entity_00_01exclude__t_3_01Exclude_8_8_8_01_4_00_01get__t_3_01Get_1aada3a14110654dc27700c17c9c2396.html
@@ -1,9 +1,9 @@
-
+
-
+
@@ -183,7 +186,7 @@ class entt::basic_group< Entity, exclude_t< Exclude... >, get_t< Get
-inlineexplicit |
+inlineexplicitconstexpr
@@ -254,7 +258,7 @@ template<typename Char>
| |||||||||||||
Definition at line 184 of file hashed_string.hpp.
- - - -
-
|
- -inlinestatic | -
Returns directly the numeric representation of a string.
-Forcing template resolution avoids implicit conversions. An human-readable identifier can be anything but a plain, old bunch of characters.
- Example of use:
| N | Number of characters of the identifier. |
| str | Human-readable identifer. |
Definition at line 96 of file hashed_string.hpp.
- -
-
|
- -inlinestatic | -
Returns directly the numeric representation of a string.
-| wrapper | Helps achieving the purpose by relying on overloading. |
Definition at line 105 of file hashed_string.hpp.
-Definition at line 115 of file hashed_string.hpp.
+
+
|
+ +inlinestaticconstexpr | +
Returns directly the numeric representation of a string.
+Forcing template resolution avoids implicit conversions. An human-readable identifier can be anything but a plain, old bunch of characters.
+ Example of use:
| N | Number of characters of the identifier. |
| str | Human-readable identifer. |
Definition at line 96 of file hashed_string.hpp.
+ +
+
|
+ +inlinestatic | +
Returns directly the numeric representation of a string.
+| wrapper | Helps achieving the purpose by relying on overloading. |
Definition at line 105 of file hashed_string.hpp.
+
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1basic__observer-members.html b/classentt_1_1basic__observer-members.html
index 06b628d83..a810b622e 100644
--- a/classentt_1_1basic__observer-members.html
+++ b/classentt_1_1basic__observer-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1basic__observer.html b/classentt_1_1basic__observer.html
index c17cdc3d5..3718503d9 100644
--- a/classentt_1_1basic__observer.html
+++ b/classentt_1_1basic__observer.html
@@ -1,9 +1,9 @@
-
+
-
+
| Entity | A valid entity type (see entt_traits for more details). |
| Entity | A valid entity type (see entt_traits for more details). |
Definition at line 285 of file observer.hpp.
+Definition at line 283 of file observer.hpp.
@@ -273,10 +276,10 @@ template<typename Entity >Returns an iterator to the first entity of the observer.
-The returned iterator points to the first entity of the observer. If the container is empty, the returned iterator will be equal to end().
The returned iterator points to the first entity of the observer. If the container is empty, the returned iterator will be equal to end().
Definition at line 369 of file observer.hpp.
+Definition at line 367 of file observer.hpp.
Definition at line 314 of file observer.hpp.
+Definition at line 312 of file observer.hpp.
@@ -362,64 +365,16 @@ template<typename Entity >Direct access to the list of entities of the observer.
-The returned pointer is such that range [data(), data() + size()] is always a valid range, even if the container is empty.
The returned pointer is such that range [data(), data() + size()] is always a valid range, even if the container is empty.
begin and end if you want to iterate the observer in the expected order.Definition at line 357 of file observer.hpp.
- -
-
|
- -inline | -
Iterates entities and applies the given function object to them, then clears the observer.
-The function object is invoked for each entity.
- The signature of the function must be equivalent to the following form:
| Func | Type of the function object to invoke. |
| func | A valid function object. |
Definition at line 407 of file observer.hpp.
+Definition at line 355 of file observer.hpp.
Iterates entities and applies the given function object to them, then clears the observer.
-The function object is invoked for each entity.
+
The function object is invoked for each entity.
The signature of the function must be equivalent to the following form:
| Func | Type of the function object to invoke. |
Definition at line 427 of file observer.hpp.
+Definition at line 425 of file observer.hpp.
+ + + + +
+
|
+ +inline | +
Iterates entities and applies the given function object to them, then clears the observer.
+The function object is invoked for each entity.
+ The signature of the function must be equivalent to the following form:
| Func | Type of the function object to invoke. |
| func | A valid function object. |
Definition at line 405 of file observer.hpp.
Checks whether an observer is empty.
Definition at line 341 of file observer.hpp.
+Definition at line 339 of file observer.hpp.
@@ -527,43 +532,12 @@ template<typename Entity >The returned iterator points to the entity following the last entity of the observer. Attempting to dereference the returned iterator results in undefined behavior.
Definition at line 383 of file observer.hpp.
- - - - -
-
|
- -delete | -
Default copy assignment operator, deleted on purpose.
-Definition at line 381 of file observer.hpp.
Default move assignment operator, deleted on purpose.
+
|
+ +delete | +
Default copy assignment operator, deleted on purpose.
+Returns the number of elements in an observer.
Definition at line 333 of file observer.hpp.
+Definition at line 331 of file observer.hpp.
@@ -630,11 +635,12 @@ template<typename Entity >
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1basic__registry-members.html b/classentt_1_1basic__registry-members.html
index 10128bf9e..49407582c 100644
--- a/classentt_1_1basic__registry-members.html
+++ b/classentt_1_1basic__registry-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1basic__registry.html b/classentt_1_1basic__registry.html
index ebfe9e2ec..d5e4b80c9 100644
--- a/classentt_1_1basic__registry.html
+++ b/classentt_1_1basic__registry.html
@@ -1,9 +1,9 @@
-
+
-
+
Static Public Member Functions | |
| template<typename Component > | |
| static component | type () ENTT_NOEXCEPT |
| Returns the opaque identifier of a component. More... | |
| Returns the opaque identifier of a component. More... | |
| static entity_type | entity (const entity_type entity) ENTT_NOEXCEPT |
| Returns the entity identifier without the version. More... | |
| Returns the entity identifier without the version. More... | |
| static version_type | version (const entity_type entity) ENTT_NOEXCEPT |
| Returns the version stored along with an entity identifier. More... | |
| Returns the version stored along with an entity identifier. More... | |
Fast and reliable entity-component system.
-The registry is the core class of the entity-component framework.
+
The registry is the core class of the entity-component framework.
It stores entities and arranges pools of components on a per request basis. By means of a registry, users can manage entities and components and thus create views or groups to iterate them.
| Entity | A valid entity type (see entt_traits for more details). |
| Entity | A valid entity type (see entt_traits for more details). |
Assigns the given component to an entity.
A new instance of the given component is created and initialized with the arguments provided (the component must have a proper constructor or be of aggregate type). Then the component is assigned to the given entity.
-
-
|
- -inline | -
Assigns each element in a range an entity.
-The components must be at least move and default insertable. A compilation error will occur otherwhise.
-| Component | Types of components to assign to the entity. |
| It | Type of forward iterator. |
| first | An iterator to the first element of the range to generate. |
| last | An iterator past the last element of the range to generate. |
Definition at line 591 of file registry.hpp.
-Creates a new entity from a prototype entity.
-The components must be copyable for obvious reasons. The source entity must be a valid one.
+
The components must be copyable for obvious reasons. The source entity must be a valid one.
If no components are provided, the registry will try to copy all the existing types. The non-copyable ones will be ignored.
Definition at line 620 of file registry.hpp.
+ + + +
+
|
+ +inline | +
Assigns each element in a range an entity.
+The components must be at least move and default insertable. A compilation error will occur otherwhise.
+| Component | Types of components to assign to the entity. |
| It | Type of forward iterator. |
| first | An iterator to the first element of the range to generate. |
| last | An iterator past the last element of the range to generate. |
Definition at line 591 of file registry.hpp.
+Assigns each element in a range an entity from a prototype entity.
-The components must be copyable for obvious reasons. The entities must be all valid.
+
The components must be copyable for obvious reasons. The entities must be all valid.
If no components are provided, the registry will try to copy all the existing types. The non-copyable ones will be ignored.
Returns a reference to an object in the context of the registry.
-| It | Type of input iterator. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Func | Type of the function object to invoke. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
+
|
+ +inline | +
Returns a group for the given components.
+| Owned | Types of components owned by the group. |
| Exclude | Types of components used to filter the group. |
Definition at line 1468 of file registry.hpp.
+ +
+
|
+ +inline | +
Returns a group for the given components.
+| Owned | Types of components owned by the group. |
| Exclude | Types of components used to filter the group. |
Definition at line 1482 of file registry.hpp.
+Returns a group for the given components.
-This kind of objects are created on the fly and share with the registry its internal data structures.
- Feel free to discard a group after the use. Creating and destroying a group is an incredibly cheap operation because they do not require any type of initialization, but for the first time they are requested.
+
This kind of objects are created on the fly and share with the registry its internal data structures.
+ Feel free to discard a group after the use. Creating and destroying a group is an incredibly cheap operation because they do not require any type of initialization, but for the first time they are requested.
As a rule of thumb, storing a group should never be an option.
Groups support exclusion lists and can own types of components. The more types are owned by a group, the faster it is to iterate entities and components.
+
Groups support exclusion lists and can own types of components. The more types are owned by a group, the faster it is to iterate entities and components.
However, groups also affect some features of the registry such as the creation and destruction of components, which will consequently be slightly slower (nothing that can be noticed in most cases).
Returns a group for the given components.
-| Owned | Types of components owned by the group. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
-
|
- -inline | -
Returns a group for the given components.
-| Owned | Types of components owned by the group. |
| Exclude | Types of components used to filter the group. |
Definition at line 1468 of file registry.hpp.
- -
-
|
- -inline | -
Returns a group for the given components.
-| Owned | Types of components owned by the group. |
| Exclude | Types of components used to filter the group. |
Definition at line 1482 of file registry.hpp.
-Checks if an entity has all the given components.
-| Component | Type of component of which to get the sink. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Component | Type of component of which to get the sink. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Component | Type of component of which to get the sink. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Func | Type of the function object to invoke. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
-
|
- -inline | -
Resets the given component for an entity.
-If the entity has an instance of the component, this function removes the component from the entity. Otherwise it does nothing.
-| Component | Type of component to reset. |
| entity | A valid entity identifier. |
Definition at line 1136 of file registry.hpp.
-Definition at line 1172 of file registry.hpp.
+
+
|
+ +inline | +
Resets the given component for an entity.
+If the entity has an instance of the component, this function removes the component from the entity. Otherwise it does nothing.
+| Component | Type of component to reset. |
| entity | A valid entity identifier. |
Definition at line 1136 of file registry.hpp.
+Returns a runtime view for the given components.
-This kind of objects are created on the fly and share with the registry its internal data structures.
- Users should throw away the view after use. Fortunately, creating and destroying a runtime view is an incredibly cheap operation because they do not require any type of initialization.
+
This kind of objects are created on the fly and share with the registry its internal data structures.
+ Users should throw away the view after use. Fortunately, creating and destroying a runtime view is an incredibly cheap operation because they do not require any type of initialization.
As a rule of thumb, storing a view should never be an option.
Runtime views are to be used when users want to construct a view from some external inputs and don't know at compile-time what are the required components.
+
Runtime views are to be used when users want to construct a view from some external inputs and don't know at compile-time what are the required components.
This is particularly well suited to plugin systems and mods in general.
+
|
+ +inline | +
Sorts two pools of components in the same way.
+The order of the elements in a pool is highly affected by assignments of components to entities and deletions. Components are arranged to maximize the performance during iterations and users should not make any assumption on the order.
+It happens that different pools of components must be sorted the same way because of runtime and/or performance constraints. This function can be used to order a pool of components according to the order between the entities in another pool of components.
+How it works
+Being A and B the two sets where B is the master (the one the order of which rules) and A is the slave (the one to sort), after a call to this function an iterator for A will return the entities according to the following rules:
A that are also in B are returned first according to the order they have in B.A that are not in B are returned in no particular order after all the other entities.Any subsequent change to B won't affect the order in A.
| To | Type of components to sort. |
| From | Type of components to use to sort. |
Definition at line 1115 of file registry.hpp.
+Sorts the pool of entities for the given component.
-The order of the elements in a pool is highly affected by assignments of components to entities and deletions. Components are arranged to maximize the performance during iterations and users should not make any assumption on the order.
+
The order of the elements in a pool is highly affected by assignments of components to entities and deletions. Components are arranged to maximize the performance during iterations and users should not make any assumption on the order.
This function can be used to impose an order to the elements in the pool of the given component. The order is kept valid until a component of the given type is assigned or removed from an entity.
The comparison function object must return true if the first element is less than the second one, false otherwise. The signature of the comparison function should be equivalent to one of the following:
Moreover, the comparison function object shall induce a strict weak ordering on the values.
+Moreover, the comparison function object shall induce a strict weak ordering on the values.
The sort function oject must offer a member function template operator() that accepts three arguments:
The comparison funtion object received by the sort function object hasn't necessarily the type of the one passed along with the other parameters to this member function.
-
-
|
- -inline | -
Sorts two pools of components in the same way.
-The order of the elements in a pool is highly affected by assignments of components to entities and deletions. Components are arranged to maximize the performance during iterations and users should not make any assumption on the order.
-It happens that different pools of components must be sorted the same way because of runtime and/or performance constraints. This function can be used to order a pool of components according to the order between the entities in another pool of components.
-How it works
-Being A and B the two sets where B is the master (the one the order of which rules) and A is the slave (the one to sort), after a call to this function an iterator for A will return the entities according to the following rules:
A that are also in B are returned first according to the order they have in B.A that are not in B are returned in no particular order after all the other entities.Any subsequent change to B won't affect the order in A.
| To | Type of components to sort. |
| From | Type of components to use to sort. |
Definition at line 1115 of file registry.hpp.
-Stomps an entity and its components.
-The components must be copyable for obvious reasons. The entities must be both valid.
+
The components must be copyable for obvious reasons. The entities must be both valid.
If no components are provided, the registry will try to copy all the existing types. The non-copyable ones will be ignored.
This feature supports exclusion lists as an alternative to component lists. An excluded type will never be copied.
-| Component | Types of components to copy. | |||||||
Definition at line 332 of file registry.hpp.
@@ -3416,8 +3428,8 @@ template<typename... Component, typename... Exclude>Returns a view for the given components.
-This kind of objects are created on the fly and share with the registry its internal data structures.
- Feel free to discard a view after the use. Creating and destroying a view is an incredibly cheap operation because they do not require any type of initialization.
+
This kind of objects are created on the fly and share with the registry its internal data structures.
+ Feel free to discard a view after the use. Creating and destroying a view is an incredibly cheap operation because they do not require any type of initialization.
As a rule of thumb, storing a view should never be an option.
Views do their best to iterate the smallest set of candidate entities. In particular:
Views in no way affect the functionalities of the registry nor those of the underlying pools.
-|
EnTT
- 3.2.1
+ 3.2.2
|
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1basic__runtime__view.html b/classentt_1_1basic__runtime__view.html
index 0cc2b1a1b..c96b2fc24 100644
--- a/classentt_1_1basic__runtime__view.html
+++ b/classentt_1_1basic__runtime__view.html
@@ -1,9 +1,9 @@
-
+
-
+
@@ -128,8 +131,8 @@ class | sparse_set and its specializations for more details.
+ Runtime views iterate over those entities that have at least all the given components in their bags. During initialization, a runtime view looks at the number of entities available for each component and picks up a reference to the smallest set of candidate entities in order to get a performance boost when iterate. Important Iterators aren't invalidated if:
Returns an iterator to the first entity that has the given components. -The returned iterator points to the first entity that has the given components. If the view is empty, the returned iterator will be equal to The returned iterator points to the first entity that has the given components. If the view is empty, the returned iterator will be equal to Iterates entities and applies the given function object to them. -The function object is invoked for each entity. It is provided only with the entity itself. To get the components, users can use the registry with which the view was built. The function object is invoked for each entity. It is provided only with the entity itself. To get the components, users can use the registry with which the view was built. void(const entity_type); Generated by
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1basic__snapshot-members.html b/classentt_1_1basic__snapshot-members.html
index 311135ad7..cbaf3f2a3 100644
--- a/classentt_1_1basic__snapshot-members.html
+++ b/classentt_1_1basic__snapshot-members.html
@@ -1,9 +1,9 @@
-
+
-
+
| |||||||
|
EnTT
- 3.2.1
+ 3.2.2
|
||||||||
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1basic__snapshot.html b/classentt_1_1basic__snapshot.html
index d22be10f1..9953a4d90 100644
--- a/classentt_1_1basic__snapshot.html
+++ b/classentt_1_1basic__snapshot.html
@@ -1,9 +1,9 @@
-
+
-
+
@@ -115,11 +118,11 @@ class |
Generated by
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1basic__snapshot__loader-members.html b/classentt_1_1basic__snapshot__loader-members.html
index f9c430e1c..ea1246290 100644
--- a/classentt_1_1basic__snapshot__loader-members.html
+++ b/classentt_1_1basic__snapshot__loader-members.html
@@ -1,9 +1,9 @@
-
+
-
+
| |||||
|
EnTT
- 3.2.1
+ 3.2.2
|
||||||
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1basic__snapshot__loader.html b/classentt_1_1basic__snapshot__loader.html
index 1eee3e515..be3625f84 100644
--- a/classentt_1_1basic__snapshot__loader.html
+++ b/classentt_1_1basic__snapshot__loader.html
@@ -1,9 +1,9 @@
-
+
-
+
@@ -114,11 +117,11 @@ class |
Destroys those entities that have no components. -In case all the entities were serialized but only part of the components was saved, it could happen that some of the entities have no components once restored. In case all the entities were serialized but only part of the components was saved, it could happen that some of the entities have no components once restored.
Generated by
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1basic__storage-members.html b/classentt_1_1basic__storage-members.html
index 3fcd0d750..c4df2c0d4 100644
--- a/classentt_1_1basic__storage-members.html
+++ b/classentt_1_1basic__storage-members.html
@@ -1,9 +1,9 @@
-
+
-
+
| |||||
|
EnTT
- 3.2.1
+ 3.2.2
|
||||||
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1basic__storage.html b/classentt_1_1basic__storage.html
index c9924ab36..504c1cd8f 100644
--- a/classentt_1_1basic__storage.html
+++ b/classentt_1_1basic__storage.html
@@ -1,9 +1,9 @@
-
+
-
+
Public Member Functions |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| void | reserve (const size_type cap) | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Increases the capacity of a storage. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Increases the capacity of a storage. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| void | shrink_to_fit () | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Requests the removal of unused capacity. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| const object_type * | raw () const ENTT_NOEXCEPT | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Direct access to the array of objects. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Direct access to the array of objects. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| object_type * | raw () ENTT_NOEXCEPT | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Direct access to the array of objects. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Direct access to the array of objects. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| const_iterator_type | cbegin () const ENTT_NOEXCEPT | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Returns an iterator to the beginning. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Returns an iterator to the beginning. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| const_iterator_type | begin () const ENTT_NOEXCEPT | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Returns an iterator to the beginning. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Returns an iterator to the beginning. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| iterator_type | begin () ENTT_NOEXCEPT | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Returns an iterator to the beginning. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Returns an iterator to the beginning. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| const_iterator_type | cend () const ENTT_NOEXCEPT | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Returns an iterator to the end. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Returns an iterator to the end. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| const_iterator_type | end () const ENTT_NOEXCEPT | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Returns an iterator to the end. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Returns an iterator to the end. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| iterator_type | end () ENTT_NOEXCEPT | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Returns an iterator to the end. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Returns an iterator to the end. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| const object_type & | get (const entity_type entt) const ENTT_NOEXCEPT | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Returns the object associated with an entity. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Returns the object associated with an entity. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| object_type & | get (const entity_type entt) ENTT_NOEXCEPT | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Returns the object associated with an entity. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Returns the object associated with an entity. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| const object_type * | try_get (const entity_type entt) const ENTT_NOEXCEPT | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Returns a pointer to the object associated with an entity, if any. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Returns a pointer to the object associated with an entity, if any. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| object_type * | try_get (const entity_type entt) ENTT_NOEXCEPT | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Returns a pointer to the object associated with an entity, if any. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Returns a pointer to the object associated with an entity, if any. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| template<typename... Args> | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| object_type & | construct (const entity_type entt, Args &&... args) | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Assigns an entity to a storage and constructs its object. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Assigns an entity to a storage and constructs its object. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| template<typename It , typename... Args> | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| iterator_type | batch (It first, It last, Args &&... args) | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Assigns one or more entities to a storage and default constructs or copy constructs their objects. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Assigns one or more entities to a storage and default constructs or copy constructs their objects. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| void | destroy (const entity_type entt) | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Removes an entity from a storage and destroys its object. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Removes an entity from a storage and destroys its object. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| void | swap (const entity_type lhs, const entity_type rhs) ENTT_NOEXCEPT override | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Swaps entities and objects in the internal packed arrays. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Swaps entities and objects in the internal packed arrays. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| template<typename Compare , typename Sort = std_sort, typename... Args> | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| void | sort (iterator_type first, iterator_type last, Compare compare, Sort algo=Sort{}, Args &&... args) | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Sort elements according to the given comparison function. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Sort elements according to the given comparison function. More... | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| void | reset () | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Entity | A valid entity type (see entt_traits for more details). |
| Entity | A valid entity type (see entt_traits for more details). |
| Type | Type of objects assigned to the entities. |
Assigns one or more entities to a storage and default constructs or copy constructs their objects.
The object type must be at least move and default insertable if no arguments are provided, move and copy insertable otherwise.
-|
EnTT
- 3.2.1
+ 3.2.2
|
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1basic__storage_3_01Entity_00_01Type_00_01std_1_1enable__if__t_3_01ENTT__ENABLE__ETO_07Type_08_4_01_4.html b/classentt_1_1basic__storage_3_01Entity_00_01Type_00_01std_1_1enable__if__t_3_01ENTT__ENABLE__ETO_07Type_08_4_01_4.html
index 1c0018dc1..6bceb1596 100644
--- a/classentt_1_1basic__storage_3_01Entity_00_01Type_00_01std_1_1enable__if__t_3_01ENTT__ENABLE__ETO_07Type_08_4_01_4.html
+++ b/classentt_1_1basic__storage_3_01Entity_00_01Type_00_01std_1_1enable__if__t_3_01ENTT__ENABLE__ETO_07Type_08_4_01_4.html
@@ -1,9 +1,9 @@
-
+
-
+
Public Member Functions |
|||||||||
| iterator_type | cbegin () const ENTT_NOEXCEPT | ||||||||
| Returns an iterator to the beginning. More... | |||||||||
| Returns an iterator to the beginning. More... | |||||||||
| iterator_type | begin () const ENTT_NOEXCEPT | ||||||||
| Returns an iterator to the beginning. More... | |||||||||
| Returns an iterator to the beginning. More... | |||||||||
| iterator_type | cend () const ENTT_NOEXCEPT | ||||||||
| Returns an iterator to the end. More... | |||||||||
| Returns an iterator to the end. More... | |||||||||
| iterator_type | end () const ENTT_NOEXCEPT | ||||||||
| Returns an iterator to the end. More... | |||||||||
| Returns an iterator to the end. More... | |||||||||
| object_type | get ([[maybe_unused]] const entity_type entt) const ENTT_NOEXCEPT | ||||||||
| Returns the object associated with an entity. More... | |||||||||
| Returns the object associated with an entity. More... | |||||||||
| template<typename It > | |||||||||
| iterator_type | batch (It first, It last, const object_type &={}) | ||||||||
| Assigns one or more entities to a storage. More... | |||||||||
| Assigns one or more entities to a storage. More... | |||||||||
| template<typename Compare , typename Sort = std_sort, typename... Args> | |||||||||
| void | sort (iterator_type first, iterator_type last, Compare compare, Sort algo=Sort{}, Args &&... args) | ||||||||
| Sort elements according to the given comparison function. More... | |||||||||
| Sort elements according to the given comparison function. More... | |||||||||
 Public Member Functions inherited from entt::sparse_set< Entity > | |||||||||
@@ -249,10 +254,10 @@ class entt::basic_storage< Entity, Type, std::enable_if_t< ENTT_ENABLE_ETO
raw and size member functions for that). Use begin and end instead.
Assigns one or more entities to a storage. The object type must be at least default constructible. - | |||||||||
@@ -160,8 +163,8 @@ class | sparse_set for more details.
+ Multi component views iterate over those entities that have at least all the given components in their bags. During initialization, a multi component view looks at the number of entities available for each component and picks up a reference to the smallest set of candidate entities in order to get a performance boost when iterate. Important Iterators aren't invalidated if:
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
General purpose event emitter.
The emitter class template follows the CRTP idiom. To create a custom emitter type, derived classes must inherit directly from the base class as:
-Handlers for the type of events are created internally on the fly. It's not required to specify in advance the full list of accepted types.
+
Handlers for the type of events are created internally on the fly. It's not required to specify in advance the full list of accepted types.
Moreover, whenever an event is published, an emitter provides the listeners with a reference to itself along with a const reference to the event. Therefore listeners have an handy way to work with it without incurring in the need of capturing a reference to the emitter.
|
EnTT
- 3.2.1
+ 3.2.2
|
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1extended__meta__factory.html b/classentt_1_1extended__meta__factory.html
index 1dfa37e87..425affe50 100644
--- a/classentt_1_1extended__meta__factory.html
+++ b/classentt_1_1extended__meta__factory.html
@@ -1,9 +1,9 @@
-
+
-
+
Public Member Functions | |
| extended_meta_factory (entt::internal::meta_prop_node **target) | |
| Constructs an extended factory from a given node. More... | |
| Constructs an extended factory from a given node. More... | |
| template<typename PropertyOrKey , typename... Value> | |
| auto | prop (PropertyOrKey &&property_or_key, Value &&... value) && |
| Assigns a property to the last meta object created. More... | |
| Assigns a property to the last meta object created. More... | |
| template<typename... Property> | |
| auto | props (Property... property) && |
| Assigns properties to the last meta object created. More... | |
| Assigns properties to the last meta object created. More... | |
| Public Member Functions inherited from entt::meta_factory< Type > | |
| auto | type (const ENTT_ID_TYPE identifier) ENTT_NOEXCEPT |
|
EnTT
- 3.2.1
+ 3.2.2
|
|
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1family.html b/classentt_1_1family.html
index 6c1d305e7..7ae7f8f1c 100644
--- a/classentt_1_1family.html
+++ b/classentt_1_1family.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1handle-members.html b/classentt_1_1handle-members.html
index 7803f5107..4147c1eee 100644
--- a/classentt_1_1handle-members.html
+++ b/classentt_1_1handle-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1handle.html b/classentt_1_1handle.html
index 6422e5f03..1853c7ae7 100644
--- a/classentt_1_1handle.html
+++ b/classentt_1_1handle.html
@@ -1,9 +1,9 @@
-
+
-
+
@@ -123,7 +126,7 @@ struct |
- 1.8.13
+ | ||
|
EnTT
- 3.2.1
+ 3.2.2
|
|||
Types identifiers.
Variable template used to generate identifiers at compile-time for the given types. Use the get member function to know what's the identifier associated to the specific type.
| Types | List of types for which to generate identifiers. |
|
EnTT
- 3.2.1
+ 3.2.2
|
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1loader.html b/classentt_1_1loader.html
index d4a0b8429..aed54f6c0 100644
--- a/classentt_1_1loader.html
+++ b/classentt_1_1loader.html
@@ -1,9 +1,9 @@
-
+
-
+
In general, resource loaders should not have a state or retain data of any type. They should let the cache manage their resources instead.
+In general, resource loaders should not have a state or retain data of any type. They should let the cache manage their resources instead.
|
EnTT
- 3.2.1
+ 3.2.2
|
- 1.8.13
+@@ -170,16 +173,16 @@ class | A meta handle is allowed to inherit from a meta any. | |||
| void | swap (meta_any &lhs, meta_any &rhs) ENTT_NOEXCEPT | |||
| Swaps two meta any objects. More... | ||||
| Swaps two meta any objects. More... | ||||
Opaque container for values of any type.
-TURN_OFF_DOXYGEN This class uses a technique called small buffer optimization (SBO) to completely eliminate the need to allocate memory, where possible.
+
TURN_OFF_DOXYGEN This class uses a technique called small buffer optimization (SBO) to completely eliminate the need to allocate memory, where possible.
From the user's point of view, nothing will change, but the elimination of allocations will reduce the jumps in memory and therefore will avoid chasing of pointers. This will greatly improve the use of the cache, thus increasing the overall performance.
Definition at line 395 of file meta.hpp.
+Definition at line 394 of file meta.hpp.
@@ -276,7 +279,7 @@ template<typename Type > -Definition at line 417 of file meta.hpp.
+Definition at line 416 of file meta.hpp.
@@ -312,7 +315,7 @@ template<typename Type > -Definition at line 1773 of file meta.hpp.
+Definition at line 1772 of file meta.hpp.
@@ -356,7 +359,7 @@ template<typename Type , typename = std::enable_if_t<!std::is_same_v<s -Definition at line 436 of file meta.hpp.
+Definition at line 435 of file meta.hpp.
@@ -392,7 +395,7 @@ template<typename Type , typename = std::enable_if_t<!std::is_same_v<s -Definition at line 444 of file meta.hpp.
+Definition at line 443 of file meta.hpp.
@@ -429,7 +432,7 @@ template<typename Type , typename = std::enable_if_t<!std::is_same_v<s -Definition at line 463 of file meta.hpp.
+Definition at line 462 of file meta.hpp.
@@ -461,7 +464,7 @@ template<typename Type >Tries to cast an instance to a given type.
The type of the instance must be such that the cast is possible.
-
-
|
- -inline | -
+
|
+ +inline | +
Returns an opaque pointer to the contained instance.
Definition at line 517 of file meta.hpp.
+Definition at line 516 of file meta.hpp.
@@ -648,7 +651,7 @@ template<typename Type >Returns an opaque pointer to the contained instance.
Definition at line 522 of file meta.hpp.
+Definition at line 521 of file meta.hpp.
@@ -693,7 +696,7 @@ template<typename Type , typename... Args> -Definition at line 634 of file meta.hpp.
+Definition at line 633 of file meta.hpp.
@@ -723,12 +726,86 @@ template<typename Type , typename... Args>Returns false if a container is empty, true otherwise.
Definition at line 642 of file meta.hpp.
+Definition at line 641 of file meta.hpp.
+ + + + +Definition at line 652 of file meta.hpp.
+Definition at line 651 of file meta.hpp.
@@ -917,7 +920,7 @@ template<typename Type >Definition at line 532 of file meta.hpp.
+Definition at line 531 of file meta.hpp.
@@ -955,7 +958,7 @@ template<typename Type >Definition at line 551 of file meta.hpp.
+Definition at line 550 of file meta.hpp.
@@ -985,7 +988,7 @@ template<typename Type >Returns the meta type of the underlying object.
Definition at line 1781 of file meta.hpp.
+Definition at line 1780 of file meta.hpp.
@@ -1033,7 +1036,7 @@ template<typename Type > -Definition at line 661 of file meta.hpp.
+Definition at line 660 of file meta.hpp.
@@ -1045,7 +1048,7 @@ template<typename Type >
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1meta__factory-members.html b/classentt_1_1meta__factory-members.html
index 434298af6..6e5b8f9b5 100644
--- a/classentt_1_1meta__factory-members.html
+++ b/classentt_1_1meta__factory-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1meta__factory.html b/classentt_1_1meta__factory.html
index 80857aa49..7c5c8e36b 100644
--- a/classentt_1_1meta__factory.html
+++ b/classentt_1_1meta__factory.html
@@ -1,9 +1,9 @@
-
+
-
+
Public Member Functions | |
| auto | type (const ENTT_ID_TYPE identifier) ENTT_NOEXCEPT |
| Extends a meta type by assigning it an identifier. More... | |
| Extends a meta type by assigning it an identifier. More... | |
| auto | type () ENTT_NOEXCEPT |
| Extends a meta type by assigning it an identifier. More... | |
| Extends a meta type by assigning it an identifier. More... | |
| template<typename Base > | |
| auto | base () ENTT_NOEXCEPT |
| Assigns a meta base to a meta type. More... | |
| Assigns a meta base to a meta type. More... | |
| template<typename To > | |
| auto | conv () ENTT_NOEXCEPT |
| Assigns a meta conversion function to a meta type. More... | |
| Assigns a meta conversion function to a meta type. More... | |
| template<auto Candidate> | |
| auto | conv () ENTT_NOEXCEPT |
| Assigns a meta conversion function to a meta type. More... | |
| Assigns a meta conversion function to a meta type. More... | |
| template<auto Func, typename Policy = as_is_t> | |
| auto | ctor () ENTT_NOEXCEPT |
| Assigns a meta constructor to a meta type. More... | |
| Assigns a meta constructor to a meta type. More... | |
| template<typename... Args> | |
| auto | ctor () ENTT_NOEXCEPT |
| Assigns a meta constructor to a meta type. More... | |
| Assigns a meta constructor to a meta type. More... | |
| template<auto Func> | |
| auto | dtor () ENTT_NOEXCEPT |
| Assigns a meta destructor to a meta type. More... | |
| Assigns a meta destructor to a meta type. More... | |
| template<auto Data, typename Policy = as_is_t> | |
| auto | data (const ENTT_ID_TYPE identifier) ENTT_NOEXCEPT |
| Assigns a meta data to a meta type. More... | |
| Assigns a meta data to a meta type. More... | |
| template<auto Setter, auto Getter, typename Policy = as_is_t> | |
| auto | data (const ENTT_ID_TYPE identifier) ENTT_NOEXCEPT |
| Assigns a meta data to a meta type by means of its setter and getter. More... | |
| Assigns a meta data to a meta type by means of its setter and getter. More... | |
| template<auto Candidate, typename Policy = as_is_t> | |
| auto | func (const ENTT_ID_TYPE identifier) ENTT_NOEXCEPT |
| Assigns a meta funcion to a meta type. More... | |
| Assigns a meta funcion to a meta type. More... | |
| void | reset () ENTT_NOEXCEPT |
| Resets a meta type and all its parts. More... | |
| Resets a meta type and all its parts. More... | |
Assigns a meta conversion function to a meta type.
-Conversion functions can be either free functions or member functions.
+
Conversion functions can be either free functions or member functions.
In case of free functions, they must accept a const reference to an instance of the parent type as an argument. In case of member functions, they should have no arguments at all.
| Func | The actual function to use as a destructor. |
+
|
+ +inline | +
Extends a meta type by assigning it an identifier.
+This function is intended only for named types
+Definition at line 298 of file factory.hpp.
+Definition at line 286 of file factory.hpp.
-
-
|
- -inline | -
Extends a meta type by assigning it an identifier.
-This function is intended only for named types
-Definition at line 298 of file factory.hpp.
-
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4-members.html b/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4-members.html
index f2c9147ff..d6fb295b6 100644
--- a/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4-members.html
+++ b/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html b/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html
index 63b3ca21e..b1dafeea4 100644
--- a/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html
+++ b/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html
@@ -1,9 +1,9 @@
-
+
-
+
Public Member Functions | |
| meta_factory (entt::internal::meta_prop_node **target) ENTT_NOEXCEPT | |
| Constructs an extended factory from a given node. More... | |
| Constructs an extended factory from a given node. More... | |
| template<typename PropertyOrKey , typename... Value> | |
| auto | prop (PropertyOrKey &&property_or_key, Value &&... value) && |
| Assigns a property to the last meta object created. More... | |
| Assigns a property to the last meta object created. More... | |
| template<typename... Property> | |
| auto | props (Property... property) && |
| Assigns properties to the last meta object created. More... | |
| Assigns properties to the last meta object created. More... | |
| Public Member Functions inherited from entt::meta_factory< Type > | |
| auto | type (const ENTT_ID_TYPE identifier) ENTT_NOEXCEPT |
| Extends a meta type by assigning it an identifier. More... | |
| auto | type () ENTT_NOEXCEPT |
| Extends a meta type by assigning it an identifier. More... | |
| template<typename Base > | |
| auto | base () ENTT_NOEXCEPT |
| Assigns a meta base to a meta type. More... | |
| auto | func (const ENTT_ID_TYPE identifier) ENTT_NOEXCEPT |
| Assigns a meta funcion to a meta type. More... | |
| void | reset () ENTT_NOEXCEPT |
| Resets a meta type and all its parts. More... | |
| auto | reset () ENTT_NOEXCEPT |
| Resets a meta type and all its parts. More... | |
| auto | import (const ENTT_ID_TYPE identifier) ENTT_NOEXCEPT |
| Imports a meta type from another context. More... | |
Definition at line 257 of file factory.hpp.
+Definition at line 258 of file factory.hpp.
Definition at line 321 of file factory.hpp.
+Definition at line 322 of file factory.hpp.
@@ -262,7 +267,7 @@ template<typename PropertyOrKey , typename... Value>Definition at line 337 of file factory.hpp.
+Definition at line 338 of file factory.hpp.
@@ -310,7 +315,7 @@ template<typename... Property>Definition at line 358 of file factory.hpp.
+Definition at line 359 of file factory.hpp.
@@ -322,7 +327,7 @@ template<typename... Property>
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4__coll__graph.map b/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4__coll__graph.map
index c3d5d52ab..b590dfbd2 100644
--- a/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4__coll__graph.map
+++ b/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4__coll__graph.map
@@ -1,3 +1,4 @@
diff --git a/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4__coll__graph.md5 b/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4__coll__graph.md5
index 672a5a4eb..e88cc6148 100644
--- a/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4__coll__graph.md5
+++ b/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4__coll__graph.md5
@@ -1 +1 @@
-e42da18e4994c2cce985af821bdad4a5
\ No newline at end of file
+51c1ff244e342183fd6b133b0574beea
\ No newline at end of file
diff --git a/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4__inherit__graph.map b/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4__inherit__graph.map
index c3d5d52ab..b590dfbd2 100644
--- a/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4__inherit__graph.map
+++ b/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4__inherit__graph.map
@@ -1,3 +1,4 @@
diff --git a/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4__inherit__graph.md5 b/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4__inherit__graph.md5
index cca203568..e88cc6148 100644
--- a/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4__inherit__graph.md5
+++ b/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4__inherit__graph.md5
@@ -1 +1 @@
-d487d0ab2f91e50664a5063dad86f571
\ No newline at end of file
+51c1ff244e342183fd6b133b0574beea
\ No newline at end of file
diff --git a/classentt_1_1meta__factory_3_01Type_01_4-members.html b/classentt_1_1meta__factory_3_01Type_01_4-members.html
index 6b1a9691d..a023f893e 100644
--- a/classentt_1_1meta__factory_3_01Type_01_4-members.html
+++ b/classentt_1_1meta__factory_3_01Type_01_4-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1meta__factory_3_01Type_01_4.html b/classentt_1_1meta__factory_3_01Type_01_4.html
index fe699c3f5..d7b840aa6 100644
--- a/classentt_1_1meta__factory_3_01Type_01_4.html
+++ b/classentt_1_1meta__factory_3_01Type_01_4.html
@@ -1,9 +1,9 @@
-
+
-
+
Public Member Functions | |
| auto | type (const ENTT_ID_TYPE identifier) ENTT_NOEXCEPT |
| Extends a meta type by assigning it an identifier. More... | |
| Extends a meta type by assigning it an identifier. More... | |
| auto | type () ENTT_NOEXCEPT |
| Extends a meta type by assigning it an identifier. More... | |
| template<typename Base > | |
| auto | base () ENTT_NOEXCEPT |
| Assigns a meta base to a meta type. More... | |
| Assigns a meta base to a meta type. More... | |
| template<typename To > | |
| auto | conv () ENTT_NOEXCEPT |
| Assigns a meta conversion function to a meta type. More... | |
| Assigns a meta conversion function to a meta type. More... | |
| template<auto Candidate> | |
| auto | conv () ENTT_NOEXCEPT |
| Assigns a meta conversion function to a meta type. More... | |
| Assigns a meta conversion function to a meta type. More... | |
| template<auto Func, typename Policy = as_is_t> | |
| auto | ctor () ENTT_NOEXCEPT |
| Assigns a meta constructor to a meta type. More... | |
| Assigns a meta constructor to a meta type. More... | |
| template<typename... Args> | |
| auto | ctor () ENTT_NOEXCEPT |
| Assigns a meta constructor to a meta type. More... | |
| Assigns a meta constructor to a meta type. More... | |
| template<auto Func> | |
| auto | dtor () ENTT_NOEXCEPT |
| Assigns a meta destructor to a meta type. More... | |
| Assigns a meta destructor to a meta type. More... | |
| template<auto Data, typename Policy = as_is_t> | |
| auto | data (const ENTT_ID_TYPE identifier) ENTT_NOEXCEPT |
| Assigns a meta data to a meta type. More... | |
| Assigns a meta data to a meta type. More... | |
| template<auto Setter, auto Getter, typename Policy = as_is_t> | |
| auto | data (const ENTT_ID_TYPE identifier) ENTT_NOEXCEPT |
| Assigns a meta data to a meta type by means of its setter and getter. More... | |
| Assigns a meta data to a meta type by means of its setter and getter. More... | |
| template<auto Candidate, typename Policy = as_is_t> | |
| auto | func (const ENTT_ID_TYPE identifier) ENTT_NOEXCEPT |
| Assigns a meta funcion to a meta type. More... | |
| Assigns a meta funcion to a meta type. More... | |
| void | reset () ENTT_NOEXCEPT |
| Resets a meta type and all its parts. More... | |
| auto | reset () ENTT_NOEXCEPT |
| Resets a meta type and all its parts. More... | |
| auto | import (const ENTT_ID_TYPE identifier) ENTT_NOEXCEPT |
| Imports a meta type from another context. More... | |
Definition at line 373 of file factory.hpp.
+Definition at line 374 of file factory.hpp.
Definition at line 431 of file factory.hpp.
+Definition at line 412 of file factory.hpp.
@@ -224,7 +228,7 @@ template<typename To >Definition at line 461 of file factory.hpp.
+Definition at line 442 of file factory.hpp.
@@ -256,7 +260,7 @@ template<auto Candidate>Assigns a meta conversion function to a meta type.
-Conversion functions can be either free functions or member functions.
+
Conversion functions can be either free functions or member functions.
In case of free functions, they must accept a const reference to an instance of the parent type as an argument. In case of member functions, they should have no arguments at all.
| Func | The actual function to use as a destructor. | |||||||||||||||
|
+ +inline | + +
Imports a meta type from another context.
+| identifier | Unique identifier. |
Definition at line 820 of file factory.hpp.
+ +
+
-
-
Extends a meta type by assigning it an identifier. -This function is intended only for named types -
Definition at line 417 of file factory.hpp. +Definition at line 391 of file factory.hpp. Generated by
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1meta__factory_3_01Type_01_4__inherit__graph.map b/classentt_1_1meta__factory_3_01Type_01_4__inherit__graph.map
index 4ab66bc62..21163e8cc 100644
--- a/classentt_1_1meta__factory_3_01Type_01_4__inherit__graph.map
+++ b/classentt_1_1meta__factory_3_01Type_01_4__inherit__graph.map
@@ -1,3 +1,4 @@
diff --git a/classentt_1_1meta__factory_3_01Type_01_4__inherit__graph.md5 b/classentt_1_1meta__factory_3_01Type_01_4__inherit__graph.md5
index df3c1a92f..3fefb79e4 100644
--- a/classentt_1_1meta__factory_3_01Type_01_4__inherit__graph.md5
+++ b/classentt_1_1meta__factory_3_01Type_01_4__inherit__graph.md5
@@ -1 +1 @@
-743d722207b666bb58699659c207e1a4
\ No newline at end of file
+27dc25ce9201f29e8dbff9506b24bc24
\ No newline at end of file
diff --git a/classentt_1_1meta__factory__inherit__graph.map b/classentt_1_1meta__factory__inherit__graph.map
index b3569eb1e..6f0fc2645 100644
--- a/classentt_1_1meta__factory__inherit__graph.map
+++ b/classentt_1_1meta__factory__inherit__graph.map
@@ -1,3 +1,4 @@
diff --git a/classentt_1_1meta__factory__inherit__graph.md5 b/classentt_1_1meta__factory__inherit__graph.md5
index 430ce8c6f..8db2b5938 100644
--- a/classentt_1_1meta__factory__inherit__graph.md5
+++ b/classentt_1_1meta__factory__inherit__graph.md5
@@ -1 +1 @@
-aed6d9a53bc5d2756f29fe5d10eacd02
\ No newline at end of file
+4d46590c1a07b769f28201615029e0cf
\ No newline at end of file
diff --git a/classentt_1_1meta__handle-members.html b/classentt_1_1meta__handle-members.html
index 2bcd7fb71..955311316 100644
--- a/classentt_1_1meta__handle-members.html
+++ b/classentt_1_1meta__handle-members.html
@@ -1,9 +1,9 @@
-
+
-
+
|
EnTT
- 3.2.1
+ 3.2.2
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1meta__handle.html b/classentt_1_1meta__handle.html
index 43a529848..f3e8ce179 100644
--- a/classentt_1_1meta__handle.html
+++ b/classentt_1_1meta__handle.html
@@ -1,9 +1,9 @@
-
+
-
+
|
EnTT
- 3.2.1
+ 3.2.2
| ||||||||||||||
| Default constructor. | ||||||||||||||||
| meta_handle (meta_any &any) ENTT_NOEXCEPT | ||||||||||||||||
| Constructs a meta handle from a meta any object. More... | ||||||||||||||||
| Constructs a meta handle from a meta any object. More... | ||||||||||||||||
| template<typename Type , typename = std::enable_if_t<!std::is_same_v<std::remove_cv_t<std::remove_reference_t<Type>>, meta_handle>>> | ||||||||||||||||
| meta_handle (Type &obj) ENTT_NOEXCEPT | ||||||||||||||||
| Constructs a meta handle from a given instance. More... | ||||||||||||||||
| Constructs a meta handle from a given instance. More... | ||||||||||||||||
| meta_type | type () const ENTT_NOEXCEPT | |||||||||||||||
| Returns the meta type of the underlying object. More... | ||||||||||||||||
| Returns the meta type of the underlying object. More... | ||||||||||||||||
| const void * | data () const ENTT_NOEXCEPT | |||||||||||||||
| Returns an opaque pointer to the contained instance. More... | ||||||||||||||||
| Returns an opaque pointer to the contained instance. More... | ||||||||||||||||
| void * | data () ENTT_NOEXCEPT | |||||||||||||||
| Returns an opaque pointer to the contained instance. More... | ||||||||||||||||
| Returns an opaque pointer to the contained instance. More... | ||||||||||||||||
| operator bool () const ENTT_NOEXCEPT | ||||||||||||||||
| Returns false if a handle is empty, true otherwise. More... | ||||||||||||||||
| Returns false if a handle is empty, true otherwise. More... | ||||||||||||||||
@@ -114,7 +117,7 @@ class | Opaque pointers to instances of any type. A handle doesn't perform copies and isn't responsible for the contained object. It doesn't prolong the lifetime of the pointed instance. Users are responsible for ensuring that the target object remains alive for the entire interval of use of the handle. -Definition at line 701 of file meta.hpp. +Definition at line 700 of file meta.hpp. Constructor & Destructor Documentation◆ meta_handle() [1/2]@@ -148,7 +151,7 @@ class | Definition at line 716 of file meta.hpp.
+ Definition at line 715 of file meta.hpp. @@ -192,7 +195,7 @@ template<typename Type , typename = std::enable_if_t<!std::is_same_v<s -Definition at line 727 of file meta.hpp. +Definition at line 726 of file meta.hpp. @@ -223,7 +226,7 @@ template<typename Type , typename = std::enable_if_t<!std::is_same_v<sReturns an opaque pointer to the contained instance.
Definition at line 736 of file meta.hpp. +Definition at line 735 of file meta.hpp. @@ -253,7 +256,7 @@ template<typename Type , typename = std::enable_if_t<!std::is_same_v<sReturns an opaque pointer to the contained instance.
Definition at line 741 of file meta.hpp. +Definition at line 740 of file meta.hpp. @@ -283,7 +286,7 @@ template<typename Type , typename = std::enable_if_t<!std::is_same_v<sReturns false if a handle is empty, true otherwise.
Definition at line 749 of file meta.hpp. +Definition at line 748 of file meta.hpp. @@ -313,7 +316,7 @@ template<typename Type , typename = std::enable_if_t<!std::is_same_v<sReturns the meta type of the underlying object.
Definition at line 1786 of file meta.hpp. +Definition at line 1785 of file meta.hpp. @@ -325,7 +328,7 @@ template<typename Type , typename = std::enable_if_t<!std::is_same_v<sGenerated by
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1meta__type-members.html b/classentt_1_1meta__type-members.html
index 9e854437c..edfe5fcd9 100644
--- a/classentt_1_1meta__type-members.html
+++ b/classentt_1_1meta__type-members.html
@@ -1,9 +1,9 @@
-
+
-
+
| |
|
EnTT
- 3.2.1
+ 3.2.2
|
|||
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1meta__type.html b/classentt_1_1meta__type.html
index 82e624a20..7e5ac8908 100644
--- a/classentt_1_1meta__type.html
+++ b/classentt_1_1meta__type.html
@@ -1,9 +1,9 @@
-
+
-
+
+
|
+ +inline | +
-
|
- -inline | -
Definition at line 1672 of file meta.hpp.
+Definition at line 1671 of file meta.hpp.
+ + + + +
+
|
+ +inline | +
Returns the meta conversion function associated with a given type.
+Searches recursively among all the conversion functions of the given type.
+| Type | The type to use to search for a meta conversion function. |
-
-Returns the meta conversion function associated with a given type. -Searches recursively among all the conversion functions of the given type. -
Returns the meta constructor that accepts a given list of types of arguments. +
◆ ctor() [1/2]+◆ ctor() [2/2]- -◆ ctor() [2/2]+ +◆ data() [1/2]
-
-template<typename... Args>
-
Returns the meta constructor that accepts a given list of types of arguments. -
Returns the meta data associated with a given identifier. +Searches recursively among all the meta data of the given type. This means that the meta data of the base classes will also be inspected, if any. +
◆ data() [1/2]+◆ data() [2/2]- - -◆ data() [2/2]- -
-
@@ -634,7 +637,7 @@ template<typename Op >
-
-
-
Returns the meta data associated with a given identifier. -Searches recursively among all the meta data of the given type. This means that the meta data of the base classes will also be inspected, if any. -
Destroys an instance of the underlying type. -It must be possible to cast the instance to the underlying type. Otherwise, invoking the meta destructor results in an undefined behavior. It must be possible to cast the instance to the underlying type. Otherwise, invoking the meta destructor results in an undefined behavior.
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1process.html b/classentt_1_1process.html
index 8d1ab043d..877a6ec29 100644
--- a/classentt_1_1process.html
+++ b/classentt_1_1process.html
@@ -1,9 +1,9 @@
-
+
-
+
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
EnTT
- 3.2.1
+ 3.2.2
|
Protected Member Functions | |
| void | succeed () ENTT_NOEXCEPT |
| Terminates a process with success if it's still alive. More... | |
| Terminates a process with success if it's still alive. More... | |
| void | fail () ENTT_NOEXCEPT |
| Terminates a process with errors if it's still alive. More... | |
| Terminates a process with errors if it's still alive. More... | |
| void | pause () ENTT_NOEXCEPT |
| Stops a process if it's in a running state. More... | |
| Stops a process if it's in a running state. More... | |
| void | unpause () ENTT_NOEXCEPT |
| Restarts a process if it's paused. More... | |
| Restarts a process if it's paused. More... | |
Base class for processes.
-This class stays true to the CRTP idiom. Derived classes must specify what's the intended type for elapsed times.
+
This class stays true to the CRTP idiom. Derived classes must specify what's the intended type for elapsed times.
A process should expose publicly the following member functions whether required:
It's invoked once per tick until a process is explicitly aborted or it terminates either with or without errors. Even though it's not mandatory to declare this member function, as a rule of thumb each process should at least define it to work properly. The void * parameter is an opaque pointer to user data (if any) forwarded directly to the process during an update.
It's invoked once per tick until a process is explicitly aborted or it terminates either with or without errors. Even though it's not mandatory to declare this member function, as a rule of thumb each process should at least define it to work properly. The void * parameter is an opaque pointer to user data (if any) forwarded directly to the process during an update.
It's invoked when the process joins the running queue of a scheduler. This happens as soon as it's attached to the scheduler if the process is a top level one, otherwise when it replaces its parent if the process is a continuation.
+It's invoked when the process joins the running queue of a scheduler. This happens as soon as it's attached to the scheduler if the process is a top level one, otherwise when it replaces its parent if the process is a continuation.
It's invoked in case of success, immediately after an update and during the same tick.
+It's invoked in case of success, immediately after an update and during the same tick.
It's invoked in case of errors, immediately after an update and during the same tick.
+It's invoked in case of errors, immediately after an update and during the same tick.
It's invoked only if a process is explicitly aborted. There is no guarantee that it executes in the same tick, this depends solely on whether the process is aborted immediately or not.
+It's invoked only if a process is explicitly aborted. There is no guarantee that it executes in the same tick, this depends solely on whether the process is aborted immediately or not.
Derived classes can change the internal state of a process by invoking the succeed and fail protected member functions and even pause or unpause the process itself.
| Derived | Actual type of process that extends the class template. |
|
EnTT
- 3.2.1
+ 3.2.2
|
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1scheduler.html b/classentt_1_1scheduler.html
index d7669327f..f34a3bddf 100644
--- a/classentt_1_1scheduler.html
+++ b/classentt_1_1scheduler.html
@@ -1,9 +1,9 @@
-
+
-
+
Cooperative scheduler for processes.
A cooperative scheduler runs processes and helps managing their life cycles.
-Each process is invoked once per tick. If a process terminates, it's removed automatically from the scheduler and it's never invoked again.
+
Each process is invoked once per tick. If a process terminates, it's removed automatically from the scheduler and it's never invoked again.
A process can also have a child. In this case, the process is replaced with its child when it terminates if it returns with success. In case of errors, both the process and its child are discarded.
Example of use (pseudocode):
-In order to invoke all scheduled processes, call the update member function passing it the elapsed time to forward to the tasks.
In order to invoke all scheduled processes, call the update member function passing it the elapsed time to forward to the tasks.
| Delta | Type to use to provide elapsed time. | |
| Proc | Type of process to schedule. |
| Args | Types of arguments to use to initialize the process. |
| Func | Type of process to schedule. |
|
EnTT
- 3.2.1
+ 3.2.2
|
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_4-members.html b/classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_4-members.html
index a82e26022..4ea6329ee 100644
--- a/classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_4-members.html
+++ b/classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_4-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_4.html b/classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_4.html
index 2fef3f2cc..f7be69052 100644
--- a/classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_4.html
+++ b/classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_4.html
@@ -1,9 +1,9 @@
-
+
-
+
Public Member Functions | |
| size_type | size () const ENTT_NOEXCEPT |
| Number of listeners connected to the signal. More... | |
| Number of listeners connected to the signal. More... | |
| bool | empty () const ENTT_NOEXCEPT |
| Returns false if at least a listener is connected to the signal. More... | |
| Returns false if at least a listener is connected to the signal. More... | |
| void | publish (Args... args) const |
| Triggers a signal. More... | |
| Triggers a signal. More... | |
| template<typename Func > | |
| void | collect (Func func, Args... args) const |
| Collects return values from the listeners. More... | |
| Collects return values from the listeners. More... | |
@@ -339,7 +342,7 @@ template<typename Ret , typename... Args>
|
EnTT
- 3.2.1
+ 3.2.2
| |
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1sink_3_01Ret_07Args_8_8_8_08_4-members.html b/classentt_1_1sink_3_01Ret_07Args_8_8_8_08_4-members.html
index f7ced00b2..ec365950f 100644
--- a/classentt_1_1sink_3_01Ret_07Args_8_8_8_08_4-members.html
+++ b/classentt_1_1sink_3_01Ret_07Args_8_8_8_08_4-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1sink_3_01Ret_07Args_8_8_8_08_4.html b/classentt_1_1sink_3_01Ret_07Args_8_8_8_08_4.html
index b1c657503..6ce3c7bb4 100644
--- a/classentt_1_1sink_3_01Ret_07Args_8_8_8_08_4.html
+++ b/classentt_1_1sink_3_01Ret_07Args_8_8_8_08_4.html
@@ -1,9 +1,9 @@
-
+
-
+
Definition at line 341 of file sigh.hpp.
+ + + +
+
|
+ +inline | +
-
|
- -inline | -
Returns a sink that connects before a given member function or free function with payload.
-| Candidate | Member or free function to look for. |
| Type | Type of class or type of payload. |
| value_or_instance | A valid pointer that fits the purpose. |
Definition at line 403 of file sigh.hpp.
+ + + +
+
|
+ +inline | +
Returns a sink that connects before a given member function or free function with payload.
+| Candidate | Member or free function to look for. |
| Type | Type of class or type of payload. |
| value_or_instance | A valid pointer that fits the purpose. |
-
|
- -inline | -
Connects a member function or a free function with payload to a signal.
-The signal isn't responsible for the connected object or the payload. Users must always guarantee that the lifetime of the instance overcomes the one of the delegate. On the other side, the signal handler performs checks to avoid multiple connections for the same function.
+
The signal isn't responsible for the connected object or the payload. Users must always guarantee that the lifetime of the instance overcomes the one of the delegate. On the other side, the signal handler performs checks to avoid multiple connections for the same function.
When used to connect a free function with payload, its signature must be such that the instance is the first argument before the ones used to define the delegate itself.
+
|
+ +inline | +
-
|
- -inline | -
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1sparse__set-members.html b/classentt_1_1sparse__set-members.html
index 4eb39e6a4..ff26f72f4 100644
--- a/classentt_1_1sparse__set-members.html
+++ b/classentt_1_1sparse__set-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/classentt_1_1sparse__set.html b/classentt_1_1sparse__set.html
index e548a5599..8d450ff02 100644
--- a/classentt_1_1sparse__set.html
+++ b/classentt_1_1sparse__set.html
@@ -1,9 +1,9 @@
-
+
-
+
| Default constructor. | |||||||
| sparse_set (const sparse_set &other) | |||||||
| Copy constructor. More... | |||||||
| Copy constructor. More... | |||||||
| sparse_set (sparse_set &&)=default | Default destructor. |
||||||
| sparse_set & | operator= (const sparse_set &other) | ||||||
| Copy assignment operator. More... | |||||||
| Copy assignment operator. More... | |||||||
| sparse_set & | operator= (sparse_set &&)=default | ||||||
| Default move assignment operator. More... | |||||||
| Default move assignment operator. More... | |||||||
| void | reserve (const size_type cap) | ||||||
| Increases the capacity of a sparse set. More... | |||||||
| Increases the capacity of a sparse set. More... | |||||||
| size_type | capacity () const ENTT_NOEXCEPT | ||||||
| Returns the number of elements that a sparse set has currently allocated space for. More... | |||||||
| Returns the number of elements that a sparse set has currently allocated space for. More... | |||||||
| void | shrink_to_fit () | ||||||
| Requests the removal of unused capacity. | |||||||
| size_type | extent () const ENTT_NOEXCEPT | ||||||
| Returns the extent of a sparse set. More... | |||||||
| Returns the extent of a sparse set. More... | |||||||
| size_type | size () const ENTT_NOEXCEPT | ||||||
| Returns the number of elements in a sparse set. More... | |||||||
| Returns the number of elements in a sparse set. More... | |||||||
| bool | empty () const ENTT_NOEXCEPT | ||||||
| Checks whether a sparse set is empty. More... | |||||||
| Checks whether a sparse set is empty. More... | |||||||
| const entity_type * | data () const ENTT_NOEXCEPT | ||||||
| Direct access to the internal packed array. More... | |||||||
| Direct access to the internal packed array. More... | |||||||
| iterator_type | begin () const ENTT_NOEXCEPT | ||||||
| Returns an iterator to the beginning. More... | |||||||
| Returns an iterator to the beginning. More... | |||||||
| iterator_type | end () const ENTT_NOEXCEPT | ||||||
| Returns an iterator to the end. More... | |||||||
| Returns an iterator to the end. More... | |||||||
| iterator_type | find (const entity_type entt) const ENTT_NOEXCEPT | ||||||
| Finds an entity. More... | |||||||
| Finds an entity. More... | |||||||
| bool | has (const entity_type entt) const ENTT_NOEXCEPT | ||||||
| Checks if a sparse set contains an entity. More... | |||||||
| Checks if a sparse set contains an entity. More... | |||||||
| size_type | index (const entity_type entt) const ENTT_NOEXCEPT | ||||||
| Returns the position of an entity in a sparse set. More... | |||||||
| Returns the position of an entity in a sparse set. More... | |||||||
| void | construct (const entity_type entt) | ||||||
| Assigns an entity to a sparse set. More... | |||||||
| Assigns an entity to a sparse set. More... | |||||||
| template<typename It > | |||||||
| void | batch (It first, It last) | ||||||
| Assigns one or more entities to a sparse set. More... | |||||||
| Assigns one or more entities to a sparse set. More... | |||||||
| void | destroy (const entity_type entt) | ||||||
| Removes an entity from a sparse set. More... | |||||||
| Removes an entity from a sparse set. More... | |||||||
| virtual void | swap (const entity_type lhs, const entity_type rhs) ENTT_NOEXCEPT | ||||||
| Swaps two entities in the internal packed array. More... | |||||||
| Swaps two entities in the internal packed array. More... | |||||||
| template<typename Compare , typename Sort = std_sort, typename... Args> | |||||||
| void | sort (iterator_type first, iterator_type last, Compare compare, Sort algo=Sort{}, Args &&... args) | ||||||
| Sort elements according to the given comparison function. More... | |||||||
| Sort elements according to the given comparison function. More... | |||||||
| template<typename Apply , typename Compare , typename Sort = std_sort, typename... Args> | |||||||
| void | arrange (iterator_type first, iterator_type last, Apply apply, Compare compare, Sort algo=Sort{}, Args &&... args) | ||||||
| Sort elements according to the given comparison function. More... | |||||||
| Sort elements according to the given comparison function. More... | |||||||
| void | respect (const sparse_set &other) ENTT_NOEXCEPT | ||||||
| Sort entities according to their order in another sparse set. More... | |||||||
| Sort entities according to their order in another sparse set. More... | |||||||
| void | reset () | data and size member functions for that). Use begin and end instead.
Sort elements according to the given comparison function. -
This function is a slightly slower version of
This function is a slightly slower version of The signature of the callback should be equivalent to the following: -bool(const Entity, const Entity);
|
|||||
|
EnTT
- 3.2.1
+ 3.2.2
|
|||||||
- 1.8.13
+
- 1.8.13
+ 1.8.16
diff --git a/dir_85dbee8884f1b3a817fa7eff8dff73ec.html b/dir_85dbee8884f1b3a817fa7eff8dff73ec.html
index f240fca92..4d4892721 100644
--- a/dir_85dbee8884f1b3a817fa7eff8dff73ec.html
+++ b/dir_85dbee8884f1b3a817fa7eff8dff73ec.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/dir_a53318306f6ac0f7fe657839abd543ab.html b/dir_a53318306f6ac0f7fe657839abd543ab.html
index 1ea4f3e1e..6ed160221 100644
--- a/dir_a53318306f6ac0f7fe657839abd543ab.html
+++ b/dir_a53318306f6ac0f7fe657839abd543ab.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/dir_b64489a1e8130d5ebf6d86d282f500f0.html b/dir_b64489a1e8130d5ebf6d86d282f500f0.html
index 1afa3e955..7bdecdc55 100644
--- a/dir_b64489a1e8130d5ebf6d86d282f500f0.html
+++ b/dir_b64489a1e8130d5ebf6d86d282f500f0.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/dir_c183064df1291357db1d38c637c6e87c.html b/dir_c183064df1291357db1d38c637c6e87c.html
new file mode 100644
index 000000000..dc5473f97
--- /dev/null
+++ b/dir_c183064df1291357db1d38c637c6e87c.html
@@ -0,0 +1,81 @@
+
+
+
+
+
+
+
+|
+ EnTT
+ 3.2.2
+
+ |
+
+ 1.8.16
+
+
+
diff --git a/dir_c5715f7ee899854a669b87bbaa642de0.html b/dir_c5715f7ee899854a669b87bbaa642de0.html
index 81f990b09..9424fd757 100644
--- a/dir_c5715f7ee899854a669b87bbaa642de0.html
+++ b/dir_c5715f7ee899854a669b87bbaa642de0.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/dir_caf434cd0cc634da803ab3b40811fcd6.html b/dir_caf434cd0cc634da803ab3b40811fcd6.html
new file mode 100644
index 000000000..74ae1d59a
--- /dev/null
+++ b/dir_caf434cd0cc634da803ab3b40811fcd6.html
@@ -0,0 +1,81 @@
+
+
+
+
+
+
+
+|
+ EnTT
+ 3.2.2
+
+ |
+
+ 1.8.16
+
+
+
diff --git a/dir_de8f4e6ba3f54a2a21309f742e93a373.html b/dir_de8f4e6ba3f54a2a21309f742e93a373.html
index 3edf0ee6f..d173933e2 100644
--- a/dir_de8f4e6ba3f54a2a21309f742e93a373.html
+++ b/dir_de8f4e6ba3f54a2a21309f742e93a373.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/dir_e3a7bb56c55e5c2286e2fe96e197d4f5.html b/dir_e3a7bb56c55e5c2286e2fe96e197d4f5.html
index 9700b7b60..cd077bae2 100644
--- a/dir_e3a7bb56c55e5c2286e2fe96e197d4f5.html
+++ b/dir_e3a7bb56c55e5c2286e2fe96e197d4f5.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/dispatcher_8hpp_source.html b/dispatcher_8hpp_source.html
index ffde4d3e8..fad7d00f1 100644
--- a/dispatcher_8hpp_source.html
+++ b/dispatcher_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/doxygen.css b/doxygen.css
index 4f1ab9195..5bc13aac5 100644
--- a/doxygen.css
+++ b/doxygen.css
@@ -1,4 +1,4 @@
-/* The standard CSS for doxygen 1.8.13 */
+/* The standard CSS for doxygen 1.8.16 */
body, table, div, p, dl {
font: 400 14px/22px Roboto,sans-serif;
@@ -53,11 +53,13 @@ dt {
font-weight: bold;
}
-div.multicol {
+ul.multicol {
-moz-column-gap: 1em;
-webkit-column-gap: 1em;
+ column-gap: 1em;
-moz-column-count: 3;
-webkit-column-count: 3;
+ column-count: 3;
}
p.startli, p.startdd {
@@ -80,6 +82,15 @@ p.endtd {
margin-bottom: 2px;
}
+p.interli {
+}
+
+p.interdd {
+}
+
+p.intertd {
+}
+
/* @end */
caption {
@@ -134,12 +145,12 @@ a.qindex {
a.qindexHL {
font-weight: bold;
background-color: #9CAFD4;
- color: #ffffff;
+ color: #FFFFFF;
border: 1px double #869DCA;
}
.contents a.qindexHL:visited {
- color: #ffffff;
+ color: #FFFFFF;
}
a.el {
@@ -163,6 +174,25 @@ dl.el {
margin-left: -1cm;
}
+ul {
+ overflow: hidden; /*Fixed: list item bullets overlap floating elements*/
+}
+
+#side-nav ul {
+ overflow: visible; /* reset ul rule for scroll bar in GENERATE_TREEVIEW window */
+}
+
+#main-nav ul {
+ overflow: visible; /* reset ul rule for the navigation bar drop down lists */
+}
+
+.fragment {
+ text-align: left;
+ direction: ltr;
+ overflow-x: auto; /*Fixed: fragment lines overlap floating elements*/
+ overflow-y: hidden;
+}
+
pre.fragment {
border: 1px solid #C4CFE5;
background-color: #FBFCFD;
@@ -177,8 +207,8 @@ pre.fragment {
}
div.fragment {
- padding: 0px;
- margin: 4px 8px 4px 2px;
+ padding: 0 0 1px 0; /*Fixed: last line underline overlap border*/
+ margin: 4px 8px 4px 2px;
background-color: #FBFCFD;
border: 1px solid #C4CFE5;
}
@@ -248,7 +278,7 @@ span.lineno a:hover {
div.ah, span.ah {
background-color: black;
font-weight: bold;
- color: #ffffff;
+ color: #FFFFFF;
margin-bottom: 3px;
margin-top: 3px;
padding: 0.2em;
@@ -324,7 +354,7 @@ img.formulaDsp {
}
-img.formulaInl {
+img.formulaInl, img.inline {
vertical-align: middle;
}
@@ -402,6 +432,13 @@ blockquote {
padding: 0 12px 0 16px;
}
+blockquote.DocNodeRTL {
+ border-left: 0;
+ border-right: 2px solid #9CAFD4;
+ margin: 0 4px 0 24px;
+ padding: 0 16px 0 12px;
+}
+
/* @end */
/*
@@ -666,17 +703,17 @@ dl.reflist dd {
padding-left: 0px;
}
-.params .paramname, .retval .paramname {
+.params .paramname, .retval .paramname, .tparams .paramname, .exception .paramname {
font-weight: bold;
vertical-align: top;
}
-.params .paramtype {
+.params .paramtype, .tparams .paramtype {
font-style: italic;
vertical-align: top;
}
-.params .paramdir {
+.params .paramdir, .tparams .paramdir {
font-family: "courier new",courier,monospace;
vertical-align: top;
}
@@ -1081,72 +1118,143 @@ div.headertitle
padding: 5px 5px 5px 10px;
}
-dl
-{
- padding: 0 0 0 10px;
+.PageDocRTL-title div.headertitle {
+ text-align: right;
+ direction: rtl;
}
-/* dl.note, dl.warning, dl.attention, dl.pre, dl.post, dl.invariant, dl.deprecated, dl.todo, dl.test, dl.bug */
-dl.section
-{
+dl {
+ padding: 0 0 0 0;
+}
+
+/* dl.note, dl.warning, dl.attention, dl.pre, dl.post, dl.invariant, dl.deprecated, dl.todo, dl.test, dl.bug, dl.examples */
+dl.section {
margin-left: 0px;
padding-left: 0px;
}
-dl.note
-{
- margin-left:-7px;
- padding-left: 3px;
- border-left:4px solid;
- border-color: #D0C000;
+dl.section.DocNodeRTL {
+ margin-right: 0px;
+ padding-right: 0px;
}
-dl.warning, dl.attention
-{
- margin-left:-7px;
- padding-left: 3px;
- border-left:4px solid;
- border-color: #FF0000;
+dl.note {
+ margin-left: -7px;
+ padding-left: 3px;
+ border-left: 4px solid;
+ border-color: #D0C000;
}
-dl.pre, dl.post, dl.invariant
-{
- margin-left:-7px;
- padding-left: 3px;
- border-left:4px solid;
- border-color: #00D000;
+dl.note.DocNodeRTL {
+ margin-left: 0;
+ padding-left: 0;
+ border-left: 0;
+ margin-right: -7px;
+ padding-right: 3px;
+ border-right: 4px solid;
+ border-color: #D0C000;
}
-dl.deprecated
-{
- margin-left:-7px;
- padding-left: 3px;
- border-left:4px solid;
- border-color: #505050;
+dl.warning, dl.attention {
+ margin-left: -7px;
+ padding-left: 3px;
+ border-left: 4px solid;
+ border-color: #FF0000;
}
-dl.todo
-{
- margin-left:-7px;
- padding-left: 3px;
- border-left:4px solid;
- border-color: #00C0E0;
+dl.warning.DocNodeRTL, dl.attention.DocNodeRTL {
+ margin-left: 0;
+ padding-left: 0;
+ border-left: 0;
+ margin-right: -7px;
+ padding-right: 3px;
+ border-right: 4px solid;
+ border-color: #FF0000;
}
-dl.test
-{
- margin-left:-7px;
- padding-left: 3px;
- border-left:4px solid;
- border-color: #3030E0;
+dl.pre, dl.post, dl.invariant {
+ margin-left: -7px;
+ padding-left: 3px;
+ border-left: 4px solid;
+ border-color: #00D000;
}
-dl.bug
-{
- margin-left:-7px;
- padding-left: 3px;
- border-left:4px solid;
- border-color: #C08050;
+dl.pre.DocNodeRTL, dl.post.DocNodeRTL, dl.invariant.DocNodeRTL {
+ margin-left: 0;
+ padding-left: 0;
+ border-left: 0;
+ margin-right: -7px;
+ padding-right: 3px;
+ border-right: 4px solid;
+ border-color: #00D000;
+}
+
+dl.deprecated {
+ margin-left: -7px;
+ padding-left: 3px;
+ border-left: 4px solid;
+ border-color: #505050;
+}
+
+dl.deprecated.DocNodeRTL {
+ margin-left: 0;
+ padding-left: 0;
+ border-left: 0;
+ margin-right: -7px;
+ padding-right: 3px;
+ border-right: 4px solid;
+ border-color: #505050;
+}
+
+dl.todo {
+ margin-left: -7px;
+ padding-left: 3px;
+ border-left: 4px solid;
+ border-color: #00C0E0;
+}
+
+dl.todo.DocNodeRTL {
+ margin-left: 0;
+ padding-left: 0;
+ border-left: 0;
+ margin-right: -7px;
+ padding-right: 3px;
+ border-right: 4px solid;
+ border-color: #00C0E0;
+}
+
+dl.test {
+ margin-left: -7px;
+ padding-left: 3px;
+ border-left: 4px solid;
+ border-color: #3030E0;
+}
+
+dl.test.DocNodeRTL {
+ margin-left: 0;
+ padding-left: 0;
+ border-left: 0;
+ margin-right: -7px;
+ padding-right: 3px;
+ border-right: 4px solid;
+ border-color: #3030E0;
+}
+
+dl.bug {
+ margin-left: -7px;
+ padding-left: 3px;
+ border-left: 4px solid;
+ border-color: #C08050;
+}
+
+dl.bug.DocNodeRTL {
+ margin-left: 0;
+ padding-left: 0;
+ border-left: 0;
+ margin-right: -7px;
+ padding-right: 3px;
+ border-right: 4px solid;
+ border-color: #C08050;
}
dl.section dd {
@@ -1263,6 +1371,11 @@ div.toc {
width: 200px;
}
+.PageDocRTL-title div.toc {
+ float: left !important;
+ text-align: right;
+}
+
div.toc li {
background: url("bdwn.png") no-repeat scroll 0 5px transparent;
font: 10px/1.2 Verdana,DejaVu Sans,Geneva,sans-serif;
@@ -1271,6 +1384,12 @@ div.toc li {
padding-top: 2px;
}
+.PageDocRTL-title div.toc li {
+ background-position-x: right !important;
+ padding-left: 0 !important;
+ padding-right: 10px;
+}
+
div.toc h3 {
font: bold 12px/1.2 Arial,FreeSans,sans-serif;
color: #4665A2;
@@ -1300,6 +1419,26 @@ div.toc li.level4 {
margin-left: 45px;
}
+.PageDocRTL-title div.toc li.level1 {
+ margin-left: 0 !important;
+ margin-right: 0;
+}
+
+.PageDocRTL-title div.toc li.level2 {
+ margin-left: 0 !important;
+ margin-right: 15px;
+}
+
+.PageDocRTL-title div.toc li.level3 {
+ margin-left: 0 !important;
+ margin-right: 30px;
+}
+
+.PageDocRTL-title div.toc li.level4 {
+ margin-left: 0 !important;
+ margin-right: 45px;
+}
+
.inherit_header {
font-weight: bold;
color: gray;
@@ -1413,7 +1552,7 @@ tr.heading h2 {
}
#powerTip.n:after, #powerTip.ne:after, #powerTip.nw:after {
- border-top-color: #ffffff;
+ border-top-color: #FFFFFF;
border-width: 10px;
margin: 0px -10px;
}
@@ -1441,7 +1580,7 @@ tr.heading h2 {
}
#powerTip.s:after, #powerTip.se:after, #powerTip.sw:after {
- border-bottom-color: #ffffff;
+ border-bottom-color: #FFFFFF;
border-width: 10px;
margin: 0px -10px;
}
@@ -1468,7 +1607,7 @@ tr.heading h2 {
left: 100%;
}
#powerTip.e:after {
- border-left-color: #ffffff;
+ border-left-color: #FFFFFF;
border-width: 10px;
top: 50%;
margin-top: -10px;
@@ -1484,7 +1623,7 @@ tr.heading h2 {
right: 100%;
}
#powerTip.w:after {
- border-right-color: #ffffff;
+ border-right-color: #FFFFFF;
border-width: 10px;
top: 50%;
margin-top: -10px;
@@ -1592,5 +1731,36 @@ th.markdownTableHeadCenter, td.markdownTableBodyCenter {
text-align: center
}
+.DocNodeRTL {
+ text-align: right;
+ direction: rtl;
+}
+.DocNodeLTR {
+ text-align: left;
+ direction: ltr;
+}
+
+table.DocNodeRTL {
+ width: auto;
+ margin-right: 0;
+ margin-left: auto;
+}
+
+table.DocNodeLTR {
+ width: auto;
+ margin-right: auto;
+ margin-left: 0;
+}
+
+tt, code, kbd, samp
+{
+ display: inline-block;
+ direction:ltr;
+}
/* @end */
+
+u {
+ text-decoration: underline;
+}
+
diff --git a/dynsections.js b/dynsections.js
index 1e6bf07f9..c8e84aaa6 100644
--- a/dynsections.js
+++ b/dynsections.js
@@ -1,3 +1,26 @@
+/*
+ @licstart The following is the entire license notice for the
+ JavaScript code in this file.
+
+ Copyright (C) 1997-2017 by Dimitri van Heesch
+
+ This program is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 2 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License along
+ with this program; if not, write to the Free Software Foundation, Inc.,
+ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
+
+ @licend The above is the entire license notice
+ for the JavaScript code in this file
+ */
function toggleVisibility(linkObj)
{
var base = $(linkObj).attr('id');
@@ -15,7 +38,7 @@ function toggleVisibility(linkObj)
summary.hide();
$(linkObj).removeClass('closed').addClass('opened');
$(trigger).attr('src',src.substring(0,src.length-10)+'open.png');
- }
+ }
return false;
}
@@ -94,11 +117,11 @@ function toggleInherit(id)
$(img).attr('src',src.substring(0,src.length-10)+'open.png');
}
}
-
+/* @license-end */
$(document).ready(function() {
$('.code,.codeRef').each(function() {
- $(this).data('powertip',$('#'+$(this).attr('href').replace(/.*\//,'').replace(/[^a-z_A-Z0-9]/g,'_')).html());
+ $(this).data('powertip',$('#a'+$(this).attr('href').replace(/.*\//,'').replace(/[^a-z_A-Z0-9]/g,'_')).html());
$(this).powerTip({ placement: 's', smartPlacement: true, mouseOnToPopup: true });
});
});
diff --git a/emitter_8hpp_source.html b/emitter_8hpp_source.html
index fbe0db91d..5f2fd4a18 100644
--- a/emitter_8hpp_source.html
+++ b/emitter_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/entity_2fwd_8hpp_source.html b/entity_2fwd_8hpp_source.html
index 75923c557..239c623d5 100644
--- a/entity_2fwd_8hpp_source.html
+++ b/entity_2fwd_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/entity_2utility_8hpp_source.html b/entity_2utility_8hpp_source.html
index 1e6eb54a8..e1672a817 100644
--- a/entity_2utility_8hpp_source.html
+++ b/entity_2utility_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/entity_8hpp_source.html b/entity_8hpp_source.html
index d1fd045e4..18adc588d 100644
--- a/entity_8hpp_source.html
+++ b/entity_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/entity_8md_source.html b/entity_8md_source.html
deleted file mode 100644
index 76b3535c4..000000000
--- a/entity_8md_source.html
+++ /dev/null
@@ -1,74 +0,0 @@
-
-
-
-
-
-
-
-|
- EnTT
- 3.2.1
-
- |
-
- 1.8.13
-
-
-
diff --git a/entt_8hpp_source.html b/entt_8hpp_source.html
index c695bf00d..c5c24ccb3 100644
--- a/entt_8hpp_source.html
+++ b/entt_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/factory_8hpp_source.html b/factory_8hpp_source.html
index 5be1acc72..9a3f79ed7 100644
--- a/factory_8hpp_source.html
+++ b/factory_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/family_8hpp_source.html b/family_8hpp_source.html
index 223407a44..fc34756f8 100644
--- a/family_8hpp_source.html
+++ b/family_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/faq_8md_source.html b/faq_8md_source.html
deleted file mode 100644
index 583f4707b..000000000
--- a/faq_8md_source.html
+++ /dev/null
@@ -1,74 +0,0 @@
-
-
-
-
-
-
-
-|
- EnTT
- 3.2.1
-
- |
-
- 1.8.13
-
-
-
diff --git a/files.html b/files.html
index 4e6c8b4da..4f869e359 100644
--- a/files.html
+++ b/files.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions.html b/functions.html
index e1df3b01c..8633d88c4 100644
--- a/functions.html
+++ b/functions.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_b.html b/functions_b.html
index 9cc425041..5a7173da4 100644
--- a/functions_b.html
+++ b/functions_b.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_c.html b/functions_c.html
index 775cc470b..19f4dc80c 100644
--- a/functions_c.html
+++ b/functions_c.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_d.html b/functions_d.html
index 68ada7af5..b859d1712 100644
--- a/functions_d.html
+++ b/functions_d.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_e.html b/functions_e.html
index 75c5a15d2..6592b240c 100644
--- a/functions_e.html
+++ b/functions_e.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_f.html b/functions_f.html
index 0f3d8d087..fb4df22d8 100644
--- a/functions_f.html
+++ b/functions_f.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_func.html b/functions_func.html
index 5b9f17a10..7464644ff 100644
--- a/functions_func.html
+++ b/functions_func.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_func_b.html b/functions_func_b.html
index 4f9eebcd4..c9a7c7d4a 100644
--- a/functions_func_b.html
+++ b/functions_func_b.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_func_c.html b/functions_func_c.html
index 3fc6171ba..49d7064d5 100644
--- a/functions_func_c.html
+++ b/functions_func_c.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_func_d.html b/functions_func_d.html
index f33011019..3a616ffca 100644
--- a/functions_func_d.html
+++ b/functions_func_d.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_func_e.html b/functions_func_e.html
index 39a3e5730..de34bcd65 100644
--- a/functions_func_e.html
+++ b/functions_func_e.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_func_f.html b/functions_func_f.html
index 736ec051c..b88b3e0aa 100644
--- a/functions_func_f.html
+++ b/functions_func_f.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_func_g.html b/functions_func_g.html
index 1838c4167..d5a6f4cea 100644
--- a/functions_func_g.html
+++ b/functions_func_g.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_func_h.html b/functions_func_h.html
index 20a2b8f87..4c27ac560 100644
--- a/functions_func_h.html
+++ b/functions_func_h.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_func_i.html b/functions_func_i.html
index 66a996602..565b169f3 100644
--- a/functions_func_i.html
+++ b/functions_func_i.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_func_k.html b/functions_func_k.html
index 8e2e1d0b2..a47a976d6 100644
--- a/functions_func_k.html
+++ b/functions_func_k.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_func_l.html b/functions_func_l.html
index 9038ed8d4..f7b707dd8 100644
--- a/functions_func_l.html
+++ b/functions_func_l.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_func_m.html b/functions_func_m.html
index 6a351b976..fa178d057 100644
--- a/functions_func_m.html
+++ b/functions_func_m.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_func_n.html b/functions_func_n.html
new file mode 100644
index 000000000..f6bf0d61f
--- /dev/null
+++ b/functions_func_n.html
@@ -0,0 +1,80 @@
+
+
+
+
+
+
+
+|
+ EnTT
+ 3.3.0
+
+ |
+
+ 1.8.16
+
+
+
diff --git a/functions_func_o.html b/functions_func_o.html
index 5130d9263..9c3a225e7 100644
--- a/functions_func_o.html
+++ b/functions_func_o.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_func_p.html b/functions_func_p.html
index 83d845be8..48a501715 100644
--- a/functions_func_p.html
+++ b/functions_func_p.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_func_r.html b/functions_func_r.html
index ede202891..d3f37f945 100644
--- a/functions_func_r.html
+++ b/functions_func_r.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_func_s.html b/functions_func_s.html
index aa49ef40a..0dbb3c20e 100644
--- a/functions_func_s.html
+++ b/functions_func_s.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_func_t.html b/functions_func_t.html
index 8ca7b33d5..ebb1b7274 100644
--- a/functions_func_t.html
+++ b/functions_func_t.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_func_u.html b/functions_func_u.html
index d243f99de..81b9fff99 100644
--- a/functions_func_u.html
+++ b/functions_func_u.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_func_v.html b/functions_func_v.html
index acc5311c9..8580d35a6 100644
--- a/functions_func_v.html
+++ b/functions_func_v.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_func_w.html b/functions_func_w.html
index fcbd5ad9c..a99afa94d 100644
--- a/functions_func_w.html
+++ b/functions_func_w.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_func_y.html b/functions_func_y.html
index 175f77ab0..d724a3a12 100644
--- a/functions_func_y.html
+++ b/functions_func_y.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_func_0x7e.html b/functions_func_~.html
similarity index 87%
rename from functions_func_0x7e.html
rename to functions_func_~.html
index ebaddda35..3fa35375e 100644
--- a/functions_func_0x7e.html
+++ b/functions_func_~.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_g.html b/functions_g.html
index 23bc91f15..f594f97ac 100644
--- a/functions_g.html
+++ b/functions_g.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_h.html b/functions_h.html
index c620897c9..a6d6bb29e 100644
--- a/functions_h.html
+++ b/functions_h.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_i.html b/functions_i.html
index c203b6e66..6a9d9b902 100644
--- a/functions_i.html
+++ b/functions_i.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_k.html b/functions_k.html
index 5d8816400..6dc1639b0 100644
--- a/functions_k.html
+++ b/functions_k.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_l.html b/functions_l.html
index aa9d5a2e9..3e8a88b0a 100644
--- a/functions_l.html
+++ b/functions_l.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_m.html b/functions_m.html
index 45b473f23..a928b02da 100644
--- a/functions_m.html
+++ b/functions_m.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_n.html b/functions_n.html
new file mode 100644
index 000000000..85d3e348d
--- /dev/null
+++ b/functions_n.html
@@ -0,0 +1,80 @@
+
+
+
+
+
+
+
+|
+ EnTT
+ 3.3.0
+
+ |
+
+ 1.8.16
+
+
+
diff --git a/functions_o.html b/functions_o.html
index cb26fdfa5..e1950d602 100644
--- a/functions_o.html
+++ b/functions_o.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_p.html b/functions_p.html
index 7e4e0af35..55a7f3de8 100644
--- a/functions_p.html
+++ b/functions_p.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_r.html b/functions_r.html
index 12b90428a..193eb5df5 100644
--- a/functions_r.html
+++ b/functions_r.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_rela.html b/functions_rela.html
index b7804e0fe..7b2e810e6 100644
--- a/functions_rela.html
+++ b/functions_rela.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_s.html b/functions_s.html
index c63ec0250..0a0f03457 100644
--- a/functions_s.html
+++ b/functions_s.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_t.html b/functions_t.html
index 09dc87e35..626f76758 100644
--- a/functions_t.html
+++ b/functions_t.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_type.html b/functions_type.html
index 82d14a917..adbb972f7 100644
--- a/functions_type.html
+++ b/functions_type.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_u.html b/functions_u.html
index 707f078f7..4702c032f 100644
--- a/functions_u.html
+++ b/functions_u.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_v.html b/functions_v.html
index 0df6fc79e..e5cf89ebe 100644
--- a/functions_v.html
+++ b/functions_v.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_vars.html b/functions_vars.html
index bb3806dff..132117ffb 100644
--- a/functions_vars.html
+++ b/functions_vars.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_w.html b/functions_w.html
index 070a33b7a..bf377e902 100644
--- a/functions_w.html
+++ b/functions_w.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_y.html b/functions_y.html
index dd47e0647..d9463d189 100644
--- a/functions_y.html
+++ b/functions_y.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/functions_0x7e.html b/functions_~.html
similarity index 87%
rename from functions_0x7e.html
rename to functions_~.html
index 7581fd386..dd2fdc52a 100644
--- a/functions_0x7e.html
+++ b/functions_~.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/fwd_8hpp_source.html b/fwd_8hpp_source.html
index 5681a59e1..369ba3173 100644
--- a/fwd_8hpp_source.html
+++ b/fwd_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/graph_legend.html b/graph_legend.html
index 4b599bb1f..33764d7f9 100644
--- a/graph_legend.html
+++ b/graph_legend.html
@@ -1,9 +1,9 @@
-
+
-
+
This page explains how to interpret the graphs that are generated by doxygen.
-Consider the following example:
This will result in the following graph:
-
-The boxes in the above graph have the following meaning:
+Consider the following example:
This will result in the following graph:
+The boxes in the above graph have the following meaning:
- 1.8.13
+ 1.8.16
diff --git a/graph_legend.md5 b/graph_legend.md5
index a06ed050c..3b4f8ab28 100644
--- a/graph_legend.md5
+++ b/graph_legend.md5
@@ -1 +1 @@
-387ff8eb65306fa251338d3c9bd7bfff
\ No newline at end of file
+2779a1676ca72f29ac6dddfb5b5a4bb2
\ No newline at end of file
diff --git a/group_8hpp_source.html b/group_8hpp_source.html
index da03e450b..73b8b7894 100644
--- a/group_8hpp_source.html
+++ b/group_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/handle_8hpp_source.html b/handle_8hpp_source.html
index 568e320e4..1a19f3574 100644
--- a/handle_8hpp_source.html
+++ b/handle_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/hashed__string_8hpp_source.html b/hashed__string_8hpp_source.html
index 3cdb845c0..7f0840b4c 100644
--- a/hashed__string_8hpp_source.html
+++ b/hashed__string_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/helper_8hpp_source.html b/helper_8hpp_source.html
index 372904093..efbf25c8c 100644
--- a/helper_8hpp_source.html
+++ b/helper_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/hierarchy.html b/hierarchy.html
index 9ec1aef88..4a0ea8074 100644
--- a/hierarchy.html
+++ b/hierarchy.html
@@ -1,9 +1,9 @@
-
+
-
+
std::sort in a class type
- 1.8.13
+ 1.8.16
diff --git a/ident_8hpp_source.html b/ident_8hpp_source.html
index 842f93804..3c1702d62 100644
--- a/ident_8hpp_source.html
+++ b/ident_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/index.html b/index.html
index fb55fc53b..2e8f45812 100644
--- a/index.html
+++ b/index.html
@@ -1,9 +1,9 @@
-
+
-
+
-
The entity-component-system (also known as ECS) is an architectural pattern used mostly in game development. For further details:
@@ -74,7 +75,7 @@ IntroductionThis project started off as a pure entity-component system. Over time the codebase has grown as more and more classes and functionalities were added.
+
This project started off as a pure entity-component system. Over time the codebase has grown as more and more classes and functionalities were added.
Here is a brief, yet incomplete list of what it offers today:
Consider this list a work in progress as well as the project. The whole API is fully documented in-code for those who are brave enough to read it.
-Currently, EnTT is tested on Linux, Microsoft Windows and OSX. It has proven to work also on both Android and iOS.
+
Currently, EnTT is tested on Linux, Microsoft Windows and OSX. It has proven to work also on both Android and iOS.
Most likely it won't be problematic on other systems as well, but it hasn't been sufficiently tested so far.
I started developing EnTT for the wrong reason: my goal was to design an entity-component system to beat another well known open source solution both in terms of performance and possibly memory usage.
+
I started developing EnTT for the wrong reason: my goal was to design an entity-component system to beat another well known open source solution both in terms of performance and possibly memory usage.
In the end, I did it, but it wasn't very satisfying. Actually it wasn't satisfying at all. The fastest and nothing more, fairly little indeed. When I realized it, I tried hard to keep intact the great performance of EnTT and to add all the features I wanted to see in my own library at the same time.
Nowadays, EnTT is finally what I was looking for: still faster than its competitors, lower memory usage in the average case, a really good API and an amazing set of features. And even more, of course.
The proposed entity-component system is incredibly fast to iterate entities and components, this is a fact. Some compilers make a lot of optimizations because of how EnTT works, some others aren't that good. In general, if we consider real world cases, EnTT is somewhere between a bit and much faster than many of the other solutions around, although I couldn't check them all for obvious reasons.
If you are interested, you can compile the benchmark test in release mode (to enable compiler optimizations, otherwise it would make little sense) by setting the BUILD_BENCHMARK option of CMake to ON, then evaluate yourself whether you're satisfied with the results or not.
Honestly I got tired of updating the README file whenever there is an improvement.
+
Honestly I got tired of updating the README file whenever there is an improvement.
There are already a lot of projects out there that use EnTT as a basis for comparison (this should already tell you a lot). Many of these benchmarks are completely wrong, many others are simply incomplete, good at omitting some information and using the wrong function to compare a given feature. Certainly there are also good ones but they age quickly if nobody updates them, especially when the library they are dealing with is actively developed.
The choice to use EnTT should be based on its carefully designed API, its set of features and the general performance, not because some single benchmark shows it to be the fastest tool available.
In the future I'll likely try to get even better performance while still adding new features, mainly for fun.
+
In the future I'll likely try to get even better performance while still adding new features, mainly for fun.
If you want to contribute and/or have suggestions, feel free to make a PR or open an issue to discuss your idea.
To be able to use EnTT, users must provide a full-featured compiler that supports at least C++17.
+
To be able to use EnTT, users must provide a full-featured compiler that supports at least C++17.
The requirements below are mandatory to compile the tests and to extract the documentation:
CMake version 3.2 or later.Doxygen version 1.8 or later.Alternatively, Bazel is also supported as a build system (credits to zaucy who introduced what's required with this pull request and offered to maintain it).
+
Alternatively, Bazel is also supported as a build system (credits to zaucy who introduced what's required with this pull request and offered to maintain it).
In the documentation below I'll still refer to CMake, this being the official build system of the library.
If you are looking for a C++14 version of EnTT, check out the git tag cpp14.
EnTT is a header-only library. This means that including the entt.hpp header is enough to include the library as a whole and use it. For those who are interested only in the entity-component system, consider to include the sole entity/registry.hpp header instead.
+
EnTT is a header-only library. This means that including the entt.hpp header is enough to include the library as a whole and use it. For those who are interested only in the entity-component system, consider to include the sole entity/registry.hpp header instead.
It's a matter of adding the following line to the top of a file:
Use the line below to include only the entity-component system instead:
-Then pass the proper -I argument to the compiler to add the src directory to the include paths.
Use the line below to include only the entity-component system instead:
+Then pass the proper -I argument to the compiler to add the src directory to the include paths.
The documentation is based on doxygen. To build it:
$ cd build @@ -138,7 +195,7 @@ $ make $ your_favorite_browser docs/html/index.html
To compile and run the tests, EnTT requires googletest.
+
To compile and run the tests, EnTT requires googletest.
cmake will download and compile the library before compiling anything else. In order to build the tests, set the CMake option BUILD_TESTING to ON.
To build the most basic set of tests:
EnTT is available for some of the most known packaging tools. In particular:
Conan, the C/C++ Package Manager for Developers.vcpkg, Microsoft VC++ Packaging Tool.vcpkg, Microsoft VC++ Packaging Tool.EnTT in just a few simple steps:The EnTT port in vcpkg is kept up to date by Microsoft team members and community contributors.
+
The EnTT port in vcpkg is kept up to date by Microsoft team members and community contributors.
If the version is out of date, please create an issue or pull request on the vcpkg repository.
Homebrew, the missing package manager for macOS.Homebrew, the missing package manager for macOS.Consider this list a work in progress and help me to make it longer.
+Consider this list a work in progress and help me to make it longer.
Code and documentation Copyright (c) 2017-2019 Michele Caini.
+
Code and documentation Copyright (c) 2017-2019 Michele Caini.
Logo Copyright (c) 2018-2019 Richard Caseres.
Code released under the MIT license. Documentation released under CC BY 4.0.
+
Code released under the MIT license. Documentation released under CC BY 4.0.
Logo released under CC BY-SA 4.0.
- 1.8.13
+ 1.8.16
diff --git a/inherit_graph_0.map b/inherit_graph_0.map
index beac9c1a6..ccc069519 100644
--- a/inherit_graph_0.map
+++ b/inherit_graph_0.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_0.md5 b/inherit_graph_0.md5
index 5a91ff6a3..30c9fbe4c 100644
--- a/inherit_graph_0.md5
+++ b/inherit_graph_0.md5
@@ -1 +1 @@
-410a709be0e4a5b04471624294ae1c32
\ No newline at end of file
+bf079e0be44f26b7e8712d5d94d33544
\ No newline at end of file
diff --git a/inherit_graph_1.map b/inherit_graph_1.map
index 3cfa468fe..1552819cf 100644
--- a/inherit_graph_1.map
+++ b/inherit_graph_1.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_1.md5 b/inherit_graph_1.md5
index 8fba7300d..8011a2d8d 100644
--- a/inherit_graph_1.md5
+++ b/inherit_graph_1.md5
@@ -1 +1 @@
-f4bdbf9a3db74093cba8790a25eb25f4
\ No newline at end of file
+d7adef1b27f9b0d0683042686258abbf
\ No newline at end of file
diff --git a/inherit_graph_10.map b/inherit_graph_10.map
index dd39e3ae8..ea9478218 100644
--- a/inherit_graph_10.map
+++ b/inherit_graph_10.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_10.md5 b/inherit_graph_10.md5
index 142bde0ab..67d02220c 100644
--- a/inherit_graph_10.md5
+++ b/inherit_graph_10.md5
@@ -1 +1 @@
-48c5d770a367ac43e2634067fec3cf5e
\ No newline at end of file
+f0f9e6cff1c2f251e0ec7b299dc2a436
\ No newline at end of file
diff --git a/inherit_graph_11.map b/inherit_graph_11.map
index ca4dea280..6a946de74 100644
--- a/inherit_graph_11.map
+++ b/inherit_graph_11.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_11.md5 b/inherit_graph_11.md5
index 446349ff6..a1ba3f80e 100644
--- a/inherit_graph_11.md5
+++ b/inherit_graph_11.md5
@@ -1 +1 @@
-dc4e3c43ab9dfe21f6f054faf40f74c3
\ No newline at end of file
+5851209ff6e5bb7ded0c76471b407c55
\ No newline at end of file
diff --git a/inherit_graph_12.map b/inherit_graph_12.map
index 428977737..3ae317a56 100644
--- a/inherit_graph_12.map
+++ b/inherit_graph_12.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_12.md5 b/inherit_graph_12.md5
index 433dec8d5..851d1be7f 100644
--- a/inherit_graph_12.md5
+++ b/inherit_graph_12.md5
@@ -1 +1 @@
-db6b1fba475fa21600fc88fc05b0933d
\ No newline at end of file
+a63707ba594808d52d6ac900e6de4340
\ No newline at end of file
diff --git a/inherit_graph_13.map b/inherit_graph_13.map
index 6345cf3a3..cb6cf43c1 100644
--- a/inherit_graph_13.map
+++ b/inherit_graph_13.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_13.md5 b/inherit_graph_13.md5
index 486c61a43..0abef8b16 100644
--- a/inherit_graph_13.md5
+++ b/inherit_graph_13.md5
@@ -1 +1 @@
-63520fb90a491e4b1fe079a08cb235e7
\ No newline at end of file
+3b0dc35a8039cbbd0653291da6421591
\ No newline at end of file
diff --git a/inherit_graph_14.map b/inherit_graph_14.map
index 0835b365d..19baa27a5 100644
--- a/inherit_graph_14.map
+++ b/inherit_graph_14.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_14.md5 b/inherit_graph_14.md5
index be4eb3461..d069ea964 100644
--- a/inherit_graph_14.md5
+++ b/inherit_graph_14.md5
@@ -1 +1 @@
-af0b010c1c62f6dadc7f6c2b925967ca
\ No newline at end of file
+70dc47da1a0add5d49870b038bf5c2f0
\ No newline at end of file
diff --git a/inherit_graph_15.map b/inherit_graph_15.map
index a50858843..3e24dc794 100644
--- a/inherit_graph_15.map
+++ b/inherit_graph_15.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_15.md5 b/inherit_graph_15.md5
index 9b4d3b7c8..55eed0d78 100644
--- a/inherit_graph_15.md5
+++ b/inherit_graph_15.md5
@@ -1 +1 @@
-e6b9be63a8f214f5456c5f9a1c76dbe1
\ No newline at end of file
+9d30d0c7896e203585fe512d719115f9
\ No newline at end of file
diff --git a/inherit_graph_16.map b/inherit_graph_16.map
index 336a43db3..3e722aeba 100644
--- a/inherit_graph_16.map
+++ b/inherit_graph_16.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_16.md5 b/inherit_graph_16.md5
index 48d479506..54ec77305 100644
--- a/inherit_graph_16.md5
+++ b/inherit_graph_16.md5
@@ -1 +1 @@
-630d9140fe3ff785fe4689a9434f0daa
\ No newline at end of file
+74e3d3575f4ab7117008117499e89e23
\ No newline at end of file
diff --git a/inherit_graph_17.map b/inherit_graph_17.map
index c96d9aa87..d5eb57ba5 100644
--- a/inherit_graph_17.map
+++ b/inherit_graph_17.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_17.md5 b/inherit_graph_17.md5
index 60dc209aa..04b667883 100644
--- a/inherit_graph_17.md5
+++ b/inherit_graph_17.md5
@@ -1 +1 @@
-8b9bbcdb006a68b13b13b198ff843d09
\ No newline at end of file
+850659062015bf402f1bfa310c7a38fa
\ No newline at end of file
diff --git a/inherit_graph_18.map b/inherit_graph_18.map
index fad5d2b78..8a5225246 100644
--- a/inherit_graph_18.map
+++ b/inherit_graph_18.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_18.md5 b/inherit_graph_18.md5
index 5c4d5789a..5ce090831 100644
--- a/inherit_graph_18.md5
+++ b/inherit_graph_18.md5
@@ -1 +1 @@
-dffcbdd14e8c5179f66da4867d59cb3e
\ No newline at end of file
+6986377c67085231043f117e4db98845
\ No newline at end of file
diff --git a/inherit_graph_19.map b/inherit_graph_19.map
index 21be30f41..a0871422a 100644
--- a/inherit_graph_19.map
+++ b/inherit_graph_19.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_19.md5 b/inherit_graph_19.md5
index 34baedc18..75c6cdc01 100644
--- a/inherit_graph_19.md5
+++ b/inherit_graph_19.md5
@@ -1 +1 @@
-ed1335c52727f112c98593c9bb6cc7b9
\ No newline at end of file
+fc1a347d9fa74100769b2e1bca016a2b
\ No newline at end of file
diff --git a/inherit_graph_2.map b/inherit_graph_2.map
index abb1444b5..031aeffc8 100644
--- a/inherit_graph_2.map
+++ b/inherit_graph_2.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_2.md5 b/inherit_graph_2.md5
index 18a32a653..6c11c2c72 100644
--- a/inherit_graph_2.md5
+++ b/inherit_graph_2.md5
@@ -1 +1 @@
-fd7e5c71aac2fa8d9880c327b302f07f
\ No newline at end of file
+5807f00042d09c8d7d8b084223baa8e1
\ No newline at end of file
diff --git a/inherit_graph_20.map b/inherit_graph_20.map
index efb52fb27..d73b46252 100644
--- a/inherit_graph_20.map
+++ b/inherit_graph_20.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_20.md5 b/inherit_graph_20.md5
index 17c343846..9dbcbb8e9 100644
--- a/inherit_graph_20.md5
+++ b/inherit_graph_20.md5
@@ -1 +1 @@
-14c95f951ac4ac05c51b95c7f080de60
\ No newline at end of file
+7015cb846be8cfed43229cbb75e46c68
\ No newline at end of file
diff --git a/inherit_graph_21.map b/inherit_graph_21.map
index 043199ae8..adfce9eb6 100644
--- a/inherit_graph_21.map
+++ b/inherit_graph_21.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_21.md5 b/inherit_graph_21.md5
index fb10c4a3a..0d848f10d 100644
--- a/inherit_graph_21.md5
+++ b/inherit_graph_21.md5
@@ -1 +1 @@
-776fc4632b42a403aafd854f54d0e009
\ No newline at end of file
+fdd665a02a56c1444d85912aab9ab490
\ No newline at end of file
diff --git a/inherit_graph_22.map b/inherit_graph_22.map
index fd0af91d4..013ddaf0b 100644
--- a/inherit_graph_22.map
+++ b/inherit_graph_22.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_22.md5 b/inherit_graph_22.md5
index eb295459c..54a7ed74e 100644
--- a/inherit_graph_22.md5
+++ b/inherit_graph_22.md5
@@ -1 +1 @@
-6b71817c594535144caf37512529b952
\ No newline at end of file
+2838b14b173c96e5bfac80bb9ca340bf
\ No newline at end of file
diff --git a/inherit_graph_23.map b/inherit_graph_23.map
index 8b9aaa7ba..8c8d2d69d 100644
--- a/inherit_graph_23.map
+++ b/inherit_graph_23.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_23.md5 b/inherit_graph_23.md5
index 2649496a1..adaa09da5 100644
--- a/inherit_graph_23.md5
+++ b/inherit_graph_23.md5
@@ -1 +1 @@
-b4ce0d2a6dae4677fede38b7e7afb3c1
\ No newline at end of file
+a85fce3e7a164dcc45839eebe9cceaaf
\ No newline at end of file
diff --git a/inherit_graph_24.map b/inherit_graph_24.map
index d8cc7c633..9e51841da 100644
--- a/inherit_graph_24.map
+++ b/inherit_graph_24.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_24.md5 b/inherit_graph_24.md5
index cc2997ed5..38a837ba4 100644
--- a/inherit_graph_24.md5
+++ b/inherit_graph_24.md5
@@ -1 +1 @@
-cc3e7e56eeaeef4960d91d84bb2f8d67
\ No newline at end of file
+c5901b19b636a1bfc079230d75c82021
\ No newline at end of file
diff --git a/inherit_graph_25.map b/inherit_graph_25.map
index c3171fe75..887fd0cec 100644
--- a/inherit_graph_25.map
+++ b/inherit_graph_25.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_25.md5 b/inherit_graph_25.md5
index 21e99f024..c66feed88 100644
--- a/inherit_graph_25.md5
+++ b/inherit_graph_25.md5
@@ -1 +1 @@
-d58ebed400ed559ebfa29149bd48e30c
\ No newline at end of file
+49e791c1edeb10b0b5043aa57360d7a3
\ No newline at end of file
diff --git a/inherit_graph_26.map b/inherit_graph_26.map
index 040f6cd2d..c317666f3 100644
--- a/inherit_graph_26.map
+++ b/inherit_graph_26.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_26.md5 b/inherit_graph_26.md5
index f38442367..16f443bc2 100644
--- a/inherit_graph_26.md5
+++ b/inherit_graph_26.md5
@@ -1 +1 @@
-f3d3e793f2e53d14c1a7da42d7115bbf
\ No newline at end of file
+ba02c371a07999b60a6a594e76432037
\ No newline at end of file
diff --git a/inherit_graph_27.map b/inherit_graph_27.map
index d8fd19b58..b60cc169f 100644
--- a/inherit_graph_27.map
+++ b/inherit_graph_27.map
@@ -1,4 +1,4 @@
diff --git a/inherit_graph_27.md5 b/inherit_graph_27.md5
index f19bf7256..e9e4257a2 100644
--- a/inherit_graph_27.md5
+++ b/inherit_graph_27.md5
@@ -1 +1 @@
-245b1eb331c51f48749d531a25501872
\ No newline at end of file
+155dab9e72a5e4188ffb175696b2ffa9
\ No newline at end of file
diff --git a/inherit_graph_28.map b/inherit_graph_28.map
index 8e7383ffe..a0f5bfb83 100644
--- a/inherit_graph_28.map
+++ b/inherit_graph_28.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_28.md5 b/inherit_graph_28.md5
index def13ade1..61a7d990e 100644
--- a/inherit_graph_28.md5
+++ b/inherit_graph_28.md5
@@ -1 +1 @@
-83b9f0e926e95b955f447a2b793991de
\ No newline at end of file
+6c7da3eee6c8abaf6d4d3d417b870b0a
\ No newline at end of file
diff --git a/inherit_graph_29.map b/inherit_graph_29.map
index f914a0523..d75f18d59 100644
--- a/inherit_graph_29.map
+++ b/inherit_graph_29.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_29.md5 b/inherit_graph_29.md5
index a562c1461..5e3311cfa 100644
--- a/inherit_graph_29.md5
+++ b/inherit_graph_29.md5
@@ -1 +1 @@
-7ecb79bda70b1375451851a01b7fb935
\ No newline at end of file
+09922e1f687dbf59c4d49a553a055e3d
\ No newline at end of file
diff --git a/inherit_graph_3.map b/inherit_graph_3.map
index 31a8ca038..968240c0b 100644
--- a/inherit_graph_3.map
+++ b/inherit_graph_3.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_3.md5 b/inherit_graph_3.md5
index 4fe6c5170..18cb471e3 100644
--- a/inherit_graph_3.md5
+++ b/inherit_graph_3.md5
@@ -1 +1 @@
-643b0c5706c0314b13af48323d8bc656
\ No newline at end of file
+9e45cc064174e0a8aa3c1564d05176d5
\ No newline at end of file
diff --git a/inherit_graph_30.map b/inherit_graph_30.map
index 5f2d72efc..3f28fdf10 100644
--- a/inherit_graph_30.map
+++ b/inherit_graph_30.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_30.md5 b/inherit_graph_30.md5
index 07272bdce..3d55d6e9c 100644
--- a/inherit_graph_30.md5
+++ b/inherit_graph_30.md5
@@ -1 +1 @@
-2db1221224d0f3abdb2eed921ebb13a7
\ No newline at end of file
+13a63cca5df4d47b4697db93b9fe2ed8
\ No newline at end of file
diff --git a/inherit_graph_31.map b/inherit_graph_31.map
index 4b137bf19..15642222d 100644
--- a/inherit_graph_31.map
+++ b/inherit_graph_31.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_31.md5 b/inherit_graph_31.md5
index 37d4400ac..2b467d204 100644
--- a/inherit_graph_31.md5
+++ b/inherit_graph_31.md5
@@ -1 +1 @@
-9ea7eb13089be72a6a409f2c5e734b0a
\ No newline at end of file
+45fb2d53b7ee74861389444cd3ea99ab
\ No newline at end of file
diff --git a/inherit_graph_32.map b/inherit_graph_32.map
index 51bfc1436..0695c7bf0 100644
--- a/inherit_graph_32.map
+++ b/inherit_graph_32.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_32.md5 b/inherit_graph_32.md5
index c8985cfc8..e399c3829 100644
--- a/inherit_graph_32.md5
+++ b/inherit_graph_32.md5
@@ -1 +1 @@
-efb47abdd9e48d0f04d9837176e37751
\ No newline at end of file
+7061c9d8a467465edfae671eee6e6ca1
\ No newline at end of file
diff --git a/inherit_graph_33.map b/inherit_graph_33.map
index 2057baf39..20fced982 100644
--- a/inherit_graph_33.map
+++ b/inherit_graph_33.map
@@ -1,3 +1,4 @@
diff --git a/inherit_graph_33.md5 b/inherit_graph_33.md5
index 5edf8be88..a7735bf3c 100644
--- a/inherit_graph_33.md5
+++ b/inherit_graph_33.md5
@@ -1 +1 @@
-7c6c6aaeae21eb41e7366738ae7a6f96
\ No newline at end of file
+fdb6ef4225ca76ec93ab61fb3c9f16b8
\ No newline at end of file
diff --git a/inherit_graph_34.map b/inherit_graph_34.map
index 67ce56a1d..b8baec2c7 100644
--- a/inherit_graph_34.map
+++ b/inherit_graph_34.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_34.md5 b/inherit_graph_34.md5
index 6c5102097..bf109abb1 100644
--- a/inherit_graph_34.md5
+++ b/inherit_graph_34.md5
@@ -1 +1 @@
-5280b3511ad40df37cde82cb9e2eb1e1
\ No newline at end of file
+4092e62672e2df3b8795431de78531e3
\ No newline at end of file
diff --git a/inherit_graph_35.map b/inherit_graph_35.map
index ed3bfca0e..72c9d7d4f 100644
--- a/inherit_graph_35.map
+++ b/inherit_graph_35.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_35.md5 b/inherit_graph_35.md5
index c5a8451da..0a5f771f7 100644
--- a/inherit_graph_35.md5
+++ b/inherit_graph_35.md5
@@ -1 +1 @@
-820ea685d52a50407520850e381b91f8
\ No newline at end of file
+3d9f819d9ffc2519a5175d11b35948e2
\ No newline at end of file
diff --git a/inherit_graph_36.map b/inherit_graph_36.map
index 083843f3f..1b7748b11 100644
--- a/inherit_graph_36.map
+++ b/inherit_graph_36.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_36.md5 b/inherit_graph_36.md5
index b88f7ce0c..3897bc411 100644
--- a/inherit_graph_36.md5
+++ b/inherit_graph_36.md5
@@ -1 +1 @@
-448f5f138376e0a71e7cc0def9a0dc84
\ No newline at end of file
+e2d21b01d085642d01366e8bf71f9e27
\ No newline at end of file
diff --git a/inherit_graph_37.map b/inherit_graph_37.map
index ef02b4372..eb17d2b65 100644
--- a/inherit_graph_37.map
+++ b/inherit_graph_37.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_37.md5 b/inherit_graph_37.md5
index 9d8243a80..e9193bd1a 100644
--- a/inherit_graph_37.md5
+++ b/inherit_graph_37.md5
@@ -1 +1 @@
-b73da3bdeb56ed8b3261b9f6de7dc7ed
\ No newline at end of file
+82da0179318a9c5f2b530068b3b6932f
\ No newline at end of file
diff --git a/inherit_graph_38.map b/inherit_graph_38.map
index fa81b917b..542d5d2cf 100644
--- a/inherit_graph_38.map
+++ b/inherit_graph_38.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_38.md5 b/inherit_graph_38.md5
index 440a519ec..284e5d785 100644
--- a/inherit_graph_38.md5
+++ b/inherit_graph_38.md5
@@ -1 +1 @@
-a11695c55d1c3d888dc9ef427191a016
\ No newline at end of file
+2da64566f7064b7b3c4596690998415f
\ No newline at end of file
diff --git a/inherit_graph_39.map b/inherit_graph_39.map
index cbcf3a2f5..fd88cc445 100644
--- a/inherit_graph_39.map
+++ b/inherit_graph_39.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_39.md5 b/inherit_graph_39.md5
index a4f18c7d1..f2989d6e2 100644
--- a/inherit_graph_39.md5
+++ b/inherit_graph_39.md5
@@ -1 +1 @@
-ce851e63091ff2e7827bd7b5a89eeab0
\ No newline at end of file
+65965bd78ff9685111c4533e35a611d8
\ No newline at end of file
diff --git a/inherit_graph_4.map b/inherit_graph_4.map
index 632342eb3..86cdd4d87 100644
--- a/inherit_graph_4.map
+++ b/inherit_graph_4.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_4.md5 b/inherit_graph_4.md5
index e7aadbe6b..ddc0ecead 100644
--- a/inherit_graph_4.md5
+++ b/inherit_graph_4.md5
@@ -1 +1 @@
-961c643791716a7c92c67dc76f62cb2a
\ No newline at end of file
+aa17a3f609116e2da2ac6d1ecdbe7fc1
\ No newline at end of file
diff --git a/inherit_graph_40.map b/inherit_graph_40.map
index 74eda95cc..b04045943 100644
--- a/inherit_graph_40.map
+++ b/inherit_graph_40.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_40.md5 b/inherit_graph_40.md5
index d73d54e68..37efeae54 100644
--- a/inherit_graph_40.md5
+++ b/inherit_graph_40.md5
@@ -1 +1 @@
-935f82d3ec03e986d1749537bc8c13c3
\ No newline at end of file
+935f12b6e01aec30ae80dcbda4722faa
\ No newline at end of file
diff --git a/inherit_graph_41.map b/inherit_graph_41.map
index 0c8318cd9..6bba07f7e 100644
--- a/inherit_graph_41.map
+++ b/inherit_graph_41.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_41.md5 b/inherit_graph_41.md5
index d3b587e28..648b80198 100644
--- a/inherit_graph_41.md5
+++ b/inherit_graph_41.md5
@@ -1 +1 @@
-9bab3769fe97df6075d00b64e8a17633
\ No newline at end of file
+18b0da33f53252ee77b4d3dc6c4075a5
\ No newline at end of file
diff --git a/inherit_graph_42.map b/inherit_graph_42.map
index 2f9109491..6e6ff2e10 100644
--- a/inherit_graph_42.map
+++ b/inherit_graph_42.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_42.md5 b/inherit_graph_42.md5
index fe34156b0..c73c14645 100644
--- a/inherit_graph_42.md5
+++ b/inherit_graph_42.md5
@@ -1 +1 @@
-5e7de526b207623fba83b89bdcbf9306
\ No newline at end of file
+65ce50b1c3d0eb383d7a114325df57ac
\ No newline at end of file
diff --git a/inherit_graph_43.map b/inherit_graph_43.map
index 3b4aae913..9d8571978 100644
--- a/inherit_graph_43.map
+++ b/inherit_graph_43.map
@@ -1,4 +1,5 @@
diff --git a/inherit_graph_43.md5 b/inherit_graph_43.md5
index 53ba4cbd8..4edc9ed53 100644
--- a/inherit_graph_43.md5
+++ b/inherit_graph_43.md5
@@ -1 +1 @@
-7121a4b2efdcd2bf479fc0fb25c0c6ac
\ No newline at end of file
+582fe73b12d4df39a13f8f0957ada0eb
\ No newline at end of file
diff --git a/inherit_graph_44.map b/inherit_graph_44.map
index 4ff4e9635..fb5006331 100644
--- a/inherit_graph_44.map
+++ b/inherit_graph_44.map
@@ -1,4 +1,5 @@
diff --git a/inherit_graph_44.md5 b/inherit_graph_44.md5
index 03731eec0..6ec848ed8 100644
--- a/inherit_graph_44.md5
+++ b/inherit_graph_44.md5
@@ -1 +1 @@
-c65b22a319e10a43a684737453d69d6e
\ No newline at end of file
+f27578a4abcd3b79dd3b1181bb078403
\ No newline at end of file
diff --git a/inherit_graph_45.map b/inherit_graph_45.map
index e870bb847..02a3b90cb 100644
--- a/inherit_graph_45.map
+++ b/inherit_graph_45.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_45.md5 b/inherit_graph_45.md5
index 7daf8ee22..448884387 100644
--- a/inherit_graph_45.md5
+++ b/inherit_graph_45.md5
@@ -1 +1 @@
-007892698126196946ebf235cf890c18
\ No newline at end of file
+6b3256ae0fab68ae13226e97224c8cf8
\ No newline at end of file
diff --git a/inherit_graph_46.map b/inherit_graph_46.map
index aeb6b774d..327b76e24 100644
--- a/inherit_graph_46.map
+++ b/inherit_graph_46.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_46.md5 b/inherit_graph_46.md5
index 624aacf70..eed5cf60a 100644
--- a/inherit_graph_46.md5
+++ b/inherit_graph_46.md5
@@ -1 +1 @@
-5a17a084ffec9c0a85d5c1b82f58fdd2
\ No newline at end of file
+eb3473fa898b4198781a94f7fe479d98
\ No newline at end of file
diff --git a/inherit_graph_47.map b/inherit_graph_47.map
index 731616aad..50b820592 100644
--- a/inherit_graph_47.map
+++ b/inherit_graph_47.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_47.md5 b/inherit_graph_47.md5
index 73cc25abc..922fa83e3 100644
--- a/inherit_graph_47.md5
+++ b/inherit_graph_47.md5
@@ -1 +1 @@
-90d42365938e3fa52386d9270d0b9b11
\ No newline at end of file
+65ce9c35c78bf038799b8c3c79011098
\ No newline at end of file
diff --git a/inherit_graph_48.map b/inherit_graph_48.map
index d11f22353..620baf589 100644
--- a/inherit_graph_48.map
+++ b/inherit_graph_48.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_48.md5 b/inherit_graph_48.md5
index 1b9188d05..ee3315faa 100644
--- a/inherit_graph_48.md5
+++ b/inherit_graph_48.md5
@@ -1 +1 @@
-74a04beb6e759fd41f0fc56927e619de
\ No newline at end of file
+c0bd4ac34d650ec8d4f55bf914a1641d
\ No newline at end of file
diff --git a/inherit_graph_49.map b/inherit_graph_49.map
index a2894f4ba..adae0fa99 100644
--- a/inherit_graph_49.map
+++ b/inherit_graph_49.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_49.md5 b/inherit_graph_49.md5
index c40f49ceb..0e318452d 100644
--- a/inherit_graph_49.md5
+++ b/inherit_graph_49.md5
@@ -1 +1 @@
-6a3ea59b56d9cf5f5eef2f69e426408e
\ No newline at end of file
+fa15c8072de6c12b6a61724288290c88
\ No newline at end of file
diff --git a/inherit_graph_5.map b/inherit_graph_5.map
index 28a0e5304..fb9eaa2d1 100644
--- a/inherit_graph_5.map
+++ b/inherit_graph_5.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_5.md5 b/inherit_graph_5.md5
index 7fff92631..0db44c694 100644
--- a/inherit_graph_5.md5
+++ b/inherit_graph_5.md5
@@ -1 +1 @@
-c534b74d2e25038c0de9a8cc9bdc8f25
\ No newline at end of file
+bd435cc87c2da7699767107822da3bda
\ No newline at end of file
diff --git a/inherit_graph_50.map b/inherit_graph_50.map
index 970a61f64..df8251140 100644
--- a/inherit_graph_50.map
+++ b/inherit_graph_50.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_50.md5 b/inherit_graph_50.md5
index 72a7f9a70..21a5c29e4 100644
--- a/inherit_graph_50.md5
+++ b/inherit_graph_50.md5
@@ -1 +1 @@
-288115063601ce1b79bb1e9abd69d579
\ No newline at end of file
+d6112f2c8d6540b6c13ee50c2675098a
\ No newline at end of file
diff --git a/inherit_graph_51.map b/inherit_graph_51.map
index a0eb92bcd..9455cfaf6 100644
--- a/inherit_graph_51.map
+++ b/inherit_graph_51.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_51.md5 b/inherit_graph_51.md5
index 934e1896b..f1b054da2 100644
--- a/inherit_graph_51.md5
+++ b/inherit_graph_51.md5
@@ -1 +1 @@
-cfe5036e07c01e8e59778a67b5b9ccca
\ No newline at end of file
+14eafd15d4260bc687c15eb815d71d5c
\ No newline at end of file
diff --git a/inherit_graph_52.map b/inherit_graph_52.map
index dcdde5b69..402c5b151 100644
--- a/inherit_graph_52.map
+++ b/inherit_graph_52.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_52.md5 b/inherit_graph_52.md5
index 10acfb1ce..b2845456a 100644
--- a/inherit_graph_52.md5
+++ b/inherit_graph_52.md5
@@ -1 +1 @@
-cc1a658d2b2d59eb0d1f630c1b24039f
\ No newline at end of file
+48fda77a44e21dd0a315d8b54fcf919e
\ No newline at end of file
diff --git a/inherit_graph_53.map b/inherit_graph_53.map
index d004d8113..9bc35cca4 100644
--- a/inherit_graph_53.map
+++ b/inherit_graph_53.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_53.md5 b/inherit_graph_53.md5
index 1a201a8fc..8451df6f6 100644
--- a/inherit_graph_53.md5
+++ b/inherit_graph_53.md5
@@ -1 +1 @@
-345bf4f3acfa9bf0453cc82a9ffeebe7
\ No newline at end of file
+5cd4260be51c51bbaac3efb501bf038d
\ No newline at end of file
diff --git a/inherit_graph_54.map b/inherit_graph_54.map
index 3b6853334..fb9e9ed72 100644
--- a/inherit_graph_54.map
+++ b/inherit_graph_54.map
@@ -1,4 +1,4 @@
diff --git a/inherit_graph_54.md5 b/inherit_graph_54.md5
index 94fa8a77b..b5ef15f5c 100644
--- a/inherit_graph_54.md5
+++ b/inherit_graph_54.md5
@@ -1 +1 @@
-be4fc44311f172d532cb64de96214a21
\ No newline at end of file
+ba97ba9c342f233b03b8b0695159179e
\ No newline at end of file
diff --git a/inherit_graph_55.map b/inherit_graph_55.map
index 13f1f02a4..93dce2b7b 100644
--- a/inherit_graph_55.map
+++ b/inherit_graph_55.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_55.md5 b/inherit_graph_55.md5
index a5eeac5fb..409759016 100644
--- a/inherit_graph_55.md5
+++ b/inherit_graph_55.md5
@@ -1 +1 @@
-69e0f5baf99c5bb4b9ac7051c409fd1b
\ No newline at end of file
+0bd81532cad307d260cb24273221b153
\ No newline at end of file
diff --git a/inherit_graph_56.map b/inherit_graph_56.map
index d6d5b25fb..d10781585 100644
--- a/inherit_graph_56.map
+++ b/inherit_graph_56.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_56.md5 b/inherit_graph_56.md5
index da27628df..f539ba009 100644
--- a/inherit_graph_56.md5
+++ b/inherit_graph_56.md5
@@ -1 +1 @@
-8cabc10afa494711094a76c98de72404
\ No newline at end of file
+a21c27dc870c5fb017846edcc5abb2e0
\ No newline at end of file
diff --git a/inherit_graph_57.map b/inherit_graph_57.map
index e43c9c18b..ae0d06f3f 100644
--- a/inherit_graph_57.map
+++ b/inherit_graph_57.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_57.md5 b/inherit_graph_57.md5
index c3de59afb..947876a4a 100644
--- a/inherit_graph_57.md5
+++ b/inherit_graph_57.md5
@@ -1 +1 @@
-5f25378b8c4fc659dbaaac9f313759c4
\ No newline at end of file
+2e039a6ee2e637e9fe2fde50facc7b93
\ No newline at end of file
diff --git a/inherit_graph_58.map b/inherit_graph_58.map
index 569c25961..3fba4ce8c 100644
--- a/inherit_graph_58.map
+++ b/inherit_graph_58.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_58.md5 b/inherit_graph_58.md5
index 2b1a4a267..6f1a862c7 100644
--- a/inherit_graph_58.md5
+++ b/inherit_graph_58.md5
@@ -1 +1 @@
-007451fed7093f090c2c832708d91bf7
\ No newline at end of file
+8d5864f5e7d80780e6910d255dcd2499
\ No newline at end of file
diff --git a/inherit_graph_59.map b/inherit_graph_59.map
index 99dc39686..362cfa40b 100644
--- a/inherit_graph_59.map
+++ b/inherit_graph_59.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_59.md5 b/inherit_graph_59.md5
index 729fd37e7..59c05bd94 100644
--- a/inherit_graph_59.md5
+++ b/inherit_graph_59.md5
@@ -1 +1 @@
-e9cca4f1a445062b2265c44ae897d625
\ No newline at end of file
+b883ee8f8721e666b6a77a0d84597064
\ No newline at end of file
diff --git a/inherit_graph_6.map b/inherit_graph_6.map
index 81e8b01b4..04266ba7e 100644
--- a/inherit_graph_6.map
+++ b/inherit_graph_6.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_6.md5 b/inherit_graph_6.md5
index 3eef4ace0..2d68a8791 100644
--- a/inherit_graph_6.md5
+++ b/inherit_graph_6.md5
@@ -1 +1 @@
-19d6cfb903b26d2ed5b7713f67956ece
\ No newline at end of file
+4f7442d8a0535e7688e80200dd973abe
\ No newline at end of file
diff --git a/inherit_graph_60.map b/inherit_graph_60.map
index 3ef50a2ee..601799557 100644
--- a/inherit_graph_60.map
+++ b/inherit_graph_60.map
@@ -1,4 +1,4 @@
diff --git a/inherit_graph_60.md5 b/inherit_graph_60.md5
index 108cec972..845aebb2a 100644
--- a/inherit_graph_60.md5
+++ b/inherit_graph_60.md5
@@ -1 +1 @@
-1e815e8823ca8b52deae56b852514a76
\ No newline at end of file
+e61b282d1053795ce17cc9ead55fe6e0
\ No newline at end of file
diff --git a/inherit_graph_61.map b/inherit_graph_61.map
index 643ee7932..8ff6c9647 100644
--- a/inherit_graph_61.map
+++ b/inherit_graph_61.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_61.md5 b/inherit_graph_61.md5
index b523988cc..818184ab6 100644
--- a/inherit_graph_61.md5
+++ b/inherit_graph_61.md5
@@ -1 +1 @@
-6125b6c8684a93234b3ff16e3ade2e04
\ No newline at end of file
+62e916ff081d7453916088bf3df4cf66
\ No newline at end of file
diff --git a/inherit_graph_62.map b/inherit_graph_62.map
index 4ae3fce72..d724ad0f8 100644
--- a/inherit_graph_62.map
+++ b/inherit_graph_62.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_62.md5 b/inherit_graph_62.md5
index 2c56d7d37..d9af054e3 100644
--- a/inherit_graph_62.md5
+++ b/inherit_graph_62.md5
@@ -1 +1 @@
-0aea804ed9c20fc7881e5ceb601498e1
\ No newline at end of file
+0cbfede483556f2a22161ebbce1619d4
\ No newline at end of file
diff --git a/inherit_graph_63.map b/inherit_graph_63.map
index 0f4e8b904..e5d859250 100644
--- a/inherit_graph_63.map
+++ b/inherit_graph_63.map
@@ -1,5 +1,6 @@
diff --git a/inherit_graph_63.md5 b/inherit_graph_63.md5
index cde54ff06..df2dfcf0d 100644
--- a/inherit_graph_63.md5
+++ b/inherit_graph_63.md5
@@ -1 +1 @@
-1b178c3a74b4b054b7ae22c7178ce969
\ No newline at end of file
+d7dffa96e8000f935b4eba72d784a991
\ No newline at end of file
diff --git a/inherit_graph_64.map b/inherit_graph_64.map
index 12db1ba02..2ef471e44 100644
--- a/inherit_graph_64.map
+++ b/inherit_graph_64.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_64.md5 b/inherit_graph_64.md5
index f846af2cc..4c1ad9b84 100644
--- a/inherit_graph_64.md5
+++ b/inherit_graph_64.md5
@@ -1 +1 @@
-96cc24d5bccad91985f975deb939dedb
\ No newline at end of file
+723c780dd5990ddc8f9f13792dd78635
\ No newline at end of file
diff --git a/inherit_graph_65.map b/inherit_graph_65.map
index 3335a9aea..ab41230e1 100644
--- a/inherit_graph_65.map
+++ b/inherit_graph_65.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_65.md5 b/inherit_graph_65.md5
index 22416be93..ced925495 100644
--- a/inherit_graph_65.md5
+++ b/inherit_graph_65.md5
@@ -1 +1 @@
-a26af94c0ac7be6391d18fc4e3dc43d1
\ No newline at end of file
+3d719b773c24614996144e0afc1b0066
\ No newline at end of file
diff --git a/inherit_graph_66.map b/inherit_graph_66.map
index 608d88807..f69582449 100644
--- a/inherit_graph_66.map
+++ b/inherit_graph_66.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_66.md5 b/inherit_graph_66.md5
index a4d32bd63..d7bba944e 100644
--- a/inherit_graph_66.md5
+++ b/inherit_graph_66.md5
@@ -1 +1 @@
-2396c3c9c6c4dfb98cf8dfde69632cf1
\ No newline at end of file
+a4790bc0bef0ac33539cb28531648039
\ No newline at end of file
diff --git a/inherit_graph_67.map b/inherit_graph_67.map
index 29aa9afdc..0cc6a7c0e 100644
--- a/inherit_graph_67.map
+++ b/inherit_graph_67.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_67.md5 b/inherit_graph_67.md5
index f1909c3f5..86fbc06f0 100644
--- a/inherit_graph_67.md5
+++ b/inherit_graph_67.md5
@@ -1 +1 @@
-a39ed1ce3ed98eda201b2225cef5fbb7
\ No newline at end of file
+c2f4a5ee491a302b3fcaa7747d872595
\ No newline at end of file
diff --git a/inherit_graph_68.map b/inherit_graph_68.map
index 39c08ca45..f7887702b 100644
--- a/inherit_graph_68.map
+++ b/inherit_graph_68.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_68.md5 b/inherit_graph_68.md5
index 5917dcd97..5b5507bd6 100644
--- a/inherit_graph_68.md5
+++ b/inherit_graph_68.md5
@@ -1 +1 @@
-b9f782712bc002836e59339fc696899b
\ No newline at end of file
+16e4a86376f3d5e26d74f2d1089594d0
\ No newline at end of file
diff --git a/inherit_graph_69.map b/inherit_graph_69.map
index d449958dd..8719a852d 100644
--- a/inherit_graph_69.map
+++ b/inherit_graph_69.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_69.md5 b/inherit_graph_69.md5
index c3547a7bd..2092da40d 100644
--- a/inherit_graph_69.md5
+++ b/inherit_graph_69.md5
@@ -1 +1 @@
-2ee708eb514037e55b481824febf10fd
\ No newline at end of file
+b99d273e428049a980e5f0a63b669c70
\ No newline at end of file
diff --git a/inherit_graph_7.map b/inherit_graph_7.map
index 4d33c92c4..5738acfc1 100644
--- a/inherit_graph_7.map
+++ b/inherit_graph_7.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_7.md5 b/inherit_graph_7.md5
index 488025624..5e4203a17 100644
--- a/inherit_graph_7.md5
+++ b/inherit_graph_7.md5
@@ -1 +1 @@
-7383a075a0a293840a412734284d45f6
\ No newline at end of file
+b2d71cad9fe9ef53110f77fcecfac992
\ No newline at end of file
diff --git a/inherit_graph_70.map b/inherit_graph_70.map
index 8b82675b9..63773c3cd 100644
--- a/inherit_graph_70.map
+++ b/inherit_graph_70.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_70.md5 b/inherit_graph_70.md5
index 14a6571bf..c54278856 100644
--- a/inherit_graph_70.md5
+++ b/inherit_graph_70.md5
@@ -1 +1 @@
-085c2237e2a84fa90fd248b3e285ca5a
\ No newline at end of file
+4c4180fea35ffc97b844c672839ceac7
\ No newline at end of file
diff --git a/inherit_graph_71.map b/inherit_graph_71.map
index b5c3c1d4c..56ee0e1e2 100644
--- a/inherit_graph_71.map
+++ b/inherit_graph_71.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_71.md5 b/inherit_graph_71.md5
index e65ccf3a3..02d49d2e7 100644
--- a/inherit_graph_71.md5
+++ b/inherit_graph_71.md5
@@ -1 +1 @@
-698d787b5a877008ad7a77fa5406407a
\ No newline at end of file
+bf96a723a7d68bf53936b1386f8c218f
\ No newline at end of file
diff --git a/inherit_graph_72.map b/inherit_graph_72.map
index 92f78d328..ebadd0850 100644
--- a/inherit_graph_72.map
+++ b/inherit_graph_72.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_72.md5 b/inherit_graph_72.md5
index e2303167f..a2af63b62 100644
--- a/inherit_graph_72.md5
+++ b/inherit_graph_72.md5
@@ -1 +1 @@
-520cb5a55cc20d587fe932139a6ace1f
\ No newline at end of file
+fc8123332184e03eda36778698335175
\ No newline at end of file
diff --git a/inherit_graph_73.map b/inherit_graph_73.map
index 53e4a7823..c337a1b3b 100644
--- a/inherit_graph_73.map
+++ b/inherit_graph_73.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_73.md5 b/inherit_graph_73.md5
index 0293f40ad..663b261ac 100644
--- a/inherit_graph_73.md5
+++ b/inherit_graph_73.md5
@@ -1 +1 @@
-b4ca4fd314317258cd0886d5c12ccfc8
\ No newline at end of file
+20012184e1a29a5286b21c1fe234ad38
\ No newline at end of file
diff --git a/inherit_graph_74.map b/inherit_graph_74.map
index 8570cac7b..0b368c084 100644
--- a/inherit_graph_74.map
+++ b/inherit_graph_74.map
@@ -1,9 +1,9 @@
diff --git a/inherit_graph_74.md5 b/inherit_graph_74.md5
index f3a3baaf8..aedd8ddd5 100644
--- a/inherit_graph_74.md5
+++ b/inherit_graph_74.md5
@@ -1 +1 @@
-138e274a254b594a9954b9aae0668a59
\ No newline at end of file
+9a59b2ef63bdf7dea29b0ca2bc235349
\ No newline at end of file
diff --git a/inherit_graph_75.map b/inherit_graph_75.map
index e90742a15..46099798f 100644
--- a/inherit_graph_75.map
+++ b/inherit_graph_75.map
@@ -1,5 +1,5 @@
diff --git a/inherit_graph_75.md5 b/inherit_graph_75.md5
index 72b4ada05..f2e1f3cde 100644
--- a/inherit_graph_75.md5
+++ b/inherit_graph_75.md5
@@ -1 +1 @@
-8855b906565907afc33255637de64777
\ No newline at end of file
+aabe0fbff34a6e45ec9d29fec0f85291
\ No newline at end of file
diff --git a/inherit_graph_76.map b/inherit_graph_76.map
index 57e8de8f6..94871c0aa 100644
--- a/inherit_graph_76.map
+++ b/inherit_graph_76.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_76.md5 b/inherit_graph_76.md5
index b1de692be..66a4bad20 100644
--- a/inherit_graph_76.md5
+++ b/inherit_graph_76.md5
@@ -1 +1 @@
-7c8657ebec4948f12f72f3ce1ea3e6f1
\ No newline at end of file
+c040e930da0640acfc225e0071fbffd6
\ No newline at end of file
diff --git a/inherit_graph_77.map b/inherit_graph_77.map
index efb9005ae..eab96512c 100644
--- a/inherit_graph_77.map
+++ b/inherit_graph_77.map
@@ -1,5 +1,5 @@
diff --git a/inherit_graph_77.md5 b/inherit_graph_77.md5
index 78f21e062..baa3d0e0d 100644
--- a/inherit_graph_77.md5
+++ b/inherit_graph_77.md5
@@ -1 +1 @@
-ed732f965f7fda691bcc3b00421de018
\ No newline at end of file
+492cf1f4dc03649e85459fa42851c26f
\ No newline at end of file
diff --git a/inherit_graph_78.map b/inherit_graph_78.map
index 1cffcafc4..a2bc43586 100644
--- a/inherit_graph_78.map
+++ b/inherit_graph_78.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_78.md5 b/inherit_graph_78.md5
index 7ff5f201f..6de2f628c 100644
--- a/inherit_graph_78.md5
+++ b/inherit_graph_78.md5
@@ -1 +1 @@
-6fe08557afca73d416eaaf6074100bcc
\ No newline at end of file
+cf2e30ab3f9c66a9efa5c945665156e9
\ No newline at end of file
diff --git a/inherit_graph_79.map b/inherit_graph_79.map
index 8a9badaf4..e42c713cc 100644
--- a/inherit_graph_79.map
+++ b/inherit_graph_79.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_79.md5 b/inherit_graph_79.md5
index add945e15..0a9edcce4 100644
--- a/inherit_graph_79.md5
+++ b/inherit_graph_79.md5
@@ -1 +1 @@
-df08f1e968b4cc2cc7daa157801ed78f
\ No newline at end of file
+dfc533d50ed6fb7966232d163ee704cf
\ No newline at end of file
diff --git a/inherit_graph_8.map b/inherit_graph_8.map
index 58ed2c21d..305dbb2f3 100644
--- a/inherit_graph_8.map
+++ b/inherit_graph_8.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_8.md5 b/inherit_graph_8.md5
index 4c890935f..57468820b 100644
--- a/inherit_graph_8.md5
+++ b/inherit_graph_8.md5
@@ -1 +1 @@
-b9e3e0f87611a3b093494ddd5be04797
\ No newline at end of file
+4c9b522e5ebf766bc71c3504a73b8aa4
\ No newline at end of file
diff --git a/inherit_graph_80.map b/inherit_graph_80.map
index 7adac6fc2..26a17376d 100644
--- a/inherit_graph_80.map
+++ b/inherit_graph_80.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_80.md5 b/inherit_graph_80.md5
index 2131cdeb4..cf75ff325 100644
--- a/inherit_graph_80.md5
+++ b/inherit_graph_80.md5
@@ -1 +1 @@
-af7001ccbe19c37aec36fd176a0ffac8
\ No newline at end of file
+9c2e416d7878932b0a87489324431ab5
\ No newline at end of file
diff --git a/inherit_graph_81.map b/inherit_graph_81.map
index 88429a650..cd12f6c5c 100644
--- a/inherit_graph_81.map
+++ b/inherit_graph_81.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_81.md5 b/inherit_graph_81.md5
index 86b004f22..147341b07 100644
--- a/inherit_graph_81.md5
+++ b/inherit_graph_81.md5
@@ -1 +1 @@
-819b2f7e5f86d24470850ff7ee4e241d
\ No newline at end of file
+fed123d41bb565808b0d7286c7db6b6b
\ No newline at end of file
diff --git a/inherit_graph_82.map b/inherit_graph_82.map
index 05029aac6..94c6fcfee 100644
--- a/inherit_graph_82.map
+++ b/inherit_graph_82.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_82.md5 b/inherit_graph_82.md5
index fba8c2616..76603d1de 100644
--- a/inherit_graph_82.md5
+++ b/inherit_graph_82.md5
@@ -1 +1 @@
-b37d22ef07743cbe52cd0e9c02a29134
\ No newline at end of file
+b93e72808f9061dd00a7b4f79431eab9
\ No newline at end of file
diff --git a/inherit_graph_83.map b/inherit_graph_83.map
index 2c27e566d..d4734f063 100644
--- a/inherit_graph_83.map
+++ b/inherit_graph_83.map
@@ -1,3 +1,4 @@
diff --git a/inherit_graph_83.md5 b/inherit_graph_83.md5
index 2486c19a3..88d543d7c 100644
--- a/inherit_graph_83.md5
+++ b/inherit_graph_83.md5
@@ -1 +1 @@
-639f6ab546dd5acf23c637ac55339882
\ No newline at end of file
+2876c2ae5218e08f9285bcc725df7bc3
\ No newline at end of file
diff --git a/inherit_graph_84.map b/inherit_graph_84.map
index 0a14bd21d..ac0acf434 100644
--- a/inherit_graph_84.map
+++ b/inherit_graph_84.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_84.md5 b/inherit_graph_84.md5
index 7f8b5bc98..0be925c36 100644
--- a/inherit_graph_84.md5
+++ b/inherit_graph_84.md5
@@ -1 +1 @@
-28cb732e1158db2e9807e3dc73e5f754
\ No newline at end of file
+8d3a30b2918e693af9bb0111a484655c
\ No newline at end of file
diff --git a/inherit_graph_85.map b/inherit_graph_85.map
index 5d8c2289c..a086dc56b 100644
--- a/inherit_graph_85.map
+++ b/inherit_graph_85.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_85.md5 b/inherit_graph_85.md5
index 1b01b039c..615e951d8 100644
--- a/inherit_graph_85.md5
+++ b/inherit_graph_85.md5
@@ -1 +1 @@
-ddf3b878e6241ab3d9dc40b5c004b15d
\ No newline at end of file
+939b5b7f8f8060572df76efae6044422
\ No newline at end of file
diff --git a/inherit_graph_86.map b/inherit_graph_86.map
index 347a4489a..426e2369b 100644
--- a/inherit_graph_86.map
+++ b/inherit_graph_86.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_86.md5 b/inherit_graph_86.md5
index 4b36cf187..cda492144 100644
--- a/inherit_graph_86.md5
+++ b/inherit_graph_86.md5
@@ -1 +1 @@
-044b1a967424a88ee007854389354a9e
\ No newline at end of file
+6637fc54ad98fb83bd5e61dc883721a7
\ No newline at end of file
diff --git a/inherit_graph_87.map b/inherit_graph_87.map
index cbf6e0dba..472db544f 100644
--- a/inherit_graph_87.map
+++ b/inherit_graph_87.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_87.md5 b/inherit_graph_87.md5
index d4f69cf6a..0006aa477 100644
--- a/inherit_graph_87.md5
+++ b/inherit_graph_87.md5
@@ -1 +1 @@
-9c42650049ecc6696a1dc77887ea11b6
\ No newline at end of file
+3e935539400960f11e58c02d1d3d4316
\ No newline at end of file
diff --git a/inherit_graph_88.map b/inherit_graph_88.map
index 85230e202..f5556ca1a 100644
--- a/inherit_graph_88.map
+++ b/inherit_graph_88.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_88.md5 b/inherit_graph_88.md5
index 5a8b581fd..0c88062fa 100644
--- a/inherit_graph_88.md5
+++ b/inherit_graph_88.md5
@@ -1 +1 @@
-069dccc2c5fd3e30e52c08ddb315de46
\ No newline at end of file
+60f25a3eae2e0dd4a0e6e4a670d8399e
\ No newline at end of file
diff --git a/inherit_graph_89.map b/inherit_graph_89.map
index 85230e202..f5556ca1a 100644
--- a/inherit_graph_89.map
+++ b/inherit_graph_89.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_89.md5 b/inherit_graph_89.md5
index 5a8b581fd..0c88062fa 100644
--- a/inherit_graph_89.md5
+++ b/inherit_graph_89.md5
@@ -1 +1 @@
-069dccc2c5fd3e30e52c08ddb315de46
\ No newline at end of file
+60f25a3eae2e0dd4a0e6e4a670d8399e
\ No newline at end of file
diff --git a/inherit_graph_9.map b/inherit_graph_9.map
index d1b41dbfc..85812fa9c 100644
--- a/inherit_graph_9.map
+++ b/inherit_graph_9.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_9.md5 b/inherit_graph_9.md5
index 2656cf65f..5d46201ee 100644
--- a/inherit_graph_9.md5
+++ b/inherit_graph_9.md5
@@ -1 +1 @@
-ae4b733bfd5e18eafcb23c81b86c38ad
\ No newline at end of file
+c05f058e8fa0d05b5ddf99c2390e65e1
\ No newline at end of file
diff --git a/inherit_graph_90.map b/inherit_graph_90.map
deleted file mode 100644
index 85230e202..000000000
--- a/inherit_graph_90.map
+++ /dev/null
@@ -1,3 +0,0 @@
-
diff --git a/inherit_graph_90.md5 b/inherit_graph_90.md5
deleted file mode 100644
index 5a8b581fd..000000000
--- a/inherit_graph_90.md5
+++ /dev/null
@@ -1 +0,0 @@
-069dccc2c5fd3e30e52c08ddb315de46
\ No newline at end of file
diff --git a/inherit_graph_90.png b/inherit_graph_90.png
deleted file mode 100644
index a6c222eec..000000000
Binary files a/inherit_graph_90.png and /dev/null differ
diff --git a/inherits.html b/inherits.html
index d74296b0d..15a202c66 100644
--- a/inherits.html
+++ b/inherits.html
@@ -1,9 +1,9 @@
-
+
-
+
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
+ |
|
|
- |
- 1.8.13
+ 1.8.16
diff --git a/jquery.js b/jquery.js
index f5343eda9..103c32d79 100644
--- a/jquery.js
+++ b/jquery.js
@@ -1,71 +1,26 @@
+/*! jQuery v3.4.1 | (c) JS Foundation and other contributors | jquery.org/license */
+!function(e,t){"use strict";"object"==typeof module&&"object"==typeof module.exports?module.exports=e.document?t(e,!0):function(e){if(!e.document)throw new Error("jQuery requires a window with a document");return t(e)}:t(e)}("undefined"!=typeof window?window:this,function(C,e){"use strict";var t=[],E=C.document,r=Object.getPrototypeOf,s=t.slice,g=t.concat,u=t.push,i=t.indexOf,n={},o=n.toString,v=n.hasOwnProperty,a=v.toString,l=a.call(Object),y={},m=function(e){return"function"==typeof e&&"number"!=typeof e.nodeType},x=function(e){return null!=e&&e===e.window},c={type:!0,src:!0,nonce:!0,noModule:!0};function b(e,t,n){var r,i,o=(n=n||E).createElement("script");if(o.text=e,t)for(r in c)(i=t[r]||t.getAttribute&&t.getAttribute(r))&&o.setAttribute(r,i);n.head.appendChild(o).parentNode.removeChild(o)}function w(e){return null==e?e+"":"object"==typeof e||"function"==typeof e?n[o.call(e)]||"object":typeof e}var f="3.4.1",k=function(e,t){return new k.fn.init(e,t)},p=/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g;function d(e){var t=!!e&&"length"in e&&e.length,n=w(e);return!m(e)&&!x(e)&&("array"===n||0===t||"number"==typeof t&&0| t |
- 1.8.13
+ 1.8.16
diff --git a/locator_8hpp_source.html b/locator_8hpp_source.html
index 77b346fab..78c2768c8 100644
--- a/locator_8hpp_source.html
+++ b/locator_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/locator_8md_source.html b/locator_8md_source.html
deleted file mode 100644
index 9c501ccdf..000000000
--- a/locator_8md_source.html
+++ /dev/null
@@ -1,74 +0,0 @@
-
-
-
-
-
-
-
-|
- EnTT
- 3.2.1
-
- |
-
- 1.8.13
-
-
-
diff --git a/autotoc_md0.html b/md_docs_md_core.html
similarity index 52%
rename from autotoc_md0.html
rename to md_docs_md_core.html
index 26638b7f9..36ce110e5 100644
--- a/autotoc_md0.html
+++ b/md_docs_md_core.html
@@ -1,9 +1,9 @@
-
+
-
+
EnTT comes with a bunch of core functionalities mostly used by the other parts of the library itself.
+
EnTT comes with a bunch of core functionalities mostly used by the other parts of the library itself.
Hardly users will include these features in their code, but it's worth describing what EnTT offers so as not to reinvent the wheel in case of need.
Sometimes it's useful to be able to give unique identifiers to types at compile-time.
+
Sometimes it's useful to be able to give unique identifiers to types at compile-time.
There are plenty of different solutions out there and I could have used one of them. However, I decided to spend my time to define a compact and versatile tool that fully embraces what the modern C++ has to offer.
The result of my efforts is the identifier class template:
This is all what the class template has to offer: a type inline variable that contains a numerical identifier for the given type. It can be used in any context where constant expressions are required.
This is all what the class template has to offer: a type inline variable that contains a numerical identifier for the given type. It can be used in any context where constant expressions are required.
As long as the list remains unchanged, identifiers are also guaranteed to be the same for every run. In case they have been used in a production environment and a type has to be removed, one can just use a placeholder to left the other identifiers unchanged:
-A bit ugly to see, but it works at least.
+A bit ugly to see, but it works at least.
Sometimes it's useful to be able to give unique identifiers to types at runtime.
+
Sometimes it's useful to be able to give unique identifiers to types at runtime.
There are plenty of different solutions out there and I could have used one of them. In fact, I adapted the most common one to my requirements and used it extensively within the entire library.
It's the family class. Here is an example of use directly from the entity-component system:
This is all what a family has to offer: a type inline variable that contains a numerical identifier for the given type.
This is all what a family has to offer: a type inline variable that contains a numerical identifier for the given type.
Please, note that identifiers aren't guaranteed to be the same for every run. Indeed it mostly depends on the flow of execution.
A hashed string is a zero overhead unique identifier. Users can use human-readable identifiers in the codebase while using their numeric counterparts at runtime, thus without affecting performance.
- The class has an implicit constexpr constructor that chews a bunch of characters. Once created, all what one can do with it is getting back the original string or converting it into a number.
+
A hashed string is a zero overhead unique identifier. Users can use human-readable identifiers in the codebase while using their numeric counterparts at runtime, thus without affecting performance.
+ The class has an implicit constexpr constructor that chews a bunch of characters. Once created, all what one can do with it is getting back the original string or converting it into a number.
The good part is that a hashed string can be used wherever a constant expression is required and no string-to-number conversion will take place at runtime if used carefully.
Example of use:
-There is also a user defined literal dedicated to hashed strings to make them more user-friendly:
-There is also a user defined literal dedicated to hashed strings to make them more user-friendly:
+The hashed string has a design that is close to that of an std::basic_string. It means that hashed_string is nothing more than an alias for basic_hashed_string<char>. For those who want to use the C++ type for wide character representation, there exists also the alias hashed_wstring for basic_hashed_string<wchar_t>.
+
The hashed string has a design that is close to that of an std::basic_string. It means that hashed_string is nothing more than an alias for basic_hashed_string<char>. For those who want to use the C++ type for wide character representation, there exists also the alias hashed_wstring for basic_hashed_string<wchar_t>.
In this case, the user defined literal to use to create hashed strings on the fly is _hws:
Note that the hash type of the hashed_wstring is the same of its counterpart.
Note that the hash type of the hashed_wstring is the same of its counterpart.
The hashed string class uses internally FNV-1a to compute the numeric counterpart of a string. Because of the pigeonhole principle, conflicts are possible. This is a fact.
- There is no silver bullet to solve the problem of conflicts when dealing with hashing functions. In this case, the best solution seemed to be to give up. That's all.
+
The hashed string class uses internally FNV-1a to compute the numeric counterpart of a string. Because of the pigeonhole principle, conflicts are possible. This is a fact.
+ There is no silver bullet to solve the problem of conflicts when dealing with hashing functions. In this case, the best solution seemed to be to give up. That's all.
After all, human-readable unique identifiers aren't something strictly defined and over which users have not the control. Choosing a slightly different identifier is probably the best solution to make the conflict disappear in this case.
The monostate pattern is often presented as an alternative to a singleton based configuration system. This is exactly its purpose in EnTT. Moreover, this implementation is thread safe by design (hopefully).
+
The monostate pattern is often presented as an alternative to a singleton based configuration system. This is exactly its purpose in EnTT. Moreover, this implementation is thread safe by design (hopefully).
Keys are represented by hashed strings, values are basic types like ints or bools. Values of different types can be associated to each key, even more than one at a time. Because of this, users must pay attention to use the same type both during an assignment and when they try to read back their data. Otherwise, they will probably incur in unexpected results.
Example of use:
-
- 1.8.13
+ 1.8.16
diff --git a/autotoc_md8.html b/md_docs_md_entity.html
similarity index 55%
rename from autotoc_md8.html
rename to md_docs_md_entity.html
index 195856584..df39e6d7a 100644
--- a/autotoc_md8.html
+++ b/md_docs_md_entity.html
@@ -1,9 +1,9 @@
-
+
-
+
EnTT is a header-only, tiny and easy to use entity-component system (and much more) written in modern C++.
+
EnTT is a header-only, tiny and easy to use entity-component system (and much more) written in modern C++.
The entity-component-system (also known as ECS) is an architectural pattern used mostly in game development.
EnTT offers a bitset-free entity-component system that doesn't require users to specify the set of components neither at compile-time nor at runtime before being able to use the library itself.
+
EnTT offers a bitset-free entity-component system that doesn't require users to specify the set of components neither at compile-time nor at runtime before being able to use the library itself.
This is why users can instantiate the core class simply like:
In place of its more annoying and error-prone counterpart:
-Furthermore, there is no need to indicate to the library in any way that a type of component exists and will be used sooner or later. When the time comes, users can just use it and that's all.
+In place of its more annoying and error-prone counterpart:
+Furthermore, there is no need to indicate to the library in any way that a type of component exists and will be used sooner or later. When the time comes, users can just use it and that's all.
EnTT is entirely designed around the principle that users have to pay only for what they want.
When it comes to using an entity-component system, the tradeoff is usually between performance and memory usage. The faster it is, the more memory it uses. Even worse, some approaches tend to heavily affect other functionalities like the construction and destruction of components to favor iterations, even when it isn't strictly required. In fact, slightly worse performance along non-critical paths are the right price to pay to reduce memory usage and have overall better perfomance sometimes and I've always wondered why this kind of tools do not leave me the choice.
- EnTT follows a completely different approach. It gets the best out from the basic data structures and gives users the possibility to pay more for higher performance where needed.
+
When it comes to using an entity-component system, the tradeoff is usually between performance and memory usage. The faster it is, the more memory it uses. Even worse, some approaches tend to heavily affect other functionalities like the construction and destruction of components to favor iterations, even when it isn't strictly required. In fact, slightly worse performance along non-critical paths are the right price to pay to reduce memory usage and have overall better perfomance sometimes and I've always wondered why this kind of tools do not leave me the choice.
+ EnTT follows a completely different approach. It gets the best out from the basic data structures and gives users the possibility to pay more for higher performance where needed.
The disadvantage of this approach is that users need to know the systems they are working on and the tools they are using. Otherwise, the risk to ruin the performance along critical paths is high.
So far, this choice has proven to be a good one and I really hope it can be for many others besides me.
EnTT is such that at every moment a pair (T *, size) is available to directly access all the instances of a given component type T.
+
EnTT is such that at every moment a pair (T *, size) is available to directly access all the instances of a given component type T.
This was a guideline and a design decision that influenced many choices, for better and for worse. I cannot say whether it will be useful or not to the reader, but it's worth to mention it, because it's one of the corner stones of this library.
Many of the tools described below, from the registry to the views and up to the groups give the possibility to get this information and have been designed around this need, which was and remains one of my main requirements during the development.
+
Many of the tools described below, from the registry to the views and up to the groups give the possibility to get this information and have been designed around this need, which was and remains one of my main requirements during the development.
The rest is experimentation and the desire to invent something new, hoping to have succeeded.
EnTT is designed so that it can work with stateless systems. In other words, all systems can be free functions and there is no need to define them as classes (although nothing prevents users from doing so).
+
EnTT is designed so that it can work with stateless systems. In other words, all systems can be free functions and there is no need to define them as classes (although nothing prevents users from doing so).
This is possible because the main class with which the users will work provides all what is needed to act as the sole source of truth of an application.
To be honest, this point became part of the design principles at a later date, but has also become one of the cornerstones of the library to date, as stateless systems are widely used and appreciated in general.
The registry to store, the views and the groups to iterate. That's all.
-An entity (the E of an ECS) is an opaque identifier that users should just use as-is and store around if needed. Do not try to inspect an entity identifier, its format can change in future and a registry offers all the functionalities to query them out-of-the-box. The underlying type of an entity (either std::uint16_t, std::uint32_t or std::uint64_t) can be specified when defining a registry. In fact, an entt::registry is nothing more than an alias for entt::basic_registry<entt::entity> and entt::entity is a distinct type that implements the concept of entity identifier.
- Components (the C of an ECS) should be plain old data structures or more complex and movable data structures with a proper constructor. Actually, the sole requirement of a component type is that it must be both move constructible and move assignable. They are list initialized by using the parameters provided to construct the component itself. No need to register components or their types neither with the registry nor with the entity-component system at all.
+
An entity (the E of an ECS) is an opaque identifier that users should just use as-is and store around if needed. Do not try to inspect an entity identifier, its format can change in future and a registry offers all the functionalities to query them out-of-the-box. The underlying type of an entity (either std::uint16_t, std::uint32_t or std::uint64_t) can be specified when defining a registry. In fact, an entt::registry is nothing more than an alias for entt::basic_registry<entt::entity> and entt::entity is a distinct type that implements the concept of entity identifier.
+ Components (the C of an ECS) should be plain old data structures or more complex and movable data structures with a proper constructor. Actually, the sole requirement of a component type is that it must be both move constructible and move assignable. They are list initialized by using the parameters provided to construct the component itself. No need to register components or their types neither with the registry nor with the entity-component system at all.
Systems (the S of an ECS) are just plain functions, functors, lambdas or whatever users want. They can accept a registry, a view or a group of any type and use them the way they prefer. No need to register systems or their types neither with the registry nor with the entity-component system at all.
The following sections will explain in short how to use the entity-component system, the core part of the whole library.
+
The following sections will explain in short how to use the entity-component system, the core part of the whole library.
In fact, the project is composed of many other classes in addition to those describe below. For more details, please refer to the inline documentation.
A registry can store and manage entities, as well as create views and groups to iterate the underlying data structures.
- The class template basic_registry lets users decide what's the preferred type to represent an entity. Because std::uint32_t is large enough for almost all the cases, there exists also the type entt::entity for it, as well as the alias entt::registry for entt::basic_registry<entt::entity>.
Entities are represented by entity identifiers. An entity identifier is an opaque type that users should not inspect or modify in any way. It carries information about the entity itself and its version.
+
A registry can store and manage entities, as well as create views and groups to iterate the underlying data structures.
+ The class template basic_registry lets users decide what's the preferred type to represent an entity. Because std::uint32_t is large enough for almost all the cases, there exists also the type entt::entity for it, as well as the alias entt::registry for entt::basic_registry<entt::entity>.
Entities are represented by entity identifiers. An entity identifier is an opaque type that users should not inspect or modify in any way. It carries information about the entity itself and its version.
User defined identifiers can be introduced by means of the ENTT_OPAQUE_TYPE macro if needed.
A registry is used both to construct and to destroy entities:
-There exists also an overload of the create and destroy member functions that accepts two iterators, that is a range to assign or to destroy. It can be used to create or destroy multiple entities at once:
In both cases, the create member function accepts also a list of default constructible component types to assign to the entities before to return. It's a faster alternative to the creation and subsequent assignment of components in separate steps.
When an entity is destroyed, the registry can freely reuse it internally with a slightly different identifier. In particular, the version of an entity is increased each and every time it's discarded.
+
There exists also an overload of the create and destroy member functions that accepts two iterators, that is a range to assign or to destroy. It can be used to create or destroy multiple entities at once:
In both cases, the create member function accepts also a list of default constructible component types to assign to the entities before to return. It's a faster alternative to the creation and subsequent assignment of components in separate steps.
When an entity is destroyed, the registry can freely reuse it internally with a slightly different identifier. In particular, the version of an entity is increased each and every time it's discarded.
In case entity identifiers are stored around, the registry offers all the functionalities required to test them and to get out of them the information they carry:
Components can be assigned to or removed from entities at any time with a few calls to member functions of the registry. As for the entities, the registry offers also a set of functionalities users can use to work with the components.
+Components can be assigned to or removed from entities at any time with a few calls to member functions of the registry. As for the entities, the registry offers also a set of functionalities users can use to work with the components.
The assign member function template creates, initializes and assigns to an entity the given component. It accepts a variable number of arguments to construct the component itself if present:
If an entity already has the given component, the replace member function template can be used to replace it:
In case users want to assign a component to an entity, but it's unknown whether the entity already has it or not, assign_or_replace does the work in a single call (there is a performance penalty to pay for this mainly due to the fact that it has to check if the entity already has the given component or not):
Note that assign_or_replace is a slightly faster alternative for the following if/else statement and nothing more:
As already shown, if in doubt about whether or not an entity has one or more components, the has member function template may be useful:
On the other side, if the goal is to delete a single component, the remove member function template is the way to go when it's certain that the entity owns a copy of the component:
Otherwise consider to use the reset member function. It behaves similarly to remove but with a strictly defined behavior (and a performance penalty is the price to pay for this). In particular it removes the component if and only if it exists, otherwise it returns safely to the caller:
There exist also two other versions of the reset member function:
If an entity already has the given component, the replace member function template can be used to replace it:
In case users want to assign a component to an entity, but it's unknown whether the entity already has it or not, assign_or_replace does the work in a single call (there is a performance penalty to pay for this mainly due to the fact that it has to check if the entity already has the given component or not):
Note that assign_or_replace is a slightly faster alternative for the following if/else statement and nothing more:
As already shown, if in doubt about whether or not an entity has one or more components, the has member function template may be useful:
On the other side, if the goal is to delete a single component, the remove member function template is the way to go when it's certain that the entity owns a copy of the component:
Otherwise consider to use the reset member function. It behaves similarly to remove but with a strictly defined behavior (and a performance penalty is the price to pay for this). In particular it removes the component if and only if it exists, otherwise it returns safely to the caller:
There exist also two other versions of the reset member function:
reset will remove the given component from each entity that has it:Finally, references to components can be retrieved simply by doing this:
-The get member function template gives direct access to the component of an entity stored in the underlying data structures of the registry. There exists also an alternative member function named try_get that returns a pointer to the component owned by an entity if any, a null pointer otherwise.
Finally, references to components can be retrieved simply by doing this:
+The get member function template gives direct access to the component of an entity stored in the underlying data structures of the registry. There exists also an alternative member function named try_get that returns a pointer to the component owned by an entity if any, a null pointer otherwise.
Because of how the registry works internally, it stores a bunch of signal handlers for each pool in order to notify some of its data structures on the construction and destruction of components or when an instance of a component is explicitly replaced by the user.
+
Because of how the registry works internally, it stores a bunch of signal handlers for each pool in order to notify some of its data structures on the construction and destruction of components or when an instance of a component is explicitly replaced by the user.
These signal handlers are also exposed and made available to users. These are the basic bricks to build fancy things like dependencies and reactive systems.
To get a sink to be used to connect and disconnect listeners so as to be notified on the creation of a component, use the on_construct member function:
To be notified when components are destroyed, use the on_destroy member function instead. Finally, the on_replace member function will return a sink to which to connect listeners to observe changes on components.
To be notified when components are destroyed, use the on_destroy member function instead. Finally, the on_replace member function will return a sink to which to connect listeners to observe changes on components.
The function type of a listener for the construction signal should be equivalent to the following:
-Where Component is intuitively the type of component of interest. In other words, a listener is provided with the registry that triggered the notification and the entity affected by the change, in addition to the newly created instance.
+
Where Component is intuitively the type of component of interest. In other words, a listener is provided with the registry that triggered the notification and the entity affected by the change, in addition to the newly created instance.
The sink returned by the on_replace member function accepts listeners the signature of which is the same of that of the construction signal. The one of the destruction signal is also similar, except for the Component parameter:
This is mainly due to performance reasons. While the component is made available after the construction, it is not when destroyed. Because of that, there are no reasons to get it from the underlying storage unless the user requires so. In this case, the registry is made available for the purpose.
+This is mainly due to performance reasons. While the component is made available after the construction, it is not when destroyed. Because of that, there are no reasons to get it from the underlying storage unless the user requires so. In this case, the registry is made available for the purpose.
Note also that:
To a certain extent, these limitations don't apply. However, it's risky to try to force them and users should respect the limitations unless they know exactly what they are doing. Subtle bugs are the price to pay in case of errors otherwise.
In general, events and therefore listeners must not be used as replacements for systems. They should not contain much logic and interactions with a registry should be kept to a minimum, if possible. Note also that the greater the number of listeners, the greater the performance hit when components are created or destroyed.
-Please, refer to the documentation of the signal class to know all the features it offers.
+
Please, refer to the documentation of the signal class to know all the features it offers.
There are many useful but less known functionalities that aren't described here, such as the connection objects or the possibility to attach listeners with a list of parameters that is shorter than that of the signal itself.
As mentioned above, signals are the basic tools to construct reactive systems, even if they are not enough on their own.
+
As mentioned above, signals are the basic tools to construct reactive systems, even if they are not enough on their own.
EnTT tries to take another step in that direction with the observer class template.
In order to explain what reactive systems are, this is a slightly revised quote from the documentation of the library that first introduced this tool, Entitas:
>Imagine you have 100 fighting units on the battlefield but only 10 of them >changed their positions. Instead of using a normal system and updating all 100 >entities depending on the position, you can use a reactive system which will >only update the 10 changed units. So efficient.
-In EnTT, this means to iterating over a reduced set of entities and components with respect to what would otherwise be returned from a view or a group.
+
In EnTT, this means to iterating over a reduced set of entities and components with respect to what would otherwise be returned from a view or a group.
On these words, however, the similarities with the proposal of Entitas also end. The rules of language and the design of the library obviously impose and allow different things.
An observer is initialized with an instance of a registry and a set of rules that describe what are the entities to intercept. As an example:
The class is default constructible if required and it can be reconfigured at any time by means of the connect member function. Moreover, instances can be disconnected from the underlying registries through the disconnect member function.
+
The class is default constructible if required and it can be reconfigured at any time by means of the connect member function. Moreover, instances can be disconnected from the underlying registries through the disconnect member function.
The observer offers also some member functions to query its internal state and to know if it's empty or how many entities it contains. Moreover, it can return a raw pointer to the list of entities it contains.
However, the most important features of this class are that:
These aspects make the observer an incredibly powerful tool to know at any time what are the entities that matched the given rules since the last time one asked:
-Note that the snippet above is equivalent to the following:
-At least as long as the observer isn't const. This means that the non-const overload of each does also reset the underlying data structure before to return to the caller, while the const overload does not for obvious reasons.
The collector is an utility aimed to generate a list of matchers (the actual rules) to use with an observer instead.
+
Note that the snippet above is equivalent to the following:
+At least as long as the observer isn't const. This means that the non-const overload of each does also reset the underlying data structure before to return to the caller, while the const overload does not for obvious reasons.
The collector is an utility aimed to generate a list of matchers (the actual rules) to use with an observer instead.
There are two types of matchers:
A grouping matcher supports also exclusion lists as well as single components.
-Roughly speaking, an observing matcher intercepts the entities for which the given components are replaced (as in registry::replace) while a grouping matcher tracks the entities that have assigned the given components since the last time one asked.
+
A grouping matcher supports also exclusion lists as well as single components.
+Roughly speaking, an observing matcher intercepts the entities for which the given components are replaced (as in registry::replace) while a grouping matcher tracks the entities that have assigned the given components since the last time one asked.
Note that, for a grouping matcher, if an entity already has all the components except one and the missing type is assigned to it, it is intercepted.
In addition, a matcher can be filtered with a where clause:
This clause introduces a way to intercept entities if and only if they are already part of a hypothetical group. If they are not, they aren't returned by the observer, no matter if they matched the given rule.
+
This clause introduces a way to intercept entities if and only if they are already part of a hypothetical group. If they are not, they aren't returned by the observer, no matter if they matched the given rule.
In the example above, whenever the component sprite of an entity is replaced, the observer probes the entity itself to verify that it has at least position and has not velocity before to store it aside. If one of the two conditions of the filter isn't respected, the entity is discared, no matter what.
A where clause accepts a theoretically unlimited number of types as well as multiple elements in the exclusion list. Moreover, every matcher can have it's own clause and multiple clauses for the same matcher are combined in a single one.
Defining components at runtime is useful to support plugin systems and mods in general. However, it seems impossible with a tool designed around a bunch of templates. Indeed it's not that difficult.
- Of course, some features cannot be easily exported into a runtime environment. As an example, sorting a group of components defined at runtime isn't for free if compared to most of the other operations. However, the basic functionalities of an entity-component system such as EnTT fit the problem perfectly and can also be used to manage runtime components if required.
+
Defining components at runtime is useful to support plugin systems and mods in general. However, it seems impossible with a tool designed around a bunch of templates. Indeed it's not that difficult.
+ Of course, some features cannot be easily exported into a runtime environment. As an example, sorting a group of components defined at runtime isn't for free if compared to most of the other operations. However, the basic functionalities of an entity-component system such as EnTT fit the problem perfectly and can also be used to manage runtime components if required.
All that is necessary to do it is to know the identifiers of the components. An identifier is nothing more than a number or similar that can be used at runtime to work with the type system.
In EnTT, identifiers are easily accessible:
Once the identifiers are made available, almost everything becomes pretty simple.
+Once the identifiers are made available, almost everything becomes pretty simple.
EnTT comes with an example (actually a test) that shows how to integrate compile-time and runtime components in a stack based JavaScript environment. It uses Duktape under the hood, mainly because I wanted to learn how it works at the time I was writing the code.
The code is not production-ready and overall performance can be highly improved. However, I sacrificed optimizations in favor of a more readable piece of code. I hope I succeeded.
- Note also that this isn't neither the only nor (probably) the best way to do it. In fact, the right way depends on the scripting language and the problem one is facing in general.
+
The code is not production-ready and overall performance can be highly improved. However, I sacrificed optimizations in favor of a more readable piece of code. I hope I succeeded.
+ Note also that this isn't neither the only nor (probably) the best way to do it. In fact, the right way depends on the scripting language and the problem one is facing in general.
That being said, feel free to use it at your own risk.
The basic idea is that of creating a compile-time component aimed to map all the runtime components assigned to an entity.
- Identifiers come in use to address the right function from a map when invoked from the runtime environment and to filter entities when iterating.
+
The basic idea is that of creating a compile-time component aimed to map all the runtime components assigned to an entity.
+ Identifiers come in use to address the right function from a map when invoked from the runtime environment and to filter entities when iterating.
With a bit of gymnastic, one can narrow views and improve the performance to some extent but it was not the goal of the example.
It goes without saying that sorting entities and components is possible with EnTT.
+
It goes without saying that sorting entities and components is possible with EnTT.
In fact, there are two functions that respond to slightly different needs:
Or by accessing their entities:
-There exists also the possibility to use a custom sort function object, as long as it adheres to the requirements described in the inline documentation.
+
Or by accessing their entities:
+There exists also the possibility to use a custom sort function object, as long as it adheres to the requirements described in the inline documentation.
This is possible mainly because users can get much more with a custom sort function object if the usage pattern is known. As an example, in case of an almost sorted pool, quick sort could be much, much slower than insertion sort.
In this case, instances of movement are arranged in memory so that cache misses are minimized when the two components are iterated together.
In this case, instances of movement are arranged in memory so that cache misses are minimized when the two components are iterated together.
As a side note, when groups are involved, the sorting functions are applied separately to the elements that are part of the group and to those that are not, effectively generating two partitions, both of which can be ordered independently of each other.
The so called helpers are small classes and functions mainly designed to offer built-in support for the most basic functionalities.
+
The so called helpers are small classes and functions mainly designed to offer built-in support for the most basic functionalities.
The list of helpers will grow longer as time passes and new ideas come out.
In EnTT, there exists a sort of null entity made available to users that is accessible via the entt::null variable.
+
In EnTT, there exists a sort of null entity made available to users that is accessible via the entt::null variable.
The library guarantees that the following expression always returns false:
In other terms, a registry will reject the null entity in all cases because it isn't considered valid. It means that the null entity cannot own components for obvious reasons.
+
In other terms, a registry will reject the null entity in all cases because it isn't considered valid. It means that the null entity cannot own components for obvious reasons.
The type of the null entity is internal and should not be used for any purpose other than defining the null entity itself. However, there exist implicit conversions from the null entity to identifiers of any allowed type:
Similarly, the null entity can be compared to any other identifier:
-Similarly, the null entity can be compared to any other identifier:
+The use of multiple registries is quite common. Examples of use are the separation of the UI from the simulation or the loading of different scenes in the background, possibly on a separate thread, without having to keep track of which entity belongs to which scene.
+
The use of multiple registries is quite common. Examples of use are the separation of the UI from the simulation or the loading of different scenes in the background, possibly on a separate thread, without having to keep track of which entity belongs to which scene.
In fact, with EnTT this is even a recommended practice, as the registry is nothing more than a container and different optimizations and strategies can be applied to different containers.
Once there are multiple registries available, however, one or more methods are needed to transfer information from one container to another and this results in the stomp member function and a couple of overloads of the create member function for the registry class .
+
Once there are multiple registries available, however, one or more methods are needed to transfer information from one container to another and this results in the stomp member function and a couple of overloads of the create member function for the registry class .
The stomp function allows to take one entity from a registry and use it to stomp one or more entities in another registry (or even the same, actually making local copies). On the other hand, the overloads of the create member function can be used to spawn new entities from a prototype.
These features open definitely the doors to a lot of interesting features like migrating entities between registries, prototypes, shadow registry, prefabs, shared components without an explicit owner and copy-on-write policies among the other things.
The registry class is designed to create short circuits between its functions within certain limits. This allows to easily define dependencies between different operations.
+
The registry class is designed to create short circuits between its functions within certain limits. This allows to easily define dependencies between different operations.
For example, the following adds (or replaces) the component a_type whenever my_type is assigned to an entity:
Similarly, the code shown below removes a_type from an entity whenever my_type is assigned to it:
A dependency can also be easily broken as follows:
-There are many other types of dependencies besides those shown above. In general, all functions that accept an entity as the first argument are good candidates for this purpose.
+Similarly, the code shown below removes a_type from an entity whenever my_type is assigned to it:
A dependency can also be easily broken as follows:
+There are many other types of dependencies besides those shown above. In general, all functions that accept an entity as the first argument are good candidates for this purpose.
There's nothing magical about the way tags can be assigned to entities while avoiding a performance hit at runtime. Nonetheless, the syntax can be annoying and that's why a more user-friendly shortcut is provided to do it.
- This shortcut is the alias template entt::tag.
There's nothing magical about the way tags can be assigned to entities while avoiding a performance hit at runtime. Nonetheless, the syntax can be annoying and that's why a more user-friendly shortcut is provided to do it.
+ This shortcut is the alias template entt::tag.
If used in combination with hashed strings, it helps to use tags where types would be required otherwise. As an example:
-The actor class is designed for those who don't feel immediately comfortable working with components or for those who are migrating a project and want to approach it one step at a time.
This class acts as a thin wrapper for an entity and for all its components. It's constructed with a registry to be used behind the scenes and is in charge of the destruction of the entity when it goes out of the scope.
+
This class acts as a thin wrapper for an entity and for all its components. It's constructed with a registry to be used behind the scenes and is in charge of the destruction of the entity when it goes out of the scope.
An actor offers all the functionalities required to work with components, such as the assign andremove member functions, but also has,get, try_get and so on.
My advice isn't to use the actor class to hide entities and components behind a more object-oriented interface. Instead, users should rely on it only where strictly necessary. In all other cases, it's highly advisable to become familiar with the model of EnTT and work directly with the registry, the views and the groups, rather than with a tool that could introduce a performance degradation.
It is often convenient to assign context variables to a registry, so as to make it the only source of truth of an application.
+
It is often convenient to assign context variables to a registry, so as to make it the only source of truth of an application.
This is possible by means of a member function named set to use to create a context variable from a given type. Later on, either ctx or try_ctx can be used to retrieve the newly created instance and unset is there to literally reset it if needed.
Example of use:
-The type of a context variable must be such that it's default constructible and can be moved. The set member function either creates a new instance of the context variable or overwrites an already existing one if any. The try_ctx member function returns a pointer to the context variable if it exists, otherwise it returns a null pointer. This fits well with the if statement with initializer.
The type of a context variable must be such that it's default constructible and can be moved. The set member function either creates a new instance of the context variable or overwrites an already existing one if any. The try_ctx member function returns a pointer to the context variable if it exists, otherwise it returns a null pointer. This fits well with the if statement with initializer.
The registry class offers basic support to serialization.
+
The registry class offers basic support to serialization.
It doesn't convert components to bytes directly, there wasn't the need of another tool for serialization out there. Instead, it accepts an opaque object with a suitable interface (namely an archive) to serialize its internal data structures and restore them later. The way types and instances are converted to a bunch of bytes is completely in charge to the archive and thus to final users.
The goal of the serialization part is to allow users to make both a dump of the entire registry or a narrower snapshot, that is to select only the components in which they are interested.
+
The goal of the serialization part is to allow users to make both a dump of the entire registry or a narrower snapshot, that is to select only the components in which they are interested.
Intuitively, the use cases are different. As an example, the first approach is suitable for local save/restore functionalities while the latter is suitable for creating client-server applications and for transferring somehow parts of the representation side to side.
To take a snapshot of the registry, use the snapshot member function. It returns a temporary object properly initialized to save the whole registry or parts of it.
Example of use:
-It isn't necessary to invoke all these functions each and every time. What functions to use in which case mostly depends on the goal and there is not a golden rule to do that.
-The entities member function asks the registry to serialize all the entities that are still in use along with their versions. On the other side, the destroyed member function tells to the registry to serialize the entities that have been destroyed and are no longer in use.
+
It isn't necessary to invoke all these functions each and every time. What functions to use in which case mostly depends on the goal and there is not a golden rule to do that.
+The entities member function asks the registry to serialize all the entities that are still in use along with their versions. On the other side, the destroyed member function tells to the registry to serialize the entities that have been destroyed and are no longer in use.
These two functions can be used to save and restore the whole set of entities with the versions they had during serialization.
The component member function is a function template the aim of which is to store aside components. The presence of a template parameter list is a consequence of a couple of design choices from the past and in the present:
There exists also another version of the component member function that accepts a range of entities to serialize. This version is a bit slower than the other one, mainly because it iterates the range of entities more than once for internal purposes. However, it can be used to filter out those entities that shouldn't be serialized for some reasons.
+
There exists also another version of the component member function that accepts a range of entities to serialize. This version is a bit slower than the other one, mainly because it iterates the range of entities more than once for internal purposes. However, it can be used to filter out those entities that shouldn't be serialized for some reasons.
As an example:
Note that component stores items along with entities. It means that it works properly without a call to the entities member function.
Once a snapshot is created, there exist mainly two ways to load it: as a whole and in a kind of continuous mode.
+
Note that component stores items along with entities. It means that it works properly without a call to the entities member function.
Once a snapshot is created, there exist mainly two ways to load it: as a whole and in a kind of continuous mode.
The following sections describe both loaders and archives in details.
A snapshot loader requires that the destination registry be empty and loads all the data at once while keeping intact the identifiers that the entities originally had.
+
A snapshot loader requires that the destination registry be empty and loads all the data at once while keeping intact the identifiers that the entities originally had.
To do that, the registry offers a member function named loader that returns a temporary object properly initialized to restore a snapshot.
Example of use:
-It isn't necessary to invoke all these functions each and every time. What functions to use in which case mostly depends on the goal and there is not a golden rule to do that. For obvious reasons, what is important is that the data are restored in exactly the same order in which they were serialized.
+It isn't necessary to invoke all these functions each and every time. What functions to use in which case mostly depends on the goal and there is not a golden rule to do that. For obvious reasons, what is important is that the data are restored in exactly the same order in which they were serialized.
The entities and destroyed member functions restore the sets of entities and the versions that the entities originally had at the source.
The component member function restores all and only the components specified and assigns them to the right entities. Note that the template parameter list must be exactly the same used during the serialization.
The orphans member function literally destroys those entities that have no components attached. It's usually useless if the snapshot is a full dump of the source. However, in case all the entities are serialized but only few components are saved, it could happen that some of the entities have no components once restored. The best users can do to deal with them is to destroy those entities and thus update their versions.
A continuous loader is designed to load data from a source registry to a (possibly) non-empty destination. The loader can accommodate in a registry more than one snapshot in a sort of continuous loading that updates the destination one step at a time.
- Identifiers that entities originally had are not transferred to the target. Instead, the loader maps remote identifiers to local ones while restoring a snapshot. Because of that, this kind of loader offers a way to update automatically identifiers that are part of components (as an example, as data members or gathered in a container).
+
A continuous loader is designed to load data from a source registry to a (possibly) non-empty destination. The loader can accommodate in a registry more than one snapshot in a sort of continuous loading that updates the destination one step at a time.
+ Identifiers that entities originally had are not transferred to the target. Instead, the loader maps remote identifiers to local ones while restoring a snapshot. Because of that, this kind of loader offers a way to update automatically identifiers that are part of components (as an example, as data members or gathered in a container).
Another difference with the snapshot loader is that the continuous loader does not need to work with the private data structures of a registry. Furthermore, it has an internal state that must persist over time. Therefore, there is no reason to create it by means of a registry, or to limit its lifetime to that of a temporary object.
Example of use:
-It isn't necessary to invoke all these functions each and every time. What functions to use in which case mostly depends on the goal and there is not a golden rule to do that. For obvious reasons, what is important is that the data are restored in exactly the same order in which they were serialized.
+It isn't necessary to invoke all these functions each and every time. What functions to use in which case mostly depends on the goal and there is not a golden rule to do that. For obvious reasons, what is important is that the data are restored in exactly the same order in which they were serialized.
The entities and destroyed member functions restore groups of entities and map each entity to a local counterpart when required. In other terms, for each remote entity identifier not yet registered by the loader, the latter creates a local identifier so that it can keep the local entity in sync with the remote one.
The component member function restores all and only the components specified and assigns them to the right entities.
+
The component member function restores all and only the components specified and assigns them to the right entities.
In case the component contains entities itself (either as data members of type entt::entity or as containers of entities), the loader can update them automatically. To do that, it's enough to specify the data members to update as shown in the example.
The orphans member function literally destroys those entities that have no components after a restore. It has exactly the same purpose described in the previous section and works the same way.
Finally, shrink helps to purge local entities that no longer have a remote conterpart. Users should invoke this member function after restoring each snapshot, unless they know exactly what they are doing.
Where entt::entity is the type of the entities used by the registry. Note that all the member functions of the snapshot class make also an initial call to this endpoint to save the size of the set they are going to store.
+
Where entt::entity is the type of the entities used by the registry. Note that all the member functions of the snapshot class make also an initial call to this endpoint to save the size of the set they are going to store.
In addition, an archive must accept a pair of entity and component for each type to be serialized. Therefore, given a type T, the archive must contain a function call operator with the following signature:
The output archive can freely decide how to serialize the data. The register is not affected at all by the decision.
+The output archive can freely decide how to serialize the data. The register is not affected at all by the decision.
Where entt::entity is the type of the entities used by the registry. Each time the function is invoked, the archive must read the next element from the underlying storage and copy it in the given variable. Note that all the member functions of a loader class make also an initial call to this endpoint to read the size of the set they are going to load.
+
Where entt::entity is the type of the entities used by the registry. Each time the function is invoked, the archive must read the next element from the underlying storage and copy it in the given variable. Note that all the member functions of a loader class make also an initial call to this endpoint to read the size of the set they are going to load.
In addition, the archive must accept a pair of entity and component for each type to be restored. Therefore, given a type T, the archive must contain a function call operator with the following signature:
Every time such an operator is invoked, the archive must read the next elements from the underlying storage and copy them in the given variables.
+Every time such an operator is invoked, the archive must read the next elements from the underlying storage and copy them in the given variables.
EnTT comes with some examples (actually some tests) that show how to integrate a well known library for serialization as an archive. It uses Cereal C++ under the hood, mainly because I wanted to learn how it works at the time I was writing the code.
The basic idea is to store everything in a group of queues in memory, then bring everything back to the registry with different loaders.
First of all, it is worth answering an obvious question: why views and groups?
- Briefly, they are a good tool to enforce single responsibility. A system that has access to a registry can create and destroy entities, as well as assign and remove components. On the other side, a system that has access to a view or a group can only iterate entities and their components, then read or update the data members of the latter.
+
First of all, it is worth answering an obvious question: why views and groups?
+ Briefly, they are a good tool to enforce single responsibility. A system that has access to a registry can create and destroy entities, as well as assign and remove components. On the other side, a system that has access to a view or a group can only iterate entities and their components, then read or update the data members of the latter.
It is a subtle difference that can help designing a better software sometimes.
More in details, views are a non-intrusive tool to access entities and components without affecting other functionalities or increasing the memory consumption. On the other side, groups are an intrusive tool that allows to reach higher performance along critical paths but has also a price to pay for that.
-There are mainly two kinds of views: compile-time (also known as view) and runtime (also known as runtime_view).
- The former require that users indicate at compile-time what are the components involved and can make several optimizations because of that. The latter can be constructed at runtime instead and are a bit slower to iterate entities and components.
+
There are mainly two kinds of views: compile-time (also known as view) and runtime (also known as runtime_view).
+ The former require that users indicate at compile-time what are the components involved and can make several optimizations because of that. The latter can be constructed at runtime instead and are a bit slower to iterate entities and components.
In both cases, creating and destroying a view isn't expensive at all because views don't have any type of initialization. Moreover, views don't affect any other functionality of the registry and keep memory usage at a minimum.
Groups come in three different flavors: full-owning groups, partial-owning groups and non-owning groups. The main difference between them is in terms of performance.
+
Groups come in three different flavors: full-owning groups, partial-owning groups and non-owning groups. The main difference between them is in terms of performance.
Groups can literally own one or more component types. It means that they will be allowed to rearrange pools so as to speed up iterations. Roughly speaking: the more components a group owns, the faster it is to iterate them. On the other side, a given component can belong to multiple groups only if they are nested, so users have to define groups carefully to get the best out of them.
Continue reading for more details or refer to the inline documentation.
A view behaves differently if it's constructed for a single component or if it has been created to iterate multiple components. Even the API is slightly different in the two cases.
-Single component views are specialized in order to give a boost in terms of performance in all the situations. This kind of views can access the underlying data structures directly and avoid superfluous checks. There is nothing as fast as a single component view. In fact, they walk through a packed array of components and return them one at a time.
- Single component views offer a bunch of functionalities to get the number of entities they are going to return and a raw access to the entity list as well as to the component list. It's also possible to ask a view if it contains a given entity.
+
Single component views are specialized in order to give a boost in terms of performance in all the situations. This kind of views can access the underlying data structures directly and avoid superfluous checks. There is nothing as fast as a single component view. In fact, they walk through a packed array of components and return them one at a time.
+ Single component views offer a bunch of functionalities to get the number of entities they are going to return and a raw access to the entity list as well as to the component list. It's also possible to ask a view if it contains a given entity.
Refer to the inline documentation for all the details.
Multi component views iterate entities that have at least all the given components in their bags. During construction, these views look at the number of entities available for each component and pick up a reference to the smallest set of candidates in order to speed up iterations.
- They offer fewer functionalities than their companion views for single component. In particular, a multi component view exposes utility functions to get the estimated number of entities it is going to return and to know whether it's empty or not. It's also possible to ask a view if it contains a given entity.
+
Multi component views iterate entities that have at least all the given components in their bags. During construction, these views look at the number of entities available for each component and pick up a reference to the smallest set of candidates in order to speed up iterations.
+ They offer fewer functionalities than their companion views for single component. In particular, a multi component view exposes utility functions to get the estimated number of entities it is going to return and to know whether it's empty or not. It's also possible to ask a view if it contains a given entity.
Refer to the inline documentation for all the details.
There is no need to store views around for they are extremely cheap to construct, even though they can be copied without problems and reused freely. Views also return newly created and correctly initialized iterators whenever begin or end are invoked.
Views share the way they are created by means of a registry:
-Filtering entities by components is also supported:
-To iterate a view, either use it in a range-for loop:
-Or rely on the each member function to iterate entities and get all their components at once:
The each member function is highly optimized. Unless users want to iterate only entities or get only some of the components, this should be the preferred approach. Note that the entity can also be excluded from the parameter list if not required, but this won't improve performance for multi component views.
+
Filtering entities by components is also supported:
+To iterate a view, either use it in a range-for loop:
+Or rely on the each member function to iterate entities and get all their components at once:
The each member function is highly optimized. Unless users want to iterate only entities or get only some of the components, this should be the preferred approach. Note that the entity can also be excluded from the parameter list if not required, but this won't improve performance for multi component views.
There exists also an alternative version of each named less that works exactly as its counterpart but for the fact that it doesn't return empty components to the caller.
As a side note, in the case of single component views, get accepts but doesn't strictly require a template parameter, since the type is implicitly defined:
Note: prefer the get member function of a view instead of the get member function template of a registry during iterations, if possible. However, keep in mind that it works only with the components of the view itself.
Note: prefer the get member function of a view instead of the get member function template of a registry during iterations, if possible. However, keep in mind that it works only with the components of the view itself.
Runtime views iterate entities that have at least all the given components in their bags. During construction, these views look at the number of entities available for each component and pick up a reference to the smallest set of candidates in order to speed up iterations.
- They offer more or less the same functionalities of a multi component view. However, they don't expose a get member function and users should refer to the registry that generated the view to access components. In particular, a runtime view exposes utility functions to get the estimated number of entities it is going to return and to know whether it's empty or not. It's also possible to ask a runtime view if it contains a given entity.
+
Runtime views iterate entities that have at least all the given components in their bags. During construction, these views look at the number of entities available for each component and pick up a reference to the smallest set of candidates in order to speed up iterations.
+ They offer more or less the same functionalities of a multi component view. However, they don't expose a get member function and users should refer to the registry that generated the view to access components. In particular, a runtime view exposes utility functions to get the estimated number of entities it is going to return and to know whether it's empty or not. It's also possible to ask a runtime view if it contains a given entity.
Refer to the inline documentation for all the details.
Runtime view are extremely cheap to construct and should not be stored around in any case. They should be used immediately after creation and then they should be thrown away. The reasons for this go far beyond the scope of this document.
+
Runtime view are extremely cheap to construct and should not be stored around in any case. They should be used immediately after creation and then they should be thrown away. The reasons for this go far beyond the scope of this document.
To iterate a runtime view, either use it in a range-for loop:
Or rely on the each member function to iterate entities:
Performance are exactly the same in both cases.
+Or rely on the each member function to iterate entities:
Performance are exactly the same in both cases.
Note: runtime views are meant for all those cases where users don't know at compile-time what components to use to iterate entities. This is particularly well suited to plugin systems and mods in general. Where possible, don't use runtime views, as their performance are slightly inferior to those of the other views.
Groups are meant to iterate multiple components at once and offer a (much) faster alternative to views. Roughly speaking, they just play in another league when compared to views.
- Groups overcome the performance of the other tools available but require to get the ownership of components and this sets some constraints on pools. On the other side, groups aren't an automatism that increases memory consumption, affects functionalities and tries to optimize iterations for all the possible combinations of components. Users can decide when to pay for groups and to what extent.
- The most interesting aspect of groups is that they fit usage patterns. Other solutions around usually try to optimize everything, because it is known that somewhere within the everything there are also our usage patterns. However this has a cost that isn't negligible, both in terms of performance and memory usage. Ironically, users pay the price also for things they don't want and this isn't something I like much. Even worse, one cannot easily disable such a behavior. Groups work differently instead and are designed to optimize only the real use cases when users find they need to.
+
Groups are meant to iterate multiple components at once and offer a (much) faster alternative to views. Roughly speaking, they just play in another league when compared to views.
+ Groups overcome the performance of the other tools available but require to get the ownership of components and this sets some constraints on pools. On the other side, groups aren't an automatism that increases memory consumption, affects functionalities and tries to optimize iterations for all the possible combinations of components. Users can decide when to pay for groups and to what extent.
+ The most interesting aspect of groups is that they fit usage patterns. Other solutions around usually try to optimize everything, because it is known that somewhere within the everything there are also our usage patterns. However this has a cost that isn't negligible, both in terms of performance and memory usage. Ironically, users pay the price also for things they don't want and this isn't something I like much. Even worse, one cannot easily disable such a behavior. Groups work differently instead and are designed to optimize only the real use cases when users find they need to.
Another nice-to-have feature of groups is that they have no impact on memory consumption, put aside full non-owning groups that are pretty rare and should be avoided as long as possible.
All groups affect to an extent the creation and destruction of their components. This is due to the fact that they must observe changes in the pools of interest and arrange data correctly when needed for the types they own.
+
All groups affect to an extent the creation and destruction of their components. This is due to the fact that they must observe changes in the pools of interest and arrange data correctly when needed for the types they own.
That being said, the way groups operate is beyond the scope of this document. However, it's unlikely that users will be able to appreciate the impact of groups on other functionalities of the registry.
Groups offer a bunch of functionalities to get the number of entities they are going to return and a raw access to the entity list as well as to the component list for owned components. It's also possible to ask a group if it contains a given entity.
+
Groups offer a bunch of functionalities to get the number of entities they are going to return and a raw access to the entity list as well as to the component list for owned components. It's also possible to ask a group if it contains a given entity.
Refer to the inline documentation for all the details.
There is no need to store groups around for they are extremely cheap to construct, even though they can be copied without problems and reused freely. A group performs an initialization step the very first time it's requested and this could be quite costly. To avoid it, consider creating the group when no components have been assigned yet. If the registry is empty, preparation is extremely fast. Groups also return newly created and correctly initialized iterators whenever begin or end are invoked.
To iterate groups, either use them in a range-for loop:
-Or rely on the each member function to iterate entities and get all their components at once:
The each member function is highly optimized. Unless users want to iterate only entities, this should be the preferred approach. Note that the entity can also be excluded from the parameter list if not required and it can improve even further the performance during iterations.
Or rely on the each member function to iterate entities and get all their components at once:
The each member function is highly optimized. Unless users want to iterate only entities, this should be the preferred approach. Note that the entity can also be excluded from the parameter list if not required and it can improve even further the performance during iterations.
Note: prefer the get member function of a group instead of the get member function template of a registry during iterations, if possible. However, keep in mind that it works only with the components of the group itself.
Let's go a bit deeper into the different types of groups made available by this library to know how they are constructed and what are the differences between them.
A full-owning group is the fastest tool an user can expect to use to iterate multiple components at once. It iterates all the components directly, no indirection required. This type of groups performs more or less as if users are accessing sequentially a bunch of packed arrays of components all sorted identically.
A full-owning group is created as:
-Filtering entities by components is also supported:
-Once created, the group gets the ownership of all the components specified in the template parameter list and arranges their pools so as to iterate all of them as fast as possible.
+Filtering entities by components is also supported:
+Once created, the group gets the ownership of all the components specified in the template parameter list and arranges their pools so as to iterate all of them as fast as possible.
Sorting owned components is no longer allowed once the group has been created. However, full-owning groups can be sorted by means of their sort member functions, if required. Sorting a full-owning group affects all the instances of the same group (it means that users don't have to call sort on each instance to sort all of them because they share the underlying data structure).
A partial-owning group works similarly to a full-owning group for the components it owns, but relies on indirection to get components owned by other groups. This isn't as fast as a full-owning group, but it's already much faster than views when there are only one or two free components to retrieve (the most common cases likely). In the worst case, it's not slower than views anyway.
A partial-owning group is created as:
-Filtering entities by components is also supported:
-Once created, the group gets the ownership of all the components specified in the template parameter list and arranges their pools so as to iterate all of them as fast as possible. The ownership of the types provided via entt::get doesn't pass to the group instead.
Filtering entities by components is also supported:
+Once created, the group gets the ownership of all the components specified in the template parameter list and arranges their pools so as to iterate all of them as fast as possible. The ownership of the types provided via entt::get doesn't pass to the group instead.
Sorting owned components is no longer allowed once the group has been created. However, partial-owning groups can be sorted by means of their sort member functions, if required. Sorting a partial-owning group affects all the instances of the same group (it means that users don't have to call sort on each instance to sort all of them because they share the underlying data structure).
Non-owning groups are usually fast enough, for sure faster than views and well suited for most of the cases. However, they require custom data structures to work properly and they increase memory consumption. As a rule of thumb, users should avoid using non-owning groups, if possible.
A non-owning group is created as:
-Filtering entities by components is also supported:
-The group doesn't receive the ownership of any type of component in this case. This type of groups is therefore the least performing in general, but also the only one that can be used in any situation to improve a performance where necessary.
+Filtering entities by components is also supported:
+The group doesn't receive the ownership of any type of component in this case. This type of groups is therefore the least performing in general, but also the only one that can be used in any situation to improve a performance where necessary.
Non-owning groups can be sorted by means of their sort member functions, if required. Sorting a non-owning group affects all the instance of the same group (it means that users don't have to call sort on each instance to sort all of them because they share the set of entities).
registry.group<sprite, transform>().registry.group<sprite, transform, rotation>().Fortunately, these are also very common cases if not the most common ones.
+
Fortunately, these are also very common cases if not the most common ones.
This allows users to have the highest possible performance on a greater number of component combinations.
Two nested groups are such that they own at least one type of component and the list of component types involved by one of them is contained entirely in that of the other. More specifically, this applies independently to all component lists used to define a group.
+
Two nested groups are such that they own at least one type of component and the list of component types involved by one of them is contained entirely in that of the other. More specifically, this applies independently to all component lists used to define a group.
Therefore, the rules for defining whether two or more groups are nested can be summarized as:
It means that more nested groups extend the their parents by adding more conditions in the form of new components.
As mentioned, the components don't necessarily have to be all owned so that two groups can be considered nested. In other words, the following definitions are fully valid:
registry.group<sprite>(entt::get<renderable>).registry.group<sprite, transform>(entt::get<renderable>).registry.group<sprite, transform>(entt::get<renderable, rotation>).registry.group<sprite>(entt::get<renderable>).registry.group<sprite, transform>(entt::get<renderable>).registry.group<sprite, transform>(entt::get<renderable, rotation>).Exclusion lists also play their part in this respect. When it comes to defining nested groups, an excluded type of component T is treated as being an observed type not_T. Therefore, these two definitions:
registry.group<sprite, transform>().registry.group<sprite, transform>(entt::exclude<rotation>).registry.group<sprite, transform>(entt::exclude<rotation>).Are treated as if users were defining the following groups:
group<sprite, transform>().group<sprite, transform>(entt::get<not_rotation>).group<sprite, transform>(entt::get<not_rotation>).Where not_rotation is an empty tag present only when rotation is not.
Because of this, to define a new group that is more restrictive than an existing one, it's enough to take the list of component types of the latter and extend it by adding new component types either owned, observed or excluded, without any precautions depending on the case.
- The opposite is also true. To define a larger group, it will be enough to take an existing one and remove constraints from it, in whatever form they are expressed.
+
Because of this, to define a new group that is more restrictive than an existing one, it's enough to take the list of component types of the latter and extend it by adding new component types either owned, observed or excluded, without any precautions depending on the case.
+ The opposite is also true. To define a larger group, it will be enough to take an existing one and remove constraints from it, in whatever form they are expressed.
Note that the greater the number of component types involved by a group, the more restrictive it is.
Despite the extreme flexibility of nested groups, which allow to independently use component types either owned, observed or excluded, the real strength of this tool lies in the possibility of defining a greater number of groups that own the same components, thus offering the best performance in more cases.
+
Despite the extreme flexibility of nested groups, which allow to independently use component types either owned, observed or excluded, the real strength of this tool lies in the possibility of defining a greater number of groups that own the same components, thus offering the best performance in more cases.
In fact, given a list of component types involved by a group, the greater the number of those owned, the greater the performance of the group itself.
As a side note, it's no longer possible to sort all groups when defining nested ones. This is because the most restrictive groups share the elements with the less restrictive ones and ordering the latter would invalidate the former.
+
As a side note, it's no longer possible to sort all groups when defining nested ones. This is because the most restrictive groups share the elements with the less restrictive ones and ordering the latter would invalidate the former.
However, given a family of nested groups, it's still possible to sort the most restrictive of them. To prevent users from having to remember which of their groups is the most restrictive, they offer the sortable member function to know if their items can be sorted or not.
The registry class offers two overloads when it comes to constructing views and groups: a const version and a non-const one. The former accepts both const and non-const types as template parameters, the latter accepts only const types instead.
+
The registry class offers two overloads when it comes to constructing views and groups: a const version and a non-const one. The former accepts both const and non-const types as template parameters, the latter accepts only const types instead.
It means that views and groups can be constructed also from a const registry and they propagate the constness of the registry to the types involved. As an example:
Consider the following definition for a non-const view instead:
-In the example above, view can be used to access either read-only or writable position components while velocity components are read-only in all cases.
+
Consider the following definition for a non-const view instead:
+In the example above, view can be used to access either read-only or writable position components while velocity components are read-only in all cases.
In other terms, these statements are all valid:
It's not possible to get non-const references to velocity components from the same view instead and these will result in compilation errors:
Similarly, the each member functions will propagate constness to the type of the components returned during iterations:
Obviously, a caller can still refer to the position components through a const reference because of the rules of the language that fortunately already allow it.
It's not possible to get non-const references to velocity components from the same view instead and these will result in compilation errors:
Similarly, the each member functions will propagate constness to the type of the components returned during iterations:
Obviously, a caller can still refer to the position components through a const reference because of the rules of the language that fortunately already allow it.
The same concepts apply to groups as well.
Views and groups are narrow windows on the entire list of entities. They work by filtering entities according to their components.
+
Views and groups are narrow windows on the entire list of entities. They work by filtering entities according to their components.
In some cases there may be the need to iterate all the entities still in use regardless of their components. The registry offers a specific member function to do that:
It returns to the caller all the entities that are still in use by means of the given function.
- As a rule of thumb, consider using a view or a group if the goal is to iterate entities that have a determinate set of components. These tools are usually much faster than combining this function with a bunch of custom tests.
+
It returns to the caller all the entities that are still in use by means of the given function.
+ As a rule of thumb, consider using a view or a group if the goal is to iterate entities that have a determinate set of components. These tools are usually much faster than combining this function with a bunch of custom tests.
In all the other cases, this is the way to go.
There exists also another member function to use to retrieve orphans. An orphan is an entity that is still in use and has no assigned components.
+
There exists also another member function to use to retrieve orphans. An orphan is an entity that is still in use and has no assigned components.
The signature of the function is the same of each:
To test the orphanity of a single entity, use the member function orphan instead. It accepts a valid entity identifer as an argument and returns true in case the entity is an orphan, false otherwise.
In general, all these functions can result in poor performance.
+
To test the orphanity of a single entity, use the member function orphan instead. It accepts a valid entity identifer as an argument and returns true in case the entity is an orphan, false otherwise.
In general, all these functions can result in poor performance.
each is fairly slow because of some checks it performs on each and every entity. For similar reasons, orphans can be even slower. Both functions should not be used frequently to avoid the risk of a performance hit.
Most of the ECS available out there don't allow to create and destroy entities and components during iterations.
+
Most of the ECS available out there don't allow to create and destroy entities and components during iterations.
EnTT partially solves the problem with a few limitations:
In these cases, iterators aren't invalidated. To be clear, it doesn't mean that also references will continue to be valid.
+
In these cases, iterators aren't invalidated. To be clear, it doesn't mean that also references will continue to be valid.
Consider the following example:
The each member function won't break (because iterators aren't invalidated) but there are no guarantees on references. Use a common range-for loop and get components directly from the view or move the creation of components at the end of the function to avoid dangling pointers.
Iterators are invalidated instead and the behavior is undefined if an entity is modified or destroyed and it's not the one currently returned by the iterator nor a newly created one.
+
The each member function won't break (because iterators aren't invalidated) but there are no guarantees on references. Use a common range-for loop and get components directly from the view or move the creation of components at the end of the function to avoid dangling pointers.
Iterators are invalidated instead and the behavior is undefined if an entity is modified or destroyed and it's not the one currently returned by the iterator nor a newly created one.
To work around it, possible approaches are:
A notable side effect of this feature is that the number of required allocations is further reduced in most of the cases.
Groups are a (much) faster alternative to views. However, the higher the performance, the greater the constraints on what is allowed and what is not.
+
Groups are a (much) faster alternative to views. However, the higher the performance, the greater the constraints on what is allowed and what is not.
In particular, groups add in some rare cases a limitation on the creation of components during iterations. It happens in quite particular cases. Given the nature and the scope of the groups, it isn't something in which it will happen to come across probably, but it's good to know it anyway.
First of all, it must be said that creating components while iterating a group isn't a problem at all and can be done freely as it happens with the views. The same applies to the destruction of components and entities, for which the rules mentioned above apply.
-The additional limitation pops out instead when a given component that is owned by a group is iterated outside of it. In this case, adding components that are part of the group itself may invalidate the iterators. There are no further limitations to the destruction of components and entities.
+
The additional limitation pops out instead when a given component that is owned by a group is iterated outside of it. In this case, adding components that are part of the group itself may invalidate the iterators. There are no further limitations to the destruction of components and entities.
Fortunately, this isn't always true. In fact, it almost never is and this happens only under certain conditions. In particular:
In other words, the limitation doesn't exist as long as a type is treated as a free type (as an example with multi component views and partial- or non-owning groups) or iterated with its own group, but it can occur if the type is used as a main type to rule on an iteration.
+
In other words, the limitation doesn't exist as long as a type is treated as a free type (as an example with multi component views and partial- or non-owning groups) or iterated with its own group, but it can occur if the type is used as a main type to rule on an iteration.
This happens because groups own the pools of their components and organize the data internally to maximize performance. Because of that, full consistency for owned components is guaranteed only when they are iterated as part of their groups or as free types with multi component views and groups in general.
An empty type T is such that std::is_empty_v<T> returns true. They are also the same types for which empty base optimization (EBO) is possibile.
+
An empty type T is such that std::is_empty_v<T> returns true. They are also the same types for which empty base optimization (EBO) is possibile.
EnTT handles these types in a special way, optimizing both in terms of performance and memory usage. However, this also has consequences that are worth mentioning.
When an empty type is detected, it's not instantiated in any case. Therefore, only the entities to which it's assigned are made available. All the iterators as well as the get member functions of the registry, the views and the groups will return temporary objects. Similarly, some functions such as try_get or the raw access to the list of components aren't available for this kind of types. Finally, the sort functionality accepts only callbacks that require to return entities rather than components:
On the other hand, iterations are faster because only the entities to which the type is assigned are considered. Moreover, less memory is used, since there doesn't exist any instance of the component, no matter how many entities it is assigned to.
+On the other hand, iterations are faster because only the entities to which the type is assigned are considered. Moreover, less memory is used, since there doesn't exist any instance of the component, no matter how many entities it is assigned to.
For similar reasons, wherever a function type of a listener accepts a component, it cannot be caught by a non-const reference. Capture it by copy or by const reference instead.
-More in general, none of the features offered by the library is affected, but for the ones that require to return actual instances.
+
More in general, none of the features offered by the library is affected, but for the ones that require to return actual instances.
This optimization can be disabled by defining the ENTT_DISABLE_ETO macro. In this case, the empty types will be treated like all other types, no matter what.
In general, the entire registry isn't thread safe as it is. Thread safety isn't something that users should want out of the box for several reasons. Just to mention one of them: performance.
+
In general, the entire registry isn't thread safe as it is. Thread safety isn't something that users should want out of the box for several reasons. Just to mention one of them: performance.
Views, groups and consequently the approach adopted by EnTT are the great exception to the rule. It's true that views, groups and iterators in general aren't thread safe by themselves. Because of this users shouldn't try to iterate a set of components and modify the same set concurrently. However:
X or assign and removes that component from a set of entities, another thread can safely do the same with components Y and Z and everything will work like a charm. As a trivial example, users can freely execute the rendering system and iterate the renderable entities while updating a physic component concurrently on a separate thread.Because of the few reasons mentioned above and many others not mentioned, users are completely responsible for synchronization whether required. On the other hand, they could get away with it without having to resort to particular expedients.
A special mention is needed for the iterators returned by the views and the groups. Most of the time they meet the requirements of random access iterators, in all cases they meet at least the requirements of forward iterators.
+
A special mention is needed for the iterators returned by the views and the groups. Most of the time they meet the requirements of random access iterators, in all cases they meet at least the requirements of forward iterators.
In other terms, they are suitable for use with the parallel algorithms of the standard library. If it's not clear, this is a great thing.
As an example, this kind of iterators can be used in combination with std::for_each and std::execution::par to parallelize the visit and therefore the update of the components returned by a view or a group, as long as the constraints previously discussed are respected:
This can increase the throughput considerably, even without resorting to who knows what artifacts that are difficult to maintain over time.
-Unfortunately, because of the limitations of the current revision of the standard, the parallel std::for_each accepts only forward iterators. This means that the iterators provided by the library cannot return proxy objects as references and must return actual reference types instead.
+
This can increase the throughput considerably, even without resorting to who knows what artifacts that are difficult to maintain over time.
+Unfortunately, because of the limitations of the current revision of the standard, the parallel std::for_each accepts only forward iterators. This means that the iterators provided by the library cannot return proxy objects as references and must return actual reference types instead.
This may change in the future and the iterators will almost certainly return both the entities and a list of references to their components sooner or later. Multi-pass guarantee won't break in any case and the performance should even benefit from it further.
There are many other features and functions not listed in this document.
+
There are many other features and functions not listed in this document.
EnTT and in particular its ECS part is in continuous development and some things could be forgotten, others could have been omitted on purpose to reduce the size of this file. Unfortunately, some parts may even be outdated and still to be updated.
For further information, it's recommended to refer to the documentation included in the code itself or join the official channels to ask a question.
- 1.8.13
+ 1.8.16
diff --git a/autotoc_md50.html b/md_docs_md_faq.html
similarity index 67%
rename from autotoc_md50.html
rename to md_docs_md_faq.html
index dfbdacc2c..0e14ae629 100644
--- a/autotoc_md50.html
+++ b/md_docs_md_faq.html
@@ -1,9 +1,9 @@
-
+
-
+
This is a constantly updated section where I'll try to put the answers to the most frequently asked questions.
+
This is a constantly updated section where I'll try to put the answers to the most frequently asked questions.
If you don't find your answer here, there are two cases: nobody has done it yet or this section needs updating. In both cases, try to open a new issue or enter the gitter channel and ask your question. Probably someone already has an answer for you and we can then integrate this part of the documentation.
EnTT is an experimental project that I also use to keep me up-to-date with the latest revision of the language and the standard library. For this reason, it's likely that some classes you're working with are using standard containers under the hood.
+
EnTT is an experimental project that I also use to keep me up-to-date with the latest revision of the language and the standard library. For this reason, it's likely that some classes you're working with are using standard containers under the hood.
Unfortunately, it's known that the standard containers aren't particularly performing in debugging (the reasons for this go beyond this document) and are even less so on Windows apparently. Fortunately this can also be mitigated a lot, achieving good results in many cases.
First of all, there are two things to do in a Windows project:
With these changes, debug performance should increase enough for most cases. If you want something more, you can can also switch to an optimization level O0 or preferably O1.
This is one of the first questions that anyone makes when starting to work with the entity-component-system architectural pattern.
+
This is one of the first questions that anyone makes when starting to work with the entity-component-system architectural pattern.
There are several approaches to the problem and what’s the best one depends mainly on the real problem one is facing. In all cases, how to do it doesn't strictly depend on the library in use, but the latter can certainly allow or not different techniques depending on how the data are laid out.
I tried to describe some of the techniques that fit well with the model of EnTT. Here is the first post of a series that tries to explore the problem. More will probably come in future.
Long story short, you can always define a tree where the nodes expose implicit lists of children by means of the following type:
-The sort functionalities of EnTT, the groups and all the other features of the library can help then to get the best in terms of data locality and therefore performance from this component.
The sort functionalities of EnTT, the groups and all the other features of the library can help then to get the best in terms of data locality and therefore performance from this component.
Custom entity identifiers are definitely a good idea in two cases at least:
@@ -94,41 +105,64 @@ Custom entity identifiers: yay or nay?std::uint32_t isn't large enough as an underlying type.These identifiers are nothing more than enum classes with some salt.
+
These identifiers are nothing more than enum classes with some salt.
To simplify the creation of new identifiers, EnTT provides the macro ENTT_OPAQUE_TYPE that accepts two arguments:
std::uint16_t, std::uint32_t or std::uint64_t).In fact, this is the definition of entt::entity:
The use of this macro is highly recommended, so as not to run into problems if the requirements for the identifiers should change in the future.
+The use of this macro is highly recommended, so as not to run into problems if the requirements for the identifiers should change in the future.
According to this issue, using a hashed string under VS could generate a warning.
+
According to this issue, using a hashed string under VS could generate a warning.
First of all, I want to reassure you: it's expected and harmless. However, it can be annoying.
To suppress it and if you don't want to suppress all the other warnings as well, here is a workaround in the form of a macro:
-With an example of use included:
-Thanks to huwpascoe for the courtesy.
+With an example of use included:
+Thanks to huwpascoe for the courtesy.
On Windows, a header file defines two macros min and max which may result in conflicts with their counterparts in the standard library and therefore in errors during compilation.
It's a pretty big problem but fortunately it's not a problem of EnTT and there is a fairly simple solution to it.
+
It's a pretty big problem but fortunately it's not a problem of EnTT and there is a fairly simple solution to it.
It consists in defining the NOMINMAX macro before to include any other header so as to get rid of the extra definitions:
Please refer to this issue for more details.
+Please refer to this issue for more details.
EnTT uses internally the trait std::is_copy_constructible_v to check if a component is actually copyable. This trait doesn't check if an object can actually be copied but only verifies if there is a copy constructor available.
+
EnTT uses internally the trait std::is_copy_constructible_v to check if a component is actually copyable. This trait doesn't check if an object can actually be copied but only verifies if there is a copy constructor available.
This can lead to surprising results due to some idiosyncrasies of the standard mainly related to the need to guarantee backward compatibility.
For example, std::vector defines a copy constructor no matter if its value type is copyable or not. As a result, std::is_copy_constructible_v is true for the following specialization:
When trying to assign an instance of this type to an entity in the ECS part, this may trigger a compilation error because we cannot really make a copy of it.
+
When trying to assign an instance of this type to an entity in the ECS part, this may trigger a compilation error because we cannot really make a copy of it.
As a workaround, users can mark the type explicitly as non-copyable:
Unfortunately, this will also disable aggregate initialization.
+Unfortunately, this will also disable aggregate initialization.
- 1.8.13
+ 1.8.16
diff --git a/autotoc_md59.html b/md_docs_md_lib.html
similarity index 72%
rename from autotoc_md59.html
rename to md_docs_md_lib.html
index bf4890cc5..8447cfc12 100644
--- a/autotoc_md59.html
+++ b/md_docs_md_lib.html
@@ -1,9 +1,9 @@
-
+
-
+
EnTT has historically had a limit when used across boundaries on Windows in general and on GNU/Linux when default visibility was set to hidden. The limitation is due mainly to a custom utility used to assign unique, sequential identifiers to different types. Unfortunately, this tool is used by several core classes (the registry among the others) that are thus almost unusable across boundaries.
+
EnTT has historically had a limit when used across boundaries on Windows in general and on GNU/Linux when default visibility was set to hidden. The limitation is due mainly to a custom utility used to assign unique, sequential identifiers to different types. Unfortunately, this tool is used by several core classes (the registry among the others) that are thus almost unusable across boundaries.
The reasons for that are beyond the purposes of this document. However, the good news is that EnTT also offers now a way to overcome this limit and to push things across boundaries without problems when needed.
To allow a type to work properly across boundaries when used by a class that requires to assign unique identifiers to types, users must specialize a class template to literally give a compile-time name to the type itself.
- The name of the class template is name_type_traits and the specialization must be such that it exposes a static constexpr data member named value having type either ENTT_ID_TYPE or entt::hashed_string::hash_type. Its value is the user defined unique identifier assigned to the specific type.
+
To allow a type to work properly across boundaries when used by a class that requires to assign unique identifiers to types, users must specialize a class template to literally give a compile-time name to the type itself.
+ The name of the class template is name_type_traits and the specialization must be such that it exposes a static constexpr data member named value having type either ENTT_ID_TYPE or entt::hashed_string::hash_type. Its value is the user defined unique identifier assigned to the specific type.
Identifiers are not to be sequentially generated in this case.
As an example:
-Because of the rules of the language, the specialization must reside in the global namespace or in the entt namespace. There is no way to change this rule unfortunately, because it doesn't depend on the library itself.
The good aspect of this approach is that it's not intrusive at all. The other way around was in fact forcing users to inherit all their classes from a common base. Something to avoid, at least from my point of view.
+
Because of the rules of the language, the specialization must reside in the global namespace or in the entt namespace. There is no way to change this rule unfortunately, because it doesn't depend on the library itself.
The good aspect of this approach is that it's not intrusive at all. The other way around was in fact forcing users to inherit all their classes from a common base. Something to avoid, at least from my point of view.
However, despite the fact that it's not intrusive, it would be great if it was also easier to use and a bit less error-prone. This is why a bunch of macros exist to ease defining named types.
Someone might think that this trick is valid only for the types to push across boundaries. This isn't how things work. In fact, the problem is more complex than that.
+
Someone might think that this trick is valid only for the types to push across boundaries. This isn't how things work. In fact, the problem is more complex than that.
As a rule of thumb, users should never mix named and non-named types. Whenever a type is given a name, all the types must be given a name. As an example, consider the registry class template: in case it is pushed across boundaries, all the types of components should be assigned a name to avoid subtle bugs.
Indeed, this constraint can be relaxed in many cases. However, it is difficult to define a general rule to follow that is not the most stringent, unless users know exactly what they are doing. Therefore, I won't elaborate on giving further details on the topic.
ENTT_NAMED_TYPE can be used to assign a name to already existing types. This macro must be used in the global namespace even when the types to be named are not.ENTT_NAMED_STRUCT can be used to define and export a struct at the same time. It accepts also an optional namespace in which to define the given type. This macro must be used in the global namespace.ENTT_NAMED_CLASS can be used to define and export a class at the same time. It accepts also an optional namespace in which to define the given type. This macro must be used in the global namespace.Nested namespaces are supported out of the box as well in all cases. As an example:
-These macros can be used to avoid specializing the named_type_traits class template. In all cases, the name of the class is used also as a seed to generate the compile-time unique identifier.
Nested namespaces are supported out of the box as well in all cases. As an example:
+These macros can be used to avoid specializing the named_type_traits class template. In all cases, the name of the class is used also as a seed to generate the compile-time unique identifier.
When using macros, unique identifiers are 32/64 bit integers generated by hashing strings during compilation. Therefore, conflicts are rare but still possible. In case of conflicts, everything simply will get broken at runtime and the strangest things will probably take place.
+
When using macros, unique identifiers are 32/64 bit integers generated by hashing strings during compilation. Therefore, conflicts are rare but still possible. In case of conflicts, everything simply will get broken at runtime and the strangest things will probably take place.
Unfortunately, there is no safe way to prevent it. If this happens, it will be enough to give a different value to one of the conflicting types to solve the problem. To do this, users can either assign a different name to the class or directly define a specialization for the named_type_traits class template.
The runtime reflection system deserves a special mention when it comes to using it across boundaries.
+
The runtime reflection system deserves a special mention when it comes to using it across boundaries.
As in all other cases, it's necessary to give a name to the types. However, this time this isn't enough to get the job done.
The runtime reflection system is linked to a static context to which the visible components are linked. A component is visible when it's given a name, so the named components are implicitly visible.
+
The runtime reflection system is linked to a static context to which the visible components are linked. A component is visible when it's given a name, so the named components are implicitly visible.
Different contexts don't relate to each other. Therefore, to allow the use of named types across boundaries, a context must also be shared.
Sharing a context is straightforward. First of all, the local one must be acquired:
-Then, it must be pushed across boundaries and the receiving space must set it as its global context, thus releasing the local one that remains available but is no longer referred to by the runtime reflection system:
-From now on, both spaces will refer to the same context and on it will be associated the new visible meta types, no matter where they are created.
+Then, it must be pushed across boundaries and the receiving space must set it as its global context, thus releasing the local one that remains available but is no longer referred to by the runtime reflection system:
+From now on, both spaces will refer to the same context and on it will be associated the new visible meta types, no matter where they are created.
A context can also be reset and then associated again locally as:
-This is allowed because local and global contexts are separated. Therefore, it's always possible to make the local context the current one again.
+This is allowed because local and global contexts are separated. Therefore, it's always possible to make the local context the current one again.
As long as EnTT won't support custom allocators, another problem with allocations will remain alive instead. This is in fact easily solved, or at least it is if one knows it.
To allow users to add types dynamically, the library makes extensive use of type erasure techniques and dynamic allocations for pools (whether they are for components, events or anything else). The problem occurs when, for example, a registry is created on one side of a boundary and a pool is dynamically created on the other side. In the best case, everything will crash at the exit, while at worst it will do so at runtime.
+
To allow users to add types dynamically, the library makes extensive use of type erasure techniques and dynamic allocations for pools (whether they are for components, events or anything else). The problem occurs when, for example, a registry is created on one side of a boundary and a pool is dynamically created on the other side. In the best case, everything will crash at the exit, while at worst it will do so at runtime.
To avoid problems, the pools must be generated from the same side of the boundary where the object that owns them is also created. As an example, when the registry is created in the main executable and used across boundaries for a given type of component, the pool for that type must be created before passing around the registry itself. To do this is fortunately quite easy, since it is sufficient to invoke any of the methods that involve the given type (continuing the example with the registry, a call to reserve or size is more than enough).
Maybe one day some dedicated methods will be added that do nothing but create a pool for a given type. Until now it has been preferred to keep the API cleaner as they are not strictly necessary.
- 1.8.13
+ 1.8.16
diff --git a/autotoc_md67.html b/md_docs_md_links.html
similarity index 95%
rename from autotoc_md67.html
rename to md_docs_md_links.html
index c02181407..d70ee995f 100644
--- a/autotoc_md67.html
+++ b/md_docs_md_links.html
@@ -1,9 +1,9 @@
-
+
-
+
If you know of other resources out there that are about EnTT, feel free to open an issue or a PR and I'll be glad to add them to this page.
- 1.8.13
+ 1.8.16
diff --git a/md_docs_md_locator.html b/md_docs_md_locator.html
new file mode 100644
index 000000000..75c1d513f
--- /dev/null
+++ b/md_docs_md_locator.html
@@ -0,0 +1,123 @@
+
+
+
+
+
+
+
+|
+ EnTT
+ 3.2.2
+
+ |
+
Usually service locators are tightly bound to the services they expose and it's hard to define a general purpose solution. This template based implementation tries to fill the gap and to get rid of the burden of defining a different specific locator for each application.
+ This class is tiny, partially unsafe and thus risky to use. Moreover it doesn't fit probably most of the scenarios in which a service locator is required. Look at it as a small tool that can sometimes be useful if users know how to handle it.
The API is straightforward. The basic idea is that services are implemented by means of interfaces and rely on polymorphism.
+ The locator is instantiated with the base type of the service if any and a concrete implementation is provided along with all the parameters required to initialize it. As an example:
The locator can also be queried to know if an active service is currently set and to retrieve it if necessary (either as a pointer or as a reference):
+A common use is to wrap the different locators in a container class, creating aliases for the various services:
+
+ 1.8.16
+
+
+
diff --git a/autotoc_md71.html b/md_docs_md_meta.html
similarity index 60%
rename from autotoc_md71.html
rename to md_docs_md_meta.html
index 919650dbc..11595565a 100644
--- a/autotoc_md71.html
+++ b/md_docs_md_meta.html
@@ -1,9 +1,9 @@
-
+
-
+
Reflection (or rather, its lack) is a trending topic in the C++ world and, in the specific case of EnTT, a tool that can unlock a lot of other features. I looked for a third-party library that met my needs on the subject, but I always came across some details that I didn't like: macros, being intrusive, too many allocations. In one word: unsatisfactory.
+
Reflection (or rather, its lack) is a trending topic in the C++ world and, in the specific case of EnTT, a tool that can unlock a lot of other features. I looked for a third-party library that met my needs on the subject, but I always came across some details that I didn't like: macros, being intrusive, too many allocations. In one word: unsatisfactory.
I finally decided to write a built-in, non-intrusive and macro-free runtime reflection system for EnTT. Maybe I didn't do better than others or maybe yes, time will tell me, but at least I can model this tool around the library to which it belongs and not vice versa.
The meta system doesn't force the user to use the tools provided by the library when it comes to working with names and identifiers. It does this by offering an API that works with opaque identifiers that may or may not be generated by means of a hashed string.
+
The meta system doesn't force the user to use the tools provided by the library when it comes to working with names and identifiers. It does this by offering an API that works with opaque identifiers that may or may not be generated by means of a hashed string.
This means that users can assign any type of identifier to the meta objects, as long as they are numeric. It doesn't matter if they are generated at runtime, at compile-time or with custom functions.
However, the examples in the following sections are all based on the hashed_string class as provided by this library. Therefore, where an identifier is required, it's likely that a user defined literal is used as follows:
For what it's worth, this is likely completely equivalent to:
-Obviously, human-readable identifiers are more convenient to use and highly recommended.
+For what it's worth, this is likely completely equivalent to:
+Obviously, human-readable identifiers are more convenient to use and highly recommended.
Reflection always starts from real types (users cannot reflect imaginary types and it would not make much sense, we wouldn't be talking about reflection anymore).
+
Reflection always starts from real types (users cannot reflect imaginary types and it would not make much sense, we wouldn't be talking about reflection anymore).
To create a meta node, the library provides the meta function that accepts a type to reflect as a template parameter:
This isn't enough to export the given type and make it visible though.
+
This isn't enough to export the given type and make it visible though.
The returned value is a factory object to use to continue building the meta type. In order to make the type visible, users can assign it an identifier:
When working with named types, it isn't even necessary to specify the identifier. In fact, it isn't allowed and it will trigger a compilation error.
+
When working with named types, it isn't even necessary to specify the identifier. In fact, it isn't allowed and it will trigger a compilation error.
Identifiers are important because users can retrieve meta types at runtime by searching for them by name other than by type. On the other hand, there are cases in which users can be interested in adding features to a reflected type so that the reflection system can use it correctly under the hood, but they don't want to allow searching the type by name. In this case, it's sufficient not to invoke type and the type will not be searchable by name.
A factory is such that all its member functions returns the factory itself or a decorated version of it. This object can be used to add the following:
ctor member function for this purpose:dtor member function for this purpose:A function should neither delete nor explicitly invoke the destructor of a given instance.
+A function should neither delete nor explicitly invoke the destructor of a given instance.
data member function for this purpose:This function requires as an argument the identifier to give to the meta data once created. Users can then access meta data at runtime by searching for them by name.
- Data members can be set also by means of a couple of functions, namely a setter and a getter. Setters and getters can be either free functions, member functions or mixed ones, as long as they respect the required signatures.
+
This function requires as an argument the identifier to give to the meta data once created. Users can then access meta data at runtime by searching for them by name.
+ Data members can be set also by means of a couple of functions, namely a setter and a getter. Setters and getters can be either free functions, member functions or mixed ones, as long as they respect the required signatures.
Refer to the inline documentation for all the details.
func member function for this purpose:This function requires as an argument the identifier to give to the meta function once created. Users can then access meta functions at runtime by searching for them by name.
+This function requires as an argument the identifier to give to the meta function once created. Users can then access meta functions at runtime by searching for them by name.
base member function for this purpose:From now on, wherever a base_type is required, an instance of derived_type will also be accepted.
From now on, wherever a base_type is required, an instance of derived_type will also be accepted.
double and an int to see it. Similar to bases, conversion functions allow users to define conversions that will be implicitly performed by the reflection system when required.double and an int to see it. Similar to bases, conversion functions allow users to define conversions that will be implicitly performed by the reflection system when required.conv member function for this purpose:That's all, everything users need to create meta types and enjoy the reflection system. At first glance it may not seem that much, but users usually learn to appreciate it over time.
+
That's all, everything users need to create meta types and enjoy the reflection system. At first glance it may not seem that much, but users usually learn to appreciate it over time.
Also, do not forget what these few lines hide under the hood: a built-in, non-intrusive and macro-free system for reflection in C++. Features that are definitely worth the price, at least for me.
The reflection system comes with its own meta_any type. It may seem redundant since C++17 introduced std::any, but it is not.
+
The reflection system comes with its own meta_any type. It may seem redundant since C++17 introduced std::any, but it is not.
In fact, the type returned by an std::any is a const reference to an std::type_info, an implementation defined class that's not something everyone wants to see in a software. Furthermore, the class std::type_info suffers from some design flaws and there is even no way to convert an std::type_info into a meta type, thus linking the two worlds.
The class meta_any offers an API similar to that of its most famous counterpart and serves the same purpose of being an opaque container for any type of value.
+
The class meta_any offers an API similar to that of its most famous counterpart and serves the same purpose of being an opaque container for any type of value.
It minimizes the allocations required, which are almost absent thanks to SBO techniques. In fact, unless users deal with fat types and create instances of them through the reflection system, allocations are at zero.
Creating instances of meta_any, whether empty or from existing objects, is trivial:
The meta_any class takes also the burden of destroying the contained object when required.
+
The meta_any class takes also the burden of destroying the contained object when required.
Furthermore, an instance of meta_any is not tied to a specific type. Therefore, the wrapper will be reconfigured by assigning it an object of a different type than the one contained, so as to be able to handle the new instance.
A particularly interesting feature of this class is that it can also be used as an opaque container for unmanaged objects:
-In other words, whenever meta_any intercepts a reference_wrapper, it acts as a reference to the original instance rather than making a copy of it. The contained object is never destroyed and users must ensure that its lifetime exceeds that of the container.
In other words, whenever meta_any intercepts a reference_wrapper, it acts as a reference to the original instance rather than making a copy of it. The contained object is never destroyed and users must ensure that its lifetime exceeds that of the container.
The meta_any class has also a type member function that returns the meta type of the contained value, if any. The member functions try_cast, cast and convert are used to know if the underlying object has a given type as a base or if it can be converted implicitly to it.
Once the web of reflected types has been constructed, it's a matter of using it at runtime where required.
+
Once the web of reflected types has been constructed, it's a matter of using it at runtime where required.
All this has the great merit that, unlike the vast majority of the things present in this library and closely linked to the compile-time, the reflection system stands in fact as a non-intrusive tool for the runtime.
To search for a reflected type there are two options: by type or by name. In both cases, the search can be done by means of the resolve function:
There exits also a third overload of the resolve function to use to iterate all the reflected types at once:
In all cases, the returned value is an instance of meta_type. This kind of objects offer an API to know their runtime identifiers, to iterate all the meta objects associated with them and even to build or destroy instances of the underlying type.
+
There exits also a third overload of the resolve function to use to iterate all the reflected types at once:
In all cases, the returned value is an instance of meta_type. This kind of objects offer an API to know their runtime identifiers, to iterate all the meta objects associated with them and even to build or destroy instances of the underlying type.
Refer to the inline documentation for all the details.
The meta objects that compose a meta type are accessed in the following ways:
The returned type is meta_ctor and may be invalid if there is no constructor that accepts the supplied arguments or at least some types from which they are derived or to which they can be converted.
+
The returned type is meta_ctor and may be invalid if there is no constructor that accepts the supplied arguments or at least some types from which they are derived or to which they can be converted.
A meta constructor offers an API to know the number of arguments, the expected meta types and to invoke it, therefore to construct a new instance of the underlying type.
The returned type is meta_dtor and may be invalid if there is no custom destructor set for the given meta type.
+
The returned type is meta_dtor and may be invalid if there is no custom destructor set for the given meta type.
All what a meta destructor has to offer is a way to invoke it on a given instance. Be aware that the result may not be what is expected.
The returned type is meta_data and may be invalid if there is no meta data object associated with the given identifier.
+
The returned type is meta_data and may be invalid if there is no meta data object associated with the given identifier.
A meta data object offers an API to query the underlying type (for example, to know if it's a const or a static one), to get the meta type of the variable and to set or get the contained value.
The returned type is meta_func and may be invalid if there is no meta function object associated with the given identifier.
+
The returned type is meta_func and may be invalid if there is no meta function object associated with the given identifier.
A meta function object offers an API to query the underlying type (for example, to know if it's a const or a static function), to know the number of arguments, the meta return type and the meta types of the parameters. In addition, a meta function object can be used to invoke the underlying function and then get the return value in the form of a meta_any object.
The returned type is meta_base and may be invalid if there is no meta base object associated with the given identifier.
+
The returned type is meta_base and may be invalid if there is no meta base object associated with the given identifier.
Meta bases aren't meant to be used directly, even though they are freely accessible. They expose only a few methods to use to know the meta type of the base class and to convert a raw pointer between types.
The returned type is meta_conv and may be invalid if there is no meta conversion function associated with the given type.
+
The returned type is meta_conv and may be invalid if there is no meta conversion function associated with the given type.
The meta conversion functions are as thin as the meta bases and with a very similar interface. The sole difference is that they return a newly created instance wrapped in a meta_any object when they convert between different types.
All the objects thus obtained as well as the meta types can be explicitly converted to a boolean value to check if they are valid:
-Furthermore, all meta objects with the exception of meta destructors can be iterated through an overload that accepts a callback through which to return them. As an example:
-A meta type can also be used to construct or destroy actual instances of the underlying type.
- In particular, the construct member function accepts a variable number of arguments and searches for a match. It returns a meta_any object that may or may not be initialized, depending on whether a suitable constructor has been found or not. On the other side, the destroy member function accepts instances of meta_any as well as actual objects by reference and invokes the registered destructor, if any.
+
Furthermore, all meta objects with the exception of meta destructors can be iterated through an overload that accepts a callback through which to return them. As an example:
+A meta type can also be used to construct or destroy actual instances of the underlying type.
+ In particular, the construct member function accepts a variable number of arguments and searches for a match. It returns a meta_any object that may or may not be initialized, depending on whether a suitable constructor has been found or not. On the other side, the destroy member function accepts instances of meta_any as well as actual objects by reference and invokes the registered destructor, if any.
Be aware that the result of a call to destroy may not be what is expected. The purpose is to give users the ability to free up resources that require special treatment and not to actually destroy instances.
Meta types and meta objects in general contain much more than what is said: a plethora of functions in addition to those listed whose purposes and uses go unfortunately beyond the scope of this document.
+
Meta types and meta objects in general contain much more than what is said: a plethora of functions in addition to those listed whose purposes and uses go unfortunately beyond the scope of this document.
I invite anyone interested in the subject to look at the code, experiment and read the inline documentation to get the best out of this powerful tool.
Policies are a kind of compile-time directives that can be used when recording reflection information.
+
Policies are a kind of compile-time directives that can be used when recording reflection information.
Their purpose is to require slightly different behavior than the default in some specific cases. For example, when reading a given data member, its value is returned wrapped in a meta_any object which, by default, makes a copy of it. For large objects or if the caller wants to access the original instance, this behavior isn't desirable. Policies are there to offer a solution to this and other problems.
There are a few alternatives available at the moment:
entt::as_is_t.entt::as_is_t.The as-void policy, associated with the type entt::as_void_t.
- Its purpose is to discard the return value of a meta object, whatever it is, thus making it appear as if its type were void.
+
The as-void policy, associated with the type entt::as_void_t.
+ Its purpose is to discard the return value of a meta object, whatever it is, thus making it appear as if its type were void.
If the use with functions is obvious, it must be said that it's also possible to use this policy with constructors and data members. In the first case, the constructor will be invoked but the returned wrapper will actually be empty. In the second case, instead, the property will not be accessible for reading.
As an example of use:
The as-alias policy, associated with the type entt::as_alias_t.
- It allows to build wrappers that act as aliases for the objects used to initialize them. Modifying the object contained in the wrapper for which the aliasing was requested will make it possible to directly modify the instance used to initialize the wrapper itself.
+
The as-alias policy, associated with the type entt::as_alias_t.
+ It allows to build wrappers that act as aliases for the objects used to initialize them. Modifying the object contained in the wrapper for which the aliasing was requested will make it possible to directly modify the instance used to initialize the wrapper itself.
This policy works with constructors (for example, when objects are taken from an external container rather than created on demand), data members and functions in general (as long as their return types are lvalue references).
As an example of use:
Some uses are rather trivial, but it's useful to note that there are some less obvious corner cases that can in turn be solved with the use of policies.
+Some uses are rather trivial, but it's useful to note that there are some less obvious corner cases that can in turn be solved with the use of policies.
A special mention should be made for constant values and enums. It wouldn't be necessary, but it will help distracted readers.
-As mentioned, the data member function can be used to reflect constants of any type among the other things.
- This allows users to create meta types for enums that will work exactly like any other meta type built from a class. Similarly, arithmetic types can be enriched with constants of special meaning where required.
+
As mentioned, the data member function can be used to reflect constants of any type among the other things.
+ This allows users to create meta types for enums that will work exactly like any other meta type built from a class. Similarly, arithmetic types can be enriched with constants of special meaning where required.
Personally, I find it very useful not to export what is the difference between enums and classes in C++ directly in the space of the reflected types.
All the values thus exported will appear to users as if they were constant data members of the reflected types.
Exporting constant values or elements from an enum is as simple as ever:
-It goes without saying that accessing them is trivial as well. It's a matter of doing the following, as with any other data member of a meta type:
-As a side note, remember that all this happens behind the scenes without any allocation because of the small object optimization performed by the meta_any class.
It goes without saying that accessing them is trivial as well. It's a matter of doing the following, as with any other data member of a meta type:
+As a side note, remember that all this happens behind the scenes without any allocation because of the small object optimization performed by the meta_any class.
Sometimes (for example, when it comes to creating an editor) it might be useful to attach properties to the meta objects created. Fortunately, this is possible for most of them.
- For the meta objects that support properties, the member functions of the factory used for registering them will return a decorated version of the factory itself. The latter can be used to attach properties to the last created meta object.
+
Sometimes (for example, when it comes to creating an editor) it might be useful to attach properties to the meta objects created. Fortunately, this is possible for most of them.
+ For the meta objects that support properties, the member functions of the factory used for registering them will return a decorated version of the factory itself. The latter can be used to attach properties to the last created meta object.
Apparently, it's more difficult to say than to do:
Properties are always in the key/value form. There are no restrictions on the type of the key or value, as long as they are copy constructible objects.
+
Properties are always in the key/value form. There are no restrictions on the type of the key or value, as long as they are copy constructible objects.
Multiple formats are supported when it comes to defining a property:
std::pairs:std::tuples:A tuple contains one or more properties. All of them are treated individually.
+A tuple contains one or more properties. All of them are treated individually.
An annotation is an invocable object that returns one or more properties. All of them are treated individually.
+An annotation is an invocable object that returns one or more properties. All of them are treated individually.
It's possible to invoke the prop function several times if needed, one for each property to associate with the last meta object created:
Alternatively, the props function is available to associate several properties at a time. However, in this case properties in the key/value form aren't allowed, since they would be interpreted as two different properties rather than a single one.
Alternatively, the props function is available to associate several properties at a time. However, in this case properties in the key/value form aren't allowed, since they would be interpreted as two different properties rather than a single one.
The meta objects for which properties are supported are currently the meta types, meta constructors, meta data and meta functions. It's not possible to attach properties to other types of meta objects and the factory returned as a result of their construction won't allow such an operation.
These types offer a couple of member functions named prop to iterate all properties at once or to search a specific property by key:
Meta properties are objects having a fairly poor interface, all in all. They only provide the key and the value member functions to be used to retrieve the key and the value contained in the form of meta_any objects, respectively.
Meta properties are objects having a fairly poor interface, all in all. They only provide the key and the value member functions to be used to retrieve the key and the value contained in the form of meta_any objects, respectively.
A type registered with the reflection system can also be unregistered. This means unregistering all its data members, member functions, conversion functions and so on. However, the base classes won't be unregistered, since they don't necessarily depend on it. Similarly, implicitly generated types (as an example, the meta types implicitly generated for function parameters when needed) won't be unregistered.
+
A type registered with the reflection system can also be unregistered. This means unregistering all its data members, member functions, conversion functions and so on. However, the base classes won't be unregistered, since they don't necessarily depend on it. Similarly, implicitly generated types (as an example, the meta types implicitly generated for function parameters when needed) won't be unregistered.
Roughly speaking, unregistering a type means disconnecting all associated meta objects from it and making its identifier no longer visible. The underlying node will remain available though, as if it were implicitly generated:
The type can be re-registered later with a completely different name and form.
+The type can be re-registered later with a completely different name and form.
- 1.8.13
+ 1.8.16
diff --git a/autotoc_md81.html b/md_docs_md_process.html
similarity index 51%
rename from autotoc_md81.html
rename to md_docs_md_process.html
index 13eb3e092..31688d01c 100644
--- a/autotoc_md81.html
+++ b/md_docs_md_process.html
@@ -1,9 +1,9 @@
-
+
-
+
Derived classes can also change the internal state of a process by invoking succeed and fail, as well as pause and unpause the process itself. All these are protected member functions made available to be able to manage the life cycle of a process from a derived class.
Here is a minimal example for the sake of curiosity:
-Lambdas and functors can't be used directly with a scheduler for they are not properly defined processes with managed life cycles.
+
Lambdas and functors can't be used directly with a scheduler for they are not properly defined processes with managed life cycles.
This class helps in filling the gap and turning lambdas and functors into full featured processes usable by a scheduler.
The function call operator has a signature similar to the one of the update function of a process but for the fact that it receives two extra arguments to call whenever a process is terminated with success or with an error:
Parameters have the following meaning:
+Parameters have the following meaning:
delta is the elapsed time.data is an opaque pointer to user data if any, nullptr otherwise.A cooperative scheduler runs different processes and helps managing their life cycles.
-Each process is invoked once per tick. If it terminates, it's removed automatically from the scheduler and it's never invoked again. Otherwise it's a good candidate to run one more time the next tick.
+
Each process is invoked once per tick. If it terminates, it's removed automatically from the scheduler and it's never invoked again. Otherwise it's a good candidate to run one more time the next tick.
A process can also have a child. In this case, the parent process is replaced with its child when it terminates and only if it returns with success. In case of errors, both the parent process and its child are discarded. This way, it's easy to create chain of processes to run sequentially.
Using a scheduler is straightforward. To create it, users must provide only the type for the elapsed times and no arguments at all:
-It has member functions to query its internal data structures, like empty or size, as well as a clear utility to reset it to a clean state:
To attach a process to a scheduler there are mainly two ways:
+It has member functions to query its internal data structures, like empty or size, as well as a clear utility to reset it to a clean state:
To attach a process to a scheduler there are mainly two ways:
process class template, it's enough to indicate its type and submit all the parameters required to construct it to the attach member function:attach member function:In both cases, the return value is an opaque object that offers a then member function to use to create chains of processes to run sequentially.
+
In both cases, the return value is an opaque object that offers a then member function to use to create chains of processes to run sequentially.
As a minimal example of use:
To update a scheduler and therefore all its processes, the update member function is the way to go:
In addition to these functions, the scheduler offers an abort member function that can be used to discard all the running processes at once:
To update a scheduler and therefore all its processes, the update member function is the way to go:
In addition to these functions, the scheduler offers an abort member function that can be used to discard all the running processes at once:
- 1.8.13
+ 1.8.16
diff --git a/md_docs_md_resource.html b/md_docs_md_resource.html
new file mode 100644
index 000000000..9cabbcb3f
--- /dev/null
+++ b/md_docs_md_resource.html
@@ -0,0 +1,182 @@
+
+
+
+
+
+
+
+|
+ EnTT
+ 3.2.2
+
+ |
+
Resource management is usually one of the most critical part of a software like a game. Solutions are often tuned to the particular application. There exist several approaches and all of them are perfectly fine as long as they fit the requirements of the piece of software in which they are used.
+ Examples are loading everything on start, loading on request, predictive loading, and so on.
EnTT doesn't pretend to offer a one-fits-all solution for the different cases. Instead, it offers a minimal and perhaps trivial cache that can be useful most of the time during prototyping and sometimes even in a production environment.
+ For those interested in the subject, the plan is to improve it considerably over time in terms of performance, memory usage and functionalities. Hoping to make it, of course, one step at a time.
There are three main actors in the model: the resource, the loader and the cache.
+The resource is whatever users want it to be. An image, a video, an audio, whatever. There are no limits.
+ As a minimal example:
A loader is a class the aim of which is to load a specific resource. It has to inherit directly from the dedicated base class as in the following example:
+Where my_resource is the type of resources it creates.
+ A resource loader must also expose a public const member function named load that accepts a variable number of arguments and returns a shared pointer to a resource.
+ As an example:
In general, resource loaders should not have a state or retain data of any type. They should let the cache manage their resources instead.
+ As a side note, base class and CRTP idiom aren't strictly required with the current implementation. One could argue that a cache can easily work with loaders of any type. However, future changes won't be breaking ones by forcing the use of a base class today and that's why the model is already in its place.
Finally, a cache is a specialization of a class template tailored to a specific resource:
+The idea is to create different caches for different types of resources and to manage each one independently in the most appropriate way.
+ As a (very) trivial example, audio tracks can survive in most of the scenes of an application while meshes can be associated with a single scene and then discarded when users leave it.
A cache offers a set of basic functionalities to query its internal state and to organize it:
+Besides these member functions, a cache contains what is needed to load, use and discard resources of the given type.
+ Before to explore this part of the interface, it makes sense to mention how resources are identified. The type of the identifiers to use is defined as:
Where id_type is an alias for entt::hashed_string::hash_type. Therefore, resource identifiers are created explicitly as in the following example:
The class hashed_string is described in a dedicated section, so I won't go in details here.
Resources are loaded and thus stored in a cache through the load member function. It accepts the loader to use as a template parameter, the resource identifier and the parameters used to construct the resource as arguments:
The function returns a handle to the resource, whether it already exists or is loaded. In case the loader returns an invalid pointer, the handle is invalid as well and therefore it can be easily used with an if statement:
Before trying to load a resource, the contains member function can be used to know if a cache already contains a specific resource:
There exists also a member function to use to force a reload of an already existing resource if needed:
+As above, the function returns a handle to the resource that is invalid in case of errors. The reload member function is a kind of alias of the following snippet:
Where the discard member function is used to get rid of a resource if loaded. In case the cache doesn't contain a resource for the given identifier, discard does nothing and returns immediately.
So far, so good. Resources are finally loaded and stored within the cache.
+ They are returned to users in the form of handles. To get one of them later on:
The idea behind a handle is the same of the flyweight pattern. In other terms, resources aren't copied around. Instead, instances are shared between handles. Users of a resource own a handle that guarantees that a resource isn't destroyed until all the handles are destroyed, even if the resource itself is removed from the cache.
+ Handles are tiny objects both movable and copyable. They return the contained resource as a const reference on request:
get member function:The resource can also be accessed directly using the arrow operator if required:
+To test if a handle is still valid, the cast operator to bool allows users to use it in a guard:
Finally, in case there is the need to load a resource and thus to get a handle without storing the resource itself in the cache, users can rely on the temp member function template.
+ The declaration is similar to that of load, a (possibly invalid) handle for the resource is returned also in this case:
Do not forget to test the handle for validity. Otherwise, getting a reference to the resource it points may result in undefined behavior.
+
+ 1.8.16
+
+
+
diff --git a/md_docs_md_signal.html b/md_docs_md_signal.html
new file mode 100644
index 000000000..5ee68d4ab
--- /dev/null
+++ b/md_docs_md_signal.html
@@ -0,0 +1,309 @@
+
+
+
+
+
+
+
+|
+ EnTT
+ 3.2.2
+
+ |
+
Signals are usually a core part of games and software architectures in general.
+ Roughly speaking, they help to decouple the various parts of a system while allowing them to communicate with each other somehow.
The so called modern C++ comes with a tool that can be useful in these terms, the std::function. As an example, it can be used to create delegates.
+ However, there is no guarantee that an std::function does not perform allocations under the hood and this could be problematic sometimes. Furthermore, it solves a problem but may not adapt well to other requirements that may arise from time to time.
In case that the flexibility and power of an std::function isn't required or if the price to pay for them is too high,EnTT offers a complete set of lightweight classes to solve the same and many other problems.
A delegate can be used as a general purpose invoker with no memory overhead for free functions and members provided along with an instance on which to invoke them.
+ It does not claim to be a drop-in replacement for an std::function, so do not expect to use it whenever an std::function fits well. That said, it's most likely even a better fit than an std::function in a lot of cases, so expect to use it quite a lot anyway.
The interface is trivial. It offers a default constructor to create empty delegates:
+All what is needed to create an instance is to specify the type of the function the delegate will contain, that is the signature of the free function or the member one wants to assign to it.
+Attempting to use an empty delegate by invoking its function call operator results in undefined behavior or most likely a crash. Before to use a delegate, it must be initialized.
+ There exists a bunch of overloads of the connect member function to do that. As an example of use:
The delegate class accepts also data members, if needed. In this case, the function type of the delegate is such that the parameter list is empty and the value of the data member is at least convertible to the return type.
+Free functions having type equivalent to void(T &, args...) are accepted as well. In this case, T & is considered a payload and the function will receive it back every time it's invoked. In other terms, this works just fine with the above definition:
The function g will be invoked with a reference to c and 42. However, the function type of the delegate is still void(int). This is also the signature of its function call operator.
Another interesting aspect of the delegate class is that it accepts also functions with a list of parameters that is shorter than that of the function type used to specialize the delegate itself.
+ The following code is therefore perfectly valid:
Where the function type of the delegate is void(int) as above. It goes without saying that the extra arguments are silently discarded internally.
+v This is a nice-to-have feature in a lot of cases, as an example when the delegate class is used as a building block of a signal-slot system.
To create and initialize a delegate at once, there are a few specialized constructors. Because of the rules of the language, the listener is provided by means of the entt::connect_arg variable template:
Aside connect, a disconnect counterpart isn't provided. Instead, there exists a reset member function to use to clear a delegate.
+ To know if a delegate is empty, it can be used explicitly in every conditional statement:
Finally, to invoke a delegate, the function call operator is the way to go as already shown in the examples above:
+In all cases, the listeners don't have to strictly follow the signature of the delegate. As long as a listener can be invoked with the given arguments to yield a result that is convertible to the given result type, everything works just fine.
+Signal handlers work with references to classes, function pointers and pointers to members. Listeners can be any kind of objects and users are in charge of connecting and disconnecting them from a signal to avoid crashes due to different lifetimes. On the other side, performance shouldn't be affected that much by the presence of such a signal handler.
+ Signals make use of delegates internally and therefore they undergo the same rules and offer similar functionalities. It may be a good idea to consult the documentation of the delegate class for further information.
A signal handler can be used as a private data member without exposing any publish functionality to the clients of a class. The basic idea is to impose a clear separation between the signal itself and the sink class, that is a tool to be used to connect and disconnect listeners on the fly.
The API of a signal handler is straightforward. If a collector is supplied to the signal when something is published, all the values returned by the listeners can be literally collected and used later by the caller. Otherwise, the class works just like a plain signal that emits events from time to time.
+ To create instances of signal handlers it is sufficient to provide the type of function to which they refer:
Signals offer all the basic functionalities required to know how many listeners they contain (size) or if they contain at least a listener (empty), as well as a function to use to swap handlers (swap).
Besides them, there are member functions to use both to connect and disconnect listeners in all their forms by means of a sink:
+As shown above, the listeners don't have to strictly follow the signature of the signal. As long as a listener can be invoked with the given arguments to yield a result that is convertible to the given return type, everything works just fine.
+ It's also possible to connect a listener before other listeners already contained by the signal. The before function returns a sink object correctly initialized for the purpose that can be used to connect one or more listeners in order and in the desired position:
In all cases, the connect member function returns by default a connection object to be used as an alternative to break a connection by means of its release member function. A scoped_connection can also be created from a connection. In this case, the link is broken automatically as soon as the object goes out of scope.
Once listeners are attached (or even if there are no listeners at all), events and data in general can be published through a signal by means of the publish member function:
To collect data, the collect member function should be used instead. Below is a minimal example to show how to use it:
A collector must expose a function operator that accepts as an argument a type to which the return type of the listeners can be converted. Moreover, it can optionally return a boolean value that is true to stop collecting data, false otherwise. This way one can avoid calling all the listeners in case it isn't necessary.
+ Functors can also be used in place of a lambda. Since the collector is copied when invoking the collect member function, std::ref is the way to go in this case:
The event dispatcher class is designed so as to be used in a loop. It allows users both to trigger immediate events or to queue events to be published all together once per tick.
+ This class shares part of its API with the one of the signal handler, but it doesn't require that all the types of events are specified when declared:
In order to register an instance of a class to a dispatcher, its type must expose one or more member functions the arguments of which are such that const E & can be converted to them for each type of event E, no matter what the return value is.
+ The name of the member function aimed to receive the event must be provided to the connect member function of the sink in charge for the specific event:
The disconnect member function follows the same pattern and can be used to remove one listener at a time or all of them at once:
The trigger member function serves the purpose of sending an immediate event to all the listeners registered so far. It offers a convenient approach that relieves users from having to create the event itself. Instead, it's enough to specify the type of event and provide all the parameters required to construct it.
+ As an example:
Listeners are invoked immediately, order of execution isn't guaranteed. This method can be used to push around urgent messages like an is terminating notification on a mobile app.
+On the other hand, the enqueue member function queues messages together and allows to maintain control over the moment they are sent to listeners. The signature of this method is more or less the same of trigger:
Events are stored aside until the update member function is invoked, then all the messages that are still pending are sent to the listeners at once:
This way users can embed the dispatcher in a loop and literally dispatch events once per tick to their systems.
+A general purpose event emitter thought mainly for those cases where it comes to working with asynchronous stuff.
+ Originally designed to fit the requirements of uvw (a wrapper for libuv written in modern C++), it was adapted later to be included in this library.
To create a custom emitter type, derived classes must inherit directly from the base class as:
+The full list of accepted types of events isn't required. Handlers are created internally on the fly and thus each type of event is accepted by default.
+Whenever an event is published, an emitter provides the listeners with a reference to itself along with a const reference to the event. Therefore listeners have an handy way to work with it without incurring in the need of capturing a reference to the emitter itself.
+ In addition, an opaque object is returned each time a connection is established between an emitter and a listener, allowing the caller to disconnect them at a later time.
+ The opaque object used to handle connections is both movable and copyable. On the other side, an event emitter is movable but not copyable by default.
To create new instances of an emitter, no arguments are required:
+Listeners must be movable and callable objects (free functions, lambdas, functors, std::functions, whatever) whose function type is:
Where Event is the type of event they want to listen.
+ There are two ways to attach a listener to an event emitter that differ slightly from each other:
on member function. It is meant to register a listener designed to be invoked more than once for the given event type.The connection object can be freely discarded. Otherwise, it can be used later to disconnect the listener if required.
+once member function. It is meant to register a listener designed to be invoked only once for the given event type. The listener is automatically disconnected after the first invocation.The connection object can be freely discarded. Otherwise, it can be used later to disconnect the listener if required.
+In both cases, the connection object can be used with the erase member function:
There are also two member functions to use either to disconnect all the listeners for a given type of event or to clear the emitter:
+To send an event to all the listeners that are interested in it, the publish member function offers a convenient approach that relieves users from having to create the event:
Finally, the empty member function tests if there exists at least either a listener registered with the event emitter or to a given type of event:
In general, the event emitter is a handy tool when the derived classes wrap asynchronous operations, because it introduces a nice-to-have model based on events and listeners that kindly hides the complexity behind the scenes. However it is not limited to such uses.
+
+ 1.8.16
+
+
+
diff --git a/menu.js b/menu.js
index 97db4c239..433c15b8f 100644
--- a/menu.js
+++ b/menu.js
@@ -1,3 +1,26 @@
+/*
+ @licstart The following is the entire license notice for the
+ JavaScript code in this file.
+
+ Copyright (C) 1997-2017 by Dimitri van Heesch
+
+ This program is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 2 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License along
+ with this program; if not, write to the Free Software Foundation, Inc.,
+ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
+
+ @licend The above is the entire license notice
+ for the JavaScript code in this file
+ */
function initMenu(relPath,searchEnabled,serverSide,searchPage,search) {
function makeTree(data,relPath) {
var result='';
@@ -17,10 +40,11 @@ function initMenu(relPath,searchEnabled,serverSide,searchPage,search) {
$('#main-nav').children(':first').addClass('sm sm-dox').attr('id','main-menu');
if (searchEnabled) {
if (serverSide) {
- $('#main-menu').append('
- 1.8.13
+ 1.8.16
diff --git a/meta_8md_source.html b/meta_8md_source.html
deleted file mode 100644
index 7335623f2..000000000
--- a/meta_8md_source.html
+++ /dev/null
@@ -1,74 +0,0 @@
-
-
-
-
-
-
-
-|
- EnTT
- 3.2.1
-
- |
-
- 1.8.13
-
-
-
diff --git a/monostate_8hpp_source.html b/monostate_8hpp_source.html
index fec08de7d..3d7596103 100644
--- a/monostate_8hpp_source.html
+++ b/monostate_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/namespaceentt.html b/namespaceentt.html
index 5419371fb..c9e7ca053 100644
--- a/namespaceentt.html
+++ b/namespaceentt.html
@@ -1,9 +1,9 @@
-
+
-
+
EnTT default namespace.
-More...
Classes | |
| struct | is_equality_comparable |
Provides the member constant value to true if a given type is equality comparable, false otherwise. More... | |
| struct | is_equality_comparable< Type, std::void_t< decltype(std::declval< Type >()==std::declval< Type >())> > |
Provides the member constant value to true if a given type is equality comparable, false otherwise. More... | |
| struct | is_equality_comparable< Type, std::void_t< decltype(std::declval< Type >()==std::declval< Type >())> > |
Provides the member constant value to true if a given type is equality comparable, false otherwise. More... | |
| struct | is_named_type |
Provides the member constant value to true if a given type has a name. In all other cases, value is false. More... | |
| template<typename... List> | |
| using | type_list_cat_t = typename type_list_cat< List... >::type |
| Helper type. More... | |
| Helper type. More... | |
| template<typename Type > | |
| using | type_list_unique_t = typename type_list_unique< Type >::type |
| Helper type. More... | |
| Helper type. More... | |
| template<typename Type > | |
| using | named_type_traits_t = typename named_type_traits< Type >::type |
| Helper type. More... | |
| Helper type. More... | |
| using | registry = basic_registry< entity > |
| template<typename... Types> | |
| using | view = basic_view< entity, Types... > |
| Alias declaration for the most common use case. More... | |
| Alias declaration for the most common use case. More... | |
| using | runtime_view = basic_runtime_view< entity > |
| template<typename... Types> | |
| using | group = basic_group< entity, Types... > |
| Alias declaration for the most common use case. More... | |
| Alias declaration for the most common use case. More... | |
| template<ENTT_ID_TYPE Value> | |
| using | tag = std::integral_constant< ENTT_ID_TYPE, Value > |
| Alias template to ease the assignment of tags to entities. More... | |
| Alias template to ease the assignment of tags to entities. More... | |
Functions | |
| template<typename Char , std::size_t N> | |
| basic_hashed_string (const Char(&str)[N]) ENTT_NOEXCEPT -> basic_hashed_string< Char > | |
| Deduction guide. More... | |
| Deduction guide. More... | |
| template<typename Char > | |
| constexpr bool | operator!= (const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs) ENTT_NOEXCEPT |
| Compares two hashed strings. More... | |
| Compares two hashed strings. More... | |
| template<typename Type , typename Class > | |
| constexpr auto | overload (Type Class::*member) ENTT_NOEXCEPT |
| Constant utility to disambiguate overloaded member functions. More... | |
| Constant utility to disambiguate overloaded member functions. More... | |
| template<typename Type > | |
| constexpr auto | overload (Type *func) ENTT_NOEXCEPT |
| Constant utility to disambiguate overloaded functions. More... | |
| Constant utility to disambiguate overloaded functions. More... | |
| template<class... Type> | |
| overloaded (Type...) -> overloaded< Type... > | |
| Deduction guide. More... | |
| Deduction guide. More... | |
| ENTT_OPAQUE_TYPE (entity, ENTT_ID_TYPE) | |
| template<typename Entity > | |
| as_view (basic_registry< Entity > &) ENTT_NOEXCEPT -> as_view< false, Entity > | |
| Deduction guide. More... | |
| Deduction guide. More... | |
| template<typename Entity > | |
| as_view (const basic_registry< Entity > &) ENTT_NOEXCEPT -> as_view< true, Entity > | |
| Deduction guide. More... | |
| Deduction guide. More... | |
| template<typename Entity > | |
| as_group (basic_registry< Entity > &) ENTT_NOEXCEPT -> as_group< false, Entity > | |
| Deduction guide. More... | |
| Deduction guide. More... | |
| template<typename Entity > | |
| as_group (const basic_registry< Entity > &) ENTT_NOEXCEPT -> as_group< true, Entity > | |
| Deduction guide. More... | |
| Deduction guide. More... | |
| template<typename Type > | |
| meta_factory< Type > | meta () ENTT_NOEXCEPT |
| Utility function to use for reflection. More... | |
| Utility function to use for reflection. More... | |
| template<typename Type > | |
| meta_type | resolve () ENTT_NOEXCEPT |
| Returns the meta type associated with a given type. More... | |
| Returns the meta type associated with a given type. More... | |
| meta_type | resolve (const ENTT_ID_TYPE identifier) ENTT_NOEXCEPT |
| Returns the meta type associated with a given identifier. More... | |
| Returns the meta type associated with a given identifier. More... | |
| template<typename Op > | |
| std::enable_if_t< std::is_invocable_v< Op, meta_type >, void > | resolve (Op op) ENTT_NOEXCEPT |
| Iterates all the reflected types. More... | |
| Iterates all the reflected types. More... | |
| bool | operator!= (const meta_any &lhs, const meta_any &rhs) ENTT_NOEXCEPT |
| Checks if two containers differ in their content. More... | |
| Checks if two containers differ in their content. More... | |
| bool | operator!= (const meta_prop &lhs, const meta_prop &rhs) ENTT_NOEXCEPT |
| Checks if two meta objects refer to the same node. More... | |
| Checks if two meta objects refer to the same node. More... | |
| bool | operator!= (const meta_base &lhs, const meta_base &rhs) ENTT_NOEXCEPT |
| Checks if two meta objects refer to the same node. More... | |
| Checks if two meta objects refer to the same node. More... | |
| bool | operator!= (const meta_conv &lhs, const meta_conv &rhs) ENTT_NOEXCEPT |
| Checks if two meta objects refer to the same node. More... | |
| Checks if two meta objects refer to the same node. More... | |
| bool | operator!= (const meta_ctor &lhs, const meta_ctor &rhs) ENTT_NOEXCEPT |
| Checks if two meta objects refer to the same node. More... | |
| Checks if two meta objects refer to the same node. More... | |
| bool | operator!= (const meta_dtor &lhs, const meta_dtor &rhs) ENTT_NOEXCEPT |
| Checks if two meta objects refer to the same node. More... | |
| Checks if two meta objects refer to the same node. More... | |
| bool | operator!= (const meta_data &lhs, const meta_data &rhs) ENTT_NOEXCEPT |
| Checks if two meta objects refer to the same node. More... | |
| Checks if two meta objects refer to the same node. More... | |
| bool | operator!= (const meta_func &lhs, const meta_func &rhs) ENTT_NOEXCEPT |
| Checks if two meta objects refer to the same node. More... | |
| Checks if two meta objects refer to the same node. More... | |
| bool | operator!= (const meta_type &lhs, const meta_type &rhs) ENTT_NOEXCEPT |
| Checks if two meta objects refer to the same node. More... | |
| Checks if two meta objects refer to the same node. More... | |
| template<typename Ret , typename... Args> | |
| bool | operator!= (const delegate< Ret(Args...)> &lhs, const delegate< Ret(Args...)> &rhs) ENTT_NOEXCEPT |
| Compares the contents of two delegates. More... | |
| Compares the contents of two delegates. More... | |
| template<auto Function> | |
| delegate (connect_arg_t< Function >) ENTT_NOEXCEPT -> delegate< std::remove_pointer_t< internal::to_function_pointer_t< decltype(Function)>>> | |
| Deduction guide. More... | |
| Deduction guide. More... | |
| template<auto Candidate, typename Type > | |
| delegate (connect_arg_t< Candidate >, Type &) ENTT_NOEXCEPT -> delegate< std::remove_pointer_t< internal::to_function_pointer_t< decltype(Candidate), Type *>>> | |
| Deduction guide. More... | |
| template<auto Candidate, typename Type > | |
| delegate (connect_arg_t< Candidate >, Type *) ENTT_NOEXCEPT -> delegate< std::remove_pointer_t< internal::to_function_pointer_t< decltype(Candidate), Type *>>> | |
| Deduction guide. More... | |
| template<auto Candidate, typename Type > | |
| delegate (connect_arg_t< Candidate >, Type &) ENTT_NOEXCEPT -> delegate< std::remove_pointer_t< internal::to_function_pointer_t< decltype(Candidate), Type * >>> | |
| Deduction guide. More... | |
| template<auto Candidate, typename Type > | |
| delegate (connect_arg_t< Candidate >, Type *) ENTT_NOEXCEPT -> delegate< std::remove_pointer_t< internal::to_function_pointer_t< decltype(Candidate), Type * >>> | |
| Deduction guide. More... | |
| template<typename Ret , typename... Args> | |
| sink (sigh< Ret(Args...)> &) ENTT_NOEXCEPT -> sink< Ret(Args...)> | |
| Deduction guide. More... | |
| Deduction guide. More... | |
Variables | |
| template<ENTT_ID_TYPE Value> | |
| monostate< Value > | monostate_v = {} |
| Helper variable template. More... | |
| Helper variable template. More... | |
| template<std::size_t N> | |
| constexpr choice_t< N > | choice {} |
| Variable template for the choice trick. More... | |
| Variable template for the choice trick. More... | |
| template<class List > | |
| constexpr auto | type_list_size_v = type_list_size<List>::value |
| Helper variable template. More... | |
| Helper variable template. More... | |
| template<class Type > | |
| constexpr auto | is_equality_comparable_v = is_equality_comparable<Type>::value |
| Helper variable template. More... | |
| Helper variable template. More... | |
| template<class Type > | |
| constexpr auto | named_type_traits_v = named_type_traits<Type>::value |
| Helper variable template. More... | |
| Helper variable template. More... | |
| template<class Type > | |
| constexpr auto | is_named_type_v = is_named_type<Type>::value |
| Helper variable template. More... | |
| Helper variable template. More... | |
| constexpr auto | null = internal::null{} |
| Compile-time constant for null entities. More... | |
| Compile-time constant for null entities. More... | |
| constexpr basic_collector | collector {} |
| template<typename... Type> | |
| constexpr exclude_t< Type... > | exclude {} |
| Variable template for exclusion lists. More... | |
| Variable template for exclusion lists. More... | |
| template<typename... Type> | |
| constexpr get_t< Type... > | get {} |
| Variable template for lists of observed components. More... | |
| Variable template for lists of observed components. More... | |
| constexpr as_alias_t | as_alias |
| template<auto Func> | |
| constexpr connect_arg_t< Func > | connect_arg {} |
| Constant of type connect_arg_t used to disambiguate calls. | |
| Constant of type connect_arg_t used to disambiguate calls. | |
Alias template to ease the assignment of tags to entities.
-If used in combination with hashed strings, it simplifies the assignment of tags to entities and the use of tags in general where a type would be required otherwise.
- As an example and where the user defined literal for hashed strings hasn't been changed:
If used in combination with hashed strings, it simplifies the assignment of tags to entities and the use of tags in general where a type would be required otherwise.
+ As an example and where the user defined literal for hashed strings hasn't been changed:
| Value | The numeric representation of an instance of hashed string. |
| Entity | A valid entity type (see entt_traits for more details). |
| Entity | A valid entity type (see entt_traits for more details). |
It allows to deduce the constness of a registry directly from the instance provided to the constructor.
| Entity | A valid entity type (see entt_traits for more details). |
| Entity | A valid entity type (see entt_traits for more details). |
It allows to deduce the constness of a registry directly from the instance provided to the constructor.
| Entity | A valid entity type (see entt_traits for more details). |
| Entity | A valid entity type (see entt_traits for more details). |
It allows to deduce the constness of a registry directly from the instance provided to the constructor.
| Entity | A valid entity type (see entt_traits for more details). |
| Entity | A valid entity type (see entt_traits for more details). |
| entt::delegate | -( | -connect_arg_t< Function > | -) | --> delegate< std::remove_pointer_t< internal::to_function_pointer_t< decltype(Function)>>> | -
Deduction guide.
-It allows to deduce the function type of the delegate directly from a function provided to the constructor.
-| Function | A valid free function pointer. |
| entt::delegate | +( | +connect_arg_t< Function > | +) | +-> delegate< std::remove_pointer_t< internal::to_function_pointer_t< decltype(Function)>>> | +
Deduction guide.
+It allows to deduce the function type of the delegate directly from a function provided to the constructor.
+| Function | A valid free function pointer. |
Utility function to use for reflection.
-This is the point from which everything starts.
+
This is the point from which everything starts.
By invoking this function with a type that is not yet reflected, a meta type is created to which it will be possible to attach meta objects through a dedicated factory.
|
+ +constexpr | +
Compares two hashed strings.
@@ -1175,60 +1188,12 @@ template<typename Ret , typename... Args>Definition at line 765 of file meta.hpp.
- - - - -
-
|
- -inline | -
Definition at line 1065 of file meta.hpp.
- - - - -
-
|
- -inline | -
Definition at line 1768 of file meta.hpp.
+Definition at line 1767 of file meta.hpp.
+ + + + +
+
|
+ +constexpr | +
Constant utility to disambiguate overloaded functions.
+| Type | Function type of the desired overload. |
| func | A valid pointer to a function. |
Definition at line 44 of file utility.hpp.
|
+ +constexpr | +
Constant utility to disambiguate overloaded member functions.
@@ -1599,43 +1665,6 @@ template<typename Type , typename Class >Definition at line 34 of file utility.hpp.
-| constexpr auto entt::overload | -( | -Type * | -func | ) | -- |
Constant utility to disambiguate overloaded functions.
-| Type | Function type of the desired overload. |
| func | A valid pointer to a function. |
Definition at line 44 of file utility.hpp.
-
|
+ +constexpr | +
Variable template for the choice trick.
@@ -1849,11 +1886,19 @@ template<std::size_t N>
|
+ +constexpr | +
Variable template for exclusion lists.
@@ -1875,11 +1920,19 @@ template<typename... Type>
|
+ +constexpr | +
Variable template for lists of observed components.
@@ -1901,11 +1954,19 @@ template<typename... Type>
|
+ +constexpr | +
Helper variable template.
@@ -1927,11 +1988,19 @@ template<class Type >
|
+ +constexpr | +
Helper variable template.
@@ -1987,11 +2056,19 @@ template<ENTT_ID_TYPE Value>
|
+ +constexpr | +
Helper variable template.
@@ -2011,11 +2088,19 @@ template<class Type >
|
+ +constexpr | +
Compile-time constant for null entities.
@@ -2032,11 +2117,19 @@ template<class Type >
|
+ +constexpr | +
Helper variable template.
@@ -2052,11 +2145,14 @@ template<class List >
- 1.8.13
+ 1.8.16
diff --git a/namespacemembers.html b/namespacemembers.html
index d89c5ee10..322c2245f 100644
--- a/namespacemembers.html
+++ b/namespacemembers.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/namespacemembers_func.html b/namespacemembers_func.html
index c7bc028cb..c2c0da764 100644
--- a/namespacemembers_func.html
+++ b/namespacemembers_func.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/namespacemembers_type.html b/namespacemembers_type.html
index 1f9e6b3cb..0620072b5 100644
--- a/namespacemembers_type.html
+++ b/namespacemembers_type.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/namespacemembers_vars.html b/namespacemembers_vars.html
index 349832128..dc993ce66 100644
--- a/namespacemembers_vars.html
+++ b/namespacemembers_vars.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/namespaces.html b/namespaces.html
index 70c307225..a294c68ce 100644
--- a/namespaces.html
+++ b/namespaces.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/observer_8hpp_source.html b/observer_8hpp_source.html
index 6c2c0b6fa..c84ecc3fd 100644
--- a/observer_8hpp_source.html
+++ b/observer_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/pages.html b/pages.html
index 69c2cbb68..17ef757dd 100644
--- a/pages.html
+++ b/pages.html
@@ -1,9 +1,9 @@
-
+
-
+
| Crash Course: core functionalities | |
| Crash Course: entity-component system | |
| Frequently Asked Questions | |
| Push EnTT across boundaries | |
| EnTT in Action | |
| Crash Course: service locator | |
| Crash Course: runtime reflection system | |
| Crash Course: cooperative scheduler | |
| Crash Course: resource management | |
| Crash Course: events, signals and everything in between | |
| Crash Course: core functionalities | |
| Crash Course: entity-component system | |
| Frequently Asked Questions | |
| Push EnTT across boundaries | |
| EnTT in Action | |
| Crash Course: service locator | |
| Crash Course: runtime reflection system | |
| Crash Course: cooperative scheduler | |
| Crash Course: resource management | |
| Crash Course: events, signals and everything in between |
- 1.8.13
+ 1.8.16
diff --git a/policy_8hpp_source.html b/policy_8hpp_source.html
index 2f41c0ea9..07c1f63a8 100644
--- a/policy_8hpp_source.html
+++ b/policy_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/process_8hpp_source.html b/process_8hpp_source.html
index ed4be7638..8412d015a 100644
--- a/process_8hpp_source.html
+++ b/process_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/process_8md_source.html b/process_8md_source.html
deleted file mode 100644
index 1f0c0c002..000000000
--- a/process_8md_source.html
+++ /dev/null
@@ -1,74 +0,0 @@
-
-
-
-
-
-
-
-|
- EnTT
- 3.2.1
-
- |
-
- 1.8.13
-
-
-
diff --git a/registry_8hpp_source.html b/registry_8hpp_source.html
index c061ab22a..5f26c8ad3 100644
--- a/registry_8hpp_source.html
+++ b/registry_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/resource_2fwd_8hpp_source.html b/resource_2fwd_8hpp_source.html
index c8b48209c..12c438014 100644
--- a/resource_2fwd_8hpp_source.html
+++ b/resource_2fwd_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/resource_8md_source.html b/resource_8md_source.html
deleted file mode 100644
index f9ac52388..000000000
--- a/resource_8md_source.html
+++ /dev/null
@@ -1,74 +0,0 @@
-
-
-
-
-
-
-
-|
- EnTT
- 3.2.1
-
- |
-
- 1.8.13
-
-
-
diff --git a/runtime__view_8hpp_source.html b/runtime__view_8hpp_source.html
index 85f8e9a4c..d5cd22e28 100644
--- a/runtime__view_8hpp_source.html
+++ b/runtime__view_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/scheduler_8hpp_source.html b/scheduler_8hpp_source.html
index 86ef2230e..31e38dede 100644
--- a/scheduler_8hpp_source.html
+++ b/scheduler_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/search/all_0.html b/search/all_0.html
index f25360b71..a52d5f053 100644
--- a/search/all_0.html
+++ b/search/all_0.html
@@ -1,7 +1,7 @@
-
+
- 1.8.13
+ 1.8.16
diff --git a/signal_2fwd_8hpp_source.html b/signal_2fwd_8hpp_source.html
index 38317ce3d..03b089cfb 100644
--- a/signal_2fwd_8hpp_source.html
+++ b/signal_2fwd_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/signal_8md_source.html b/signal_8md_source.html
deleted file mode 100644
index 76b23fa3e..000000000
--- a/signal_8md_source.html
+++ /dev/null
@@ -1,74 +0,0 @@
-
-
-
-
-
-
-
-|
- EnTT
- 3.2.1
-
- |
-
- 1.8.13
-
-
-
diff --git a/snapshot_8hpp_source.html b/snapshot_8hpp_source.html
index 45a0f5e18..bfe65412e 100644
--- a/snapshot_8hpp_source.html
+++ b/snapshot_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/sparse__set_8hpp_source.html b/sparse__set_8hpp_source.html
index 8e994cc9d..84687fded 100644
--- a/sparse__set_8hpp_source.html
+++ b/sparse__set_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/storage_8hpp_source.html b/storage_8hpp_source.html
index 1c1e123ae..6843b1141 100644
--- a/storage_8hpp_source.html
+++ b/storage_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1as__alias__t.html b/structentt_1_1as__alias__t.html
index 1344b233f..c1bec6785 100644
--- a/structentt_1_1as__alias__t.html
+++ b/structentt_1_1as__alias__t.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1as__group-members.html b/structentt_1_1as__group-members.html
index 4168b5e1a..0103e4b0d 100644
--- a/structentt_1_1as__group-members.html
+++ b/structentt_1_1as__group-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1as__group.html b/structentt_1_1as__group.html
index 4bbab950c..b404a34d9 100644
--- a/structentt_1_1as__group.html
+++ b/structentt_1_1as__group.html
@@ -1,9 +1,9 @@
-
+
-
+
| Const | Constness of the accepted registry. |
| Entity | A valid entity type (see entt_traits for more details). |
| Entity | A valid entity type (see entt_traits for more details). |
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1as__is__t.html b/structentt_1_1as__is__t.html
index 6ebb32dea..920dfc1c8 100644
--- a/structentt_1_1as__is__t.html
+++ b/structentt_1_1as__is__t.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1as__view-members.html b/structentt_1_1as__view-members.html
index cafd1bcaa..35d6b7f2a 100644
--- a/structentt_1_1as__view-members.html
+++ b/structentt_1_1as__view-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1as__view.html b/structentt_1_1as__view.html
index 885aa48bc..4c17b6744 100644
--- a/structentt_1_1as__view.html
+++ b/structentt_1_1as__view.html
@@ -1,9 +1,9 @@
-
+
-
+
| Const | Constness of the accepted registry. |
| Entity | A valid entity type (see entt_traits for more details). |
| Entity | A valid entity type (see entt_traits for more details). |
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1as__void__t.html b/structentt_1_1as__void__t.html
index 04c0851d0..175bf3630 100644
--- a/structentt_1_1as__void__t.html
+++ b/structentt_1_1as__void__t.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1basic__actor-members.html b/structentt_1_1basic__actor-members.html
index 753b69b3e..262206fa9 100644
--- a/structentt_1_1basic__actor-members.html
+++ b/structentt_1_1basic__actor-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1basic__actor.html b/structentt_1_1basic__actor.html
index 95ad5a75a..3c3e7b910 100644
--- a/structentt_1_1basic__actor.html
+++ b/structentt_1_1basic__actor.html
@@ -1,9 +1,9 @@
-
+
-
+
Tiny wrapper around a registry, for all those users that aren't confident with entity-component-system architecture and prefer to iterate objects directly.
| Entity | A valid entity type (see entt_traits for more details). |
| Entity | A valid entity type (see entt_traits for more details). |
Assigns the given component to an actor.
-A new instance of the given component is created and initialized with the arguments provided (the component must have a proper constructor or be of aggregate type). Then the component is assigned to the actor.
+
A new instance of the given component is created and initialized with the arguments provided (the component must have a proper constructor or be of aggregate type). Then the component is assigned to the actor.
In case the actor already has a component of the given type, it's replaced with the new one.
|
EnTT
- 3.2.1
+ 3.2.2
|
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_2946084b83498520c73ff3a9eb022209.html b/structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_2946084b83498520c73ff3a9eb022209.html
index eb50ec347..221ccfb58 100644
--- a/structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_2946084b83498520c73ff3a9eb022209.html
+++ b/structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_2946084b83498520c73ff3a9eb022209.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html b/structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html
index d01485de0..094136220 100644
--- a/structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html
+++ b/structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html
@@ -1,9 +1,9 @@
-
+
-
+
Collector.
-A collector contains a set of rules (literally, matchers) to use to track entities.
+
A collector contains a set of rules (literally, matchers) to use to track entities.
Its main purpose is to generate a descriptor that allows an observer to know how to connect to a registry.
| Reject | Untracked types used to filter out entities. |
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1basic__collector_3_4-members.html b/structentt_1_1basic__collector_3_4-members.html
index 95b1f92d3..a09c3bce9 100644
--- a/structentt_1_1basic__collector_3_4-members.html
+++ b/structentt_1_1basic__collector_3_4-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1basic__collector_3_4.html b/structentt_1_1basic__collector_3_4.html
index 9caf6ea7a..50e2770c3 100644
--- a/structentt_1_1basic__collector_3_4.html
+++ b/structentt_1_1basic__collector_3_4.html
@@ -1,9 +1,9 @@
-
+
-
+
Collector.
-A collector contains a set of rules (literally, matchers) to use to track entities.
+
A collector contains a set of rules (literally, matchers) to use to track entities.
Its main purpose is to generate a descriptor that allows an observer to know how to connect to a registry.
Definition at line 46 of file observer.hpp.
@@ -118,7 +121,7 @@ template<typename... AllOf, typename... NoneOf>
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1cache-members.html b/structentt_1_1cache-members.html
index eb69b36fc..060838954 100644
--- a/structentt_1_1cache-members.html
+++ b/structentt_1_1cache-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1cache.html b/structentt_1_1cache.html
index 78dd2c889..3245d786d 100644
--- a/structentt_1_1cache.html
+++ b/structentt_1_1cache.html
@@ -1,9 +1,9 @@
-
+
-
+
Iterates all resources.
-The function object is invoked for each element. It is provided with either the resource identifier, the resource handle or both of them.
+
The function object is invoked for each element. It is provided with either the resource identifier, the resource handle or both of them.
The signature of the function must be equivalent to one of the following forms:
| Func | Type of the function object to invoke. |
Creates a handle for a given resource identifier.
A resource handle can be in a either valid or invalid state. In other terms, a resource handle is properly initialized with a resource if the cache contains the resource itself. Otherwise the returned handle is uninitialized and accessing it results in undefined behavior.
-| id | Unique resource identifier. |
|
EnTT
- 3.2.1
+ 3.2.2
|
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1choice__t_3_010_01_4.html b/structentt_1_1choice__t_3_010_01_4.html
index a1eab4497..d080859b9 100644
--- a/structentt_1_1choice__t_3_010_01_4.html
+++ b/structentt_1_1choice__t_3_010_01_4.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1connect__arg__t.html b/structentt_1_1connect__arg__t.html
index a7232933b..8f77bd73a 100644
--- a/structentt_1_1connect__arg__t.html
+++ b/structentt_1_1connect__arg__t.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1emitter_1_1connection-members.html b/structentt_1_1emitter_1_1connection-members.html
index 6cfe3109e..ee02acee4 100644
--- a/structentt_1_1emitter_1_1connection-members.html
+++ b/structentt_1_1emitter_1_1connection-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1emitter_1_1connection.html b/structentt_1_1emitter_1_1connection.html
index 3c4b0b4db..081b73faf 100644
--- a/structentt_1_1emitter_1_1connection.html
+++ b/structentt_1_1emitter_1_1connection.html
@@ -1,9 +1,9 @@
-
+
-
+
@@ -94,7 +105,7 @@ Public Member Functions | |
| Default constructor. | |
| connection (typename event_handler< Event >::connection_type conn) | |
| Creates a connection that wraps its underlying instance. More... | |
| Creates a connection that wraps its underlying instance. More... | |
@@ -110,7 +121,7 @@ template<typename Event> | |||
|
EnTT
- 3.2.1
+ 3.2.2
|
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1entt__traits_3_01std_1_1uint16__t_01_4-members.html b/structentt_1_1entt__traits_3_01std_1_1uint16__t_01_4-members.html
index 4ed3fb34a..50f6ba3c2 100644
--- a/structentt_1_1entt__traits_3_01std_1_1uint16__t_01_4-members.html
+++ b/structentt_1_1entt__traits_3_01std_1_1uint16__t_01_4-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1entt__traits_3_01std_1_1uint16__t_01_4.html b/structentt_1_1entt__traits_3_01std_1_1uint16__t_01_4.html
index 52dae193a..80116fde0 100644
--- a/structentt_1_1entt__traits_3_01std_1_1uint16__t_01_4.html
+++ b/structentt_1_1entt__traits_3_01std_1_1uint16__t_01_4.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1entt__traits_3_01std_1_1uint32__t_01_4-members.html b/structentt_1_1entt__traits_3_01std_1_1uint32__t_01_4-members.html
index c17900da0..aefa25642 100644
--- a/structentt_1_1entt__traits_3_01std_1_1uint32__t_01_4-members.html
+++ b/structentt_1_1entt__traits_3_01std_1_1uint32__t_01_4-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1entt__traits_3_01std_1_1uint32__t_01_4.html b/structentt_1_1entt__traits_3_01std_1_1uint32__t_01_4.html
index 73c23ee12..a9772964c 100644
--- a/structentt_1_1entt__traits_3_01std_1_1uint32__t_01_4.html
+++ b/structentt_1_1entt__traits_3_01std_1_1uint32__t_01_4.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1entt__traits_3_01std_1_1uint64__t_01_4-members.html b/structentt_1_1entt__traits_3_01std_1_1uint64__t_01_4-members.html
index bc65cc2dd..7b9e96df2 100644
--- a/structentt_1_1entt__traits_3_01std_1_1uint64__t_01_4-members.html
+++ b/structentt_1_1entt__traits_3_01std_1_1uint64__t_01_4-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1entt__traits_3_01std_1_1uint64__t_01_4.html b/structentt_1_1entt__traits_3_01std_1_1uint64__t_01_4.html
index 047c49558..b0fe3d39e 100644
--- a/structentt_1_1entt__traits_3_01std_1_1uint64__t_01_4.html
+++ b/structentt_1_1entt__traits_3_01std_1_1uint64__t_01_4.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1exclude__t.html b/structentt_1_1exclude__t.html
index e48fdf97d..46874362f 100644
--- a/structentt_1_1exclude__t.html
+++ b/structentt_1_1exclude__t.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1exclude__t__coll__graph.map b/structentt_1_1exclude__t__coll__graph.map
index 3d61520e9..f71fb7dad 100644
--- a/structentt_1_1exclude__t__coll__graph.map
+++ b/structentt_1_1exclude__t__coll__graph.map
@@ -1,3 +1,4 @@
diff --git a/structentt_1_1exclude__t__coll__graph.md5 b/structentt_1_1exclude__t__coll__graph.md5
index f230a25cf..e8db3aab1 100644
--- a/structentt_1_1exclude__t__coll__graph.md5
+++ b/structentt_1_1exclude__t__coll__graph.md5
@@ -1 +1 @@
-b59d3cba3fc4ecfa313d40fb9005acd7
\ No newline at end of file
+2a8afac85acfeb099c60075cba4df31e
\ No newline at end of file
diff --git a/structentt_1_1exclude__t__inherit__graph.map b/structentt_1_1exclude__t__inherit__graph.map
index 3d61520e9..f71fb7dad 100644
--- a/structentt_1_1exclude__t__inherit__graph.map
+++ b/structentt_1_1exclude__t__inherit__graph.map
@@ -1,3 +1,4 @@
diff --git a/structentt_1_1exclude__t__inherit__graph.md5 b/structentt_1_1exclude__t__inherit__graph.md5
index bc4bcddb2..e8db3aab1 100644
--- a/structentt_1_1exclude__t__inherit__graph.md5
+++ b/structentt_1_1exclude__t__inherit__graph.md5
@@ -1 +1 @@
-bea56ce62e8439efd7c0b85da10f7696
\ No newline at end of file
+2a8afac85acfeb099c60075cba4df31e
\ No newline at end of file
diff --git a/structentt_1_1family-members.html b/structentt_1_1family-members.html
new file mode 100644
index 000000000..993869bc5
--- /dev/null
+++ b/structentt_1_1family-members.html
@@ -0,0 +1,85 @@
+
+
+
+
+
+
+
+|
+ EnTT
+ 3.3.0
+
+ |
+
This is the complete list of members for entt::family< Type, Generator >, including all inherited members.
+| type() ENTT_NOEXCEPT | entt::family< Type, Generator > | inlinestatic |
+ 1.8.16
+
+
+
diff --git a/structentt_1_1family.html b/structentt_1_1family.html
new file mode 100644
index 000000000..a25db4356
--- /dev/null
+++ b/structentt_1_1family.html
@@ -0,0 +1,146 @@
+
+
+
+
+
+
+
+|
+ EnTT
+ 3.3.0
+
+ |
+
Runtime type unique identifier. + More...
+ +#include <family.hpp>
+Static Public Member Functions | |
| static ENTT_ID_TYPE | type () ENTT_NOEXCEPT |
| Statically generated unique identifier for a given type. More... | |
Runtime type unique identifier.
+| Type | Type for which to generate an unique identifier. |
| Generator | Tags to use to discriminate between different generators. |
Definition at line 32 of file family.hpp.
+
+
|
+ +inlinestatic | +
Statically generated unique identifier for a given type.
+Definition at line 37 of file family.hpp.
+ +
+ 1.8.16
+
+
+
diff --git a/structentt_1_1generator-members.html b/structentt_1_1generator-members.html
new file mode 100644
index 000000000..d9e946aff
--- /dev/null
+++ b/structentt_1_1generator-members.html
@@ -0,0 +1,85 @@
+
+
+
+
+
+
+
+|
+ EnTT
+ 3.3.0
+
+ |
+
This is the complete list of members for entt::generator<... >, including all inherited members.
+| next() ENTT_NOEXCEPT | entt::generator<... > | inlinestatic |
+ 1.8.16
+
+
+
diff --git a/structentt_1_1generator.html b/structentt_1_1generator.html
new file mode 100644
index 000000000..94fad3237
--- /dev/null
+++ b/structentt_1_1generator.html
@@ -0,0 +1,139 @@
+
+
+
+
+
+
+
+|
+ EnTT
+ 3.3.0
+
+ |
+
Sequential number generator. + More...
+ +#include <family.hpp>
+Static Public Member Functions | |
| static ENTT_ID_TYPE | next () ENTT_NOEXCEPT |
| Returns the next available value. More... | |
Sequential number generator.
+ +Definition at line 14 of file family.hpp.
+
+
|
+ +inlinestatic | +
Returns the next available value.
+Definition at line 19 of file family.hpp.
+ +
+ 1.8.16
+
+
+
diff --git a/structentt_1_1get__t.html b/structentt_1_1get__t.html
index 655c31cca..70036250f 100644
--- a/structentt_1_1get__t.html
+++ b/structentt_1_1get__t.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1get__t__coll__graph.map b/structentt_1_1get__t__coll__graph.map
index 1adff6c7f..58ebb6f83 100644
--- a/structentt_1_1get__t__coll__graph.map
+++ b/structentt_1_1get__t__coll__graph.map
@@ -1,3 +1,4 @@
diff --git a/structentt_1_1get__t__coll__graph.md5 b/structentt_1_1get__t__coll__graph.md5
index 9c9662fee..76a418297 100644
--- a/structentt_1_1get__t__coll__graph.md5
+++ b/structentt_1_1get__t__coll__graph.md5
@@ -1 +1 @@
-de8ed796fa0befd52014ea09ff1bff1d
\ No newline at end of file
+3eafa0c0c4a8c11b54308af3b028f73e
\ No newline at end of file
diff --git a/structentt_1_1get__t__inherit__graph.map b/structentt_1_1get__t__inherit__graph.map
index 1adff6c7f..58ebb6f83 100644
--- a/structentt_1_1get__t__inherit__graph.map
+++ b/structentt_1_1get__t__inherit__graph.map
@@ -1,3 +1,4 @@
diff --git a/structentt_1_1get__t__inherit__graph.md5 b/structentt_1_1get__t__inherit__graph.md5
index 43597f6da..76a418297 100644
--- a/structentt_1_1get__t__inherit__graph.md5
+++ b/structentt_1_1get__t__inherit__graph.md5
@@ -1 +1 @@
-ae5e7f61605ed19d01d8b0a089cb2f41
\ No newline at end of file
+3eafa0c0c4a8c11b54308af3b028f73e
\ No newline at end of file
diff --git a/structentt_1_1identity-members.html b/structentt_1_1identity-members.html
index 4f20e0fb9..0453a9082 100644
--- a/structentt_1_1identity-members.html
+++ b/structentt_1_1identity-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1identity.html b/structentt_1_1identity.html
index 30ff113f8..2f49b222a 100644
--- a/structentt_1_1identity.html
+++ b/structentt_1_1identity.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1insertion__sort-members.html b/structentt_1_1insertion__sort-members.html
index 1c81c6d6e..aa39c7425 100644
--- a/structentt_1_1insertion__sort-members.html
+++ b/structentt_1_1insertion__sort-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1insertion__sort.html b/structentt_1_1insertion__sort.html
index ed6ea9ac9..97aeaa26b 100644
--- a/structentt_1_1insertion__sort.html
+++ b/structentt_1_1insertion__sort.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1is__equality__comparable.html b/structentt_1_1is__equality__comparable.html
index bc3f3feb3..6535c9754 100644
--- a/structentt_1_1is__equality__comparable.html
+++ b/structentt_1_1is__equality__comparable.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva1cb524e6c54df82cda82d1a4dfba6abe.md5 b/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva1cb524e6c54df82cda82d1a4dfba6abe.md5
deleted file mode 100644
index b469b3e9d..000000000
--- a/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva1cb524e6c54df82cda82d1a4dfba6abe.md5
+++ /dev/null
@@ -1 +0,0 @@
-fee18437d6f544c2674fa0213a79c2dd
\ No newline at end of file
diff --git a/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva22225425f92ebe2943dca66f125cfda1.html b/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva46aebf4c20f38cbd0108d1e297595736.html
similarity index 71%
rename from structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva22225425f92ebe2943dca66f125cfda1.html
rename to structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva46aebf4c20f38cbd0108d1e297595736.html
index b0a09b55d..ecc429379 100644
--- a/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva22225425f92ebe2943dca66f125cfda1.html
+++ b/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva46aebf4c20f38cbd0108d1e297595736.html
@@ -1,9 +1,9 @@
-
+
-
+
Provides the member constant value to true if a given type is equality comparable, false otherwise.
- More...
#include <type_traits.hpp>
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva1cb524e6c54df82cda82d1a4dfba6abe.map b/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva5c1d68aca80e5da312839debee08d38e.map
similarity index 56%
rename from structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva1cb524e6c54df82cda82d1a4dfba6abe.map
rename to structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva5c1d68aca80e5da312839debee08d38e.map
index 02400c46b..9cfa8800a 100644
--- a/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva1cb524e6c54df82cda82d1a4dfba6abe.map
+++ b/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva5c1d68aca80e5da312839debee08d38e.map
@@ -1,2 +1,4 @@
diff --git a/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva5c1d68aca80e5da312839debee08d38e.md5 b/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva5c1d68aca80e5da312839debee08d38e.md5
new file mode 100644
index 000000000..d12589523
--- /dev/null
+++ b/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva5c1d68aca80e5da312839debee08d38e.md5
@@ -0,0 +1 @@
+7c5a8147a8a17954a9de9d6755ec2d69
\ No newline at end of file
diff --git a/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva1cb524e6c54df82cda82d1a4dfba6abe.png b/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva5c1d68aca80e5da312839debee08d38e.png
similarity index 100%
rename from structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva1cb524e6c54df82cda82d1a4dfba6abe.png
rename to structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva5c1d68aca80e5da312839debee08d38e.png
diff --git a/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declvabfe6c5f774b5178f5435086b847a8374.map b/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declvaaf8c5fc435d01b8c7467d553d4cf4ad8.map
similarity index 56%
rename from structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declvabfe6c5f774b5178f5435086b847a8374.map
rename to structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declvaaf8c5fc435d01b8c7467d553d4cf4ad8.map
index 02400c46b..9cfa8800a 100644
--- a/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declvabfe6c5f774b5178f5435086b847a8374.map
+++ b/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declvaaf8c5fc435d01b8c7467d553d4cf4ad8.map
@@ -1,2 +1,4 @@
diff --git a/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declvaaf8c5fc435d01b8c7467d553d4cf4ad8.md5 b/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declvaaf8c5fc435d01b8c7467d553d4cf4ad8.md5
new file mode 100644
index 000000000..d12589523
--- /dev/null
+++ b/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declvaaf8c5fc435d01b8c7467d553d4cf4ad8.md5
@@ -0,0 +1 @@
+7c5a8147a8a17954a9de9d6755ec2d69
\ No newline at end of file
diff --git a/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declvabfe6c5f774b5178f5435086b847a8374.png b/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declvaaf8c5fc435d01b8c7467d553d4cf4ad8.png
similarity index 100%
rename from structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declvabfe6c5f774b5178f5435086b847a8374.png
rename to structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declvaaf8c5fc435d01b8c7467d553d4cf4ad8.png
diff --git a/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declvabfe6c5f774b5178f5435086b847a8374.md5 b/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declvabfe6c5f774b5178f5435086b847a8374.md5
deleted file mode 100644
index ac20fb67f..000000000
--- a/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declvabfe6c5f774b5178f5435086b847a8374.md5
+++ /dev/null
@@ -1 +0,0 @@
-edd0e692b2cd75cb60092ea47fa2276a
\ No newline at end of file
diff --git a/structentt_1_1is__equality__comparable__coll__graph.map b/structentt_1_1is__equality__comparable__coll__graph.map
index b7a6199df..08aa242f2 100644
--- a/structentt_1_1is__equality__comparable__coll__graph.map
+++ b/structentt_1_1is__equality__comparable__coll__graph.map
@@ -1,2 +1,4 @@
diff --git a/structentt_1_1is__equality__comparable__coll__graph.md5 b/structentt_1_1is__equality__comparable__coll__graph.md5
index c031e48cb..13466869f 100644
--- a/structentt_1_1is__equality__comparable__coll__graph.md5
+++ b/structentt_1_1is__equality__comparable__coll__graph.md5
@@ -1 +1 @@
-79ac629113b298dfb59599dff81e02cf
\ No newline at end of file
+0fbe2d2783b875dadb3260bb1030ba13
\ No newline at end of file
diff --git a/structentt_1_1is__equality__comparable__inherit__graph.map b/structentt_1_1is__equality__comparable__inherit__graph.map
index b7a6199df..08aa242f2 100644
--- a/structentt_1_1is__equality__comparable__inherit__graph.map
+++ b/structentt_1_1is__equality__comparable__inherit__graph.map
@@ -1,2 +1,4 @@
diff --git a/structentt_1_1is__equality__comparable__inherit__graph.md5 b/structentt_1_1is__equality__comparable__inherit__graph.md5
index 8b531fc52..13466869f 100644
--- a/structentt_1_1is__equality__comparable__inherit__graph.md5
+++ b/structentt_1_1is__equality__comparable__inherit__graph.md5
@@ -1 +1 @@
-6f81a80d20bd5a32b01e843b647d0d37
\ No newline at end of file
+0fbe2d2783b875dadb3260bb1030ba13
\ No newline at end of file
diff --git a/structentt_1_1is__named__type.html b/structentt_1_1is__named__type.html
index c7cd4572a..bf8966e83 100644
--- a/structentt_1_1is__named__type.html
+++ b/structentt_1_1is__named__type.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1is__named__type_3_01Type_00_01std_1_1void__t_3_01named__type__traits__t_3_01std_1_0c6058b8ba47cc9c6693d18c8fb48d92.map b/structentt_1_1is__named__type_3_01Type_00_01std_1_1void__t_3_01named__type__traits__t_3_01std_1_0c6058b8ba47cc9c6693d18c8fb48d92.map
index f4836835a..f138f158f 100644
--- a/structentt_1_1is__named__type_3_01Type_00_01std_1_1void__t_3_01named__type__traits__t_3_01std_1_0c6058b8ba47cc9c6693d18c8fb48d92.map
+++ b/structentt_1_1is__named__type_3_01Type_00_01std_1_1void__t_3_01named__type__traits__t_3_01std_1_0c6058b8ba47cc9c6693d18c8fb48d92.map
@@ -1,2 +1,4 @@
diff --git a/structentt_1_1is__named__type_3_01Type_00_01std_1_1void__t_3_01named__type__traits__t_3_01std_1_0c6058b8ba47cc9c6693d18c8fb48d92.md5 b/structentt_1_1is__named__type_3_01Type_00_01std_1_1void__t_3_01named__type__traits__t_3_01std_1_0c6058b8ba47cc9c6693d18c8fb48d92.md5
index e7b8d0969..e7bf0c8f1 100644
--- a/structentt_1_1is__named__type_3_01Type_00_01std_1_1void__t_3_01named__type__traits__t_3_01std_1_0c6058b8ba47cc9c6693d18c8fb48d92.md5
+++ b/structentt_1_1is__named__type_3_01Type_00_01std_1_1void__t_3_01named__type__traits__t_3_01std_1_0c6058b8ba47cc9c6693d18c8fb48d92.md5
@@ -1 +1 @@
-2de8bdc27b2970e35746a08fc74cbeb5
\ No newline at end of file
+392a99b82cfedf64d35169691275356c
\ No newline at end of file
diff --git a/structentt_1_1is__named__type_3_01Type_00_01std_1_1void__t_3_01named__type__traits__t_3_01std_1_268fa5a871b2de95e24d77c0786df19e.html b/structentt_1_1is__named__type_3_01Type_00_01std_1_1void__t_3_01named__type__traits__t_3_01std_1_268fa5a871b2de95e24d77c0786df19e.html
index d6040bb91..251995eb7 100644
--- a/structentt_1_1is__named__type_3_01Type_00_01std_1_1void__t_3_01named__type__traits__t_3_01std_1_268fa5a871b2de95e24d77c0786df19e.html
+++ b/structentt_1_1is__named__type_3_01Type_00_01std_1_1void__t_3_01named__type__traits__t_3_01std_1_268fa5a871b2de95e24d77c0786df19e.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1is__named__type_3_01Type_00_01std_1_1void__t_3_01named__type__traits__t_3_01std_1_9aa8d80f3ceacce258d85ba16cdb7265.map b/structentt_1_1is__named__type_3_01Type_00_01std_1_1void__t_3_01named__type__traits__t_3_01std_1_9aa8d80f3ceacce258d85ba16cdb7265.map
index f4836835a..f138f158f 100644
--- a/structentt_1_1is__named__type_3_01Type_00_01std_1_1void__t_3_01named__type__traits__t_3_01std_1_9aa8d80f3ceacce258d85ba16cdb7265.map
+++ b/structentt_1_1is__named__type_3_01Type_00_01std_1_1void__t_3_01named__type__traits__t_3_01std_1_9aa8d80f3ceacce258d85ba16cdb7265.map
@@ -1,2 +1,4 @@
diff --git a/structentt_1_1is__named__type_3_01Type_00_01std_1_1void__t_3_01named__type__traits__t_3_01std_1_9aa8d80f3ceacce258d85ba16cdb7265.md5 b/structentt_1_1is__named__type_3_01Type_00_01std_1_1void__t_3_01named__type__traits__t_3_01std_1_9aa8d80f3ceacce258d85ba16cdb7265.md5
index 338cc0b93..e7bf0c8f1 100644
--- a/structentt_1_1is__named__type_3_01Type_00_01std_1_1void__t_3_01named__type__traits__t_3_01std_1_9aa8d80f3ceacce258d85ba16cdb7265.md5
+++ b/structentt_1_1is__named__type_3_01Type_00_01std_1_1void__t_3_01named__type__traits__t_3_01std_1_9aa8d80f3ceacce258d85ba16cdb7265.md5
@@ -1 +1 @@
-62b0504b9a783e944e5f8f9afcad6a31
\ No newline at end of file
+392a99b82cfedf64d35169691275356c
\ No newline at end of file
diff --git a/structentt_1_1is__named__type__coll__graph.map b/structentt_1_1is__named__type__coll__graph.map
index 30da58e63..fa22010fa 100644
--- a/structentt_1_1is__named__type__coll__graph.map
+++ b/structentt_1_1is__named__type__coll__graph.map
@@ -1,2 +1,4 @@
diff --git a/structentt_1_1is__named__type__coll__graph.md5 b/structentt_1_1is__named__type__coll__graph.md5
index b3e6aaa0b..6c036ee88 100644
--- a/structentt_1_1is__named__type__coll__graph.md5
+++ b/structentt_1_1is__named__type__coll__graph.md5
@@ -1 +1 @@
-c1dbfb3f619b7a5f7bbafa4ff453812d
\ No newline at end of file
+18530e5107bc720021e33442e78eca41
\ No newline at end of file
diff --git a/structentt_1_1is__named__type__inherit__graph.map b/structentt_1_1is__named__type__inherit__graph.map
index 30da58e63..fa22010fa 100644
--- a/structentt_1_1is__named__type__inherit__graph.map
+++ b/structentt_1_1is__named__type__inherit__graph.map
@@ -1,2 +1,4 @@
diff --git a/structentt_1_1is__named__type__inherit__graph.md5 b/structentt_1_1is__named__type__inherit__graph.md5
index fb997606a..6c036ee88 100644
--- a/structentt_1_1is__named__type__inherit__graph.md5
+++ b/structentt_1_1is__named__type__inherit__graph.md5
@@ -1 +1 @@
-a5249ddad21262ceff2901cd1b48abaa
\ No newline at end of file
+18530e5107bc720021e33442e78eca41
\ No newline at end of file
diff --git a/structentt_1_1matcher.html b/structentt_1_1matcher.html
index 53828009c..01cc03c4f 100644
--- a/structentt_1_1matcher.html
+++ b/structentt_1_1matcher.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1meta__base-members.html b/structentt_1_1meta__base-members.html
index dc9d61e17..13b4ae25b 100644
--- a/structentt_1_1meta__base-members.html
+++ b/structentt_1_1meta__base-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1meta__base.html b/structentt_1_1meta__base.html
index dd5b1d2e4..d231ca7d4 100644
--- a/structentt_1_1meta__base.html
+++ b/structentt_1_1meta__base.html
@@ -1,9 +1,9 @@
-
+
-
+
Returns true if a meta object is valid, false otherwise.
Definition at line 864 of file meta.hpp.
+Definition at line 863 of file meta.hpp.
@@ -269,7 +272,7 @@ Public Member FunctionsReturns the meta type to which a meta object belongs.
Definition at line 1791 of file meta.hpp.
+Definition at line 1790 of file meta.hpp.
@@ -299,7 +302,7 @@ Public Member FunctionsReturns the meta type of the underlying object.
Definition at line 1796 of file meta.hpp.
+Definition at line 1795 of file meta.hpp.
@@ -311,7 +314,7 @@ Public Member Functions
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1meta__conv-members.html b/structentt_1_1meta__conv-members.html
index e83325afd..f5d9f140c 100644
--- a/structentt_1_1meta__conv-members.html
+++ b/structentt_1_1meta__conv-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1meta__conv.html b/structentt_1_1meta__conv.html
index 877457574..b5c0aee63 100644
--- a/structentt_1_1meta__conv.html
+++ b/structentt_1_1meta__conv.html
@@ -1,9 +1,9 @@
-
+
-
+
Definition at line 897 of file meta.hpp.
+Definition at line 896 of file meta.hpp.
@@ -202,7 +205,7 @@ Public Member FunctionsReturns true if a meta object is valid, false otherwise.
Definition at line 905 of file meta.hpp.
+Definition at line 904 of file meta.hpp.
@@ -239,7 +242,7 @@ Public Member FunctionsDefinition at line 910 of file meta.hpp.
+Definition at line 909 of file meta.hpp.
@@ -269,7 +272,7 @@ Public Member FunctionsReturns the meta type to which a meta object belongs.
Definition at line 1801 of file meta.hpp.
+Definition at line 1800 of file meta.hpp.
@@ -299,7 +302,7 @@ Public Member FunctionsReturns the meta type of the underlying object.
Definition at line 1806 of file meta.hpp.
+Definition at line 1805 of file meta.hpp.
@@ -311,7 +314,7 @@ Public Member Functions
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1meta__ctor-members.html b/structentt_1_1meta__ctor-members.html
index 65ea81030..482b4e323 100644
--- a/structentt_1_1meta__ctor-members.html
+++ b/structentt_1_1meta__ctor-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1meta__ctor.html b/structentt_1_1meta__ctor.html
index 3da572496..132465770 100644
--- a/structentt_1_1meta__ctor.html
+++ b/structentt_1_1meta__ctor.html
@@ -1,9 +1,9 @@
-
+
-
+
Definition at line 1816 of file meta.hpp.
+Definition at line 1815 of file meta.hpp.
@@ -237,7 +240,7 @@ template<typename... Args>Definition at line 965 of file meta.hpp.
+Definition at line 964 of file meta.hpp.
@@ -267,7 +270,7 @@ template<typename... Args>Returns true if a meta object is valid, false otherwise.
Definition at line 1002 of file meta.hpp.
+Definition at line 1001 of file meta.hpp.
@@ -304,7 +307,7 @@ template<typename... Args>Definition at line 1007 of file meta.hpp.
+Definition at line 1006 of file meta.hpp.
@@ -334,12 +337,49 @@ template<typename... Args>Returns the meta type to which a meta object belongs.
Definition at line 1811 of file meta.hpp.
+Definition at line 1810 of file meta.hpp.
+ + + + +Returns the number of arguments accepted by a meta constructor.
Definition at line 942 of file meta.hpp.
+Definition at line 941 of file meta.hpp.
@@ -457,7 +460,7 @@ template<typename Op >
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1meta__ctx-members.html b/structentt_1_1meta__ctx-members.html
index 7d9f17607..b16416b30 100644
--- a/structentt_1_1meta__ctx-members.html
+++ b/structentt_1_1meta__ctx-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1meta__ctx.html b/structentt_1_1meta__ctx.html
index 12fa6b3e5..b53e65a89 100644
--- a/structentt_1_1meta__ctx.html
+++ b/structentt_1_1meta__ctx.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1meta__data-members.html b/structentt_1_1meta__data-members.html
index c89b77dfa..2da51411a 100644
--- a/structentt_1_1meta__data-members.html
+++ b/structentt_1_1meta__data-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1meta__data.html b/structentt_1_1meta__data.html
index bdef8a595..8669bd2eb 100644
--- a/structentt_1_1meta__data.html
+++ b/structentt_1_1meta__data.html
@@ -1,9 +1,9 @@
-
+
-
+
Definition at line 1157 of file meta.hpp.
+Definition at line 1156 of file meta.hpp.
@@ -249,7 +252,7 @@ Public Member FunctionsDefinition at line 1171 of file meta.hpp.
+Definition at line 1170 of file meta.hpp.
@@ -279,7 +282,7 @@ Public Member FunctionsReturns the identifier assigned to a given meta object.
Definition at line 1078 of file meta.hpp.
+Definition at line 1077 of file meta.hpp.
@@ -309,7 +312,7 @@ Public Member FunctionsIndicates whether a given meta data is constant or not.
Definition at line 1089 of file meta.hpp.
+Definition at line 1088 of file meta.hpp.
@@ -340,7 +343,7 @@ Public Member FunctionsA static meta data is such that it can be accessed using a null pointer as an instance.
Definition at line 1101 of file meta.hpp.
+Definition at line 1100 of file meta.hpp.
@@ -370,7 +373,7 @@ Public Member FunctionsReturns true if a meta object is valid, false otherwise.
Definition at line 1202 of file meta.hpp.
+Definition at line 1201 of file meta.hpp.
@@ -407,7 +410,7 @@ Public Member FunctionsDefinition at line 1207 of file meta.hpp.
+Definition at line 1206 of file meta.hpp.
@@ -437,12 +440,49 @@ Public Member FunctionsReturns the meta type to which a meta object belongs.
Definition at line 1826 of file meta.hpp.
+Definition at line 1825 of file meta.hpp.
+ + + + +
-
|
- -inline | -
Sets the value of the variable enclosed by a given meta type.
-It must be possible to cast the instance to the parent type of the meta data. Otherwise, invoking the setter results in an undefined behavior.
- The type of the value must coincide exactly with that of the variable enclosed by the meta data. Otherwise, invoking the setter does nothing.
| Type | Type of value to assign. |
| handle | An opaque pointer to an instance of the underlying type. |
| value | Parameter to use to set the underlying variable. |
Sets the i-th element of an array enclosed by a given meta type.
-It must be possible to cast the instance to the parent type of the meta data. Otherwise, invoking the setter results in an undefined behavior.
+
It must be possible to cast the instance to the parent type of the meta data. Otherwise, invoking the setter results in an undefined behavior.
The type of the value must coincide exactly with that of the array type enclosed by the meta data. Otherwise, invoking the setter does nothing.
+
|
+ +inline | +
Sets the value of the variable enclosed by a given meta type.
+It must be possible to cast the instance to the parent type of the meta data. Otherwise, invoking the setter results in an undefined behavior.
+ The type of the value must coincide exactly with that of the variable enclosed by the meta data. Otherwise, invoking the setter does nothing.
| Type | Type of value to assign. |
| handle | An opaque pointer to an instance of the underlying type. |
| value | Parameter to use to set the underlying variable. |
Returns the meta type of the underlying object.
Definition at line 1831 of file meta.hpp.
+Definition at line 1830 of file meta.hpp.
@@ -683,7 +686,7 @@ template<typename Type >
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1meta__dtor-members.html b/structentt_1_1meta__dtor-members.html
index 544cebb73..ce8c932bd 100644
--- a/structentt_1_1meta__dtor-members.html
+++ b/structentt_1_1meta__dtor-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1meta__dtor.html b/structentt_1_1meta__dtor.html
index 81cf9e13b..af5e637d0 100644
--- a/structentt_1_1meta__dtor.html
+++ b/structentt_1_1meta__dtor.html
@@ -1,9 +1,9 @@
-
+
-
+
Definition at line 1042 of file meta.hpp.
+Definition at line 1041 of file meta.hpp.
@@ -200,7 +203,7 @@ Public Member FunctionsReturns true if a meta object is valid, false otherwise.
Definition at line 1050 of file meta.hpp.
+Definition at line 1049 of file meta.hpp.
@@ -237,7 +240,7 @@ Public Member FunctionsDefinition at line 1055 of file meta.hpp.
+Definition at line 1054 of file meta.hpp.
@@ -267,7 +270,7 @@ Public Member FunctionsReturns the meta type to which a meta object belongs.
Definition at line 1821 of file meta.hpp.
+Definition at line 1820 of file meta.hpp.
@@ -279,7 +282,7 @@ Public Member Functions
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1meta__func-members.html b/structentt_1_1meta__func-members.html
index ba394dbed..b6173175e 100644
--- a/structentt_1_1meta__func-members.html
+++ b/structentt_1_1meta__func-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1meta__func.html b/structentt_1_1meta__func.html
index 3ad9c2997..318e86624 100644
--- a/structentt_1_1meta__func.html
+++ b/structentt_1_1meta__func.html
@@ -1,9 +1,9 @@
-
+
-
+
Definition at line 1846 of file meta.hpp.
+Definition at line 1845 of file meta.hpp.
@@ -233,7 +236,7 @@ Public Member FunctionsReturns the identifier assigned to a given meta object.
Definition at line 1233 of file meta.hpp.
+Definition at line 1232 of file meta.hpp.
@@ -274,7 +277,7 @@ template<typename... Args>Invokes the underlying function, if possible.
-To invoke a meta function, the types of the parameters must coincide exactly with those required by the underlying function. Otherwise, an empty and then invalid container is returned.
+
To invoke a meta function, the types of the parameters must coincide exactly with those required by the underlying function. Otherwise, an empty and then invalid container is returned.
It must be possible to cast the instance to the parent type of the meta function. Otherwise, invoking the underlying function results in an undefined behavior.
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1meta__handle.html b/structentt_1_1meta__handle.html
index d6ca86653..a0610e321 100644
--- a/structentt_1_1meta__handle.html
+++ b/structentt_1_1meta__handle.html
@@ -1,9 +1,9 @@
-
+
-
+
Opaque pointers to instances of any type.
-A handle doesn't perform copies and isn't responsible for the contained object. It doesn't prolong the lifetime of the pointed instance.
+
A handle doesn't perform copies and isn't responsible for the contained object. It doesn't prolong the lifetime of the pointed instance.
Handles are used mainly to gnerate aliases for actual objects when needed.
Definition at line 665 of file meta.hpp.
+Definition at line 636 of file meta.hpp.
@@ -168,7 +171,7 @@ template<typename Type >Indirection operator for aliasing construction.
Definition at line 677 of file meta.hpp.
+Definition at line 648 of file meta.hpp.
@@ -180,7 +183,7 @@ template<typename Type >
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1meta__prop-members.html b/structentt_1_1meta__prop-members.html
index a15af2734..218aea9ae 100644
--- a/structentt_1_1meta__prop-members.html
+++ b/structentt_1_1meta__prop-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1meta__prop.html b/structentt_1_1meta__prop.html
index d6d3b6d9e..096dabab5 100644
--- a/structentt_1_1meta__prop.html
+++ b/structentt_1_1meta__prop.html
@@ -1,9 +1,9 @@
-
+
-
+
Returns the stored key.
Definition at line 784 of file meta.hpp.
+Definition at line 783 of file meta.hpp.
@@ -192,7 +195,7 @@ Public Member FunctionsReturns true if a meta object is valid, false otherwise.
Definition at line 800 of file meta.hpp.
+Definition at line 799 of file meta.hpp.
@@ -229,7 +232,7 @@ Public Member FunctionsDefinition at line 810 of file meta.hpp.
+Definition at line 809 of file meta.hpp.
@@ -259,7 +262,7 @@ Public Member FunctionsReturns the stored value.
Definition at line 792 of file meta.hpp.
+Definition at line 791 of file meta.hpp.
@@ -271,7 +274,7 @@ Public Member Functions
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1monostate-members.html b/structentt_1_1monostate-members.html
index adcaad368..eda6d450c 100644
--- a/structentt_1_1monostate-members.html
+++ b/structentt_1_1monostate-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1monostate.html b/structentt_1_1monostate.html
index ecbd93a3a..4f0c6dfdc 100644
--- a/structentt_1_1monostate.html
+++ b/structentt_1_1monostate.html
@@ -1,9 +1,9 @@
-
+
-
+
Minimal implementation of the monostate pattern.
-A minimal, yet complete configuration system built on top of the monostate pattern. Thread safe by design, it works only with basic types like ints or bools.
+
A minimal, yet complete configuration system built on top of the monostate pattern. Thread safe by design, it works only with basic types like ints or bools.
Multiple types and therefore more than one value can be associated with a single key. Because of this, users must pay attention to use the same type both during an assignment and when they try to read back their data. Otherwise, they can incur in unexpected results.
Definition at line 24 of file monostate.hpp.
@@ -191,7 +194,7 @@ template<typename Type >
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1named__type__traits.html b/structentt_1_1named__type__traits.html
index 7f9fed842..9c1a294ec 100644
--- a/structentt_1_1named__type__traits.html
+++ b/structentt_1_1named__type__traits.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1named__type__traits_3_01const_01Type_01_4.html b/structentt_1_1named__type__traits_3_01const_01Type_01_4.html
index 3acb0b08a..c036c7921 100644
--- a/structentt_1_1named__type__traits_3_01const_01Type_01_4.html
+++ b/structentt_1_1named__type__traits_3_01const_01Type_01_4.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1named__type__traits_3_01const_01Type_01_4__coll__graph.map b/structentt_1_1named__type__traits_3_01const_01Type_01_4__coll__graph.map
index 68e66aa2f..8aa89fb18 100644
--- a/structentt_1_1named__type__traits_3_01const_01Type_01_4__coll__graph.map
+++ b/structentt_1_1named__type__traits_3_01const_01Type_01_4__coll__graph.map
@@ -1,3 +1,4 @@
diff --git a/structentt_1_1named__type__traits_3_01const_01Type_01_4__coll__graph.md5 b/structentt_1_1named__type__traits_3_01const_01Type_01_4__coll__graph.md5
index 7d6fc6a65..08de4d9fe 100644
--- a/structentt_1_1named__type__traits_3_01const_01Type_01_4__coll__graph.md5
+++ b/structentt_1_1named__type__traits_3_01const_01Type_01_4__coll__graph.md5
@@ -1 +1 @@
-af406f619646e2f2b7f5ca50a3ab5393
\ No newline at end of file
+a07b5b831cc3bbbe49a238fd7a299736
\ No newline at end of file
diff --git a/structentt_1_1named__type__traits_3_01const_01Type_01_4__inherit__graph.map b/structentt_1_1named__type__traits_3_01const_01Type_01_4__inherit__graph.map
index 68e66aa2f..8aa89fb18 100644
--- a/structentt_1_1named__type__traits_3_01const_01Type_01_4__inherit__graph.map
+++ b/structentt_1_1named__type__traits_3_01const_01Type_01_4__inherit__graph.map
@@ -1,3 +1,4 @@
diff --git a/structentt_1_1named__type__traits_3_01const_01Type_01_4__inherit__graph.md5 b/structentt_1_1named__type__traits_3_01const_01Type_01_4__inherit__graph.md5
index c086f65c5..08de4d9fe 100644
--- a/structentt_1_1named__type__traits_3_01const_01Type_01_4__inherit__graph.md5
+++ b/structentt_1_1named__type__traits_3_01const_01Type_01_4__inherit__graph.md5
@@ -1 +1 @@
-c1b62f210feb840c8882c017c960512b
\ No newline at end of file
+a07b5b831cc3bbbe49a238fd7a299736
\ No newline at end of file
diff --git a/structentt_1_1overloaded.html b/structentt_1_1overloaded.html
index 7334a402b..0e2cfa1d1 100644
--- a/structentt_1_1overloaded.html
+++ b/structentt_1_1overloaded.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1overloaded__coll__graph.map b/structentt_1_1overloaded__coll__graph.map
index 0e3e0a3b7..b68fe2c40 100644
--- a/structentt_1_1overloaded__coll__graph.map
+++ b/structentt_1_1overloaded__coll__graph.map
@@ -1,2 +1,4 @@
diff --git a/structentt_1_1overloaded__coll__graph.md5 b/structentt_1_1overloaded__coll__graph.md5
index 87c62d7dd..efedfea57 100644
--- a/structentt_1_1overloaded__coll__graph.md5
+++ b/structentt_1_1overloaded__coll__graph.md5
@@ -1 +1 @@
-d553af46b875c78c3f87249a108cdf95
\ No newline at end of file
+0b595e8a5f6f32f1853f971769cba668
\ No newline at end of file
diff --git a/structentt_1_1overloaded__inherit__graph.map b/structentt_1_1overloaded__inherit__graph.map
index 0e3e0a3b7..b68fe2c40 100644
--- a/structentt_1_1overloaded__inherit__graph.map
+++ b/structentt_1_1overloaded__inherit__graph.map
@@ -1,2 +1,4 @@
diff --git a/structentt_1_1overloaded__inherit__graph.md5 b/structentt_1_1overloaded__inherit__graph.md5
index 741e250ae..efedfea57 100644
--- a/structentt_1_1overloaded__inherit__graph.md5
+++ b/structentt_1_1overloaded__inherit__graph.md5
@@ -1 +1 @@
-070be0ed8d751e2cbf40b09e1f714d68
\ No newline at end of file
+0b595e8a5f6f32f1853f971769cba668
\ No newline at end of file
diff --git a/structentt_1_1process__adaptor-members.html b/structentt_1_1process__adaptor-members.html
index 9e95e647d..14032cc0b 100644
--- a/structentt_1_1process__adaptor-members.html
+++ b/structentt_1_1process__adaptor-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1process__adaptor.html b/structentt_1_1process__adaptor.html
index 2f55c032a..8217be9b5 100644
--- a/structentt_1_1process__adaptor.html
+++ b/structentt_1_1process__adaptor.html
@@ -1,9 +1,9 @@
-
+
-
+
| template<typename... Args> | |
| process_adaptor (Args &&... args) | |
| Constructs a process adaptor from a lambda or a functor. More... | |
| Constructs a process adaptor from a lambda or a functor. More... | |
| void | update (const Delta delta, void *data) |
| Updates a process and its internal state if required. More... | |
| Updates a process and its internal state if required. More... | |
| Public Member Functions inherited from entt::process< process_adaptor< Func, Delta >, Delta > | |
| void | tick (const Delta delta, void *data=nullptr) | Where: +Where:
The signature of the function call operator of both void(); Usually users shouldn't worry about creating adaptors. A scheduler will create them internally each and avery time a lambda or a functor is used as a process. -
void();
+Usually users shouldn't worry about creating adaptors. A scheduler will create them internally each and avery time a lambda or a functor is used as a process. + +scheduler
|
|
EnTT
- 3.2.1
+ 3.2.2
|
|
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1scoped__connection-members.html b/structentt_1_1scoped__connection-members.html
index 6798dfae7..7ed8e89c0 100644
--- a/structentt_1_1scoped__connection-members.html
+++ b/structentt_1_1scoped__connection-members.html
@@ -1,9 +1,9 @@
-
+
-
+
| connection()=default | entt::connection | private |
| connection(const connection &)=default | entt::connection | private |
| connection(connection &&other) | entt::connection | inlineprivate |
| operator bool() const ENTT_NOEXCEPT | entt::connection | inlineexplicitprivate |
| operator=(const scoped_connection &)=delete | entt::scoped_connection | |
| operator=(scoped_connection &&)=default | entt::scoped_connection | |
| operator=(const connection &other) | entt::scoped_connection | inline |
| operator=(connection &&other) | entt::scoped_connection | inline |
| release() | entt::connection | inlineprivate |
| scoped_connection()=default | entt::scoped_connection | |
| scoped_connection(const connection &conn) | entt::scoped_connection | inline |
| scoped_connection(const scoped_connection &)=delete | entt::scoped_connection | |
| scoped_connection(scoped_connection &&)=default | entt::scoped_connection | |
| ~scoped_connection() | entt::scoped_connection | inline |
| release() | entt::scoped_connection | inline |
| entt::connection::release() | entt::connection | inlineprivate |
| scoped_connection()=default | entt::scoped_connection | |
| scoped_connection(const connection &conn) | entt::scoped_connection | inline |
| scoped_connection(const scoped_connection &)=delete | entt::scoped_connection | |
| scoped_connection(scoped_connection &&)=default | entt::scoped_connection | |
| ~scoped_connection() | entt::scoped_connection | inline |
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1scoped__connection.html b/structentt_1_1scoped__connection.html
index 4482071e9..2595e984d 100644
--- a/structentt_1_1scoped__connection.html
+++ b/structentt_1_1scoped__connection.html
@@ -1,9 +1,9 @@
-
+
-
+
| Default constructor. | |
| scoped_connection (const connection &conn) | |
| Constructs a scoped connection from a basic connection. More... | |
| Constructs a scoped connection from a basic connection. More... | |
| scoped_connection (const scoped_connection &)=delete | |
| Automatically breaks the link on destruction. | |
| scoped_connection & | operator= (const scoped_connection &)=delete |
| Default copy assignment operator, deleted on purpose. More... | |
| Default copy assignment operator, deleted on purpose. More... | |
| scoped_connection & | operator= (scoped_connection &&)=default |
| Default move assignment operator. More... | |
| Default move assignment operator. More... | |
| scoped_connection & | operator= (const connection &other) |
| Copies a connection. More... | |
| Copies a connection. More... | |
| scoped_connection & | operator= (connection &&other) |
| Moves a connection. More... | |
| Moves a connection. More... | |
| +void | release () |
| Breaks the connection. | |
Scoped connection class.
-Opaque object the aim of which is to allow users to release an already estabilished connection without having to keep a reference to the signal or the sink that generated it.
+
Opaque object the aim of which is to allow users to release an already estabilished connection without having to keep a reference to the signal or the sink that generated it.
A scoped connection automatically breaks the link between the two objects when it goes out of scope.
-
|
- -delete | -
Default copy assignment operator, deleted on purpose.
-
-
|
- -default | -
Default move assignment operator.
-
-
|
- -inline | -
+
|
+ +inline | +
+
|
+ +delete | +
Default copy assignment operator, deleted on purpose.
+
+
|
+ +default | +
Default move assignment operator.
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1scoped__connection__coll__graph.map b/structentt_1_1scoped__connection__coll__graph.map
index 2dcedb3a6..18234dd16 100644
--- a/structentt_1_1scoped__connection__coll__graph.map
+++ b/structentt_1_1scoped__connection__coll__graph.map
@@ -1,3 +1,4 @@
diff --git a/structentt_1_1scoped__connection__coll__graph.md5 b/structentt_1_1scoped__connection__coll__graph.md5
index 71b3b9a05..0db7b9b01 100644
--- a/structentt_1_1scoped__connection__coll__graph.md5
+++ b/structentt_1_1scoped__connection__coll__graph.md5
@@ -1 +1 @@
-87044d697d9c369af2c5b1663c7c04ff
\ No newline at end of file
+ff05107f97f11dc0d1bf7e2f837fd6e7
\ No newline at end of file
diff --git a/structentt_1_1scoped__connection__inherit__graph.map b/structentt_1_1scoped__connection__inherit__graph.map
index 2dcedb3a6..18234dd16 100644
--- a/structentt_1_1scoped__connection__inherit__graph.map
+++ b/structentt_1_1scoped__connection__inherit__graph.map
@@ -1,3 +1,4 @@
diff --git a/structentt_1_1scoped__connection__inherit__graph.md5 b/structentt_1_1scoped__connection__inherit__graph.md5
index f72e5628c..0db7b9b01 100644
--- a/structentt_1_1scoped__connection__inherit__graph.md5
+++ b/structentt_1_1scoped__connection__inherit__graph.md5
@@ -1 +1 @@
-4b76c150a17e2fa7b78c84f32ab2f205
\ No newline at end of file
+ff05107f97f11dc0d1bf7e2f837fd6e7
\ No newline at end of file
diff --git a/structentt_1_1service__locator-members.html b/structentt_1_1service__locator-members.html
index 01b88c729..dc7294f94 100644
--- a/structentt_1_1service__locator-members.html
+++ b/structentt_1_1service__locator-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1service__locator.html b/structentt_1_1service__locator.html
index 219244aed..9f887289f 100644
--- a/structentt_1_1service__locator.html
+++ b/structentt_1_1service__locator.html
@@ -1,9 +1,9 @@
-
+
-
+
Service locator, nothing more.
-A service locator can be used to do what it promises: locate services.
+
A service locator can be used to do what it promises: locate services.
Usually service locators are tightly bound to the services they expose and thus it's hard to define a general purpose class to do that. This template based implementation tries to fill the gap and to get rid of the burden of defining a different specific locator for each application.
|
@@ -172,7 +175,7 @@ template<typename Service>
-template<typename Service>
+template<typename Service >
@@ -88,8 +92,9 @@ Collaboration diagram for entt::storage< Entity, Type >:
Generated by
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1storage__coll__graph.map b/structentt_1_1storage__coll__graph.map
index 61d770ab3..434bab4b3 100644
--- a/structentt_1_1storage__coll__graph.map
+++ b/structentt_1_1storage__coll__graph.map
@@ -1,4 +1,5 @@
diff --git a/structentt_1_1storage__coll__graph.md5 b/structentt_1_1storage__coll__graph.md5
index df4f1c11f..d5145e790 100644
--- a/structentt_1_1storage__coll__graph.md5
+++ b/structentt_1_1storage__coll__graph.md5
@@ -1 +1 @@
-e5ba0f67ea6b5a7197c757a644fb560b
\ No newline at end of file
+beeb01ab8dbe1628b5235038790b0e42
\ No newline at end of file
diff --git a/structentt_1_1storage__inherit__graph.map b/structentt_1_1storage__inherit__graph.map
index 61d770ab3..434bab4b3 100644
--- a/structentt_1_1storage__inherit__graph.map
+++ b/structentt_1_1storage__inherit__graph.map
@@ -1,4 +1,5 @@
diff --git a/structentt_1_1storage__inherit__graph.md5 b/structentt_1_1storage__inherit__graph.md5
index 75bd81043..d5145e790 100644
--- a/structentt_1_1storage__inherit__graph.md5
+++ b/structentt_1_1storage__inherit__graph.md5
@@ -1 +1 @@
-87d4821aa2cab92dde5366cd6135b021
\ No newline at end of file
+beeb01ab8dbe1628b5235038790b0e42
\ No newline at end of file
diff --git a/structentt_1_1type__id.html b/structentt_1_1type__id.html
new file mode 100644
index 000000000..3d4142c71
--- /dev/null
+++ b/structentt_1_1type__id.html
@@ -0,0 +1,102 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+entt::type_id< Type, typename > Struct Template Reference
+
+
+
+Types identifiers. + More... + +
Detailed Description+template<typename Type, typename = std::void_t<>>
+
+ | |||||||||||||||||||||||||||||
| Type | Type for which to generate an identifier. |
Definition at line 18 of file type_info.hpp.
+
+ 1.8.16
+
+
+
diff --git a/structentt_1_1type__list.html b/structentt_1_1type__list.html
index 740c9d248..49dfc5d68 100644
--- a/structentt_1_1type__list.html
+++ b/structentt_1_1type__list.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1type__list__cat.html b/structentt_1_1type__list__cat.html
index df580e509..ef687bb1c 100644
--- a/structentt_1_1type__list__cat.html
+++ b/structentt_1_1type__list__cat.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html b/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html
index 1b769d2ee..603c9a544 100644
--- a/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html
+++ b/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8b5f6e6ed6191612d6e0fe24c4ff408dc.html b/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8b5f6e6ed6191612d6e0fe24c4ff408dc.html
index 870ddcd9b..32d13b933 100644
--- a/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8b5f6e6ed6191612d6e0fe24c4ff408dc.html
+++ b/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8b5f6e6ed6191612d6e0fe24c4ff408dc.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4-members.html b/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4-members.html
index 97b691e00..f7188e9ff 100644
--- a/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4-members.html
+++ b/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4.html b/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4.html
index 62b6660a1..57a506f8d 100644
--- a/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4.html
+++ b/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1type__list__cat_3_4-members.html b/structentt_1_1type__list__cat_3_4-members.html
index 8a814a4f4..c2f280cc2 100644
--- a/structentt_1_1type__list__cat_3_4-members.html
+++ b/structentt_1_1type__list__cat_3_4-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1type__list__cat_3_4.html b/structentt_1_1type__list__cat_3_4.html
index f3a8275bb..f6ca415d6 100644
--- a/structentt_1_1type__list__cat_3_4.html
+++ b/structentt_1_1type__list__cat_3_4.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1type__list__size.html b/structentt_1_1type__list__size.html
index f195a1509..c6628354c 100644
--- a/structentt_1_1type__list__size.html
+++ b/structentt_1_1type__list__size.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1type__list__size_3_01type__list_3_01Type_8_8_8_01_4_01_4.html b/structentt_1_1type__list__size_3_01type__list_3_01Type_8_8_8_01_4_01_4.html
index f4451cbfa..91efaca64 100644
--- a/structentt_1_1type__list__size_3_01type__list_3_01Type_8_8_8_01_4_01_4.html
+++ b/structentt_1_1type__list__size_3_01type__list_3_01Type_8_8_8_01_4_01_4.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1type__list__size_3_01type__list_3_01Type_8_8_8_01_4_01_4__coll__graph.map b/structentt_1_1type__list__size_3_01type__list_3_01Type_8_8_8_01_4_01_4__coll__graph.map
index c071f37e9..3dc95e6c9 100644
--- a/structentt_1_1type__list__size_3_01type__list_3_01Type_8_8_8_01_4_01_4__coll__graph.map
+++ b/structentt_1_1type__list__size_3_01type__list_3_01Type_8_8_8_01_4_01_4__coll__graph.map
@@ -1,2 +1,4 @@
diff --git a/structentt_1_1type__list__size_3_01type__list_3_01Type_8_8_8_01_4_01_4__coll__graph.md5 b/structentt_1_1type__list__size_3_01type__list_3_01Type_8_8_8_01_4_01_4__coll__graph.md5
index 813614cf2..9e8333220 100644
--- a/structentt_1_1type__list__size_3_01type__list_3_01Type_8_8_8_01_4_01_4__coll__graph.md5
+++ b/structentt_1_1type__list__size_3_01type__list_3_01Type_8_8_8_01_4_01_4__coll__graph.md5
@@ -1 +1 @@
-437959b25e4ffcc70c787c2e0391121e
\ No newline at end of file
+df55ca0e21d7864b6e2d46c4d4f7caa4
\ No newline at end of file
diff --git a/structentt_1_1type__list__size_3_01type__list_3_01Type_8_8_8_01_4_01_4__inherit__graph.map b/structentt_1_1type__list__size_3_01type__list_3_01Type_8_8_8_01_4_01_4__inherit__graph.map
index c071f37e9..3dc95e6c9 100644
--- a/structentt_1_1type__list__size_3_01type__list_3_01Type_8_8_8_01_4_01_4__inherit__graph.map
+++ b/structentt_1_1type__list__size_3_01type__list_3_01Type_8_8_8_01_4_01_4__inherit__graph.map
@@ -1,2 +1,4 @@
diff --git a/structentt_1_1type__list__size_3_01type__list_3_01Type_8_8_8_01_4_01_4__inherit__graph.md5 b/structentt_1_1type__list__size_3_01type__list_3_01Type_8_8_8_01_4_01_4__inherit__graph.md5
index cd9163779..9e8333220 100644
--- a/structentt_1_1type__list__size_3_01type__list_3_01Type_8_8_8_01_4_01_4__inherit__graph.md5
+++ b/structentt_1_1type__list__size_3_01type__list_3_01Type_8_8_8_01_4_01_4__inherit__graph.md5
@@ -1 +1 @@
-2ca4e771d13906d731af93610c5da634
\ No newline at end of file
+df55ca0e21d7864b6e2d46c4d4f7caa4
\ No newline at end of file
diff --git a/structentt_1_1type__list__unique.html b/structentt_1_1type__list__unique.html
index df32be930..5c3bb6306 100644
--- a/structentt_1_1type__list__unique.html
+++ b/structentt_1_1type__list__unique.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4-members.html b/structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4-members.html
index 96e30b4c3..84e60dafd 100644
--- a/structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4-members.html
+++ b/structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html b/structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html
index cf29f1bfc..852460d66 100644
--- a/structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html
+++ b/structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1type__list__unique_3_01type__list_3_4_01_4-members.html b/structentt_1_1type__list__unique_3_01type__list_3_4_01_4-members.html
index 9774a973d..f5d84ab7e 100644
--- a/structentt_1_1type__list__unique_3_01type__list_3_4_01_4-members.html
+++ b/structentt_1_1type__list__unique_3_01type__list_3_4_01_4-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1type__list__unique_3_01type__list_3_4_01_4.html b/structentt_1_1type__list__unique_3_01type__list_3_4_01_4.html
index 7a6472389..716052e20 100644
--- a/structentt_1_1type__list__unique_3_01type__list_3_4_01_4.html
+++ b/structentt_1_1type__list__unique_3_01type__list_3_4_01_4.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1y__combinator-members.html b/structentt_1_1y__combinator-members.html
index 4a873f811..ca8fc74d7 100644
--- a/structentt_1_1y__combinator-members.html
+++ b/structentt_1_1y__combinator-members.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/structentt_1_1y__combinator.html b/structentt_1_1y__combinator.html
index 52b336f9e..aa4b48404 100644
--- a/structentt_1_1y__combinator.html
+++ b/structentt_1_1y__combinator.html
@@ -1,9 +1,9 @@
-
+
-
+
-
|
- -inline | -
Invokes a y-combinator and therefore its underlying function.
-| Args | Types of arguments to use to invoke the underlying function. |
| args | Parameters to use to invoke the underlying function. |
Definition at line 86 of file utility.hpp.
- -Definition at line 92 of file utility.hpp.
+
+
|
+ +inline | +
Invokes a y-combinator and therefore its underlying function.
+| Args | Types of arguments to use to invoke the underlying function. |
| args | Parameters to use to invoke the underlying function. |
Definition at line 86 of file utility.hpp.
+
- 1.8.13
+ 1.8.16
diff --git a/type__info_8hpp_source.html b/type__info_8hpp_source.html
new file mode 100644
index 000000000..1801e0115
--- /dev/null
+++ b/type__info_8hpp_source.html
@@ -0,0 +1,120 @@
+
+
+
+
+
+
+
+|
+ EnTT
+ 3.3.0
+
+ |
+
+ 1.8.16
+
+
+
diff --git a/type__traits_8hpp_source.html b/type__traits_8hpp_source.html
index d42332d88..7b7ed9656 100644
--- a/type__traits_8hpp_source.html
+++ b/type__traits_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/version_8h_source.html b/version_8h_source.html
index 09aabf63e..d471fe805 100644
--- a/version_8h_source.html
+++ b/version_8h_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
diff --git a/view_8hpp_source.html b/view_8hpp_source.html
index 74ecef564..0df724be3 100644
--- a/view_8hpp_source.html
+++ b/view_8hpp_source.html
@@ -1,9 +1,9 @@
-
+
-
+
- 1.8.13
+ 1.8.16
