vector(7rheolef) [debian man page]
Vector(7rheolef) rheolef-6.1 Vector(7rheolef) NAME
Vector - STL vector<T> with reference counting DESCRIPTION
The class implement a reference counting wrapper for the STL vector<T> container class, with shallow copies. See also: @quotation The Standard Template Library, by Alexander Stephanov and Meng Lee. @end quotation This class provides the full vector<T> interface specification an could be used instead of vector<T>. NOTE
The write accessors T& operator[](size_type) as in v[i] may checks the reference count for each access. For a loop, a better usage is: Vector<T>::iterator i = v.begin(); Vector<T>::iterator last = v.end(); while (i != last) { ...} and the reference count check step occurs only two time, when accessing via begin() and end(). Thus, in order to encourage users to do it, we declare private theses member functions. A synonym of operator[] is at. IMPLEMENTATION
template<class T> class Vector : private smart_pointer<vector_rep<T> > { public: // typedefs: typedef iterator; typedef const_iterator; typedef pointer; typedef reference; typedef const_reference; typedef size_type; typedef difference_type; typedef value_type; typedef reverse_iterator; typedef const_reverse_iterator; // allocation/deallocation: explicit Vector (size_type n = 0, const T& value = T ()); Vector (const_iterator first, const_iterator last); void reserve (size_type n); void swap (Vector<T>& x) ; // accessors: 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; size_type size () const; size_type max_size () const; size_type capacity () const; bool empty () const; void resize (size_type sz, T v = T ()); // non-standard ? private: const_reference operator[] (size_type n) const; reference operator[] (size_type n); public: const_reference at (size_type n) const; // non-standard ? reference at (size_type n); reference front (); const_reference front () const; reference back (); const_reference back () const; // insert/erase: void push_back (const T& x); iterator insert (iterator position, const T& x = T ()); void insert (iterator position, size_type n, const T& x); void insert (iterator position, const_iterator first, const_iterator last); void pop_back (); void erase (iterator position); void erase (iterator first, iterator last); }; rheolef-6.1 rheolef-6.1 Vector(7rheolef)
Check Out this Related Man Page
std::__profile::deque< _Tp, _Allocator >(3) Library Functions Manual std::__profile::deque< _Tp, _Allocator >(3) NAME
std::__profile::deque< _Tp, _Allocator > - SYNOPSIS
Inherits deque< _Tp, _Allocator >. Public Types typedef _Allocator allocator_type typedef _Base::const_iterator const_iterator typedef _Base::const_pointer const_pointer typedef _Base::const_reference const_reference typedef _Base::const_reverse_iterator const_reverse_iterator" typedef _Base::difference_type difference_type typedef _Base::iterator iterator typedef _Base::pointer pointer typedef _Base::reference reference typedef _Base::reverse_iterator reverse_iterator typedef _Base::size_type size_type typedef _Tp value_type Public Member Functions _Base & _M_base () noexcept const _Base & _M_base () const noexcept reference back () const_reference back () const const _Tp const _Allocator iterator begin () noexcept const_iterator begin () const noexcept const_iterator cbegin () const noexcept const_iterator cend () const noexcept void clear () noexcept const_reverse_iterator crbegin () const noexcept const_reverse_iterator crend () const noexcept template<typename... _Args> iterator emplace (iterator __position, _Args &&...__args) template<typename... _Args> void emplace_back (_Args &&...__args) template<typename... _Args> void emplace_front (_Args &&...__args) iterator end () noexcept const_iterator end () const noexcept iterator erase (iterator __position) iterator erase (iterator __first, iterator __last) reference front () const_reference front () const iterator insert (iterator __position, const _Tp &__x) iterator insert (iterator __position, _Tp &&__x) void insert (iterator __p, initializer_list< value_type > __l) void insert (iterator __position, size_type __n, const _Tp &__x) template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> void insert (iterator __position, _InputIterator __first, _InputIterator __last) reference operator[] (size_type __n) const_reference operator[] (size_type __n) const void pop_back () void pop_front () void push_back (const _Tp &__x) void push_back (_Tp &&__x) void push_front (const _Tp &__x) void push_front (_Tp &&__x) reverse_iterator rbegin () noexcept const_reverse_iterator rbegin () const noexcept reverse_iterator rend () noexcept const_reverse_iterator rend () const noexcept void resize (size_type __sz) void resize (size_type __sz, const _Tp &__c) void swap (deque &__x) Public Attributes const _Tp const _Allocator & __a __pad0__: _Base(__a) { } explicit deque(size_type __n) : _Base(__n) { } deque(size_type __n const _Tp & __value Detailed Description template<typename _Tp, typename _Allocator = std::allocator<_Tp>>class std::__profile::deque< _Tp, _Allocator > Class std::deque wrapper with performance instrumentation. Definition at line 40 of file profile/deque. Author Generated automatically by Doxygen for libstdc++ from the source code. libstdc++ Tue Jun 10 2014 std::__profile::deque< _Tp, _Allocator >(3)