reversible_ptr_container.rst
来自「Boost provides free peer-reviewed portab」· RST 代码 · 共 156 行
RST
156 行
++++++++++++++++++++++++++++++++++ |Boost| Pointer Container Library++++++++++++++++++++++++++++++++++ .. |Boost| image:: boost.pngClass ``reversible_ptr_container``------------------------------------This class is not a real class that can be found in the library. Its purpose is to present the general interface of all the pointer containers.**Hierarchy:**- ``reversible_ptr_container`` - `ptr_sequence_adapter <ptr_sequence_adapter.html>`_ - `ptr_vector <ptr_vector.html>`_ - `ptr_list <ptr_list.html>`_ - `ptr_deque <ptr_deque.html>`_ - `ptr_array <ptr_array.html>`_ - `associative_ptr_container <associative_ptr_container.html>`_ - `ptr_set_adapter <ptr_set_adapter.html>`_ - `ptr_multiset_adapter <ptr_multiset_adapter.html>`_ - `ptr_map_adapter <ptr_map_adapter.html>`_ - `ptr_multi_map_adapter <ptr_multimap_adapter.html>`_ - `ptr_set <ptr_set.html>`_ - `ptr_multi_set <ptr_multiset.html>`_ - `ptr_map <ptr_map.html>`_ - `ptr_multimap <ptr_multimap.html>`_**Navigate:**- `home <ptr_container.html>`_- `reference <reference.html>`_**synopsis:**.. parsed-literal:: namespace boost { template < class T, class CloneAllocator, class VoidPtrContainer > class reversible_ptr_container { public: // `typedefs`_ typedef T* value_type; typedef T& reference; typedef const T& const_reference; typedef *implementation defined* iterator; typedef *implementation defined* const_iterator; typedef typename VoidPtrContainer::differnce_type difference_type; typedef typename VoidPtrContainer::size_type size_type; typedef typename VoidPtrContainer::allocator_type allocator_type; typedef *implementation defined* reverse_iterator; typedef *implementation defined* const_reverse_iterator; typedef *implementation defined* auto_type; public: // `construct/copy/destroy`_ reversible_ptr_container(); explicit reversible_ptr_container( const reversible_ptr_container& r ); template< class Derived > explicit reversible_ptr_container( const reversible_ptr_container<Derived>& r ); explicit reversible_ptr_container( std::auto_ptr<reversible_ptr_container> r ); template< class InputIterator > reversible_ptr_container( InputIterator first, InputIterator last ); ~reversible_ptr_container(); reversible_ptr_container& operator=( const reversible_ptr_container& r ); template<class Derived> reversible_ptr_container& operator=( const reversible_ptr_container<Derived>& r ); reversible_ptr_container& operator=( std::auto_ptr<reversible_ptr_container> r ); allocator_type get_allocator() const; public: // `iterators`_ 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; public: // `capacity`_ size_type size() const; size_type max_size() const; bool empty() const; public: // `modifiers`_ void swap( reversible_ptr_container& r ); void clear(): VoidPtrContainer& base(); const VoidPtrContainer& base() const; public: // `pointer container requirements`_ auto_type replace( iterator position, T* x ); template< class U > auto_type replace( iterator position, std::auto_ptr<U> x ); std::auto_ptr<reversible_ptr_container> clone() const; std::auto_ptr<reversible_ptr_container> release(); auto_type release( iterator position ); }; // class 'reversible_ptr_container' // `comparison`_ template < class T, class CA, class VPC > bool operator==( const reversible_ptr_container<T,CA,VPC>& x, const reversible_ptr_container<T,CA,VPC>& y); template < class T, class CA, class VPC > bool operator<( const reversible_ptr_container<T,CA,VPC>& x, const reversible_ptr_container<T,CA,VPC>& y); template < class T, class CA, class VPC > bool operator!=( const reversible_ptr_container<T,CA,VPC>& x, const reversible_ptr_container<T,CA,VPC>& y); template < class T, class CA, class VPC > bool operator>( const reversible_ptr_container<T,CA,VPC>& x, const reversible_ptr_container<T,CA,VPC>& y); template < class T, class CA, class VPC > bool operator>=( const reversible_ptr_container<T,CA,VPC>& x, const reversible_ptr_container<T,CA,VPC>& y); template < class T, class CA, class VPC > bool operator<=( const reversible_ptr_container<T,CA,VPC>& x, const reversible_ptr_container<T,CA,VPC>& y); template< class T, class CA, class VPC > void swap( reversible_ptr_container<T,CA,VPC>& x, reversible_ptr_container<T,CA,VPC>& y ); // cloneability_ template< class T, class CA, class VPC > reversible_ptr_container<T,CA,VPC>* new_clone( const reversible_ptr_container<T,CA,VPC>& r ); // `null predicate`_ template< class Iterator > bool is_null( Iterator i ); // `serialization`_ template<class Archive, class T, class CA, class VPC> void serialize( Archive& ar, reversible_ptr_container<T,C
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?