[#bsl-vector-086] = xref:bsl.adoc[bsl]::xref:bsl/vector-00d.adoc[vector]<VALUE_TYPE*, ALLOCATOR> :relfileprefix: ../ :mrdocs: This partial specialization of `vector` for pointer types to a (template parameter) `VALUE_TYPE` type is implemented in terms of `vector<UintPtr>` to reduce the amount of code generated. Note that this specialization rebinds the (template parameter) `ALLOCATOR` type to an allocator of `UintPtr` so as to satisfy the invariant in the `vector` base class. Note that the contract for all members is the same as the primary template, so documentation is not repeated to avoid accidentally introducing inconsistency over time. == Synopsis Declared in `<bslstl_vector.h>` [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template< class VALUE_TYPE, class ALLOCATOR> class xref:bsl/vector-00d.adoc[vector]<VALUE_TYPE*, ALLOCATOR>; ---- == Type Aliases [cols="1"] |=== | Name | xref:bsl/vector-086/allocator_type.adoc[`allocator_type`] | xref:bsl/vector-086/const_iterator.adoc[`const_iterator`] | xref:bsl/vector-086/const_pointer.adoc[`const_pointer`] | xref:bsl/vector-086/const_reference.adoc[`const_reference`] | xref:bsl/vector-086/const_reverse_iterator.adoc[`const_reverse_iterator`] | xref:bsl/vector-086/difference_type.adoc[`difference_type`] | xref:bsl/vector-086/iterator.adoc[`iterator`] | xref:bsl/vector-086/pointer.adoc[`pointer`] | xref:bsl/vector-086/reference.adoc[`reference`] | xref:bsl/vector-086/reverse_iterator.adoc[`reverse_iterator`] | xref:bsl/vector-086/size_type.adoc[`size_type`] | xref:bsl/vector-086/value_type.adoc[`value_type`] |=== == Member Functions [cols="1,4"] |=== | Name| Description | xref:bsl/vector-086/2constructor-052.adoc[`vector`] [.small]#[constructor]# | | xref:bsl/vector-086/2destructor.adoc[`~vector`] [.small]#[destructor]# | | xref:bsl/vector-086/operator_assign-0ba.adoc[`operator=`] | NOTE: This function has been implemented inline due to an issue with the Sun compiler. | xref:bsl/vector-086/append_range.adoc[`append_range`] | | xref:bsl/vector-086/assign-0f.adoc[`assign`] | | xref:bsl/vector-086/assign_range.adoc[`assign_range`] | | xref:bsl/vector-086/at-0f.adoc[`at`] | | xref:bsl/vector-086/back-0b.adoc[`back`] | | xref:bsl/vector-086/begin-03.adoc[`begin`] | | xref:bsl/vector-086/capacity.adoc[`capacity`] | | xref:bsl/vector-086/cbegin.adoc[`cbegin`] | | xref:bsl/vector-086/cend.adoc[`cend`] | | xref:bsl/vector-086/clear.adoc[`clear`] | | xref:bsl/vector-086/crbegin.adoc[`crbegin`] | | xref:bsl/vector-086/crend.adoc[`crend`] | | xref:bsl/vector-086/data-00.adoc[`data`] | | xref:bsl/vector-086/emplace-0b.adoc[`emplace`] | | xref:bsl/vector-086/emplace_back-02.adoc[`emplace_back`] | | xref:bsl/vector-086/empty.adoc[`empty`] | | xref:bsl/vector-086/end-03.adoc[`end`] | | xref:bsl/vector-086/erase-00.adoc[`erase`] | | xref:bsl/vector-086/front-0f.adoc[`front`] | | xref:bsl/vector-086/get_allocator.adoc[`get_allocator`] | | xref:bsl/vector-086/insert-02.adoc[`insert`] | | xref:bsl/vector-086/insert_range.adoc[`insert_range`] | | xref:bsl/vector-086/max_size.adoc[`max_size`] | | xref:bsl/vector-086/operator_subs-0b.adoc[`operator[]`] | | xref:bsl/vector-086/pop_back.adoc[`pop_back`] | | xref:bsl/vector-086/push_back.adoc[`push_back`] | | xref:bsl/vector-086/rbegin-04.adoc[`rbegin`] | | xref:bsl/vector-086/rend-0f.adoc[`rend`] | | xref:bsl/vector-086/reserve.adoc[`reserve`] | | xref:bsl/vector-086/resize-0f.adoc[`resize`] | | xref:bsl/vector-086/shrink_to_fit.adoc[`shrink_to_fit`] | | xref:bsl/vector-086/size.adoc[`size`] | | xref:bsl/vector-086/swap.adoc[`swap`] | |=== == Friends [cols="1,4"] |=== | Name| Description | `xref:bsl/swap-05ca.adoc[bsl::swap]` | Exchange the values of the specified `a` and `b` objects. | `xref:bsl/operator_3way-037e.adoc[bsl::operator<=>]` | Perform a three‐way comparison of the specified `lhs` and `rhs` vectors and return the result of that comparison. | `xref:bsl/operator_eq-04a.adoc[bsl::operator==]` | Return `true` if the specified `lhs` and `rhs` vectors have the same value, and `false` otherwise. |=== [.small]#Created with https://www.mrdocs.com[MrDocs]#