libgrape-lite
A C++ library for parallel graph processing
|
Array a std::vector-like container type without reserving memory. More...
#include <gcontainer.h>
Classes | |
struct | __Array_base |
struct | _ConstructTransaction |
Public Member Functions | |
allocator_type | get_allocator () const noexcept |
Array (const allocator_type &__a) noexcept | |
Array (size_type __n, const allocator_type &__a=allocator_type()) | |
Array (size_type __n, const value_type &__x, const allocator_type &__a=allocator_type()) | |
Array (const Array &__x) | |
Array (Array &&__x) noexcept | |
Array (const Array &__x, const allocator_type &__a) | |
Array (Array &&__x, const allocator_type &__a) | |
Array & | operator= (const Array &__x) |
Array & | operator= (Array &&__x) |
size_type | size () const noexcept |
void | resize (size_type __new_size) |
void | resize (size_type __new_size, const value_type &__x) |
bool | empty () const noexcept |
reference | operator[] (size_type __n) noexcept |
const_reference | operator[] (size_type __n) const noexcept |
reference | at (size_type __n) noexcept |
const_reference | at (size_type __n) const noexcept |
pointer | data () noexcept |
const_pointer | data () const noexcept |
iterator | begin () noexcept |
const_iterator | begin () const noexcept |
iterator | end () noexcept |
const_iterator | end () const noexcept |
void | swap (Array &__x) noexcept |
void | clear () noexcept |
Private Attributes | |
__Array_base | __base |
Array a std::vector-like container type without reserving memory.
Unlike std::array, Array is resizable, and unlike std::vector, Array takes exactly memory for elements without reserving spaces for further insertions.
_Tp | Type of elements in the array. |
_Alloc | Allocator type that will be used for memory allocation. |