_deque.c

symbian 上的stl_port进过编译的。

    }
    _STLP_UNWIND(this->_M_destroy_nodes(this->_M_finish._M_node + 1, __new_finish._M_node + 1))
  }
  return __pos;
}

#if !defined (_STLP_MEMBER_TEMPLATES)
template <class _Tp, class _Alloc >
void deque<_Tp,_Alloc>::_M_insert_range_aux(iterator __pos,
                                            const value_type* __first, const value_type* __last,
                                            size_type __n, const __true_type& /*_Movable*/) {
  const difference_type __elems_before = __pos - this->_M_start;
  size_type __length = size();
  if (__elems_before <= difference_type(__length / 2)) {
    iterator __new_start = _M_reserve_elements_at_front(__n);
    __pos = this->_M_start + __elems_before;
    _STLP_TRY {
      iterator __dst = __new_start;
      iterator __src = this->_M_start;
      for (; __src != __pos; ++__dst, ++__src) {
        _STLP_STD::_Move_Construct(&(*__dst), *__src);
        _STLP_STD::_Destroy_Moved(&(*__src));
      }
      this->_M_start = __new_start;
      _STLP_PRIV __ucopy(__first, __last, __dst);
    }
    _STLP_UNWIND(this->_M_destroy_nodes(__new_start._M_node, this->_M_start._M_node))
  }
  else {
    iterator __new_finish = _M_reserve_elements_at_back(__n);
    const difference_type __elems_after = difference_type(__length) - __elems_before;
    __pos = this->_M_finish - __elems_after;
    _STLP_TRY {
      iterator __dst = __new_finish;
      iterator __src = this->_M_finish;
      for (--__src, --__dst; __src >= __pos; --__src, --__dst) {
        _STLP_STD::_Move_Construct(&(*__dst), *__src);
        _STLP_STD::_Destroy_Moved(&(*__src));
      }
      this->_M_finish = __new_finish;
      _STLP_PRIV __ucopy(__first, __last, __pos);
    }
    _STLP_UNWIND(this->_M_destroy_nodes(this->_M_finish._M_node + 1, __new_finish._M_node + 1))
  }
}

template <class _Tp, class _Alloc >
void deque<_Tp,_Alloc>::_M_insert_range_aux(iterator __pos,
                                            const value_type* __first, const value_type* __last,
                                            size_type __n, const __false_type& /*_Movable*/) {
  const difference_type __elems_before = __pos - this->_M_start;
  size_type __length = size();
  if (__elems_before <= difference_type(__length / 2)) {
    iterator __new_start = _M_reserve_elements_at_front(__n);
    iterator __old_start = this->_M_start;
    __pos = this->_M_start + __elems_before;
    _STLP_TRY {
      if (__elems_before >= difference_type(__n)) {
        iterator __start_n = this->_M_start + difference_type(__n);
        _STLP_PRIV __ucopy(this->_M_start, __start_n, __new_start);
        this->_M_start = __new_start;
        copy(__start_n, __pos, __old_start);
        copy(__first, __last, __pos - difference_type(__n));
      }
      else {
        const value_type* __mid = __first + (difference_type(__n) - __elems_before);
        __uninitialized_copy_copy(this->_M_start, __pos, __first, __mid, __new_start);
        this->_M_start = __new_start;
        copy(__mid, __last, __old_start);
      }
    }
    _STLP_UNWIND(this->_M_destroy_nodes(__new_start._M_node, this->_M_start._M_node))
  }
  else {
    iterator __new_finish = _M_reserve_elements_at_back(__n);
    iterator __old_finish = this->_M_finish;
    const difference_type __elems_after =
      difference_type(__length) - __elems_before;
    __pos = this->_M_finish - __elems_after;
    _STLP_TRY {

      if (__elems_after > difference_type(__n)) {
        iterator __finish_n = this->_M_finish - difference_type(__n);
        _STLP_PRIV __ucopy(__finish_n, this->_M_finish, this->_M_finish);
        this->_M_finish = __new_finish;
        copy_backward(__pos, __finish_n, __old_finish);
        copy(__first, __last, __pos);
      }
      else {
        const value_type* __mid = __first + __elems_after;
        __uninitialized_copy_copy(__mid, __last, __pos, this->_M_finish, this->_M_finish);
        this->_M_finish = __new_finish;
        copy(__first, __mid, __pos);
      }
    }
    _STLP_UNWIND(this->_M_destroy_nodes(this->_M_finish._M_node + 1, __new_finish._M_node + 1))
  }
}

template <class _Tp, class _Alloc >
void deque<_Tp,_Alloc>::_M_insert_range_aux(iterator __pos,
                                            const_iterator __first, const_iterator __last,
                                            size_type __n, const __true_type& /*_Movable*/) {
  const difference_type __elems_before = __pos - this->_M_start;
  size_type __length = size();
  if (__elems_before <= difference_type(__length / 2)) {
    iterator __new_start = _M_reserve_elements_at_front(__n);
    __pos = this->_M_start + __elems_before;
    _STLP_TRY {
      iterator __dst = __new_start;
      iterator __src = this->_M_start;
      for (; __src != __pos; ++__dst, ++__src) {
        _STLP_STD::_Move_Construct(&(*__dst), *__src);
        _STLP_STD::_Destroy_Moved(&(*__src));
      }
      this->_M_start = __new_start;
      _STLP_PRIV __ucopy(__first, __last, __dst);
    }
    _STLP_UNWIND(this->_M_destroy_nodes(__new_start._M_node, this->_M_start._M_node))
  }
  else {
    iterator __new_finish = _M_reserve_elements_at_back(__n);
    const difference_type __elems_after = difference_type(__length) - __elems_before;
    __pos = this->_M_finish - __elems_after;
    _STLP_TRY {
      iterator __dst = __new_finish;
      iterator __src = this->_M_finish;
      for (--__src, --__dst; __src >= __pos; --__src, --__dst) {
        _STLP_STD::_Move_Construct(&(*__dst), *__src);
        _STLP_STD::_Destroy_Moved(&(*__src));
      }
      this->_M_finish = __new_finish;
      _STLP_PRIV __ucopy(__first, __last, __pos);
    }
    _STLP_UNWIND(this->_M_destroy_nodes(this->_M_finish._M_node + 1, __new_finish._M_node + 1))
  }
}

template <class _Tp, class _Alloc >
void deque<_Tp,_Alloc>::_M_insert_range_aux(iterator __pos,
                                            const_iterator __first, const_iterator __last,
                                            size_type __n, const __false_type& /*_Movable*/) {
  const difference_type __elems_before = __pos - this->_M_start;
  size_type __length = size();
  if (__elems_before < difference_type(__length / 2)) {
    iterator __new_start = _M_reserve_elements_at_front(__n);
    iterator __old_start = this->_M_start;
    __pos = this->_M_start + __elems_before;
    _STLP_TRY {
      if (__elems_before >= difference_type(__n)) {
        iterator __start_n = this->_M_start + __n;
        _STLP_PRIV __ucopy(this->_M_start, __start_n, __new_start);
        this->_M_start = __new_start;
        copy(__start_n, __pos, __old_start);
        copy(__first, __last, __pos - difference_type(__n));
      }
      else {
        const_iterator __mid = __first + (__n - __elems_before);
        __uninitialized_copy_copy(this->_M_start, __pos, __first, __mid, __new_start);
        this->_M_start = __new_start;
        copy(__mid, __last, __old_start);
      }
    }
    _STLP_UNWIND(this->_M_destroy_nodes(__new_start._M_node, this->_M_start._M_node))
  }
  else {
    iterator __new_finish = _M_reserve_elements_at_back(__n);
    iterator __old_finish = this->_M_finish;
    const difference_type __elems_after = __length - __elems_before;
    __pos = this->_M_finish - __elems_after;
    _STLP_TRY {
      if (__elems_after > difference_type(__n)) {
        iterator __finish_n = this->_M_finish - difference_type(__n);
        _STLP_PRIV __ucopy(__finish_n, this->_M_finish, this->_M_finish);
        this->_M_finish = __new_finish;
        copy_backward(__pos, __finish_n, __old_finish);
        copy(__first, __last, __pos);
      }
      else {
        const_iterator __mid = __first + __elems_after;
        __uninitialized_copy_copy(__mid, __last, __pos, this->_M_finish, this->_M_finish);
        this->_M_finish = __new_finish;
        copy(__first, __mid, __pos);
      }
    }
    _STLP_UNWIND(this->_M_destroy_nodes(this->_M_finish._M_node + 1, __new_finish._M_node + 1))
  }
}
#endif /* _STLP_MEMBER_TEMPLATES */

template <class _Tp, class _Alloc >
void deque<_Tp,_Alloc>::_M_new_elements_at_front(size_type __new_elems) {
  size_type __new_nodes
      = (__new_elems + this->buffer_size() - 1) / this->buffer_size();
  _M_reserve_map_at_front(__new_nodes);
  size_type __i = 1;
  _STLP_TRY {
    for (; __i <= __new_nodes; ++__i)
      *(this->_M_start._M_node - __i) = this->_M_map_size.allocate(this->buffer_size());
  }
  _STLP_UNWIND(for (size_type __j = 1; __j < __i; ++__j)
                 this->_M_map_size.deallocate(*(this->_M_start._M_node - __j), this->buffer_size()))
}

template <class _Tp, class _Alloc >
void deque<_Tp,_Alloc>::_M_new_elements_at_back(size_type __new_elems) {
  size_type __new_nodes
      = (__new_elems + this->buffer_size() - 1) / this->buffer_size();
  _M_reserve_map_at_back(__new_nodes);
  size_type __i = 1;
  _STLP_TRY {
    for (; __i <= __new_nodes; ++__i)
      *(this->_M_finish._M_node + __i) = this->_M_map_size.allocate(this->buffer_size());
  }
  _STLP_UNWIND(for (size_type __j = 1; __j < __i; ++__j)
                 this->_M_map_size.deallocate(*(this->_M_finish._M_node + __j), this->buffer_size()))
}

template <class _Tp, class _Alloc >
void deque<_Tp,_Alloc>::_M_reallocate_map(size_type __nodes_to_add,
                                          bool __add_at_front) {
  size_type __old_num_nodes = this->_M_finish._M_node - this->_M_start._M_node + 1;
  size_type __new_num_nodes = __old_num_nodes + __nodes_to_add;

  _Map_pointer __new_nstart;
  if (this->_M_map_size._M_data > 2 * __new_num_nodes) {
    __new_nstart = this->_M_map._M_data + (this->_M_map_size._M_data - __new_num_nodes) / 2
                     + (__add_at_front ? __nodes_to_add : 0);
    if (__new_nstart < this->_M_start._M_node)
      copy(this->_M_start._M_node, this->_M_finish._M_node + 1, __new_nstart);
    else
      copy_backward(this->_M_start._M_node, this->_M_finish._M_node + 1,
                    __new_nstart + __old_num_nodes);
  }
  else {
    size_type __new_map_size =
      this->_M_map_size._M_data + (max)((size_t)this->_M_map_size._M_data, __nodes_to_add) + 2;

    _Map_pointer __new_map = this->_M_map.allocate(__new_map_size);
    __new_nstart = __new_map + (__new_map_size - __new_num_nodes) / 2
                         + (__add_at_front ? __nodes_to_add : 0);
    copy(this->_M_start._M_node, this->_M_finish._M_node + 1, __new_nstart);
    this->_M_map.deallocate(this->_M_map._M_data, this->_M_map_size._M_data);

    this->_M_map._M_data = __new_map;
    this->_M_map_size._M_data = __new_map_size;
  }

  this->_M_start._M_set_node(__new_nstart);
  this->_M_finish._M_set_node(__new_nstart + __old_num_nodes - 1);
}

#if defined (deque)
#  undef deque
_STLP_MOVE_TO_STD_NAMESPACE
#endif

_STLP_END_NAMESPACE

#undef __iterator__
#undef iterator
#undef const_iterator
#undef size_type
#undef value_type

#endif /*  _STLP_DEQUE_C */

// Local Variables:
// mode:C++
// End: