mirror of
https://github.com/boostorg/container.git
synced 2025-08-02 14:04:26 +02:00
Reordered sequence container types and functions to improve Doxygen documentation
[SVN r80686]
This commit is contained in:
@@ -27,6 +27,8 @@ doxygen autodoc
|
|||||||
<doxygen:param>MACRO_EXPANSION=YES
|
<doxygen:param>MACRO_EXPANSION=YES
|
||||||
<doxygen:param>"PREDEFINED=\"insert_const_ref_type= const T&\" \\
|
<doxygen:param>"PREDEFINED=\"insert_const_ref_type= const T&\" \\
|
||||||
\"BOOST_CONTAINER_DOXYGEN_INVOKED\" \\
|
\"BOOST_CONTAINER_DOXYGEN_INVOKED\" \\
|
||||||
|
\"BOOST_CONTAINER_IMPDEF(T)=implementation_defined\" \\
|
||||||
|
\"BOOST_CONTAINER_SEEDOC(T)=see_documentation\" \\
|
||||||
\"BOOST_RV_REF(T)=T &&\" \\
|
\"BOOST_RV_REF(T)=T &&\" \\
|
||||||
\"BOOST_RV_REF_BEG=\" \\
|
\"BOOST_RV_REF_BEG=\" \\
|
||||||
\"BOOST_RV_REF_END=&&\" \\
|
\"BOOST_RV_REF_END=&&\" \\
|
||||||
|
@@ -617,13 +617,15 @@ use [*Boost.Container]? There are several reasons for that:
|
|||||||
[section:release_notes_boost_1_52_00 Boost 1.52 Release]
|
[section:release_notes_boost_1_52_00 Boost 1.52 Release]
|
||||||
|
|
||||||
* Improved `stable_vector`'s template code bloat and type safety.
|
* Improved `stable_vector`'s template code bloat and type safety.
|
||||||
|
* Changed typedefs and reordered functions of sequence containers to improve doxygen documentation.
|
||||||
* Fixed bugs
|
* Fixed bugs
|
||||||
[@https://svn.boost.org/trac/boost/ticket/6615 #6615],
|
[@https://svn.boost.org/trac/boost/ticket/6615 #6615],
|
||||||
[@https://svn.boost.org/trac/boost/ticket/7139 #7139],
|
[@https://svn.boost.org/trac/boost/ticket/7139 #7139],
|
||||||
[@https://svn.boost.org/trac/boost/ticket/7215 #7215],
|
[@https://svn.boost.org/trac/boost/ticket/7215 #7215],
|
||||||
[@https://svn.boost.org/trac/boost/ticket/7232 #7232],
|
[@https://svn.boost.org/trac/boost/ticket/7232 #7232],
|
||||||
[@https://svn.boost.org/trac/boost/ticket/7269 #7269].
|
[@https://svn.boost.org/trac/boost/ticket/7269 #7269].
|
||||||
|
* Implemented LWG Issue #149 (range insertion now returns an iterator) & cleaned up insertion code in most containers
|
||||||
|
* Corrected aliasing errors.
|
||||||
|
|
||||||
[endsect]
|
[endsect]
|
||||||
|
|
||||||
|
@@ -70,41 +70,41 @@ struct allocator_traits
|
|||||||
typedef unspecified pointer;
|
typedef unspecified pointer;
|
||||||
//! Alloc::const_pointer if such a type exists ; otherwise, pointer_traits<pointer>::rebind<const
|
//! Alloc::const_pointer if such a type exists ; otherwise, pointer_traits<pointer>::rebind<const
|
||||||
//!
|
//!
|
||||||
typedef unspecified const_pointer;
|
typedef see_documentation const_pointer;
|
||||||
//! Non-standard extension
|
//! Non-standard extension
|
||||||
//! Alloc::reference if such a type exists; otherwise, value_type&
|
//! Alloc::reference if such a type exists; otherwise, value_type&
|
||||||
typedef unspecified reference;
|
typedef see_documentation reference;
|
||||||
//! Non-standard extension
|
//! Non-standard extension
|
||||||
//! Alloc::const_reference if such a type exists ; otherwise, const value_type&
|
//! Alloc::const_reference if such a type exists ; otherwise, const value_type&
|
||||||
typedef unspecified const_reference;
|
typedef see_documentation const_reference;
|
||||||
//! Alloc::void_pointer if such a type exists ; otherwise, pointer_traits<pointer>::rebind<void>.
|
//! Alloc::void_pointer if such a type exists ; otherwise, pointer_traits<pointer>::rebind<void>.
|
||||||
//!
|
//!
|
||||||
typedef unspecified void_pointer;
|
typedef see_documentation void_pointer;
|
||||||
//! Alloc::const_void_pointer if such a type exists ; otherwis e, pointer_traits<pointer>::rebind<const
|
//! Alloc::const_void_pointer if such a type exists ; otherwis e, pointer_traits<pointer>::rebind<const
|
||||||
//!
|
//!
|
||||||
typedef unspecified const_void_pointer;
|
typedef see_documentation const_void_pointer;
|
||||||
//! Alloc::difference_type if such a type exists ; otherwise, pointer_traits<pointer>::difference_type.
|
//! Alloc::difference_type if such a type exists ; otherwise, pointer_traits<pointer>::difference_type.
|
||||||
//!
|
//!
|
||||||
typedef unspecified difference_type;
|
typedef see_documentation difference_type;
|
||||||
//! Alloc::size_type if such a type exists ; otherwise, make_unsigned<difference_type>::type
|
//! Alloc::size_type if such a type exists ; otherwise, make_unsigned<difference_type>::type
|
||||||
//!
|
//!
|
||||||
typedef unspecified size_type;
|
typedef see_documentation size_type;
|
||||||
//! Alloc::propagate_on_container_copy_assignment if such a type exists, otherwise an integral_constant
|
//! Alloc::propagate_on_container_copy_assignment if such a type exists, otherwise an integral_constant
|
||||||
//! type with internal constant static member `value` == false.
|
//! type with internal constant static member `value` == false.
|
||||||
typedef unspecified propagate_on_container_copy_assignment;
|
typedef see_documentation propagate_on_container_copy_assignment;
|
||||||
//! Alloc::propagate_on_container_move_assignment if such a type exists, otherwise an integral_constant
|
//! Alloc::propagate_on_container_move_assignment if such a type exists, otherwise an integral_constant
|
||||||
//! type with internal constant static member `value` == false.
|
//! type with internal constant static member `value` == false.
|
||||||
typedef unspecified propagate_on_container_move_assignment;
|
typedef see_documentation propagate_on_container_move_assignment;
|
||||||
//! Alloc::propagate_on_container_swap if such a type exists, otherwise an integral_constant
|
//! Alloc::propagate_on_container_swap if such a type exists, otherwise an integral_constant
|
||||||
//! type with internal constant static member `value` == false.
|
//! type with internal constant static member `value` == false.
|
||||||
typedef unspecified propagate_on_container_swap;
|
typedef see_documentation propagate_on_container_swap;
|
||||||
//! Defines an allocator: Alloc::rebind<T>::other if such a type exists; otherwise, Alloc<T, Args>
|
//! Defines an allocator: Alloc::rebind<T>::other if such a type exists; otherwise, Alloc<T, Args>
|
||||||
//! if Alloc is a class template instantiation of the form Alloc<U, Args>, where Args is zero or
|
//! if Alloc is a class template instantiation of the form Alloc<U, Args>, where Args is zero or
|
||||||
//! more type arguments ; otherwise, the instantiation of rebind_alloc is ill-formed.
|
//! more type arguments ; otherwise, the instantiation of rebind_alloc is ill-formed.
|
||||||
//!
|
//!
|
||||||
//! In C++03 compilers `rebind_alloc` is a struct derived from an allocator
|
//! In C++03 compilers `rebind_alloc` is a struct derived from an allocator
|
||||||
//! deduced by previously detailed rules.
|
//! deduced by previously detailed rules.
|
||||||
template <class T> using rebind_alloc = unspecified;
|
template <class T> using rebind_alloc = see_documentation;
|
||||||
|
|
||||||
//! In C++03 compilers `rebind_traits` is a struct derived from
|
//! In C++03 compilers `rebind_traits` is a struct derived from
|
||||||
//! `allocator_traits<OtherAlloc>`, where `OtherAlloc` is
|
//! `allocator_traits<OtherAlloc>`, where `OtherAlloc` is
|
||||||
@@ -115,7 +115,7 @@ struct allocator_traits
|
|||||||
//! `type` is an allocator related to Alloc deduced deduced by rules explained in `rebind_alloc`.
|
//! `type` is an allocator related to Alloc deduced deduced by rules explained in `rebind_alloc`.
|
||||||
template <class T>
|
template <class T>
|
||||||
struct portable_rebind_alloc
|
struct portable_rebind_alloc
|
||||||
{ typedef unspecified_type type; };
|
{ typedef see_documentation type; };
|
||||||
#else
|
#else
|
||||||
//pointer
|
//pointer
|
||||||
typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT(boost::container::container_detail::, Alloc,
|
typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT(boost::container::container_detail::, Alloc,
|
||||||
|
@@ -585,6 +585,22 @@ struct is_bidirectional_iterator<T, false>
|
|||||||
static const bool value = false;
|
static const bool value = false;
|
||||||
};
|
};
|
||||||
|
|
||||||
|
template<class T, class IIterator>
|
||||||
|
struct iiterator_types
|
||||||
|
{
|
||||||
|
typedef typename std::iterator_traits<IIterator>::pointer it_pointer;
|
||||||
|
typedef typename std::iterator_traits<IIterator>::difference_type difference_type;
|
||||||
|
typedef typename ::boost::intrusive::pointer_traits<it_pointer>::
|
||||||
|
template rebind_pointer<T>::type pointer;
|
||||||
|
typedef typename ::boost::intrusive::pointer_traits<it_pointer>::
|
||||||
|
template rebind_pointer<const T>::type const_pointer;
|
||||||
|
typedef typename ::boost::intrusive::
|
||||||
|
pointer_traits<pointer>::reference reference;
|
||||||
|
typedef typename ::boost::intrusive::
|
||||||
|
pointer_traits<const_pointer>::reference const_reference;
|
||||||
|
};
|
||||||
|
|
||||||
|
|
||||||
} //namespace container_detail {
|
} //namespace container_detail {
|
||||||
|
|
||||||
} //namespace container {
|
} //namespace container {
|
||||||
@@ -593,4 +609,3 @@ struct is_bidirectional_iterator<T, false>
|
|||||||
#include <boost/container/detail/config_end.hpp>
|
#include <boost/container/detail/config_end.hpp>
|
||||||
|
|
||||||
#endif //#ifndef BOOST_CONTAINER_DETAIL_ITERATORS_HPP
|
#endif //#ifndef BOOST_CONTAINER_DETAIL_ITERATORS_HPP
|
||||||
|
|
||||||
|
@@ -31,6 +31,10 @@
|
|||||||
#define BOOST_CONTAINER_UNIMPLEMENTED_PACK_EXPANSION_TO_FIXED_LIST
|
#define BOOST_CONTAINER_UNIMPLEMENTED_PACK_EXPANSION_TO_FIXED_LIST
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
|
//Macros for documentation purposes. For code, expands to the argument
|
||||||
|
#define BOOST_CONTAINER_IMPDEF(TYPE) TYPE
|
||||||
|
#define BOOST_CONTAINER_SEEDOC(TYPE) TYPE
|
||||||
|
|
||||||
#include <boost/container/detail/config_end.hpp>
|
#include <boost/container/detail/config_end.hpp>
|
||||||
|
|
||||||
#endif //#ifndef BOOST_CONTAINER_DETAIL_WORKAROUND_HPP
|
#endif //#ifndef BOOST_CONTAINER_DETAIL_WORKAROUND_HPP
|
||||||
|
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
@@ -466,9 +466,6 @@ class stable_vector
|
|||||||
typedef typename index_traits_type::index_iterator index_iterator;
|
typedef typename index_traits_type::index_iterator index_iterator;
|
||||||
typedef typename index_traits_type::
|
typedef typename index_traits_type::
|
||||||
const_index_iterator const_index_iterator;
|
const_index_iterator const_index_iterator;
|
||||||
|
|
||||||
typedef typename container_detail::
|
|
||||||
move_const_ref_type<T>::type insert_const_ref_type;
|
|
||||||
typedef boost::intrusive::
|
typedef boost::intrusive::
|
||||||
pointer_traits
|
pointer_traits
|
||||||
<typename allocator_traits_type::pointer> ptr_traits;
|
<typename allocator_traits_type::pointer> ptr_traits;
|
||||||
@@ -601,27 +598,35 @@ class stable_vector
|
|||||||
{ this->priv_node_alloc().deallocate_individual(boost::move(holder)); }
|
{ this->priv_node_alloc().deallocate_individual(boost::move(holder)); }
|
||||||
|
|
||||||
friend class stable_vector_detail::clear_on_destroy<stable_vector>;
|
friend class stable_vector_detail::clear_on_destroy<stable_vector>;
|
||||||
|
typedef stable_vector_detail::iterator
|
||||||
|
< T
|
||||||
|
, typename allocator_traits<A>::reference
|
||||||
|
, typename allocator_traits<A>::pointer> iterator_impl;
|
||||||
|
typedef stable_vector_detail::iterator
|
||||||
|
< T
|
||||||
|
, typename allocator_traits<A>::const_reference
|
||||||
|
, typename allocator_traits<A>::const_pointer> const_iterator_impl;
|
||||||
///@endcond
|
///@endcond
|
||||||
public:
|
public:
|
||||||
|
|
||||||
|
//////////////////////////////////////////////
|
||||||
// types:
|
//
|
||||||
|
// types
|
||||||
typedef typename allocator_traits_type::reference reference;
|
//
|
||||||
typedef typename allocator_traits_type::const_reference const_reference;
|
//////////////////////////////////////////////
|
||||||
typedef typename allocator_traits_type::pointer pointer;
|
typedef T value_type;
|
||||||
typedef typename allocator_traits_type::const_pointer const_pointer;
|
typedef typename ::boost::container::allocator_traits<A>::pointer pointer;
|
||||||
typedef stable_vector_detail::iterator
|
typedef typename ::boost::container::allocator_traits<A>::const_pointer const_pointer;
|
||||||
<T,T&, pointer> iterator;
|
typedef typename ::boost::container::allocator_traits<A>::reference reference;
|
||||||
typedef stable_vector_detail::iterator
|
typedef typename ::boost::container::allocator_traits<A>::const_reference const_reference;
|
||||||
<T,const T&, const_pointer> const_iterator;
|
typedef typename ::boost::container::allocator_traits<A>::size_type size_type;
|
||||||
typedef typename index_type::size_type size_type;
|
typedef typename ::boost::container::allocator_traits<A>::difference_type difference_type;
|
||||||
typedef typename iterator::difference_type difference_type;
|
typedef A allocator_type;
|
||||||
typedef T value_type;
|
typedef node_allocator_type stored_allocator_type;
|
||||||
typedef A allocator_type;
|
typedef BOOST_CONTAINER_IMPDEF(iterator_impl) iterator;
|
||||||
typedef std::reverse_iterator<iterator> reverse_iterator;
|
typedef BOOST_CONTAINER_IMPDEF(const_iterator_impl) const_iterator;
|
||||||
typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
|
typedef BOOST_CONTAINER_IMPDEF(std::reverse_iterator<iterator>) reverse_iterator;
|
||||||
typedef node_allocator_type stored_allocator_type;
|
typedef BOOST_CONTAINER_IMPDEF(std::reverse_iterator<const_iterator>) const_reverse_iterator;
|
||||||
|
|
||||||
///@cond
|
///@cond
|
||||||
private:
|
private:
|
||||||
@@ -636,6 +641,11 @@ class stable_vector
|
|||||||
///@endcond
|
///@endcond
|
||||||
|
|
||||||
public:
|
public:
|
||||||
|
//////////////////////////////////////////////
|
||||||
|
//
|
||||||
|
// construct/copy/destroy
|
||||||
|
//
|
||||||
|
//////////////////////////////////////////////
|
||||||
|
|
||||||
//! <b>Effects</b>: Default constructs a stable_vector.
|
//! <b>Effects</b>: Default constructs a stable_vector.
|
||||||
//!
|
//!
|
||||||
@@ -842,6 +852,18 @@ class stable_vector
|
|||||||
return *this;
|
return *this;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
|
//! <b>Effects</b>: Assigns the n copies of val to *this.
|
||||||
|
//!
|
||||||
|
//! <b>Throws</b>: If memory allocation throws or T's copy constructor throws.
|
||||||
|
//!
|
||||||
|
//! <b>Complexity</b>: Linear to n.
|
||||||
|
void assign(size_type n, const T& t)
|
||||||
|
{
|
||||||
|
typedef constant_iterator<value_type, difference_type> cvalue_iterator;
|
||||||
|
this->assign(cvalue_iterator(t, n), cvalue_iterator());
|
||||||
|
}
|
||||||
|
|
||||||
//! <b>Effects</b>: Assigns the the range [first, last) to *this.
|
//! <b>Effects</b>: Assigns the the range [first, last) to *this.
|
||||||
//!
|
//!
|
||||||
//! <b>Throws</b>: If memory allocation throws or
|
//! <b>Throws</b>: If memory allocation throws or
|
||||||
@@ -870,17 +892,6 @@ class stable_vector
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
//! <b>Effects</b>: Assigns the n copies of val to *this.
|
|
||||||
//!
|
|
||||||
//! <b>Throws</b>: If memory allocation throws or T's copy constructor throws.
|
|
||||||
//!
|
|
||||||
//! <b>Complexity</b>: Linear to n.
|
|
||||||
void assign(size_type n, const T& t)
|
|
||||||
{
|
|
||||||
typedef constant_iterator<value_type, difference_type> cvalue_iterator;
|
|
||||||
this->assign(cvalue_iterator(t, n), cvalue_iterator());
|
|
||||||
}
|
|
||||||
|
|
||||||
//! <b>Effects</b>: Returns a copy of the internal allocator.
|
//! <b>Effects</b>: Returns a copy of the internal allocator.
|
||||||
//!
|
//!
|
||||||
//! <b>Throws</b>: If allocator's copy constructor throws.
|
//! <b>Throws</b>: If allocator's copy constructor throws.
|
||||||
@@ -909,6 +920,12 @@ class stable_vector
|
|||||||
stored_allocator_type &get_stored_allocator() BOOST_CONTAINER_NOEXCEPT
|
stored_allocator_type &get_stored_allocator() BOOST_CONTAINER_NOEXCEPT
|
||||||
{ return this->priv_node_alloc(); }
|
{ return this->priv_node_alloc(); }
|
||||||
|
|
||||||
|
//////////////////////////////////////////////
|
||||||
|
//
|
||||||
|
// iterators
|
||||||
|
//
|
||||||
|
//////////////////////////////////////////////
|
||||||
|
|
||||||
//! <b>Effects</b>: Returns an iterator to the first element contained in the stable_vector.
|
//! <b>Effects</b>: Returns an iterator to the first element contained in the stable_vector.
|
||||||
//!
|
//!
|
||||||
//! <b>Throws</b>: Nothing.
|
//! <b>Throws</b>: Nothing.
|
||||||
@@ -1011,6 +1028,20 @@ class stable_vector
|
|||||||
const_reverse_iterator crend()const
|
const_reverse_iterator crend()const
|
||||||
{ return this->rend(); }
|
{ return this->rend(); }
|
||||||
|
|
||||||
|
//////////////////////////////////////////////
|
||||||
|
//
|
||||||
|
// capacity
|
||||||
|
//
|
||||||
|
//////////////////////////////////////////////
|
||||||
|
|
||||||
|
//! <b>Effects</b>: Returns true if the stable_vector contains no elements.
|
||||||
|
//!
|
||||||
|
//! <b>Throws</b>: Nothing.
|
||||||
|
//!
|
||||||
|
//! <b>Complexity</b>: Constant.
|
||||||
|
bool empty() const
|
||||||
|
{ return this->index.size() <= ExtraPointers; }
|
||||||
|
|
||||||
//! <b>Effects</b>: Returns the number of the elements contained in the stable_vector.
|
//! <b>Effects</b>: Returns the number of the elements contained in the stable_vector.
|
||||||
//!
|
//!
|
||||||
//! <b>Throws</b>: Nothing.
|
//! <b>Throws</b>: Nothing.
|
||||||
@@ -1030,31 +1061,22 @@ class stable_vector
|
|||||||
size_type max_size() const
|
size_type max_size() const
|
||||||
{ return this->index.max_size() - ExtraPointers; }
|
{ return this->index.max_size() - ExtraPointers; }
|
||||||
|
|
||||||
//! <b>Effects</b>: Number of elements for which memory has been allocated.
|
//! <b>Effects</b>: Inserts or erases elements at the end such that
|
||||||
//! capacity() is always greater than or equal to size().
|
//! the size becomes n. New elements are default constructed.
|
||||||
//!
|
//!
|
||||||
//! <b>Throws</b>: Nothing.
|
//! <b>Throws</b>: If memory allocation throws, or T's copy constructor throws.
|
||||||
//!
|
//!
|
||||||
//! <b>Complexity</b>: Constant.
|
//! <b>Complexity</b>: Linear to the difference between size() and new_size.
|
||||||
size_type capacity() const
|
void resize(size_type n)
|
||||||
{
|
{
|
||||||
const size_type index_size = this->index.size();
|
typedef default_construct_iterator<value_type, difference_type> default_iterator;
|
||||||
BOOST_ASSERT(!index_size || index_size >= ExtraPointers);
|
STABLE_VECTOR_CHECK_INVARIANT;
|
||||||
const size_type bucket_extra_capacity = this->index.capacity()- index_size;
|
if(n > this->size())
|
||||||
const size_type node_extra_capacity = this->internal_data.pool_size;
|
this->insert(this->cend(), default_iterator(n - this->size()), default_iterator());
|
||||||
const size_type extra_capacity = (bucket_extra_capacity < node_extra_capacity)
|
else if(n < this->size())
|
||||||
? bucket_extra_capacity : node_extra_capacity;
|
this->erase(this->cbegin() + n, this->cend());
|
||||||
return (index_size ? (index_size - ExtraPointers + extra_capacity) : index_size);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
//! <b>Effects</b>: Returns true if the stable_vector contains no elements.
|
|
||||||
//!
|
|
||||||
//! <b>Throws</b>: Nothing.
|
|
||||||
//!
|
|
||||||
//! <b>Complexity</b>: Constant.
|
|
||||||
bool empty() const
|
|
||||||
{ return this->index.size() <= ExtraPointers; }
|
|
||||||
|
|
||||||
//! <b>Effects</b>: Inserts or erases elements at the end such that
|
//! <b>Effects</b>: Inserts or erases elements at the end such that
|
||||||
//! the size becomes n. New elements are copy constructed from x.
|
//! the size becomes n. New elements are copy constructed from x.
|
||||||
//!
|
//!
|
||||||
@@ -1070,20 +1092,21 @@ class stable_vector
|
|||||||
this->erase(this->cbegin() + n, this->cend());
|
this->erase(this->cbegin() + n, this->cend());
|
||||||
}
|
}
|
||||||
|
|
||||||
//! <b>Effects</b>: Inserts or erases elements at the end such that
|
//! <b>Effects</b>: Number of elements for which memory has been allocated.
|
||||||
//! the size becomes n. New elements are default constructed.
|
//! capacity() is always greater than or equal to size().
|
||||||
//!
|
//!
|
||||||
//! <b>Throws</b>: If memory allocation throws, or T's copy constructor throws.
|
//! <b>Throws</b>: Nothing.
|
||||||
//!
|
//!
|
||||||
//! <b>Complexity</b>: Linear to the difference between size() and new_size.
|
//! <b>Complexity</b>: Constant.
|
||||||
void resize(size_type n)
|
size_type capacity() const
|
||||||
{
|
{
|
||||||
typedef default_construct_iterator<value_type, difference_type> default_iterator;
|
const size_type index_size = this->index.size();
|
||||||
STABLE_VECTOR_CHECK_INVARIANT;
|
BOOST_ASSERT(!index_size || index_size >= ExtraPointers);
|
||||||
if(n > this->size())
|
const size_type bucket_extra_capacity = this->index.capacity()- index_size;
|
||||||
this->insert(this->cend(), default_iterator(n - this->size()), default_iterator());
|
const size_type node_extra_capacity = this->internal_data.pool_size;
|
||||||
else if(n < this->size())
|
const size_type extra_capacity = (bucket_extra_capacity < node_extra_capacity)
|
||||||
this->erase(this->cbegin() + n, this->cend());
|
? bucket_extra_capacity : node_extra_capacity;
|
||||||
|
return (index_size ? (index_size - ExtraPointers + extra_capacity) : index_size);
|
||||||
}
|
}
|
||||||
|
|
||||||
//! <b>Effects</b>: If n is less than or equal to capacity(), this call has no
|
//! <b>Effects</b>: If n is less than or equal to capacity(), this call has no
|
||||||
@@ -1116,6 +1139,86 @@ class stable_vector
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
//! <b>Effects</b>: Tries to deallocate the excess of memory created
|
||||||
|
//! with previous allocations. The size of the stable_vector is unchanged
|
||||||
|
//!
|
||||||
|
//! <b>Throws</b>: If memory allocation throws.
|
||||||
|
//!
|
||||||
|
//! <b>Complexity</b>: Linear to size().
|
||||||
|
void shrink_to_fit()
|
||||||
|
{
|
||||||
|
if(this->capacity()){
|
||||||
|
//First empty allocated node pool
|
||||||
|
this->priv_clear_pool();
|
||||||
|
//If empty completely destroy the index, let's recover default-constructed state
|
||||||
|
if(this->empty()){
|
||||||
|
this->index.clear();
|
||||||
|
this->index.shrink_to_fit();
|
||||||
|
this->internal_data.end_node.up = node_base_ptr_ptr();
|
||||||
|
}
|
||||||
|
//Otherwise, try to shrink-to-fit the index and readjust pointers if necessary
|
||||||
|
else{
|
||||||
|
const void* old_ptr = &index[0];
|
||||||
|
this->index.shrink_to_fit();
|
||||||
|
bool realloced = &index[0] != old_ptr;
|
||||||
|
//Fix the pointers for the newly allocated buffer
|
||||||
|
if(realloced){
|
||||||
|
index_traits_type::fix_up_pointers_from(this->index, this->index.begin());
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
//////////////////////////////////////////////
|
||||||
|
//
|
||||||
|
// element access
|
||||||
|
//
|
||||||
|
//////////////////////////////////////////////
|
||||||
|
|
||||||
|
//! <b>Requires</b>: !empty()
|
||||||
|
//!
|
||||||
|
//! <b>Effects</b>: Returns a reference to the first
|
||||||
|
//! element of the container.
|
||||||
|
//!
|
||||||
|
//! <b>Throws</b>: Nothing.
|
||||||
|
//!
|
||||||
|
//! <b>Complexity</b>: Constant.
|
||||||
|
reference front()
|
||||||
|
{ return static_cast<node_reference>(*this->index.front()).value; }
|
||||||
|
|
||||||
|
//! <b>Requires</b>: !empty()
|
||||||
|
//!
|
||||||
|
//! <b>Effects</b>: Returns a const reference to the first
|
||||||
|
//! element of the container.
|
||||||
|
//!
|
||||||
|
//! <b>Throws</b>: Nothing.
|
||||||
|
//!
|
||||||
|
//! <b>Complexity</b>: Constant.
|
||||||
|
const_reference front() const
|
||||||
|
{ return static_cast<const_node_reference>(*this->index.front()).value; }
|
||||||
|
|
||||||
|
//! <b>Requires</b>: !empty()
|
||||||
|
//!
|
||||||
|
//! <b>Effects</b>: Returns a reference to the last
|
||||||
|
//! element of the container.
|
||||||
|
//!
|
||||||
|
//! <b>Throws</b>: Nothing.
|
||||||
|
//!
|
||||||
|
//! <b>Complexity</b>: Constant.
|
||||||
|
reference back()
|
||||||
|
{ return static_cast<node_reference>(*this->index[this->size() - ExtraPointers]).value; }
|
||||||
|
|
||||||
|
//! <b>Requires</b>: !empty()
|
||||||
|
//!
|
||||||
|
//! <b>Effects</b>: Returns a const reference to the last
|
||||||
|
//! element of the container.
|
||||||
|
//!
|
||||||
|
//! <b>Throws</b>: Nothing.
|
||||||
|
//!
|
||||||
|
//! <b>Complexity</b>: Constant.
|
||||||
|
const_reference back()const
|
||||||
|
{ return static_cast<const_node_reference>(*this->index[this->size() - ExtraPointers]).value; }
|
||||||
|
|
||||||
//! <b>Requires</b>: size() > n.
|
//! <b>Requires</b>: size() > n.
|
||||||
//!
|
//!
|
||||||
//! <b>Effects</b>: Returns a reference to the nth element
|
//! <b>Effects</b>: Returns a reference to the nth element
|
||||||
@@ -1168,49 +1271,86 @@ class stable_vector
|
|||||||
return operator[](n);
|
return operator[](n);
|
||||||
}
|
}
|
||||||
|
|
||||||
//! <b>Requires</b>: !empty()
|
//////////////////////////////////////////////
|
||||||
//!
|
//
|
||||||
//! <b>Effects</b>: Returns a reference to the first
|
// modifiers
|
||||||
//! element of the container.
|
//
|
||||||
//!
|
//////////////////////////////////////////////
|
||||||
//! <b>Throws</b>: Nothing.
|
|
||||||
//!
|
|
||||||
//! <b>Complexity</b>: Constant.
|
|
||||||
reference front()
|
|
||||||
{ return static_cast<node_reference>(*this->index.front()).value; }
|
|
||||||
|
|
||||||
//! <b>Requires</b>: !empty()
|
#if defined(BOOST_CONTAINER_PERFECT_FORWARDING) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
|
||||||
//!
|
|
||||||
//! <b>Effects</b>: Returns a const reference to the first
|
|
||||||
//! element of the container.
|
|
||||||
//!
|
|
||||||
//! <b>Throws</b>: Nothing.
|
|
||||||
//!
|
|
||||||
//! <b>Complexity</b>: Constant.
|
|
||||||
const_reference front() const
|
|
||||||
{ return static_cast<const_node_reference>(*this->index.front()).value; }
|
|
||||||
|
|
||||||
//! <b>Requires</b>: !empty()
|
//! <b>Effects</b>: Inserts an object of type T constructed with
|
||||||
|
//! std::forward<Args>(args)... in the end of the stable_vector.
|
||||||
//!
|
//!
|
||||||
//! <b>Effects</b>: Returns a reference to the last
|
//! <b>Throws</b>: If memory allocation throws or the in-place constructor throws.
|
||||||
//! element of the container.
|
|
||||||
//!
|
//!
|
||||||
//! <b>Throws</b>: Nothing.
|
//! <b>Complexity</b>: Amortized constant time.
|
||||||
//!
|
template<class ...Args>
|
||||||
//! <b>Complexity</b>: Constant.
|
void emplace_back(Args &&...args)
|
||||||
reference back()
|
{
|
||||||
{ return static_cast<node_reference>(*this->index[this->size() - ExtraPointers]).value; }
|
typedef emplace_functor<Args...> EmplaceFunctor;
|
||||||
|
typedef emplace_iterator<value_type, EmplaceFunctor, difference_type> EmplaceIterator;
|
||||||
|
EmplaceFunctor &&ef = EmplaceFunctor(boost::forward<Args>(args)...);
|
||||||
|
this->insert(this->cend(), EmplaceIterator(ef), EmplaceIterator());
|
||||||
|
}
|
||||||
|
|
||||||
//! <b>Requires</b>: !empty()
|
//! <b>Requires</b>: position must be a valid iterator of *this.
|
||||||
//!
|
//!
|
||||||
//! <b>Effects</b>: Returns a const reference to the last
|
//! <b>Effects</b>: Inserts an object of type T constructed with
|
||||||
//! element of the container.
|
//! std::forward<Args>(args)... before position
|
||||||
//!
|
//!
|
||||||
//! <b>Throws</b>: Nothing.
|
//! <b>Throws</b>: If memory allocation throws or the in-place constructor throws.
|
||||||
//!
|
//!
|
||||||
//! <b>Complexity</b>: Constant.
|
//! <b>Complexity</b>: If position is end(), amortized constant time
|
||||||
const_reference back()const
|
//! Linear time otherwise.
|
||||||
{ return static_cast<const_node_reference>(*this->index[this->size() - ExtraPointers]).value; }
|
template<class ...Args>
|
||||||
|
iterator emplace(const_iterator position, Args && ...args)
|
||||||
|
{
|
||||||
|
//Just call more general insert(pos, size, value) and return iterator
|
||||||
|
size_type pos_n = position - cbegin();
|
||||||
|
typedef emplace_functor<Args...> EmplaceFunctor;
|
||||||
|
typedef emplace_iterator<value_type, EmplaceFunctor, difference_type> EmplaceIterator;
|
||||||
|
EmplaceFunctor &&ef = EmplaceFunctor(boost::forward<Args>(args)...);
|
||||||
|
this->insert(position, EmplaceIterator(ef), EmplaceIterator());
|
||||||
|
return iterator(this->begin() + pos_n);
|
||||||
|
}
|
||||||
|
|
||||||
|
#else
|
||||||
|
|
||||||
|
#define BOOST_PP_LOCAL_MACRO(n) \
|
||||||
|
BOOST_PP_EXPR_IF(n, template<) BOOST_PP_ENUM_PARAMS(n, class P) BOOST_PP_EXPR_IF(n, >) \
|
||||||
|
void emplace_back(BOOST_PP_ENUM(n, BOOST_CONTAINER_PP_PARAM_LIST, _)) \
|
||||||
|
{ \
|
||||||
|
typedef BOOST_PP_CAT(BOOST_PP_CAT(emplace_functor, n), arg) \
|
||||||
|
BOOST_PP_EXPR_IF(n, <) BOOST_PP_ENUM_PARAMS(n, P) BOOST_PP_EXPR_IF(n, >) \
|
||||||
|
EmplaceFunctor; \
|
||||||
|
typedef emplace_iterator<value_type, EmplaceFunctor, difference_type> EmplaceIterator; \
|
||||||
|
EmplaceFunctor ef BOOST_PP_LPAREN_IF(n) \
|
||||||
|
BOOST_PP_ENUM(n, BOOST_CONTAINER_PP_PARAM_FORWARD, _) \
|
||||||
|
BOOST_PP_RPAREN_IF(n); \
|
||||||
|
this->insert(this->cend() , EmplaceIterator(ef), EmplaceIterator()); \
|
||||||
|
} \
|
||||||
|
\
|
||||||
|
BOOST_PP_EXPR_IF(n, template<) BOOST_PP_ENUM_PARAMS(n, class P) BOOST_PP_EXPR_IF(n, >) \
|
||||||
|
iterator emplace(const_iterator pos \
|
||||||
|
BOOST_PP_ENUM_TRAILING(n, BOOST_CONTAINER_PP_PARAM_LIST, _)) \
|
||||||
|
{ \
|
||||||
|
typedef BOOST_PP_CAT(BOOST_PP_CAT(emplace_functor, n), arg) \
|
||||||
|
BOOST_PP_EXPR_IF(n, <) BOOST_PP_ENUM_PARAMS(n, P) BOOST_PP_EXPR_IF(n, >) \
|
||||||
|
EmplaceFunctor; \
|
||||||
|
typedef emplace_iterator<value_type, EmplaceFunctor, difference_type> EmplaceIterator; \
|
||||||
|
EmplaceFunctor ef BOOST_PP_LPAREN_IF(n) \
|
||||||
|
BOOST_PP_ENUM(n, BOOST_CONTAINER_PP_PARAM_FORWARD, _) \
|
||||||
|
BOOST_PP_RPAREN_IF(n); \
|
||||||
|
size_type pos_n = pos - this->cbegin(); \
|
||||||
|
this->insert(pos, EmplaceIterator(ef), EmplaceIterator()); \
|
||||||
|
return iterator(this->begin() + pos_n); \
|
||||||
|
} \
|
||||||
|
//!
|
||||||
|
#define BOOST_PP_LOCAL_LIMITS (0, BOOST_CONTAINER_MAX_CONSTRUCTOR_PARAMETERS)
|
||||||
|
#include BOOST_PP_LOCAL_ITERATE()
|
||||||
|
|
||||||
|
#endif //#ifdef BOOST_CONTAINER_PERFECT_FORWARDING
|
||||||
|
|
||||||
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
|
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
|
||||||
//! <b>Effects</b>: Inserts a copy of x at the end of the stable_vector.
|
//! <b>Effects</b>: Inserts a copy of x at the end of the stable_vector.
|
||||||
@@ -1232,16 +1372,6 @@ class stable_vector
|
|||||||
BOOST_MOVE_CONVERSION_AWARE_CATCH(push_back, T, void, priv_push_back)
|
BOOST_MOVE_CONVERSION_AWARE_CATCH(push_back, T, void, priv_push_back)
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
//! <b>Effects</b>: Removes the last element from the stable_vector.
|
|
||||||
//!
|
|
||||||
//! <b>Throws</b>: Nothing.
|
|
||||||
//!
|
|
||||||
//! <b>Complexity</b>: Constant time.
|
|
||||||
void pop_back()
|
|
||||||
{ this->erase(this->end()-1); }
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
|
#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
|
||||||
//! <b>Requires</b>: position must be a valid iterator of *this.
|
//! <b>Requires</b>: position must be a valid iterator of *this.
|
||||||
//!
|
//!
|
||||||
@@ -1355,80 +1485,13 @@ class stable_vector
|
|||||||
}
|
}
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
#if defined(BOOST_CONTAINER_PERFECT_FORWARDING) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
|
//! <b>Effects</b>: Removes the last element from the stable_vector.
|
||||||
|
|
||||||
//! <b>Effects</b>: Inserts an object of type T constructed with
|
|
||||||
//! std::forward<Args>(args)... in the end of the stable_vector.
|
|
||||||
//!
|
//!
|
||||||
//! <b>Throws</b>: If memory allocation throws or the in-place constructor throws.
|
//! <b>Throws</b>: Nothing.
|
||||||
//!
|
//!
|
||||||
//! <b>Complexity</b>: Amortized constant time.
|
//! <b>Complexity</b>: Constant time.
|
||||||
template<class ...Args>
|
void pop_back()
|
||||||
void emplace_back(Args &&...args)
|
{ this->erase(--this->cend()); }
|
||||||
{
|
|
||||||
typedef emplace_functor<Args...> EmplaceFunctor;
|
|
||||||
typedef emplace_iterator<value_type, EmplaceFunctor, difference_type> EmplaceIterator;
|
|
||||||
EmplaceFunctor &&ef = EmplaceFunctor(boost::forward<Args>(args)...);
|
|
||||||
this->insert(this->cend(), EmplaceIterator(ef), EmplaceIterator());
|
|
||||||
}
|
|
||||||
|
|
||||||
//! <b>Requires</b>: position must be a valid iterator of *this.
|
|
||||||
//!
|
|
||||||
//! <b>Effects</b>: Inserts an object of type T constructed with
|
|
||||||
//! std::forward<Args>(args)... before position
|
|
||||||
//!
|
|
||||||
//! <b>Throws</b>: If memory allocation throws or the in-place constructor throws.
|
|
||||||
//!
|
|
||||||
//! <b>Complexity</b>: If position is end(), amortized constant time
|
|
||||||
//! Linear time otherwise.
|
|
||||||
template<class ...Args>
|
|
||||||
iterator emplace(const_iterator position, Args && ...args)
|
|
||||||
{
|
|
||||||
//Just call more general insert(pos, size, value) and return iterator
|
|
||||||
size_type pos_n = position - cbegin();
|
|
||||||
typedef emplace_functor<Args...> EmplaceFunctor;
|
|
||||||
typedef emplace_iterator<value_type, EmplaceFunctor, difference_type> EmplaceIterator;
|
|
||||||
EmplaceFunctor &&ef = EmplaceFunctor(boost::forward<Args>(args)...);
|
|
||||||
this->insert(position, EmplaceIterator(ef), EmplaceIterator());
|
|
||||||
return iterator(this->begin() + pos_n);
|
|
||||||
}
|
|
||||||
|
|
||||||
#else
|
|
||||||
|
|
||||||
#define BOOST_PP_LOCAL_MACRO(n) \
|
|
||||||
BOOST_PP_EXPR_IF(n, template<) BOOST_PP_ENUM_PARAMS(n, class P) BOOST_PP_EXPR_IF(n, >) \
|
|
||||||
void emplace_back(BOOST_PP_ENUM(n, BOOST_CONTAINER_PP_PARAM_LIST, _)) \
|
|
||||||
{ \
|
|
||||||
typedef BOOST_PP_CAT(BOOST_PP_CAT(emplace_functor, n), arg) \
|
|
||||||
BOOST_PP_EXPR_IF(n, <) BOOST_PP_ENUM_PARAMS(n, P) BOOST_PP_EXPR_IF(n, >) \
|
|
||||||
EmplaceFunctor; \
|
|
||||||
typedef emplace_iterator<value_type, EmplaceFunctor, difference_type> EmplaceIterator; \
|
|
||||||
EmplaceFunctor ef BOOST_PP_LPAREN_IF(n) \
|
|
||||||
BOOST_PP_ENUM(n, BOOST_CONTAINER_PP_PARAM_FORWARD, _) \
|
|
||||||
BOOST_PP_RPAREN_IF(n); \
|
|
||||||
this->insert(this->cend() , EmplaceIterator(ef), EmplaceIterator()); \
|
|
||||||
} \
|
|
||||||
\
|
|
||||||
BOOST_PP_EXPR_IF(n, template<) BOOST_PP_ENUM_PARAMS(n, class P) BOOST_PP_EXPR_IF(n, >) \
|
|
||||||
iterator emplace(const_iterator pos \
|
|
||||||
BOOST_PP_ENUM_TRAILING(n, BOOST_CONTAINER_PP_PARAM_LIST, _)) \
|
|
||||||
{ \
|
|
||||||
typedef BOOST_PP_CAT(BOOST_PP_CAT(emplace_functor, n), arg) \
|
|
||||||
BOOST_PP_EXPR_IF(n, <) BOOST_PP_ENUM_PARAMS(n, P) BOOST_PP_EXPR_IF(n, >) \
|
|
||||||
EmplaceFunctor; \
|
|
||||||
typedef emplace_iterator<value_type, EmplaceFunctor, difference_type> EmplaceIterator; \
|
|
||||||
EmplaceFunctor ef BOOST_PP_LPAREN_IF(n) \
|
|
||||||
BOOST_PP_ENUM(n, BOOST_CONTAINER_PP_PARAM_FORWARD, _) \
|
|
||||||
BOOST_PP_RPAREN_IF(n); \
|
|
||||||
size_type pos_n = pos - this->cbegin(); \
|
|
||||||
this->insert(pos, EmplaceIterator(ef), EmplaceIterator()); \
|
|
||||||
return iterator(this->begin() + pos_n); \
|
|
||||||
} \
|
|
||||||
//!
|
|
||||||
#define BOOST_PP_LOCAL_LIMITS (0, BOOST_CONTAINER_MAX_CONSTRUCTOR_PARAMETERS)
|
|
||||||
#include BOOST_PP_LOCAL_ITERATE()
|
|
||||||
|
|
||||||
#endif //#ifdef BOOST_CONTAINER_PERFECT_FORWARDING
|
|
||||||
|
|
||||||
//! <b>Effects</b>: Erases the element at position pos.
|
//! <b>Effects</b>: Erases the element at position pos.
|
||||||
//!
|
//!
|
||||||
@@ -1491,36 +1554,6 @@ class stable_vector
|
|||||||
void clear()
|
void clear()
|
||||||
{ this->erase(this->cbegin(),this->cend()); }
|
{ this->erase(this->cbegin(),this->cend()); }
|
||||||
|
|
||||||
//! <b>Effects</b>: Tries to deallocate the excess of memory created
|
|
||||||
//! with previous allocations. The size of the stable_vector is unchanged
|
|
||||||
//!
|
|
||||||
//! <b>Throws</b>: If memory allocation throws.
|
|
||||||
//!
|
|
||||||
//! <b>Complexity</b>: Linear to size().
|
|
||||||
void shrink_to_fit()
|
|
||||||
{
|
|
||||||
if(this->capacity()){
|
|
||||||
//First empty allocated node pool
|
|
||||||
this->priv_clear_pool();
|
|
||||||
//If empty completely destroy the index, let's recover default-constructed state
|
|
||||||
if(this->empty()){
|
|
||||||
this->index.clear();
|
|
||||||
this->index.shrink_to_fit();
|
|
||||||
this->internal_data.end_node.up = node_base_ptr_ptr();
|
|
||||||
}
|
|
||||||
//Otherwise, try to shrink-to-fit the index and readjust pointers if necessary
|
|
||||||
else{
|
|
||||||
const void* old_ptr = &index[0];
|
|
||||||
this->index.shrink_to_fit();
|
|
||||||
bool realloced = &index[0] != old_ptr;
|
|
||||||
//Fix the pointers for the newly allocated buffer
|
|
||||||
if(realloced){
|
|
||||||
index_traits_type::fix_up_pointers_from(this->index, this->index.begin());
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/// @cond
|
/// @cond
|
||||||
|
|
||||||
private:
|
private:
|
||||||
|
File diff suppressed because it is too large
Load Diff
109
proj/to-do.txt
109
proj/to-do.txt
@@ -51,4 +51,111 @@ change virtual functions with pointers to avoid template instantiation for every
|
|||||||
|
|
||||||
Add hash for containers
|
Add hash for containers
|
||||||
|
|
||||||
Add std:: hashing support
|
Add std:: hashing support
|
||||||
|
|
||||||
|
Take out from class definition iterators in slist & list
|
||||||
|
|
||||||
|
Fix trivial destructor after move and other optimizing traits
|
||||||
|
|
||||||
|
Define typedefs exactly like the standard to generate better documentation. for implementation defined types:
|
||||||
|
#if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
|
||||||
|
#define BOOST_CONTAINER_IMPLDEF(TYPE) TYPE
|
||||||
|
#else
|
||||||
|
#define BOOST_CONTAINER_IMPLDEF(TYPE) implementation_defined
|
||||||
|
#endif
|
||||||
|
Mark previous() in slist/and forward_list as non-standard
|
||||||
|
|
||||||
|
Replace all insert_const_ref_type with BOOST_MOVE_CONVERSION_AWARE_CATCH_XXX
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
Function order:
|
||||||
|
|
||||||
|
----------type------------
|
||||||
|
value_type;
|
||||||
|
pointer;
|
||||||
|
const_pointer;
|
||||||
|
reference;
|
||||||
|
const_reference;
|
||||||
|
size_type;
|
||||||
|
difference_type;
|
||||||
|
allocator_type;
|
||||||
|
stored_allocator_type;
|
||||||
|
iterator;
|
||||||
|
const_iterator;
|
||||||
|
reverse_iterator;
|
||||||
|
const_reverse_iterator;
|
||||||
|
----------func------------
|
||||||
|
container()
|
||||||
|
container(allocator_type)
|
||||||
|
container(size_type)
|
||||||
|
container(size_type, value_type, allocator_type = ())
|
||||||
|
container(InpIt, InpIt)
|
||||||
|
container(const container &)
|
||||||
|
container(container &&)
|
||||||
|
container(const container &, allocator_type)
|
||||||
|
container(container &&, allocator_type)
|
||||||
|
container(initializer_list<T>, allocator)
|
||||||
|
~container()
|
||||||
|
container operator=(const container &)
|
||||||
|
container operator=(container &&)
|
||||||
|
container operator=(initializer_list<T>)
|
||||||
|
assign(size_type, const T &)
|
||||||
|
|
||||||
|
assign(InpIt, InptIt)
|
||||||
|
assign(initializer_list)
|
||||||
|
get_allocator()
|
||||||
|
|
||||||
|
begin()
|
||||||
|
begin() const
|
||||||
|
end()
|
||||||
|
end() const
|
||||||
|
rbegin()
|
||||||
|
rbegin() const
|
||||||
|
rend()
|
||||||
|
rend() const
|
||||||
|
|
||||||
|
cbegin() const
|
||||||
|
cend() const
|
||||||
|
crbegin() const
|
||||||
|
crend() const
|
||||||
|
|
||||||
|
empty()
|
||||||
|
size()
|
||||||
|
max_size()
|
||||||
|
resize(size_type)
|
||||||
|
resize(size_type, cont T&)
|
||||||
|
capacity()
|
||||||
|
reserve(size_type)
|
||||||
|
shrink_to_fit()
|
||||||
|
|
||||||
|
front()
|
||||||
|
front() const
|
||||||
|
back()
|
||||||
|
back() const
|
||||||
|
operator[] ()
|
||||||
|
operator[] ()const
|
||||||
|
at()
|
||||||
|
at() const
|
||||||
|
|
||||||
|
|
||||||
|
data()
|
||||||
|
data() const
|
||||||
|
|
||||||
|
emplace_front()
|
||||||
|
emplace_back()
|
||||||
|
emplace()
|
||||||
|
push_front(const T&)
|
||||||
|
push_front(T&&)
|
||||||
|
push_back(const T&)
|
||||||
|
push_back(T&&)
|
||||||
|
insert(iterator, const T &)
|
||||||
|
insert(iterator, T &&)
|
||||||
|
insert(size_type, const T &)
|
||||||
|
insert(InpIt, InpIt)
|
||||||
|
pop_front()
|
||||||
|
pop_back()
|
||||||
|
erase(const_iterator)
|
||||||
|
erase(const_iterator, const_iterator)
|
||||||
|
swap(container &)
|
||||||
|
clear()
|
Reference in New Issue
Block a user