stl_vector.h

粗糙集应用软件

  void push_back() {
    if (_M_finish != _M_end_of_storage._M_data) {
      __STLPORT_STD::construct(_M_finish);
      ++_M_finish;
    }
    else
      _M_insert_aux(_M_finish);
  }

  void swap(vector<_Tp, _Alloc>& __x) {
    __stl_debug_do(_M_iter_list._Swap_owners(__x._M_iter_list));
    __STLPORT_STD::swap(_M_start, __x._M_start);
    __STLPORT_STD::swap(_M_finish, __x._M_finish);
    __STLPORT_STD::swap(_M_end_of_storage._M_data, __x._M_end_of_storage._M_data);
  }

  iterator insert(iterator __position, const _Tp& __x) {
    __stl_debug_check(__check_if_owner(&_M_iter_list, __position));
    size_type __n = __position - begin();
    if (_M_finish != _M_end_of_storage._M_data && __position == end()) {
      __STLPORT_STD::construct(_M_finish, __x);
      ++_M_finish;
    }
    else
      _M_insert_aux(_Make_ptr(__position), __x);
    return begin() + __n;
  }

  iterator insert(iterator __position) {
    __stl_debug_check(__check_if_owner(&_M_iter_list, __position));
    size_type __n = __position - begin();
    if (_M_finish != _M_end_of_storage._M_data && __position == end()) {
      __STLPORT_STD::construct(_M_finish);
      ++_M_finish;
    }
    else
      _M_insert_aux(_Make_ptr(__position));
    return begin() + __n;
  }

  void _M_fill_insert (iterator __pos, size_type __n, const _Tp& __x);

#ifdef __STL_MEMBER_TEMPLATES
  // Check whether it's an integral type.  If so, it's not an iterator.
  template <class _InputIterator>
  void insert(iterator __pos, _InputIterator __first, _InputIterator __last) {
    typedef typename _Is_integer<_InputIterator>::_Integral _Integral;
    _M_insert_dispatch(__pos, __first, __last, _Integral());
  }

  template <class _Integer>
  void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val,
                          __true_type) {
    _M_fill_insert(__pos, (size_type) __n, (_Tp) __val);
  }

  template <class _InputIterator>
  void _M_insert_dispatch(iterator __pos,
                          _InputIterator __first, _InputIterator __last,
                          __false_type) {
    _M_range_insert(__pos, __first, __last, __ITERATOR_CATEGORY(__first));
  }

#else /* __STL_MEMBER_TEMPLATES */
  void insert(iterator __position,
              const_iterator __first, const_iterator __last)
# if defined ( __STL_DEBUG )
    {    
        __stl_debug_check(__check_range(__first,__last));
        insert(__position, _Make_ptr(__first), _Make_ptr(__last));
    }
    void insert (iterator __position, const_pointer __first, 
                 const_pointer __last);
# else
    ;
# endif /* __STL_DEBUG */
#endif /* __STL_MEMBER_TEMPLATES */

  void insert (iterator __pos, size_type __n, const _Tp& __x)
    { _M_fill_insert(__pos, __n, __x); }

  void pop_back() {
    __stl_verbose_assert(!empty(), _StlMsg_EMPTY_CONTAINER);
    --_M_finish;
    __stl_debug_do(__invalidate_iterator(&_M_iter_list,end()));
    __STLPORT_STD::destroy(_M_finish);
  }
  iterator erase(iterator __position) {
    __stl_debug_check(__check_if_owner(&_M_iter_list, __position));
    __stl_verbose_assert(_Make_ptr(__position)!=_M_finish,_StlMsg_ERASE_PAST_THE_END);
    if (__position + 1 != end())
      copy(_Make_ptr(__position) + 1, _M_finish, _Make_ptr(__position));
    __stl_debug_do(__invalidate_range(&_M_iter_list, __position, end()));
    --_M_finish;
    __STLPORT_STD::destroy(_M_finish);
    return __position;
  }
  iterator erase(iterator __first, iterator __last) {
    __stl_debug_check(__check_range(__first,__last,begin(), end()));
    pointer __i = copy(_Make_ptr(__last), _M_finish, _Make_ptr(__first));
    __STLPORT_STD::destroy(__i, _M_finish);
    __stl_debug_do(__invalidate_range(&_M_iter_list, __first, end()));
    _M_finish = __i;
    return _Make_iterator(_Make_ptr(__first));
  }

  void resize(size_type __new_size, const _Tp& __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, _Tp()); }
  void clear() { 
    erase(begin(), end());
  }

protected:

#ifdef __STL_MEMBER_TEMPLATES
  template <class _ForwardIterator>
  pointer _M_allocate_and_copy(size_type __n, _ForwardIterator __first, 
				_ForwardIterator __last) {
    pointer __result = _M_end_of_storage.allocate(__n);
    __STL_TRY {
      uninitialized_copy(__first, __last, __result);
      return __result;
    } 
    __STL_UNWIND(_M_end_of_storage.deallocate(__result, __n));
# ifdef __STL_THROW_RETURN_BUG
	return __result;
# endif
  } 
#else /* __STL_MEMBER_TEMPLATES */
  pointer _M_allocate_and_copy(size_type __n, const_pointer __first, 
			       const_pointer __last)
  {
    pointer __result = _M_end_of_storage.allocate(__n);
    __STL_TRY {
      uninitialized_copy(__first, __last, __result);
      return __result;
    }
    __STL_UNWIND(_M_end_of_storage.deallocate(__result, __n));
# ifdef __STL_THROW_RETURN_BUG
	return __result;
# endif
  }
#endif /* __STL_MEMBER_TEMPLATES */

#ifdef __STL_MEMBER_TEMPLATES
  template <class _InputIterator>
  void _M_range_initialize(_InputIterator __first,  
                           _InputIterator __last, input_iterator_tag)
  {
    __stl_debug_check(__check_range(__first,__last));
    for ( ; __first != __last; ++__first)
      push_back(*__first);
  }

  // This function is only called by the constructor. 
  template <class _ForwardIterator>
  void _M_range_initialize(_ForwardIterator __first,
                           _ForwardIterator __last, forward_iterator_tag)
  {
    __stl_debug_check(__check_range(__first,__last));
    size_type __n = 0;
    distance(__first, __last, __n);
    _M_start = _M_end_of_storage.allocate(__n);
    _M_end_of_storage._M_data = _M_start + __n;
    _M_finish = uninitialized_copy(__first, __last, _M_start);
  }

  template <class _InputIterator>
  void _M_range_insert(iterator __pos, 
		       _InputIterator __first, 
		       _InputIterator __last,
		       input_iterator_tag)
	{
	  __stl_debug_check(__check_range(__first,__last));
	  for ( ; __first != __last; ++__first) {
	    __pos = insert(__pos, *__first);
	    ++__pos;
	  }
	}

template <class _ForwardIterator>
# ifdef __STL_DEBUG
void _M_range_insert(iterator __pos,
		     _ForwardIterator __first,
		     _ForwardIterator __last,
		     forward_iterator_tag)
# else
  void _M_range_insert(iterator __position,
		       _ForwardIterator __first,
		       _ForwardIterator __last,
		       forward_iterator_tag)
# endif
# ifndef __STL_INLINE_MEMBER_TEMPLATES
;
# else
    {
#  ifdef __STL_DEBUG
    __stl_debug_check(__check_if_owner(&_M_iter_list, __pos));
    pointer __position(_Make_ptr(__pos));
#  endif
    if (__first != __last) {
      __stl_debug_check(__check_range(__first,__last));
      size_type __n = 0;
      distance(__first, __last, __n);
      if (size_type(_M_end_of_storage._M_data - _M_finish) >= __n) {
	const size_type __elems_after = _M_finish - __position;
	pointer __old_finish = _M_finish;
	if (__elems_after > __n) {
	  uninitialized_copy(_M_finish - __n, _M_finish, _M_finish);
	  _M_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, _M_finish);
	  _M_finish += __n - __elems_after;
	  uninitialized_copy(__position, __old_finish, _M_finish);
	  _M_finish += __elems_after;
	  copy(__first, __mid, __position);
	}
	__stl_debug_do(__invalidate_range(&_M_iter_list, __pos, end()));
      }
      else {
	const size_type __old_size = size();
	const size_type __len = __old_size + max(__old_size, __n);
	pointer __new_start = _M_end_of_storage.allocate(__len);
	pointer __new_finish = __new_start;
	__STL_TRY {
	  __new_finish = uninitialized_copy(_M_start, __position, __new_start);
	  __new_finish = uninitialized_copy(__first, __last, __new_finish);
	  __new_finish
	    = uninitialized_copy(__position, _M_finish, __new_finish);
	}
	__STL_UNWIND((__STLPORT_STD::destroy(__new_start,__new_finish), 
		      _M_end_of_storage.deallocate(__new_start,__len)));
	__STLPORT_STD::destroy(_M_start, _M_finish);
	_M_end_of_storage.deallocate(_M_start, _M_end_of_storage._M_data - _M_start);
	_M_start = __new_start;
	_M_finish = __new_finish;
	_M_end_of_storage._M_data = __new_start + __len;
      }
    }
  }
# endif /* __STL_INLINE_MEMBER_TEMPLATES */
#endif /* __STL_MEMBER_TEMPLATES */
};

template <class _Tp, class _Alloc>
inline bool 
operator==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
{
  return __x.size() == __y.size() &&
         equal(__x.begin(), __x.end(), __y.begin());
}

template <class _Tp, class _Alloc>
inline bool 
operator<(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
{
  return lexicographical_compare(__x.begin(), __x.end(), 
                                 __y.begin(), __y.end());
}

#ifdef __STL_FUNCTION_TMPL_PARTIAL_ORDER

template <class _Tp, class _Alloc>
inline void swap(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>& __y)
{
  __x.swap(__y);
}

#endif /* __STL_FUNCTION_TMPL_PARTIAL_ORDER */


#ifdef __STL_USE_SEPARATE_RELOPS_NAMESPACE

template <class _Tp, class _Alloc>
inline bool
operator!=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) {
  return !(__x == __y);
}

template <class _Tp, class _Alloc>
inline bool
operator>(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) {
  return __y < __x;
}

template <class _Tp, class _Alloc>
inline bool
operator<=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) {
  return !(__y < __x);
}

template <class _Tp, class _Alloc>
inline bool
operator>=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) {
  return !(__x < __y);
}

#endif /* __STL_USE_SEPARATE_RELOPS_NAMESPACE */


#  undef  vector
#  undef __vector__
// provide a uniform way to access full funclionality
#  define __vector__ __FULL_NAME(vector)

# if defined (__STL_USE_WRAPPER_FOR_ALLOC_PARAM)
// provide a "default" vector adaptor
template <class _Tp>
class vector : public __vector__<_Tp, __STL_DEFAULT_ALLOCATOR(_Tp) >
{
public:
#   define _VEC_SUPER __vector__<_Tp, __STL_DEFAULT_ALLOCATOR(_Tp) >
    typedef _VEC_SUPER  _Super;
    __IMPORT_WITH_REVERSE_ITERATORS(_Super)
    __IMPORT_SUPER_COPY_ASSIGNMENT(vector, vector<_Tp>, _VEC_SUPER)
    vector() {}
    explicit vector(size_type __n, const _Tp& __value) : _VEC_SUPER(__n, __value) { }
    explicit vector(size_type __n) : _VEC_SUPER(__n) { }
# if defined ( __STL_DEBUG )
    vector(const value_type* __first, const value_type* __last) : _VEC_SUPER(__first,__last) { }
# endif
    vector(const_iterator __first, const_iterator __last) : _VEC_SUPER(__first,__last) { }
    ~vector() {}
};

#  if defined (__STL_BASE_MATCH_BUG)
template <class _Tp>
inline bool operator==(const vector<_Tp>& __x, const vector<_Tp>& __y) {
  return __x.size() == __y.size() &&
    equal(__x.begin(), __x.end(), __y.begin());
}

template <class _Tp>
inline bool operator<(const vector<_Tp>& __x, const vector<_Tp>& __y) {
  return lexicographical_compare(__x.begin(), __x.end(), 
				 __y.begin(), __y.end());
}
#  endif /* __STL_BASE_MATCH_BUG */
#  undef _VEC_SUPER
# endif /* WRAPPER */

#if defined(__sgi) && !defined(__GNUC__) && (_MIPS_SIM != _MIPS_SIM_ABI32)
#pragma reset woff 1174
#pragma reset woff 1375
#endif

// close std namespace
__STL_END_NAMESPACE

// do a cleanup

# undef _Make_iterator
# undef _Make_const_iterator
// fbp : weird !
// # undef _Make_ptr 

# if !defined (__STL_LINK_TIME_INSTANTIATION)
#  include <stl_vector.c>
# endif

#endif /* __SGI_STL_VECTOR_H */

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