diff options
Diffstat (limited to 'boost/container/small_vector.hpp')
-rw-r--r-- | boost/container/small_vector.hpp | 12 |
1 files changed, 8 insertions, 4 deletions
diff --git a/boost/container/small_vector.hpp b/boost/container/small_vector.hpp index 7ef0c238a3..a9f7522205 100644 --- a/boost/container/small_vector.hpp +++ b/boost/container/small_vector.hpp @@ -60,7 +60,7 @@ class small_vector_base; //! for documentation purposes. //! //! This allocator inherits from a standard-conforming allocator -//! and forwards member functiond to the standard allocator except +//! and forwards member functions to the standard allocator except //! when internal storage is being used as memory source. //! //! This allocator is a "partially_propagable" allocator and @@ -68,7 +68,7 @@ class small_vector_base; //! //! A partially propagable allocator means that not all storage //! allocatod by an instance of `small_vector_allocator` can be -//! deallocated by another instance of this type, even is both +//! deallocated by another instance of this type, even if both //! instances compare equal or an instance is propagated to another //! one using the copy/move constructor or assignment. The storage that //! can never be propagated is identified by `storage_is_unpropagable(p)`. @@ -311,8 +311,12 @@ class small_vector_base : public vector<T, small_vector_allocator<SecondaryAllocator> > { #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED + public: + //Make it public as it will be inherited by small_vector and container + //must have this public member typedef typename allocator_traits<SecondaryAllocator>::pointer pointer; + private: BOOST_COPYABLE_AND_MOVABLE(small_vector_base) friend class small_vector_allocator<SecondaryAllocator>; @@ -428,8 +432,8 @@ struct small_vector_storage_definer #endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED -//! small_vector a vector-like container optimized for the case when it contains few elements. -//! It contains some preallocated elements in-place, which allows it to avoid the use of dynamic storage allocation +//! small_vector is a vector-like container optimized for the case when it contains few elements. +//! It contains some preallocated elements in-place, which can avoid the use of dynamic storage allocation //! when the actual number of elements is below that preallocated threshold. //! //! `small_vector<T, N, Allocator>` is convertible to `small_vector_base<T, Allocator>` that is independent |