// Filename: stl_vector.h
// Comment By: 凝霜
// E-mail: mdl2009@vip.qq.com
// Blog: http://blog.csdn.net/mdl13412
/*
*
* Copyright (c) 1994
* Hewlett-Packard Company
*
* Permission to use, copy, modify, distribute and sell this software
* and its documentation for any purpose is hereby granted without fee,
* provided that the above copyright notice appear in all copies and
* that both that copyright notice and this permission notice appear
* in supporting documentation. Hewlett-Packard Company makes no
* representations about the suitability of this software for any
* purpose. It is provided "as is" without express or implied warranty.
*
*
* Copyright (c) 1996
* Silicon Graphics Computer Systems, Inc.
*
* Permission to use, copy, modify, distribute and sell this software
* and its documentation for any purpose is hereby granted without fee,
* provided that the above copyright notice appear in all copies and
* that both that copyright notice and this permission notice appear
* in supporting documentation. Silicon Graphics makes no
* representations about the suitability of this software for any
* purpose. It is provided "as is" without express or implied warranty.
*/
/* NOTE: This is an internal header file, included by other STL headers.
* You should not attempt to use it directly.
*/
#ifndef __SGI_STL_INTERNAL_VECTOR_H
#define __SGI_STL_INTERNAL_VECTOR_H
__STL_BEGIN_NAMESPACE
#if defined(__sgi) && !defined(__GNUC__) && (_MIPS_SIM != _MIPS_SIM_ABI32)
#pragma set woff 1174
#endif
////////////////////////////////////////////////////////////////////////////////
//
////////////////////////////////////////////////////////////////////////////////
// 預設allocator為alloc, 其具體使用版本請參照<stl_alloc.h>
template <class T, class Alloc = alloc>
class vector
{
public:
// 標記為'STL標準強制要求'的typedefs用於提供iterator_traits<I>支援
typedef T value_type; // STL標準強制要求
typedef value_type* pointer; // STL標準強制要求
typedef const value_type* const_pointer;
// 由於vector的特性, 一般我們實作的時候都分配給其連續的記憶體空間,
// 所以其迭代器只需要定義成原生指標即可滿足需要
typedef value_type* iterator; // STL標準強制要求
typedef const value_type* const_iterator;
typedef value_type& reference; // STL標準強制要求
typedef const value_type& const_reference;
typedef size_t size_type;
typedef ptrdiff_t difference_type; // STL標準強制要求
#ifdef __STL_CLASS_PARTIAL_SPECIALIZATION
typedef reverse_iterator<const_iterator> const_reverse_iterator;
typedef reverse_iterator<iterator> reverse_iterator;
#else /* __STL_CLASS_PARTIAL_SPECIALIZATION */
typedef reverse_iterator<const_iterator, value_type, const_reference,
difference_type> const_reverse_iterator;
typedef reverse_iterator<iterator, value_type, reference, difference_type>
reverse_iterator;
#endif /* __STL_CLASS_PARTIAL_SPECIALIZATION */
protected:
// 這個提供STL標準的allocator介面
typedef simple_alloc<value_type, Alloc> data_allocator;
iterator start; // 記憶體空間起始點
iterator finish; // 當前使用的記憶體空間結束點
iterator end_of_storage; // 實際分配記憶體空間的結束點
void insert_aux(iterator position, const T& x);
// 釋放分配的記憶體空間
void deallocate()
{
// 由於使用的是data_allocator進行記憶體空間的分配,
// 所以需要同樣嗲用data_allocator::deallocate()進行釋放
// 如果直接釋放, 對於data_allocator內部使用記憶體池的版本
// 就會發生錯誤
if (start) data_allocator::deallocate(start, end_of_storage - start);
}
void fill_initialize(size_type n, const T& value)
{
start = allocate_and_fill(n, value);
finish = start + n; // 設定當前使用記憶體空間的結束點
// 構造階段, 此實作不多分配記憶體,
// 所以要設定記憶體空間結束點和, 已經使用的記憶體空間結束點相同
end_of_storage = finish;
}
public:
// 獲取幾種迭代器
iterator begin() { return start; }
const_iterator begin() const { return start; }
iterator end() { return finish; }
const_iterator end() const { return finish; }
reverse_iterator rbegin() { return reverse_iterator(end()); }
const_reverse_iterator rbegin() const {
return const_reverse_iterator(end());
}
reverse_iterator rend() { return reverse_iterator(begin()); }
const_reverse_iterator rend() const {
return const_reverse_iterator(begin());
}
// 返回當前物件個數
size_type size() const { return size_type(end() - begin()); }
size_type max_size() const { return size_type(-1) / sizeof(T); }
// 返回重新分配記憶體前最多能儲存的物件個數
size_type capacity() const { return size_type(end_of_storage - begin()); }
bool empty() const { return begin() == end(); }
reference operator[](size_type n) { return *(begin() + n); }
const_reference operator[](size_type n) const { return *(begin() + n); }
// 本實作中預設構造出的vector不分配記憶體空間
vector() : start(0), finish(0), end_of_storage(0) {}
////////////////////////////////////////////////////////////////////////////////
// 本實作中給定個數和物件, 則只分配所需記憶體, 不會多分配
////////////////////////////////////////////////////////////////////////////////
// vector(size_type n, const T& value)
// ↓
// fill_initialize(n, value)
// ↓
// allocate_and_fill(n, value)
// ↓
// data_allocator::allocate(n) <stl_alloc.h>
// uninitialized_fill_n(result, n, x) <stl_uninitialized.h>
////////////////////////////////////////////////////////////////////////////////
vector(size_type n, const T& value) { fill_initialize(n, value); }
vector(int n, const T& value) { fill_initialize(n, value); }
vector(long n, const T& value) { fill_initialize(n, value); }
// 需要物件提供預設建構函式
explicit vector(size_type n) { fill_initialize(n, T()); }
////////////////////////////////////////////////////////////////////////////////
// 複製構造, 同樣不會多分配記憶體
////////////////////////////////////////////////////////////////////////////////
// vector(const vector<T, Alloc>& x)
// ↓
// allocate_and_copy(x.end() - x.begin(), x.begin(), x.end());
// ↓
// data_allocator::allocate(n) <stl_alloc.h>
// uninitialized_copy(first, last, result); <stl_uninitialized.h>
////////////////////////////////////////////////////////////////////////////////
vector(const vector<T, Alloc>& x)
{
start = allocate_and_copy(x.end() - x.begin(), x.begin(), x.end());
finish = start + (x.end() - x.begin());
end_of_storage = finish;
}
// 複製指定區間的元素, 同樣不多分配記憶體
#ifdef __STL_MEMBER_TEMPLATES
////////////////////////////////////////////////////////////////////////////////
// 複製一個區間進行構造, 可能會導致多分配記憶體
////////////////////////////////////////////////////////////////////////////////
// vector(InputIterator first, InputIterator last)
// ↓
// range_initialize(first, last, iterator_category(first));
// ↓
// for ( ; first != last; ++first)
// push_back(*first);
// 由於使用push_back()操作, 可能導致多次重複分配記憶體,個人感覺應該先
// data_allocator::allocate((last - first) * sizeof(T));
// 然後uninitialized_copy(first, last, result);
// 這樣不會多分配記憶體， 也不會導致多次重新分配記憶體問題
////////////////////////////////////////////////////////////////////////////////
template <class InputIterator>
vector(InputIterator first, InputIterator last) :
start(0), finish(0), end_of_storage(0)
{
range_initialize(first, last, iterator_category(first));
}
#else /* __STL_MEMBER_TEMPLATES */
////////////////////////////////////////////////////////////////////////////////
// 複製一個區間進行構造, 可能會導致多分配記憶體
////////////////////////////////////////////////////////////////////////////////
// vector(const_iterator first, const_iterator last)
// ↓
// distance(first, last, n);
// ↓
// allocate_and_copy(n, first, last);
// ↓
// data_allocator::allocate(n) <stl_alloc.h>
// uninitialized_copy(first, last, result); <stl_uninitialized.h>
////////////////////////////////////////////////////////////////////////////////
vector(const_iterator first, const_iterator last) {
size_type n = 0;
distance(first, last, n);
start = allocate_and_copy(n, first, last);
finish = start + n;
end_of_storage = finish;
}
#endif /* __STL_MEMBER_TEMPLATES */
~vector()
{
// 析構物件
destroy(start, finish);
// 釋放記憶體
deallocate();
}
vector<T, Alloc>& operator=(const vector<T, Alloc>& x);
////////////////////////////////////////////////////////////////////////////////
// 預留一定空間, 如果n < capacity(), 並不會減少空間
////////////////////////////////////////////////////////////////////////////////
// reserve(size_type n)
// ↓
// allocate_and_copy(n, start, finish)
// destroy(start, finish); <stl_construct.h>
// deallocate();
////////////////////////////////////////////////////////////////////////////////
void reserve(size_type n)
{
if (capacity() < n) {
const size_type old_size = size();
iterator tmp = allocate_and_copy(n, start, finish);
destroy(start, finish);
deallocate();
start = tmp;
finish = tmp + old_size;
end_of_storage = start + n;
}
}
// 提供訪問函式
reference front() { return *begin(); }
const_reference front() const { return *begin(); }
reference back() { return *(end() - 1); }
const_reference back() const { return *(end() - 1); }
////////////////////////////////////////////////////////////////////////////////
// 向容器尾追加一個元素, 可能導致記憶體重新分配
////////////////////////////////////////////////////////////////////////////////
// push_back(const T& x)
// |
// |---------------- 容量已滿?
// |
// ----------------------------
// No | | Yes
// | |
// ↓ ↓
// construct(finish, x); insert_aux(end(), x);
// ++finish; |
// |------ 記憶體不足, 重新分配
// | 大小為原來的2倍
// new_finish = data_allocator::allocate(len); <stl_alloc.h>
// uninitialized_copy(start, position, new_start); <stl_uninitialized.h>
// construct(new_finish, x); <stl_construct.h>
// ++new_finish;
// uninitialized_copy(position, finish, new_finish); <stl_uninitialized.h>
////////////////////////////////////////////////////////////////////////////////
void push_back(const T& x)
{
// 記憶體滿足條件則直接追加元素, 否則需要重新分配記憶體空間
if (finish != end_of_storage) {
construct(finish, x);
++finish;
}
else
insert_aux(end(), x);
}
// 交換兩個vector, 實際上是交換內部的狀態指標
void swap(vector<T, Alloc>& x)
{
__STD::swap(start, x.start);
__STD::swap(finish, x.finish);
__STD::swap(end_of_storage, x.end_of_storage);
}
////////////////////////////////////////////////////////////////////////////////
// 在指定位置插入元素
////////////////////////////////////////////////////////////////////////////////
// insert(iterator position, const T& x)
// |
// |------------ 容量是否足夠 && 是否是end()?
// |
// -------------------------------------------
// No | | Yes
// | |
// ↓ ↓
// insert_aux(position, x); construct(finish, x);
// | ++finish;
// |-------- 容量是否夠用?
// |
// --------------------------------------------------
// Yes | | No
// | |
// ↓ |
// construct(finish, *(finish - 1)); |
// ++finish; |
// T x_copy = x; |
// copy_backward(position, finish - 2, finish - 1); |
// *position = x_copy; |
// ↓
// data_allocator::allocate(len); <stl_alloc.h>
// uninitialized_copy(start, position, new_start); <stl_uninitialized.h>
// construct(new_finish, x); <stl_construct.h>
// ++new_finish;
// uninitialized_copy(position, finish, new_finish); <stl_uninitialized.h>
// destroy(begin(), end()); <stl_construct.h>
// deallocate();
////////////////////////////////////////////////////////////////////////////////
iterator insert(iterator position, const T& x)
{
size_type n = position - begin();
if (finish != end_of_storage && position == end()) {
construct(finish, x);
++finish;
}
else
insert_aux(position, x);
return begin() + n;
}
iterator insert(iterator position) { return insert(position, T()); }
#ifdef __STL_MEMBER_TEMPLATES
////////////////////////////////////////////////////////////////////////////////
// 在指定位置插入一個區間
////////////////////////////////////////////////////////////////////////////////
// insert(iterator position, InputIterator first, InputIterator last)
// ↓
// range_insert(position, first, last, iterator_category(first));
// ↓
// for ( ; first != last; ++first) {
// pos = insert(pos, *first);
// ++pos;
// }
////////////////////////////////////////////////////////////////////////////////
template <class InputIterator>
void insert(iterator position, InputIterator first, InputIterator last)
{
range_insert(position, first, last, iterator_category(first));
}
#else /* __STL_MEMBER_TEMPLATES */
void insert(iterator position,
const_iterator first, const_iterator last);
#endif /* __STL_MEMBER_TEMPLATES */
void insert (iterator pos, size_type n, const T& x);
void insert (iterator pos, int n, const T& x)
{
insert(pos, (size_type) n, x);
}
void insert (iterator pos, long n, const T& x)
{
insert(pos, (size_type) n, x);
}
void pop_back()
{
--finish;
destroy(finish);
}
iterator erase(iterator position)
{
if (position + 1 != end())
copy(position + 1, finish, position);
--finish;
destroy(finish);
return position;
}
////////////////////////////////////////////////////////////////////////////////
// 擦除指定區間的元素
////////////////////////////////////////////////////////////////////////////////
// erase(iterator first, iterator last)
// ↓
// ---------- copy(last, finish, first); <stl_algobase.h>
// | destroy(i, finish); <stl_construct.h>
// |
// | -------------- copy(...)
// | 特化 | char *特化 memmove()
// ---------------------------------------|
// | 泛化 | wchar_t特化 copy(...)
// | -------------- memmove()
// |
// 呼叫__copy_dispatch<InputIterator,OutputIterator>()(first, last, result);
// 進行__copy(first, last, result, iterator_category(first));派發
// |
// |
// | random_access_iterator_tag
// --------------------------------------------------------------
// | input_iterator_tag |
// | |
// ↓ |
// __copy(..., input_iterator_tag) |
// for ( ; first != last; ++result, ++first) |
// *result = *first; ↓
// __copy(..., random_access_iterator_tag)
// __copy_d(first, last, result, distance_type(first));
// |
// |
// ↓
// for (Distance n = last - first; n > 0; --n, ++result, ++first)
// *result = *first;
////////////////////////////////////////////////////////////////////////////////
iterator erase(iterator first, iterator last)
{
iterator i = copy(last, finish, first);
// 析構掉需要析構的元素
destroy(i, finish);
finish = finish - (last - first);
return first;
}
// 調整size, 但是並不會重新分配記憶體空間
void resize(size_type new_size, const T& x)
{
if (new_size < size())
erase(begin() + new_size, end());
else
insert(end(), new_size - size(), x);
}
void resize(size_type new_size) { resize(new_size, T()); }
void clear() { erase(begin(), end()); }
protected:
// 分配空間, 並且複製物件到分配的空間處
iterator allocate_and_fill(size_type n, const T& x)
{
iterator result = data_allocator::allocate(n);
__STL_TRY {
uninitialized_fill_n(result, n, x);
return result;
}
__STL_UNWIND(data_allocator::deallocate(result, n));
}
// 分配空間並且拷貝一個區間的元素到新分配空間處
#ifdef __STL_MEMBER_TEMPLATES
template <class ForwardIterator>
iterator allocate_and_copy(size_type n,
ForwardIterator first, ForwardIterator last)
{
iterator result = data_allocator::allocate(n);
__STL_TRY {
uninitialized_copy(first, last, result);
return result;
}
__STL_UNWIND(data_allocator::deallocate(result, n));
}
#else /* __STL_MEMBER_TEMPLATES */
iterator allocate_and_copy(size_type n,
const_iterator first, const_iterator last)
{
iterator result = data_allocator::allocate(n);
__STL_TRY {
uninitialized_copy(first, last, result);
return result;
}
__STL_UNWIND(data_allocator::deallocate(result, n));
}
#endif /* __STL_MEMBER_TEMPLATES */
#ifdef __STL_MEMBER_TEMPLATES
// 初始化一個區間, 使用push_back()操作, 可能引發記憶體多次重新分配
// 解決方案見
// template <class InputIterator>
// vector(InputIterator first, InputIterator last)
// 我評註部分
template <class InputIterator>
void range_initialize(InputIterator first, InputIterator last,
input_iterator_tag)
{
for ( ; first != last; ++first)
push_back(*first);
}
// This function is only called by the constructor. We have to worry
// about resource leaks, but not about maintaining invariants.
template <class ForwardIterator>
void range_initialize(ForwardIterator first, ForwardIterator last,
forward_iterator_tag)
{
size_type n = 0;
distance(first, last, n);
start = allocate_and_copy(n, first, last);
finish = start + n;
end_of_storage = finish;
}
template <class InputIterator>
void range_insert(iterator pos,
InputIterator first, InputIterator last,
input_iterator_tag);
template <class ForwardIterator>
void range_insert(iterator pos,
ForwardIterator first, ForwardIterator last,
forward_iterator_tag);
#endif /* __STL_MEMBER_TEMPLATES */
};
////////////////////////////////////////////////////////////////////////////////
// vector實現部分
////////////////////////////////////////////////////////////////////////////////
template <class T, class Alloc>
inline bool operator==(const vector<T, Alloc>& x, const vector<T, Alloc>& y)
{
return x.size() == y.size() && equal(x.begin(), x.end(), y.begin());
}
// 字典序比較
template <class T, class Alloc>
inline bool operator<(const vector<T, Alloc>& x, const vector<T, Alloc>& y)
{
return lexicographical_compare(x.begin(), x.end(), y.begin(), y.end());
}
#ifdef __STL_FUNCTION_TMPL_PARTIAL_ORDER
template <class T, class Alloc>
inline void swap(vector<T, Alloc>& x, vector<T, Alloc>& y)
{
x.swap(y);
}
#endif /* __STL_FUNCTION_TMPL_PARTIAL_ORDER */
////////////////////////////////////////////////////////////////////////////////
// 過載賦值運算子
////////////////////////////////////////////////////////////////////////////////
// operator=(const vector<T, Alloc>& x)
// |
// |---------------- 是否是自賦值?
// ↓
// -----------------------------------------
// No | | Yes
// | |
// ↓ |------- 容量判斷
// return *this; |
// ↓
// -----------------------------------------------------------------
// |x.size() > capacity() | size() >= x.size() | other
// | | |
// ↓ ↓ |
// 容量不足, 需要重新分配 容量足夠, 只需要析構掉多餘的物件 |
// allocate_and_copy( copy(x.begin(), x.end(), begin()); |
// x.end() - x.begin(), destroy(i, finish); |
// x.begin(), x.end()); |
// destroy(start, finish); |
// deallocate(); ↓
// copy(x.begin(), x.begin() + size(), start);
// uninitialized_copy(x.begin() + size(), x.end(), finish);
////////////////////////////////////////////////////////////////////////////////
template <class T, class Alloc>
vector<T, Alloc>& vector<T, Alloc>::operator=(const vector<T, Alloc>& x)
{
if (&x != this) {
// 如果x.size() > capacity()那麼就需要重新分配記憶體
// 首先分配記憶體, 並將容器內原來的元素拷貝到新分配記憶體中
// 然後析構原容器中元素, 調整記憶體狀態變數
if (x.size() > capacity()) {
iterator tmp = allocate_and_copy(x.end() - x.begin(),
x.begin(), x.end());
destroy(start, finish);
deallocate();
start = tmp;
end_of_storage = start + (x.end() - x.begin());
}
else if (size() >= x.size()) {
iterator i = copy(x.begin(), x.end(), begin());
destroy(i, finish);
}
else {
copy(x.begin(), x.begin() + size(), start);
uninitialized_copy(x.begin() + size(), x.end(), finish);
}
finish = start + x.size();
}
return *this;
}
////////////////////////////////////////////////////////////////////////////////
// 提供插入操作
////////////////////////////////////////////////////////////////////////////////
// insert_aux(iterator position, const T& x)
// |
// |---------------- 容量是否足夠?
// ↓
// -----------------------------------------
// Yes | | No
// | |
// ↓ |
// 從opsition開始, 整體向後移動一個位置 |
// construct(finish, *(finish - 1)); |
// ++finish; |
// T x_copy = x; |
// copy_backward(position, finish - 2, finish - 1); |
// *position = x_copy; |
// ↓
// data_allocator::allocate(len);
// uninitialized_copy(start, position, new_start);
// construct(new_finish, x);
// ++new_finish;
// uninitialized_copy(position, finish, new_finish);
// destroy(begin(), end());
// deallocate();
////////////////////////////////////////////////////////////////////////////////
template <class T, class Alloc>
void vector<T, Alloc>::insert_aux(iterator position, const T& x)
{
if (finish != end_of_storage) { // 還有剩餘記憶體
construct(finish, *(finish - 1));
++finish;
T x_copy = x;
copy_backward(position, finish - 2, finish - 1);
*position = x_copy;
}
else { // 記憶體不足, 需要重新分配
// 本實作中是按原記憶體2倍進行重新分配
const size_type old_size = size();
const size_type len = old_size != 0 ? 2 * old_size : 1;
iterator new_start = data_allocator::allocate(len);
iterator new_finish = new_start;
// 將記憶體重新配置
__STL_TRY {
new_finish = uninitialized_copy(start, position, new_start);
construct(new_finish, x);
++new_finish;
new_finish = uninitialized_copy(position, finish, new_finish);
}
// 分配失敗則丟擲異常
# ifdef __STL_USE_EXCEPTIONS
catch(...) {
destroy(new_start, new_finish);
data_allocator::deallocate(new_start, len);
throw;
}
# endif /* __STL_USE_EXCEPTIONS */
// 析構原容器中的物件
destroy(begin(), end());
// 釋放原容器分配的記憶體
deallocate();
// 調整記憶體指標狀態
start = new_start;
finish = new_finish;
end_of_storage = new_start + len;
}
}
////////////////////////////////////////////////////////////////////////////////
// 在指定位置插入n個元素
////////////////////////////////////////////////////////////////////////////////
// insert(iterator position, size_type n, const T& x)
// |
// |---------------- 插入元素個數是否為0?
// ↓
// -----------------------------------------
// No | | Yes
// | |
// | ↓
// | return;
// |----------- 記憶體是否足夠?
// |
// -------------------------------------------------
// Yes | | No
// | |
// |------ (finish - position) > n? |
// | 分別調整指標 |
// ↓ |
// ---------------------------- |
// No | | Yes |
// | | |
// ↓ ↓ |
// 插入操作, 調整指標 插入操作, 調整指標 |
// ↓
// data_allocator::allocate(len);
// new_finish = uninitialized_copy(start, position, new_start);
// new_finish = uninitialized_fill_n(new_finish, n, x);
// new_finish = uninitialized_copy(position, finish, new_finish);
// destroy(start, finish);
// deallocate();
////////////////////////////////////////////////////////////////////////////////
template <class T, class Alloc>
void vector<T, Alloc>::insert(iterator position, size_type n, const T& x)
{
// 如果n為0則不進行任何操作
if (n != 0) {
if (size_type(end_of_storage - finish) >= n) { // 剩下的記憶體夠分配
T x_copy = x;
const size_type elems_after = finish - position;
iterator old_finish = finish;
if (elems_after > n) {
uninitialized_copy(finish - n, finish, finish);
finish += n;
copy_backward(position, old_finish - n, old_finish);
fill(position, position + n, x_copy);
}
else {
uninitialized_fill_n(finish, n - elems_after, x_copy);
finish += n - elems_after;
uninitialized_copy(position, old_finish, finish);
finish += elems_after;
fill(position, old_finish, x_copy);
}
}
else { // 剩下的記憶體不夠分配, 需要重新分配
const size_type old_size = size();
const size_type len = old_size + max(old_size, n);
iterator new_start = data_allocator::allocate(len);
iterator new_finish = new_start;
__STL_TRY {
new_finish = uninitialized_copy(start, position, new_start);
new_finish = uninitialized_fill_n(new_finish, n, x);
new_finish = uninitialized_copy(position, finish, new_finish);
}
# ifdef __STL_USE_EXCEPTIONS
catch(...) {
destroy(new_start, new_finish);
data_allocator::deallocate(new_start, len);
throw;
}
# endif /* __STL_USE_EXCEPTIONS */
destroy(start, finish);
deallocate();
start = new_start;
finish = new_finish;
end_of_storage = new_start + len;
}
}
}
#ifdef __STL_MEMBER_TEMPLATES
// 在指定位置插入指定區間的物件
template <class T, class Alloc> template <class InputIterator>
void vector<T, Alloc>::range_insert(iterator pos,
InputIterator first, InputIterator last,
input_iterator_tag)
{
for ( ; first != last; ++first) {
pos = insert(pos, *first);
++pos;
}
}
template <class T, class Alloc> template <class ForwardIterator>
void vector<T, Alloc>::range_insert(iterator position,
ForwardIterator first,
ForwardIterator last,
forward_iterator_tag)
{
if (first != last) {
size_type n = 0;
distance(first, last, n);
if (size_type(end_of_storage - finish) >= n) {
const size_type elems_after = finish - position;
iterator old_finish = finish;
if (elems_after > n) {
uninitialized_copy(finish - n, finish, finish);
finish += n;
copy_backward(position, old_finish - n, old_finish);
copy(first, last, position);
}
else {
ForwardIterator mid = first;
advance(mid, elems_after);
uninitialized_copy(mid, last, finish);
finish += n - elems_after;
uninitialized_copy(position, old_finish, finish);
finish += elems_after;
copy(first, mid, position);
}
}
else {
const size_type old_size = size();
const size_type len = old_size + max(old_size, n);
iterator new_start = data_allocator::allocate(len);
iterator new_finish = new_start;
__STL_TRY {
new_finish = uninitialized_copy(start, position, new_start);
new_finish = uninitialized_copy(first, last, new_finish);
new_finish = uninitialized_copy(position, finish, new_finish);
}
# ifdef __STL_USE_EXCEPTIONS
catch(...) {
destroy(new_start, new_finish);
data_allocator::deallocate(new_start, len);
throw;
}
# endif /* __STL_USE_EXCEPTIONS */
destroy(start, finish);
deallocate();
start = new_start;
finish = new_finish;
end_of_storage = new_start + len;
}
}
}
#else /* __STL_MEMBER_TEMPLATES */
template <class T, class Alloc>
void vector<T, Alloc>::insert(iterator position,
const_iterator first,
const_iterator last) {
if (first != last) {
size_type n = 0;
distance(first, last, n);
if (size_type(end_of_storage - finish) >= n) {
const size_type elems_after = finish - position;
iterator old_finish = finish;
if (elems_after > n) {
uninitialized_copy(finish - n, finish, finish);
finish += n;
copy_backward(position, old_finish - n, old_finish);
copy(first, last, position);
}
else {
uninitialized_copy(first + elems_after, last, finish);
finish += n - elems_after;
uninitialized_copy(position, old_finish, finish);
finish += elems_after;
copy(first, first + elems_after, position);
}
}
else {
const size_type old_size = size();
const size_type len = old_size + max(old_size, n);
iterator new_start = data_allocator::allocate(len);
iterator new_finish = new_start;
__STL_TRY {
new_finish = uninitialized_copy(start, position, new_start);
new_finish = uninitialized_copy(first, last, new_finish);
new_finish = uninitialized_copy(position, finish, new_finish);
}
# ifdef __STL_USE_EXCEPTIONS
catch(...) {
destroy(new_start, new_finish);
data_allocator::deallocate(new_start, len);
throw;
}
# endif /* __STL_USE_EXCEPTIONS */
destroy(start, finish);
deallocate();
start = new_start;
finish = new_finish;
end_of_storage = new_start + len;
}
}
}
#endif /* __STL_MEMBER_TEMPLATES */
#if defined(__sgi) && !defined(__GNUC__) && (_MIPS_SIM != _MIPS_SIM_ABI32)
#pragma reset woff 1174
#endif
__STL_END_NAMESPACE
#endif /* __SGI_STL_INTERNAL_VECTOR_H */
// Local Variables:
// mode:C++
// End: