EnTT 3.14.0
|
Basic table implementation. More...
#include <table.hpp>
Public Types | |
using | size_type = std::size_t |
Unsigned integer type. | |
using | iterator = internal::table_iterator<typename Container::iterator...> |
Input iterator type. | |
using | const_iterator = internal::table_iterator<typename Container::const_iterator...> |
Constant input iterator type. | |
using | reverse_iterator = internal::table_iterator<typename Container::reverse_iterator...> |
Reverse iterator type. | |
using | const_reverse_iterator = internal::table_iterator<typename Container::const_reverse_iterator...> |
Constant reverse iterator type. | |
Public Member Functions | |
basic_table () | |
Default constructor. | |
basic_table (const Container &...container) noexcept | |
Copy constructs the underlying containers. | |
basic_table (Container &&...container) noexcept | |
Move constructs the underlying containers. | |
basic_table (const basic_table &)=delete | |
Default copy constructor, deleted on purpose. | |
basic_table (basic_table &&other) noexcept | |
Move constructor. | |
template<typename Allocator > | |
basic_table (const Allocator &allocator) | |
Constructs the underlying containers using a given allocator. | |
template<class Allocator > | |
basic_table (const Container &...container, const Allocator &allocator) noexcept | |
Copy constructs the underlying containers using a given allocator. | |
template<class Allocator > | |
basic_table (Container &&...container, const Allocator &allocator) noexcept | |
Move constructs the underlying containers using a given allocator. | |
template<class Allocator > | |
basic_table (basic_table &&other, const Allocator &allocator) | |
Allocator-extended move constructor. | |
~basic_table ()=default | |
Default destructor. | |
basic_table & | operator= (const basic_table &)=delete |
Default copy assignment operator, deleted on purpose. | |
basic_table & | operator= (basic_table &&other) noexcept |
Move assignment operator. | |
void | swap (basic_table &other) noexcept |
Exchanges the contents with those of a given table. | |
void | reserve (const size_type cap) |
Increases the capacity of a table. | |
size_type | capacity () const noexcept |
Returns the number of rows that a table has currently allocated space for. | |
void | shrink_to_fit () |
Requests the removal of unused capacity. | |
size_type | size () const noexcept |
Returns the number of rows in a table. | |
bool | empty () const noexcept |
Checks whether a table is empty. | |
const_iterator | cbegin () const noexcept |
Returns an iterator to the beginning. | |
const_iterator | begin () const noexcept |
Returns an iterator to the beginning. | |
iterator | begin () noexcept |
Returns an iterator to the beginning. | |
const_iterator | cend () const noexcept |
Returns an iterator to the end. | |
const_iterator | end () const noexcept |
Returns an iterator to the end. | |
iterator | end () noexcept |
Returns an iterator to the end. | |
const_reverse_iterator | crbegin () const noexcept |
Returns a reverse iterator to the beginning. | |
const_reverse_iterator | rbegin () const noexcept |
Returns a reverse iterator to the beginning. | |
reverse_iterator | rbegin () noexcept |
Returns a reverse iterator to the beginning. | |
const_reverse_iterator | crend () const noexcept |
Returns a reverse iterator to the end. | |
const_reverse_iterator | rend () const noexcept |
Returns a reverse iterator to the end. | |
reverse_iterator | rend () noexcept |
Returns a reverse iterator to the end. | |
template<typename... Args> | |
std::tuple< typename Container::value_type &... > | emplace (Args &&...args) |
Appends a row to the end of a table. | |
iterator | erase (const_iterator pos) |
Removes a row from a table. | |
void | erase (const size_type pos) |
Removes a row from a table. | |
std::tuple< const typename Container::value_type &... > | operator[] (const size_type pos) const |
Returns the row data at specified location. | |
std::tuple< typename Container::value_type &... > | operator[] (const size_type pos) |
Returns the row data at specified location. | |
void | clear () |
Clears a table. | |
Basic table implementation.
Internal data structures arrange elements to maximize performance. There are no guarantees that objects are returned in the insertion order when iterate a table. Do not make assumption on the order in any case.
Container | Sequence container row types. |
using entt::basic_table< Container >::const_iterator = internal::table_iterator<typename Container::const_iterator...> |
using entt::basic_table< Container >::const_reverse_iterator = internal::table_iterator<typename Container::const_reverse_iterator...> |
using entt::basic_table< Container >::iterator = internal::table_iterator<typename Container::iterator...> |
using entt::basic_table< Container >::reverse_iterator = internal::table_iterator<typename Container::reverse_iterator...> |
using entt::basic_table< Container >::size_type = std::size_t |
|
inline |
|
inlineexplicitnoexcept |
|
inlineexplicitnoexcept |
|
inlinenoexcept |
|
inlineexplicit |
|
inlinenoexcept |
|
inline |
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
|
inline |
|
inlinenoexcept |
|
inlinenoexcept |
|
inline |
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
|
inline |
|
inline |
|
inlinenoexcept |
|
delete |
Default copy assignment operator, deleted on purpose.
|
inline |
|
inline |
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
|
inline |
|
inline |
|
inlinenoexcept |
|
inlinenoexcept |