文章标题 SGI的vector

1. vector的内存结构如下：
   
   vector类中只有这三个数据成员都是iterator类型
2. vector的实现

#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

template <class T, class Alloc = alloc>
class vector {
public:
  typedef T value_type;
  typedef value_type* pointer;
  typedef const value_type* const_pointer;
  typedef value_type* iterator;//迭代器为普通的指针
  typedef const value_type* const_iterator;
  typedef value_type& reference;
  typedef const value_type& const_reference;
  typedef size_t size_type;
  typedef ptrdiff_t difference_type;

#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:
  typedef simple_alloc<value_type, Alloc> data_allocator;
  //成员变量
  iterator start;//首地址
  iterator finish;//最后一个数据的下一个位置的地址
  iterator end_of_storage;//（start+容量）的地址
  void insert_aux(iterator position, const T& x);
  void deallocate() {
    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()); 
  }
  //vector中数据的个数
  size_type size() const { return size_type(end() - begin()); }
  //vector中之多可以存放数据的个数
  size_type max_size() const { return size_type(-1) / sizeof(T); }
  //vector中数据的容量
  size_type capacity() const { return size_type(end_of_storage - begin()); }
  bool empty() const { return begin() == end(); }
  //重载operator []
  reference operator[](size_type n) { return *(begin() + n); }
  const_reference operator[](size_type n) const { return *(begin() + n); }
    //默认构造函数
  vector() : start(0), finish(0), end_of_storage(0) {}
  //构造n个值为value的vector
  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的作用是防止隐式类型转换，构造n个T()数据的vector
  explicit vector(size_type n) { fill_initialize(n, T()); }
    //copy构造函数
  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
  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) {
    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);
  //保存
  void reserve(size_type n) {
    if (capacity() < n) {//如果容量大于等于n则不变化
      const size_type old_size = size();//旧的数据个数
      //分配n个数据的内存 并将迭代器[start,finish)所指的数据复制到新的内存区，返回新的内存的首地址
      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); }
  //在最后插入一个数据x
  void push_back(const T& x) {
    if (finish != end_of_storage) {//数据没有满、容量还有剩余
      construct(finish, x);//在finish处构造T(x)
      //即实际上的操作为new(finish) T(x)
      ++finish;
    }
    else
      insert_aux(end(), x);//需要重新分配内存了
  }
  //vector 的swap()
  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);
  }
  iterator insert(iterator position, const T& x) {
    size_type n = position - begin();

    if (finish != end_of_storage && position == end()) {
        //vector没有满但是插入点正好位于end()
      construct(finish, x);
      ++finish;
    }
    else
      insert_aux(position, x);
    return begin() + n;//返回插入数据的迭代器
  }
  //在position处插入T()
  iterator insert(iterator position) { return insert(position, T()); }
#ifdef __STL_MEMBER_TEMPLATES
  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);//将[position+1 ,finish)拷贝到以position开始的地方
    --finish;
    destroy(finish);//析构最后一个数据
    return position;//返回被删除下一个数据的迭代器,实际上也就是被删除数据的迭代器
  }
  iterator erase(iterator first, iterator last) {
    iterator i = copy(last, finish, first);//将[last,finish)拷贝到以first开始的地方
    destroy(i, finish);//析构[i , finsih)
    finish = finish - (last - first);
    return first;
  }
  //重整vector的数据个数
  void resize(size_type new_size, const T& x) {
    if (new_size < 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:
    //分配内存 并 赋初值X
  iterator allocate_and_fill(size_type n, const T& x) {
    iterator result = data_allocator::allocate(n);//分配n个T数据类型的内存
    __STL_TRY {
      uninitialized_fill_n(result, n, x);//构造
      return result;
    }
    __STL_UNWIND(data_allocator::deallocate(result, n));//构造异常还要释放内存
  }
    //分配n个数据的内存 并将[first,last)内的数据copy到新分配内存的地方
#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);//copy数据
      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
  template <class InputIterator>
  void range_initialize(InputIterator first, InputIterator last,
                        input_iterator_tag) {//输入迭代器类型
    for ( ; first != last; ++first)
      push_back(*first);//将[first,last)加入vector后面
  }

  // 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);//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 */
    //赋值操作符重载
template <class T, class Alloc>
vector<T, Alloc>& vector<T, Alloc>::operator=(const vector<T, Alloc>& x) {
  if (&x != this) {//不是自身赋值
    if (x.size() > capacity()) {//如果大于vector的容量
        //分配并拷贝
      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;
}

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 , finish-1)复制到以finish-1结束的地方
    *position = x_copy;//插入数据
  }
  else {//vector满了
    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 {
        //复制[satrt , positon) 到 new_start
      new_finish = uninitialized_copy(start, position, new_start);
      construct(new_finish, x);//插入的新值
      ++new_finish;
      //复制[position , finish) 到 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;
  }
}

template <class T, class Alloc>
void vector<T, Alloc>::insert(iterator position, size_type n, const T& x) {
  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);//n个数据
    if (size_type(end_of_storage - finish) >= n) {//容量还满足
      const size_type elems_after = finish - position;
      iterator old_finish = finish;
      if (elems_after > n) {//position到finish的数据个数大于插入数据的个数
        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);//拷贝插入的数据尾段到vector未初始化的尾部
        finish += n - elems_after;//新的尾地址
        uninitialized_copy(position, old_finish, finish);//拷贝position到旧尾地址到新的尾地址后面
        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: