The vector reference class is a nested class whose objects can provide references to elements (single bits) within a vector object. It has an allocator for the underlying type used by the specialization.
#Stl vector code full
The vector class is a full specialization of the class template vector for elements of type bool. If no reallocation happens, only iterators and references before the insertion/deletion point remain valid. In all such cases, iterators or references that point at altered portions of the sequence become invalid. Other insertions and erasures may alter various storage addresses within the sequence. Vector reallocation occurs when a member function must increase the sequence contained in the vector object beyond its current storage capacity. The list class container is faster at insertions and deletions at any location within a sequence. The deque class container is faster at insertions and deletions at the beginning and end of a sequence. Inserting or deleting elements in the middle of a vector requires linear time. Vectors allow constant time insertions and deletions at the end of the sequence. This argument is optional and the default value is allocator.
The type that represents the stored allocator object that encapsulates details about the vector's allocation and deallocation of memory. The element data type to be stored in the vector A vector is the preferred container for a sequence when random-access performance is at a premium. A vector stores elements of a given type in a linear arrangement, and allows fast random access to any element. The C++ Standard Library vector class is a class template for sequence containers.
0 kommentar(er)
