vector(C++std)

operator!= , operator> , operator>= , operator< , operator<= , operator== , swap , vector , vector<bool> - defines a template class that implements a vector container (standard template library)

Synopsis

   namespace std {
   template<class T, class A>
       class vector;
   template<class A>
       class vector<bool>;

           // TEMPLATE FUNCTIONS
   template<class T, class A>
       bool operator==(
           const vector<T, A>& lhs,
           const vector<T, A>& rhs);
   template<class T, class A>
       bool operator!=(
           const vector<T, A>& lhs,
           const vector<T, A>& rhs);
   template<class T, class A>
       bool operator<(
           const vector<T, A>& lhs,
           const vector<T, A>& rhs);
   template<class T, class A>
       bool operator>(
           const vector<T, A>& lhs,
           const vector<T, A>& rhs);
   template<class T, class A>
       bool operator<=(
           const vector<T, A>& lhs,
           const vector<T, A>& rhs);
   template<class T, class A>
       bool operator>=(
           const vector<T, A>& lhs,
           const vector<T, A>& rhs);
   template<class T, class A>
       void swap(
           vector<T, A>& lhs,
           vector<T, A>& rhs);
       };

Description

Include the STL standard header <vector> to define the container template class vector and several supporting templates.

operator!=

   template<class T, class A>
       bool operator!=(
           const vector <T, A>& lhs,
           const vector <T, A>& rhs);

The template function returns !(lhs == rhs).

operator==

   template<class T, class A>
       bool operator==(
           const vector <T, A>& lhs,
           const vector <T, A>& rhs);

The template function overloads operator== to compare two objects of template class vector. The function returns lhs.size() == rhs.size() && equal(lhs. begin(), lhs. end(), rhs.begin()).

operator<

   template<class T, class A>
       bool operator<(
           const vector <T, A>& lhs,
           const vector <T, A>& rhs);

The template function overloads operator< to compare two objects of template class vector. The function returns lexicographical_compare(lhs. begin(), lhs. end(), rhs.begin(), rhs.end()).

operator<=

   template<class T, class A>
       bool operator<=(
           const vector <T, A>& lhs,
           const vector <T, A>& rhs);

The template function returns !(rhs < lhs).

operator>

   template<class T, class A>
       bool operator>(
           const vector <T, A>& lhs,
           const vector <T, A>& rhs);

The template function returns rhs < lhs.

operator>=

   template<class T, class A>
       bool operator>=(
           const vector <T, A>& lhs,
           const vector <T, A>& rhs);

The template function returns !(lhs < rhs).

swap

   template<class T, class A>
       void swap(
           vector <T, A>& lhs,
           vector <T, A>& rhs);

The template function executes lhs.swap(rhs).

vector

allocator_type , assign , at , back , begin , capacity , clear , const_iterator , const_pointer , const_reference , const_reverse_iterator , difference_type , empty , end , erase , front , get_allocator , insert , iterator , max_size , operator[] , pointer , pop_back , push_back , rbegin , reference , rend , reserve , resize , reverse_iterator , size , size_type , swap , value_type , vector

   template<class T, class A = allocator<T> >
       class vector {
   public:
       typedef A allocator_type;
       typedef typename A::pointer pointer;
       typedef typename A::const_pointer
           const_pointer;
       typedef typename A::reference reference;
       typedef typename A::const_reference
           const_reference;
       typedef typename A::value_type value_type;
       typedef T0 iterator;
       typedef T1 const_iterator;
       typedef T2 size_type;
       typedef T3 difference_type;
       typedef reverse_iterator<const_iterator>
           const_reverse_iterator;
       typedef reverse_iterator<iterator>
           reverse_iterator;
       vector();
       explicit vector(const A& al);
       explicit vector(size_type n);
       vector(size_type n, const T& x);
       vector(size_type n, const T& x,
           const A& al);
       vector(const vector& x);
       template<class InIt>
           vector(InIt first, InIt last);
       template<class InIt>
           vector(InIt first, InIt last,
               const A& al);
       void reserve(size_type n);
       size_type capacity() const;
       iterator begin();
       const_iterator begin() const;
       iterator end();
       const_iterator end() const;
       reverse_iterator rbegin();
       const_reverse_iterator rbegin() const;
       reverse_iterator rend();
       const_reverse_iterator rend() const;
       void resize(size_type n);
       void resize(size_type n, T x);
       size_type size() const;
       size_type max_size() const;
       bool empty() const;
       A get_allocator() const;
       reference at(size_type pos);
       const_reference at(size_type pos) const;
       reference operator[](size_type pos);
       const_reference operator[](size_type pos);
       reference front();
       const_reference front() const;
       reference back();
       const_reference back() const;
       void push_back(const T& x);
       void pop_back();
       template<class InIt>
           void assign(InIt first, InIt last);
       void assign(size_type n, const T& x);
       iterator insert(iterator it, const T& x);
       void insert(iterator it, size_type n, const T& x);
       template<class InIt>
           void insert(iterator it, InIt first, InIt last);
       iterator erase(iterator it);
       iterator erase(iterator first, iterator last);
       void clear();
       void swap(vector& x);
       };

The template class describes an object that controls a varying-length sequence of elements of type T. The sequence is stored as an array of T.

The object allocates and frees storage for the sequence it controls through a stored allocator object of class A. Such an allocator object must have the same external interface as an object of template class allocator. Note that the stored allocator object is not copied when the container object is assigned.

Vector reallocation occurs when a member function must grow the controlled sequence beyond its current storage capacity. Other insertions and erasures may alter various storage addresses within the sequence. In all such cases, iterators or references that point at altered portions of the controlled sequence become invalid.

vector::allocator_type

   typedef A allocator_type;

The type is a synonym for the template parameter A.

vector::assign

   template<class InIt>
       void assign(InIt first, InIt last);
   void assign(size_type n, const T& x);

If InIt is an integer type, the first member function behaves the same as assign((size_type)first, (T)last). Otherwise, the first member function replaces the sequence controlled by *this with the sequence [first, last), which must not overlap the initial controlled sequence. The second member function replaces the sequence controlled by *this with a repetition of n elements of value x.

vector::at

   const_reference at(size_type pos) const;
   reference at(size_type pos);

The member function returns a reference to the element of the controlled sequence at position pos. If that position is invalid, the function throws an object of class out_of_range.

vector::back

   reference back();
   const_reference back() const;

The member function returns a reference to the last element of the controlled sequence, which must be non-empty.

vector::begin

   const_iterator begin() const;
   iterator begin();

The member function returns a random-access iterator that points at the first element of the sequence (or just beyond the end of an empty sequence).

vector::capacity

   size_type capacity() const;

The member function returns the storage currently allocated to hold the controlled sequence, a value at least as large as size().

vector::clear

   void clear();

The member function calls erase( begin(), end()).

vector::const_iterator

   typedef T1 const_iterator;

The type describes an object that can serve as a constant random-access iterator for the controlled sequence. It is described here as a synonym for the implementation-defined type T1.

vector::const_pointer

   typedef typename A::const_pointer
       const_pointer;

The type describes an object that can serve as a constant pointer to an element of the controlled sequence.

vector::const_reference

   typedef typename A::const_reference
       const_reference;

The type describes an object that can serve as a constant reference to an element of the controlled sequence.

vector::const_reverse_iterator

   typedef reverse_iterator<const_iterator>
       const_reverse_iterator;

The type describes an object that can serve as a constant reverse iterator for the controlled sequence.

vector::difference_type

   typedef T3 difference_type;

The signed integer type describes an object that can represent the difference between the addresses of any two elements in the controlled sequence. It is described here as a synonym for the implementation-defined type T3.

vector::empty

   bool empty() const;

The member function returns true for an empty controlled sequence.

vector::end

   const_iterator end() const;
   iterator end();

The member function returns a random-access iterator that points just beyond the end of the sequence.

vector::erase

   iterator erase(iterator it);
   iterator erase(iterator first, iterator last);

The first member function removes the element of the controlled sequence pointed to by it. The second member function removes the elements of the controlled sequence in the range [first, last). Both return an iterator that designates the first element remaining beyond any elements removed, or end() if no such element exists.

Erasing N elements causes N destructor calls and an assignment for each of the elements between the insertion point and the end of the sequence. No reallocation occurs, so iterators and references become invalid only from the first element erased through the end of the sequence.

The member functions throw an exception only if a copy operation throws an exception.

vector::front

   reference front();
   const_reference front() const;

The member function returns a reference to the first element of the controlled sequence, which must be non-empty.

vector::get_allocator

   A get_allocator() const;

The member function returns the stored allocator object.

vector::insert

   iterator insert(iterator it, const T& x);
   void insert(iterator it, size_type n, const T& x);
   template<class InIt>
       void insert(iterator it, InIt first, InIt last);

Each of the member functions inserts, before the element pointed to by it in the controlled sequence, a sequence specified by the remaining operands. The first member function inserts a single element with value x and returns an iterator that points to the newly inserted element. The second member function inserts a repetition of n elements of value x.

If InIt is an integer type, the last member function behaves the same as insert(it, (size_type)first, (T)last). Otherwise, the last member function inserts the sequence [first, last), which must not overlap the initial controlled sequence.

When inserting a single element, the number of element copies is linear in the number of elements between the insertion point and the end of the sequence. When inserting a single element at the end of the sequence, the amortized number of element copies is constant. When inserting N elements, the number of element copies is linear in N plus the number of elements between the insertion point and the end of the sequence -- except when the template member is specialized for InIt an input iterator, which behaves like N single insertions.

If reallocation occurs, the size of the controlled sequence increases by a fixed factor (at least), and all iterators and references become invalid. If no reallocation occurs, iterators become invalid only from the point of insertion through the end of the sequence.

If an exception is thrown during the insertion of one or more elements, and the exception is not thrown while copying an element, the container is left unaltered and the exception is rethrown.

vector::iterator

   typedef T0 iterator;

The type describes an object that can serve as a random-access iterator for the controlled sequence. It is described here as a synonym for the implementation-defined type T0.

vector::max_size

   size_type max_size() const;

The member function returns the length of the longest sequence that the object can control.

vector::operator[]

   const_reference operator[](size_type pos) const;
   reference operator[](size_type pos);

The member function returns a reference to the element of the controlled sequence at position pos. If that position is invalid, the behavior is undefined.

vector::pointer

   typedef typename A::pointer pointer;

The type describes an object that can serve as a pointer to an element of the controlled sequence.

vector::pop_back

   void pop_back();

The member function removes the last element of the controlled sequence, which must be non-empty.

The member function never throws an exception.

vector::push_back

   void push_back(const T& x);

The member function inserts an element with value x at the end of the controlled sequence.

If an exception is thrown, the container is left unaltered and the exception is rethrown.

vector::rbegin

   const_reverse_iterator rbegin() const;
   reverse_iterator rbegin();

The member function returns a reverse iterator that points just beyond the end of the controlled sequence. Hence, it designates the beginning of the reverse sequence.

vector::reference

   typedef typename A::reference reference;

The type describes an object that can serve as a reference to an element of the controlled sequence.

vector::rend

   const_reverse_iterator rend() const;
   reverse_iterator rend();

The member function returns a reverse iterator that points at the first element of the sequence (or just beyond the end of an empty sequence). Hence, it designates the end of the reverse sequence.

vector::reserve

   void reserve(size_type n);

If n is greater than max_size(), the member function reports a length error by throwing an object of class length_error. Otherwise, it ensures that capacity() henceforth returns at least n.

vector::resize

   void resize(size_type n);
   void resize(size_type n, T x);

The member functions both ensure that size() henceforth returns n. If it must make the controlled sequence longer, the first member function appends elements with value T(), while the second member function appends elements with value x. To make the controlled sequence shorter, both member functions call erase(begin() + n, end()).

vector::reverse_iterator

   typedef reverse_iterator<iterator>
       reverse_iterator;

The type describes an object that can serve as a reverse iterator for the controlled sequence.

vector::size

   size_type size() const;

The member function returns the length of the controlled sequence.

vector::size_type

   typedef T2 size_type;

The unsigned integer type describes an object that can represent the length of any controlled sequence. It is described here as a synonym for the implementation-defined type T2.

vector::swap

   void swap(vector& x);

The member function swaps the controlled sequences between *this and x. If get_allocator() == x.get_allocator(), it does so in constant time, it throws no exceptions, and it invalidates no references, pointers, or iterators that designate elements in the two controlled sequences. Otherwise, it performs a number of element assignments and constructor calls proportional to the number of elements in the two controlled sequences.

vector::value_type

   typedef typename A::value_type value_type;

The type is a synonym for the template parameter T.

vector::vector

   vector();
   explicit vector(const A& al);
   explicit vector(size_type n);
   vector(size_type n, const T& x);
   vector(size_type n, const T& x, const A& al);
   vector(const vector& x);
   template<class InIt>
       vector(InIt first, InIt last);
   template<class InIt>
       vector(InIt first, InIt last, const A& al);

All constructors store an allocator object and initialize the controlled sequence. The allocator object is the argument al, if present. For the copy constructor, it is x.get_allocator(). Otherwise, it is A().

The first two constructors specify an empty initial controlled sequence. The third constructor specifies a repetition of n elements of value T(). The fourth and fifth constructors specify a repetition of n elements of value x. The sixth constructor specifies a copy of the sequence controlled by x. If InIt is an integer type, the last two constructors specify a repetition of (size_type)first elements of value (T)last. Otherwise, the last two constructors specify the sequence [first, last).

All constructors copy N elements and perform no interim reallocation.

vector<bool, A>

   template<class A>
       class vector<bool, A> {
   public:
       class reference;
       typedef bool const_reference;
       typedef T0 iterator;
       typedef T1 const_iterator;
       typedef T4 pointer;
       typedef T5 const_pointer;
       void flip();
       static void swap(reference x, reference y);
   // rest same as template class vector
       };

The class is a partial specialization of template class vector for elements of type bool. It alters the definition of four member types (to optimize the packing and unpacking of elements) and adds two member functions. Its behavior is otherwise the same as for template class vector.

vector<bool, A>::const_iterator

   typedef T1 const_iterator;

The type describes an object that can serve as a constant random-access iterator for the controlled sequence. It is described here as a synonym for the unspecified type T1.

vector<bool, A>::const_pointer

   typedef T5 const_pointer;

The type describes an object that can serve as a pointer to a constant element of the controlled sequence. It is described here as a synonym for the unspecified type T5.

vector<bool, A>::const_reference

   typedef bool const_reference;

The type describes an object that can serve as a constant reference to an element of the controlled sequence, in this case bool.

vector<bool, A>::flip

   void flip();

The member function inverts the values of all the members of the controlled sequence.

vector<bool, A>::iterator

   typedef T0 iterator;

The type describes an object that can serve as a random-access iterator for the controlled sequence. It is described here as a synonym for the unspecified type T0.

vector<bool, A>::pointer

   typedef T4 pointer;

The type describes an object that can serve as a pointer to an element of the controlled sequence. It is described here as a synonym for the unspecified type T4.

vector<bool, A>::reference

   class reference {
   public:
       reference& operator=(const reference& x);
       reference& operator=(bool x);
       void flip();
       bool operator~() const;
       operator bool() const;
       };

The type describes an object that can serve as a reference to an element of the controlled sequence. Specifically, for two objects x and y of class reference:

bool(x) yields the value of the element designated by x
~x yields the inverted value of the element designated by x
x.flip() inverts the value stored in x
y = bool(x) and y = x both assign the value of the element designated by x to the element designated by y

It is unspecified how member functions of class vector<bool> construct objects of class reference that designate elements of a controlled sequence. The default constructor for class reference generates an object that refers to no such element.

vector<bool, A>::swap

   void swap(reference x, reference y);

The static member function swaps the members of the controlled sequences designated by x and y.

References

algorithm() , memory(C++std)