Difference between revisions of "cpp/container/vector"
From cppreference.com
m (Text replace - "{{tdcl" to "{{dcl") |
m (Text replace - "container/tdcl" to "container/dcl") |
||
Line 15: | Line 15: | ||
{{dcl list begin}} | {{dcl list begin}} | ||
{{dcl list hitem | Member type | Definition}} | {{dcl list hitem | Member type | Definition}} | ||
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list value_type | vector}} |
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list allocator_type | vector}} |
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list size_type | vector}} |
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list difference_type | vector}} |
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list reference | vector}} |
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list const_reference | vector}} |
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list pointer | vector}} |
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list const_pointer | vector}} |
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list iterator | vector}} |
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list const_iterator | vector}} |
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list reverse_iterator | vector}} |
− | {{dcl list template | cpp/container/ | + | {{dcl list template | cpp/container/dcl list const_reverse_iterator | vector}} |
{{dcl list end}} | {{dcl list end}} | ||
Revision as of 02:06, 12 June 2012
Template:cpp/container/vector/sidebar
Defined in header <vector>
|
||
template< class T, |
||
std::vector
is a container that supports fast random access to the elements and fast insertion or removal of elements at the end of the container. Fast element insertion or removal in the middle of the container is not supported. It is implemented as an contiguous array, which means that pointer arithmetic is fully supported, and a pointer to an element of a vector may be passed to any C function that expects a pointer to an element of an array.
std::vector
meets the requirements of Template:concept, Template:concept, Template:concept and Template:concept.
Contents |