Basic storage implementation. More...

#include <storage.hpp>

Inheritance diagram for entt::basic_storage_impl< Entity, Type, Allocator, typename >:

[legend]

Collaboration diagram for entt::basic_storage_impl< Entity, Type, Allocator, typename >:

Public Types
using	allocator_type = typename alloc_traits::allocator_type
	Allocator type.

using	value_type = Type
	Type of the objects assigned to entities.

using	entity_type = Entity
	Underlying entity identifier.

using	size_type = std::size_t
	Unsigned integer type.

using	pointer = bucket_alloc_pointer
	Pointer type to contained elements.

using	const_pointer = bucket_alloc_const_pointer
	Constant pointer type to contained elements.

using	iterator = storage_iterator< value_type >
	Random access iterator type.

using	const_iterator = storage_iterator< const value_type >
	Constant random access iterator type.

using	reverse_iterator = std::reverse_iterator< iterator >
	Reverse iterator type.

using	const_reverse_iterator = std::reverse_iterator< const_iterator >
	Constant reverse iterator type.

Public Types inherited from entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >
using	allocator_type = typename alloc_traits::allocator_type
	Allocator type.

using	entity_type = Entity
	Underlying entity identifier.

using	size_type = std::size_t
	Unsigned integer type.

using	pointer = alloc_const_pointer
	Pointer type to contained entities.

using	iterator = sparse_set_iterator
	Random access iterator type.

using	reverse_iterator = std::reverse_iterator< iterator >
	Reverse iterator type.

Public Member Functions
	basic_storage_impl (const allocator_type &alloc={})
	Default constructor. More...

	basic_storage_impl (basic_storage_impl &&other)
	Move constructor. More...

	~basic_storage_impl () override
	Default destructor.

basic_storage_impl &	operator= (basic_storage_impl &&other)
	Move assignment operator. More...

void	reserve (const size_type cap)
	Increases the capacity of a storage. More...

size_type	capacity () const
	Returns the number of elements that a storage has currently allocated space for. More...

void	shrink_to_fit ()
	Requests the removal of unused capacity.

const_pointer	raw () const
	Direct access to the array of objects. More...

pointer	raw ()
	Direct access to the array of objects. More...

const_iterator	cbegin () const
	Returns an iterator to the beginning. More...

const_iterator	begin () const
	Returns an iterator to the beginning. More...

iterator	begin ()
	Returns an iterator to the beginning. More...

const_iterator	cend () const
	Returns an iterator to the end. More...

const_iterator	end () const
	Returns an iterator to the end. More...

iterator	end ()
	Returns an iterator to the end. More...

const_reverse_iterator	crbegin () const
	Returns a reverse iterator to the beginning. More...

const_reverse_iterator	rbegin () const
	Returns a reverse iterator to the beginning. More...

reverse_iterator	rbegin ()
	Returns a reverse iterator to the beginning. More...

const_reverse_iterator	crend () const
	Returns a reverse iterator to the end. More...

const_reverse_iterator	rend () const
	Returns a reverse iterator to the end. More...

reverse_iterator	rend ()
	Returns a reverse iterator to the end. More...

const value_type &	get (const entity_type entt) const
	Returns the object assigned to an entity. More...

value_type &	get (const entity_type entt)
	Returns the object assigned to an entity. More...

template<typename... Args>
value_type &	emplace (const entity_type entt, Args &&... args)
	Assigns an entity to a storage and constructs its object. More...

template<typename... Func>
decltype(auto)	patch (const entity_type entt, Func &&... func)
	Updates the instance assigned to a given entity in-place. More...

template<typename It >
void	insert (It first, It last, const value_type &value={})
	Assigns one or more entities to a storage and constructs their objects from a given instance. More...

template<typename EIt , typename CIt , typename = std::enable_if_t<std::is_same_v<std::decay_t<typename std::iterator_traits<CIt>::value_type>, value_type>>>
void	insert (EIt first, EIt last, CIt from)
	Assigns one or more entities to a storage and constructs their objects from a given range. More...

template<typename Compare , typename Sort = std_sort, typename... Args>
void	sort_n (const size_type length, Compare compare, Sort algo=Sort{}, Args &&... args)
	Sort elements according to the given comparison function. More...

template<typename Compare , typename Sort = std_sort, typename... Args>
void	sort (Compare compare, Sort algo=Sort{}, Args &&... args)
	Sort all elements according to the given comparison function. More...

Public Member Functions inherited from entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >
	basic_sparse_set (deletion_policy pol, const allocator_type &alloc={})
	Constructs an empty container with the given policy and allocator. More...

	basic_sparse_set (const allocator_type &alloc={})
	Constructs an empty container with the given allocator. More...

	basic_sparse_set (basic_sparse_set &&other)
	Move constructor. More...

virtual	~basic_sparse_set ()
	Default destructor.

basic_sparse_set &	operator= (basic_sparse_set &&other)
	Move assignment operator. More...

deletion_policy	policy () const
	Returns the deletion policy of a sparse set. More...

size_type	slot () const
	Returns the next slot available for insertion. More...

void	reserve (const size_type cap)
	Increases the capacity of a sparse set. More...

size_type	capacity () const
	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
	Returns the extent of a sparse set. More...

size_type	size () const
	Returns the number of elements in a sparse set. More...

bool	empty () const
	Checks whether a sparse set is empty. More...

pointer	data () const
	Direct access to the internal packed array. More...

iterator	begin () const
	Returns an iterator to the beginning. More...

iterator	end () const
	Returns an iterator to the end. More...

reverse_iterator	rbegin () const
	Returns a reverse iterator to the beginning. More...

reverse_iterator	rend () const
	Returns a reverse iterator to the end. More...

iterator	find (const entity_type entt) const
	Finds an entity. More...

bool	contains (const entity_type entt) const
	Checks if a sparse set contains an entity. More...

size_type	index (const entity_type entt) const
	Returns the position of an entity in a sparse set. More...

entity_type	at (const size_type pos) const
	Returns the entity at specified location, with bounds checking. More...

entity_type	operator[] (const size_type pos) const
	Returns the entity at specified location, without bounds checking. More...

size_type	emplace_back (const entity_type entt)
	Appends an entity to a sparse set. More...

size_type	emplace (const entity_type entt)
	Assigns an entity to a sparse set. More...

void	insert (It first, It last)
	Assigns one or more entities to a sparse set. More...

void	erase (const entity_type entt, void *ud=nullptr)
	Erases an entity from a sparse set. More...

void	erase (It first, It last, void *ud=nullptr)
	Erases entities from a set. More...

bool	remove (const entity_type entt, void *ud=nullptr)
	Removes an entity from a sparse set if it exists. More...

size_type	remove (It first, It last, void *ud=nullptr)
	Removes entities from a sparse set if they exist. More...

void	compact ()
	Removes all tombstones from the packed array of a sparse set.

void	swap (const entity_type lhs, const entity_type rhs)
	Swaps two entities in the internal packed array. More...

void	sort_n (const size_type length, Compare compare, Sort algo=Sort{}, Args &&... args)
	Sort the first count elements according to the given comparison function. More...

void	sort (Compare compare, Sort algo=Sort{}, Args &&... args)
	Sort all elements according to the given comparison function. More...

void	respect (const basic_sparse_set &other)
	Sort entities according to their order in another sparse set. More...

void	clear (void *ud=nullptr)
	Clears a sparse set. More...

Protected Member Functions
void	swap_at (const std::size_t lhs, const std::size_t rhs) final
	Swaps two entities in the internal packed array. More...

void	move_and_pop (const std::size_t from, const std::size_t to) final
	Moves an entity in the internal packed array. More...

void	swap_and_pop (const Entity entt, void *ud) override
	Attempts to erase an entity from the internal packed array. More...

void	in_place_pop (const Entity entt, void *ud) override
	Attempts to erase an entity from the internal packed array. More...

Protected Member Functions inherited from entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >
virtual void	swap_at ([[maybe_unused]] const std::size_t lhs,[[maybe_unused]] const std::size_t rhs)
	Swaps two entities in the internal packed array. More...

virtual void	move_and_pop ([[maybe_unused]] const std::size_t from,[[maybe_unused]] const std::size_t to)
	Moves an entity in the internal packed array. More...

virtual void	swap_and_pop (const Entity entt,[[maybe_unused]] void *ud)
	Attempts to erase an entity from the internal packed array. More...

virtual void	in_place_pop (const Entity entt,[[maybe_unused]] void *ud)
	Attempts to erase an entity from the internal packed array. More...

Detailed Description

template<typename Entity, typename Type, typename Allocator, typename = void>
class entt::basic_storage_impl< Entity, Type, Allocator, typename >

Basic storage implementation.

This class is a refinement of a sparse set that associates an object to an entity. The main purpose of this class is to extend sparse sets to store components in a registry. It guarantees fast access both to the elements and to the entities.

Note: Entities and objects have the same order.; Internal data structures arrange elements to maximize performance. There are no guarantees that objects are returned in the insertion order when iterate a storage. Do not make assumption on the order in any case.

Warning: Empty types aren't explicitly instantiated. Therefore, many of the functions normally available for non-empty types will not be available for empty ones.

See also: sparse_set<Entity>

Template Parameters

Entity	A valid entity type (see entt_traits for more details).
Type	Type of objects assigned to the entities.
Allocator	Type of allocator used to manage memory and elements.

Definition at line 52 of file storage.hpp.

Constructor & Destructor Documentation

◆ basic_storage_impl() [1/2]

template<typename Entity , typename Type , typename Allocator , typename = void>

entt::basic_storage_impl< Entity, Type, Allocator, typename >::basic_storage_impl ( const allocator_type & alloc = {} )

inlineexplicit

Default constructor.

Parameters

alloc Allocator to use (possibly default-constructed).

Definition at line 318 of file storage.hpp.

◆ basic_storage_impl() [2/2]

template<typename Entity , typename Type , typename Allocator , typename = void>

entt::basic_storage_impl< Entity, Type, Allocator, typename >::basic_storage_impl ( basic_storage_impl< Entity, Type, Allocator, typename > && other )

inline

Move constructor.

Parameters

other The instance to move from.

Definition at line 330 of file storage.hpp.

Member Function Documentation

◆ begin() [1/2]

template<typename Entity , typename Type , typename Allocator , typename = void>

iterator entt::basic_storage_impl< Entity, Type, Allocator, typename >::begin ( )

inline

Returns an iterator to the beginning.

The returned iterator points to the first instance of the internal array. If the storage is empty, the returned iterator will be equal to end().

Returns: An iterator to the first instance of the internal array.

Definition at line 424 of file storage.hpp.

◆ begin() [2/2]

template<typename Entity , typename Type , typename Allocator , typename = void>

const_iterator entt::basic_storage_impl< Entity, Type, Allocator, typename >::begin ( ) const

inline

Returns an iterator to the beginning.

The returned iterator points to the first instance of the internal array. If the storage is empty, the returned iterator will be equal to end().

Returns: An iterator to the first instance of the internal array.

Definition at line 419 of file storage.hpp.

◆ capacity()

template<typename Entity , typename Type , typename Allocator , typename = void>

size_type entt::basic_storage_impl< Entity, Type, Allocator, typename >::capacity ( ) const

inline

Returns the number of elements that a storage has currently allocated space for.

Returns: Capacity of the storage.

Definition at line 382 of file storage.hpp.

◆ cbegin()

template<typename Entity , typename Type , typename Allocator , typename = void>

const_iterator entt::basic_storage_impl< Entity, Type, Allocator, typename >::cbegin ( ) const

inline

Returns an iterator to the beginning.

The returned iterator points to the first instance of the internal array. If the storage is empty, the returned iterator will be equal to end().

Returns: An iterator to the first instance of the internal array.

Definition at line 413 of file storage.hpp.

◆ cend()

template<typename Entity , typename Type , typename Allocator , typename = void>

const_iterator entt::basic_storage_impl< Entity, Type, Allocator, typename >::cend ( ) const

inline

Returns an iterator to the end.

The returned iterator points to the element following the last instance of the internal array. Attempting to dereference the returned iterator results in undefined behavior.

Returns: An iterator to the element following the last instance of the internal array.

Definition at line 439 of file storage.hpp.

◆ crbegin()

template<typename Entity , typename Type , typename Allocator , typename = void>

const_reverse_iterator entt::basic_storage_impl< Entity, Type, Allocator, typename >::crbegin ( ) const

inline

Returns a reverse iterator to the beginning.

The returned iterator points to the first instance of the reversed internal array. If the storage is empty, the returned iterator will be equal to rend().

Returns: An iterator to the first instance of the reversed internal array.

Definition at line 462 of file storage.hpp.

◆ crend()

template<typename Entity , typename Type , typename Allocator , typename = void>

const_reverse_iterator entt::basic_storage_impl< Entity, Type, Allocator, typename >::crend ( ) const

inline

Returns a reverse iterator to the end.

The returned iterator points to the element following the last instance of the reversed internal array. Attempting to dereference the returned iterator results in undefined behavior.

Returns: An iterator to the element following the last instance of the reversed internal array.

Definition at line 486 of file storage.hpp.

◆ emplace()

template<typename Entity , typename Type , typename Allocator , typename = void>

template<typename... Args>

value_type& entt::basic_storage_impl< Entity, Type, Allocator, typename >::emplace	(	const entity_type	entt,
		Args &&...	args
	)

inline

Assigns an entity to a storage and constructs its object.

This version accept both types that can be constructed in place directly and types like aggregates that do not work well with a placement new as performed usually under the hood during an emplace back.

Warning: Attempting to use an entity that already belongs to the storage results in undefined behavior.

Template Parameters

Args	Types of arguments to use to construct the object.

Parameters

entt	A valid entity identifier.
args	Parameters to use to construct an object for the entity.

Returns: A reference to the newly created object.

Definition at line 537 of file storage.hpp.

◆ end() [1/2]

template<typename Entity , typename Type , typename Allocator , typename = void>

iterator entt::basic_storage_impl< Entity, Type, Allocator, typename >::end ( )

inline

Returns an iterator to the end.

The returned iterator points to the element following the last instance of the internal array. Attempting to dereference the returned iterator results in undefined behavior.

Returns: An iterator to the element following the last instance of the internal array.

Definition at line 449 of file storage.hpp.

◆ end() [2/2]

template<typename Entity , typename Type , typename Allocator , typename = void>

const_iterator entt::basic_storage_impl< Entity, Type, Allocator, typename >::end ( ) const

inline

Returns an iterator to the end.

The returned iterator points to the element following the last instance of the internal array. Attempting to dereference the returned iterator results in undefined behavior.

Returns: An iterator to the element following the last instance of the internal array.

Definition at line 444 of file storage.hpp.

◆ get() [1/2]

template<typename Entity , typename Type , typename Allocator , typename = void>

value_type& entt::basic_storage_impl< Entity, Type, Allocator, typename >::get ( const entity_type entt )

inline

Returns the object assigned to an entity.

Warning: Attempting to use an entity that doesn't belong to the storage results in undefined behavior.

Parameters

entt	A valid entity identifier.

Returns: The object assigned to the entity.

Definition at line 516 of file storage.hpp.

◆ get() [2/2]

template<typename Entity , typename Type , typename Allocator , typename = void>

const value_type& entt::basic_storage_impl< Entity, Type, Allocator, typename >::get ( const entity_type entt ) const

inline

Returns the object assigned to an entity.

Warning: Attempting to use an entity that doesn't belong to the storage results in undefined behavior.

Parameters

entt	A valid entity identifier.

Returns: The object assigned to the entity.

Definition at line 510 of file storage.hpp.

◆ in_place_pop()

template<typename Entity , typename Type , typename Allocator , typename = void>

void entt::basic_storage_impl< Entity, Type, Allocator, typename >::in_place_pop	(	const Entity	entt,
		void *	ud
	)

inlineoverrideprotected

Attempts to erase an entity from the internal packed array.

Parameters

entt	A valid entity identifier.
ud	Optional user data that are forwarded as-is to derived classes.

Definition at line 285 of file storage.hpp.

◆ insert() [1/2]

template<typename Entity , typename Type , typename Allocator , typename = void>

template<typename EIt , typename CIt , typename = std::enable_if_t<std::is_same_v<std::decay_t<typename std::iterator_traits<CIt>::value_type>, value_type>>>

void entt::basic_storage_impl< Entity, Type, Allocator, typename >::insert	(	EIt	first,
		EIt	last,
		CIt	from
	)

inline

Assigns one or more entities to a storage and constructs their objects from a given range.

See also: construct

Template Parameters

EIt	Type of input iterator.
CIt	Type of input iterator.

Parameters

first	An iterator to the first element of the range of entities.
last	An iterator past the last element of the range of entities.
from	An iterator to the first element of the range of objects.

Definition at line 613 of file storage.hpp.

◆ insert() [2/2]

template<typename Entity , typename Type , typename Allocator , typename = void>

template<typename It >

void entt::basic_storage_impl< Entity, Type, Allocator, typename >::insert	(	It	first,
		It	last,
		const value_type &	value = `{}`
	)

inline

Assigns one or more entities to a storage and constructs their objects from a given instance.

Warning: Attempting to assign an entity that already belongs to the storage results in undefined behavior.

Template Parameters

It	Type of input iterator.

Parameters

first	An iterator to the first element of the range of entities.
last	An iterator past the last element of the range of entities.
value	An instance of the object to construct.

Definition at line 583 of file storage.hpp.

◆ move_and_pop()

template<typename Entity , typename Type , typename Allocator , typename = void>

void entt::basic_storage_impl< Entity, Type, Allocator, typename >::move_and_pop	(	const std::size_t	from,
		const std::size_t	to
	)

inlinefinalprotected

Moves an entity in the internal packed array.

Parameters

from	A valid position of an entity within storage.
to	A valid position of an entity within storage.

Definition at line 265 of file storage.hpp.

◆ operator=()

template<typename Entity , typename Type , typename Allocator , typename = void>

basic_storage_impl& entt::basic_storage_impl< Entity, Type, Allocator, typename >::operator= ( basic_storage_impl< Entity, Type, Allocator, typename > && other )

inline

Move assignment operator.

Parameters

other The instance to move from.

Returns: This sparse set.

Definition at line 348 of file storage.hpp.

◆ patch()

template<typename Entity , typename Type , typename Allocator , typename = void>

template<typename... Func>

decltype(auto) entt::basic_storage_impl< Entity, Type, Allocator, typename >::patch	(	const entity_type	entt,
		Func &&...	func
	)

inline

Updates the instance assigned to a given entity in-place.

Template Parameters

Func	Types of the function objects to invoke.

Parameters

entt	A valid entity identifier.
func	Valid function objects.

Returns: A reference to the updated instance.

Definition at line 562 of file storage.hpp.

◆ raw() [1/2]

template<typename Entity , typename Type , typename Allocator , typename = void>

pointer entt::basic_storage_impl< Entity, Type, Allocator, typename >::raw ( )

inline

Direct access to the array of objects.

Returns: A pointer to the array of objects.

Definition at line 401 of file storage.hpp.

◆ raw() [2/2]

template<typename Entity , typename Type , typename Allocator , typename = void>

const_pointer entt::basic_storage_impl< Entity, Type, Allocator, typename >::raw ( ) const

inline

Direct access to the array of objects.

Returns: A pointer to the array of objects.

Definition at line 396 of file storage.hpp.

◆ rbegin() [1/2]

template<typename Entity , typename Type , typename Allocator , typename = void>

reverse_iterator entt::basic_storage_impl< Entity, Type, Allocator, typename >::rbegin ( )

inline

Returns a reverse iterator to the beginning.

The returned iterator points to the first instance of the reversed internal array. If the storage is empty, the returned iterator will be equal to rend().

Returns: An iterator to the first instance of the reversed internal array.

Definition at line 472 of file storage.hpp.

◆ rbegin() [2/2]

template<typename Entity , typename Type , typename Allocator , typename = void>

const_reverse_iterator entt::basic_storage_impl< Entity, Type, Allocator, typename >::rbegin ( ) const

inline

Returns a reverse iterator to the beginning.

The returned iterator points to the first instance of the reversed internal array. If the storage is empty, the returned iterator will be equal to rend().

Returns: An iterator to the first instance of the reversed internal array.

Definition at line 467 of file storage.hpp.

◆ rend() [1/2]

template<typename Entity , typename Type , typename Allocator , typename = void>

reverse_iterator entt::basic_storage_impl< Entity, Type, Allocator, typename >::rend ( )

inline

Returns a reverse iterator to the end.

The returned iterator points to the element following the last instance of the reversed internal array. Attempting to dereference the returned iterator results in undefined behavior.

Returns: An iterator to the element following the last instance of the reversed internal array.

Definition at line 496 of file storage.hpp.

◆ rend() [2/2]

template<typename Entity , typename Type , typename Allocator , typename = void>

const_reverse_iterator entt::basic_storage_impl< Entity, Type, Allocator, typename >::rend ( ) const

inline

Returns a reverse iterator to the end.

The returned iterator points to the element following the last instance of the reversed internal array. Attempting to dereference the returned iterator results in undefined behavior.

Returns: An iterator to the element following the last instance of the reversed internal array.

Definition at line 491 of file storage.hpp.

◆ reserve()

template<typename Entity , typename Type , typename Allocator , typename = void>

void entt::basic_storage_impl< Entity, Type, Allocator, typename >::reserve ( const size_type cap )

inline

Increases the capacity of a storage.

If the new capacity is greater than the current capacity, new storage is allocated, otherwise the method does nothing.

Parameters

cap	Desired capacity.

Definition at line 369 of file storage.hpp.

◆ sort()

template<typename Entity , typename Type , typename Allocator , typename = void>

template<typename Compare , typename Sort = std_sort, typename... Args>

void entt::basic_storage_impl< Entity, Type, Allocator, typename >::sort	(	Compare	compare,
		Sort	algo = `Sort{}`,
		Args &&...	args
	)

inline

Sort all elements according to the given comparison function.

See also: sort_n

Template Parameters

Compare	Type of comparison function object.
Sort	Type of sort function object.
Args	Types of arguments to forward to the sort function object.

Parameters

compare	A valid comparison function object.
algo	A valid sort function object.
args	Arguments to forward to the sort function object, if any.

Definition at line 690 of file storage.hpp.

◆ sort_n()

template<typename Entity , typename Type , typename Allocator , typename = void>

template<typename Compare , typename Sort = std_sort, typename... Args>

void entt::basic_storage_impl< Entity, Type, Allocator, typename >::sort_n	(	const size_type	length,
		Compare	compare,
		Sort	algo = `Sort{}`,
		Args &&...	args
	)

inline

Sort elements according to the given comparison function.

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:

bool(const Entity, const Entity);

bool(const Type &, const Type &);

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:

An iterator to the first element of the range to sort.
An iterator past the last element of the range to sort.
A comparison function to use to compare the elements.

Warning: Empty types are never instantiated. Therefore, only comparison function objects that require to return entities rather than components are accepted.

Template Parameters

Compare	Type of comparison function object.
Sort	Type of sort function object.
Args	Types of arguments to forward to the sort function object.

Parameters

length	Number of elements to sort.
compare	A valid comparison function object.
algo	A valid sort function object.
args	Arguments to forward to the sort function object, if any.

Definition at line 666 of file storage.hpp.

◆ swap_and_pop()

template<typename Entity , typename Type , typename Allocator , typename = void>

void entt::basic_storage_impl< Entity, Type, Allocator, typename >::swap_and_pop	(	const Entity	entt,
		void *	ud
	)

inlineoverrideprotected

Attempts to erase an entity from the internal packed array.

Parameters

entt	A valid entity identifier.
ud	Optional user data that are forwarded as-is to derived classes.

Definition at line 271 of file storage.hpp.

◆ swap_at()

template<typename Entity , typename Type , typename Allocator , typename = void>

void entt::basic_storage_impl< Entity, Type, Allocator, typename >::swap_at	(	const std::size_t	lhs,
		const std::size_t	rhs
	)

inlinefinalprotected

Swaps two entities in the internal packed array.

Parameters

lhs	A valid position of an entity within storage.
rhs	A valid position of an entity within storage.

Definition at line 260 of file storage.hpp.

The documentation for this class was generated from the following file:

src/entt/entity/storage.hpp

Public Types

Public Member Functions

Protected Member Functions

Detailed Description

template<typename Entity, typename Type, typename Allocator, typename = void> class entt::basic_storage_impl< Entity, Type, Allocator, typename >

Constructor & Destructor Documentation

◆ basic_storage_impl() [1/2]

◆ basic_storage_impl() [2/2]

Member Function Documentation

◆ begin() [1/2]

◆ begin() [2/2]

◆ capacity()

◆ cbegin()

◆ cend()

◆ crbegin()

◆ crend()

◆ emplace()

◆ end() [1/2]

◆ end() [2/2]

◆ get() [1/2]

◆ get() [2/2]

◆ in_place_pop()

◆ insert() [1/2]

◆ insert() [2/2]

◆ move_and_pop()

◆ operator=()

◆ patch()

◆ raw() [1/2]

◆ raw() [2/2]

◆ rbegin() [1/2]

◆ rbegin() [2/2]

◆ rend() [1/2]

◆ rend() [2/2]

◆ reserve()

◆ sort()

◆ sort_n()

◆ swap_and_pop()

◆ swap_at()

template<typename Entity, typename Type, typename Allocator, typename = void>
class entt::basic_storage_impl< Entity, Type, Allocator, typename >