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::set< _Key, _Compare, _Allocator >(3cxx) std::__profile::set< _Key, _Compare, _Allocator >(3cxx) NAME
std::__profile::set< _Key, _Compare, _Allocator > - SYNOPSIS
Inherits set< _Key, _Compare, _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 _Compare key_compare typedef _Key key_type typedef _Base::pointer pointer typedef _Base::reference reference typedef _Base::reverse_iterator reverse_iterator typedef _Base::size_type size_type typedef _Compare value_compare typedef _Key value_type Public Member Functions set (const _Compare &__comp=_Compare(), const _Allocator &__a=_Allocator()) template<typename _InputIterator > set (_InputIterator __first, _InputIterator __last, const _Compare &__comp=_Compare(), const _Allocator &__a=_Allocator()) set (const set &__x) set (const _Base &__x) set (set &&__x) set (initializer_list< value_type > __l, const _Compare &__comp=_Compare(), const allocator_type &__a=allocator_type()) _Base & _M_base () const _Base & _M_base () const iterator begin () const_iterator begin () const const_iterator cbegin () const const_iterator cend () const void clear () const_reverse_iterator crbegin () const const_reverse_iterator crend () const iterator end () const_iterator end () const std::pair< iterator, iterator > equal_range (const key_type &__x) std::pair< const_iterator, const_iterator > equal_range (const key_type &__x) const " iterator erase (const_iterator __position) size_type erase (const key_type &__x) iterator erase (const_iterator __first, const_iterator __last) iterator find (const key_type &__x) const_iterator find (const key_type &__x) const std::pair< iterator, bool > insert (const value_type &__x) std::pair< iterator, bool > insert (value_type &&__x) iterator insert (const_iterator __position, const value_type &__x) iterator insert (const_iterator __position, value_type &&__x) template<typename _InputIterator > void insert (_InputIterator __first, _InputIterator __last) void insert (initializer_list< value_type > __l) iterator lower_bound (const key_type &__x) const_iterator lower_bound (const key_type &__x) const set & operator= (const set &__x) set & operator= (set &&__x) set & operator= (initializer_list< value_type > __l) reverse_iterator rbegin () const_reverse_iterator rbegin () const reverse_iterator rend () const_reverse_iterator rend () const void swap (set &__x) iterator upper_bound (const key_type &__x) const_iterator upper_bound (const key_type &__x) const Detailed Description template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>class std::__profile::set< _Key, _Compare, _Allocator > Class std::set wrapper with performance instrumentation. Definition at line 41 of file profile/set.h. Author Generated automatically by Doxygen for libstdc++ from the source code. libstdc++ Tue Nov 27 2012 std::__profile::set< _Key, _Compare, _Allocator >(3cxx)