281 Map& operator=(
Map&&) noexcept = default;
285 [[nodiscard]]
Box operator[](
Box&& key) const;
294 [[nodiscard]]
Box empty() const;
298 [[nodiscard]]
size_t size() const;
#define CE_EXPLICIT(EXPR)
Definition Macros.hpp:413
Definition Box.collection.hpp:86
Box empty() const
Checks if the container has no elements, i.e.
void popFront() const
Removes the first element of the container.
void pushBack(Box &&value) const
Appends the given element value to the end of the container.
void reserve(size_t n) const
Increase the capacity of the container (the total number of elements that the vector can hold without...
void pushFront(Box &&value) const
Appends the given element value to the front of the container.
Iterator insert(const Iterator &position, const Iterator &first, const Iterator &last) const
Inserts elements at the specified location in the container.
size_t size() const
Returns the number of elements in the container, i.e.
Iterator begin() const
Returns an iterator to the first element of the container.
Box capacity() const
Returns the number of elements that the container has currently allocated space for.
Box operator[](size_t position) const
void resize(size_t count, const Box &value) const
Resizes the container to contain count elements, does nothing if count == size().
Box at(size_t position) const
void pushBack(const Box &value) const
Array & operator=(const Array &)=default
void clear() const
Erases all elements from the container.
Iterator cbegin() const
Returns an iterator to the first element of the container.
Iterator insert(const Iterator &position, Box &&value) const
Inserts elements at the specified location in the container.
Iterator erase(const Iterator &position) const
Erases the specified elements from the container.
Iterator insert(const Iterator &position, const Box &value) const
void pushFront(const Box &value) const
Array(const Array &)=default
Iterator end() const
Returns an iterator to the element following the last element of the container.
Array(Array &&) noexcept=default
void popBack() const
Removes the last element of the container.
void resize(size_t count) const
Resizes the container to contain count elements, does nothing if count == size().
Definition Box.collection.hpp:55
Iterator cbegin() const
Returns an iterator to the first element of the container.
Iterable(Iterable &&) noexcept=default
Iterable & operator=(const Iterable &)=default
Iterator end() const
Returns an iterator to the element following the last element of the container.
Iterable(const Iterable &)=default
Iterator begin() const
Returns an iterator to the first element of the container.
Box() noexcept
Creates a new variant holding an empty value.
Definition Box.collection.hpp:14
DifferenceType difference_type
Definition Box.collection.hpp:22
Box ValueType
Definition Box.collection.hpp:19
Iterator() noexcept=default
Creates a new empty MetaValue iterator.
~Iterator() noexcept=default
Destroys the iterator.
std::ptrdiff_t DifferenceType
Definition Box.collection.hpp:18
Box ReferenceType
Definition Box.collection.hpp:20
Definition Box.collection.hpp:269
Map(Map &&) noexcept=default
Map & operator=(const Map &)=default
A value type that can hold any alongside it's type information.
Definition Box.hpp:40
void * data() noexcept
Returns pointer to decayed type.
Definition Box.hpp:260
friend class Type
Definition Box.hpp:128
Box() noexcept
Creates a new variant holding an empty value.
Represents a reflected C++ type. Can be used to get metadata from a C++ type.
Definition Type.hpp:32
Definition Application.hpp:19
auto move(Vector3 position)
Moves a entity to the given position.
Definition Helpers.hpp:22
constexpr CountAlgorithmFunctor count
Returns the number of elements matching an element.
Definition Count.hpp:82
constexpr size_t hash(const T &v)
Generates a hash for the provided type.
Definition Hash.hpp:25