Requires : p must be a valid iterator of *this. Effects : Insert n copies of x before pos. Returns : an iterator to the first inserted element or p if n is 0. Throws : If memory allocation throws or T's copy/move constructor throws. Complexity : Linear to n.
| 1965 | //! |
| 1966 | //! <b>Complexity</b>: Linear to n. |
| 1967 | BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, size_type n, const T& x) |
| 1968 | { |
| 1969 | BOOST_ASSERT(this->priv_in_range_or_end(p)); |
| 1970 | dtl::insert_n_copies_proxy<allocator_type, T*> proxy(x); |
| 1971 | return this->priv_insert_forward_range(vector_iterator_get_ptr(p), n, proxy); |
| 1972 | } |
| 1973 | |
| 1974 | //! <b>Requires</b>: p must be a valid iterator of *this. |
| 1975 | //! |
no outgoing calls