stl_string.c

粗糙集应用软件

/*
 *
 *
 * Copyright (c) 1994
 * Hewlett-Packard Company
 *
 * Copyright (c) 1996,1997
 * Silicon Graphics Computer Systems, Inc.
 *
 * Copyright (c) 1997
 * Moscow Center for SPARC Technology
 *
 * Copyright (c) 1999 
 * Boris Fomitchev
 *
 * This material is provided "as is", with absolutely no warranty expressed
 * or implied. Any use is at your own risk.
 *
 * Permission to use or copy this software for any purpose is hereby granted 
 * without fee, provided the above notices are retained on all copies.
 * Permission to modify the code and to distribute modified code is granted,
 * provided the above notices are retained, and a notice that the code was
 * modified is included with the above copyright notice.
 *
 */
#ifndef __STL_STRING_C
#define __STL_STRING_C


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

# if defined (__STL_USE_NEW_IOSTREAMS) && ! defined (__STLPORT_NEW_IOSTREAMS) && !defined (__STL_MSVC)
#  include <locale>
# endif

# if defined (__STL_USE_OWN_NAMESPACE) || !defined (__STL_USE_NATIVE_STRING)

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

# undef _Make_ptr
# if defined (__STL_DEBUG)
#  define _Make_ptr(__i)   __i._M_iterator
# else
#  define _Make_ptr(__i)   __i
# endif

# if defined (__STL_NESTED_TYPE_PARAM_BUG)
#  define __size_type__ size_t
#  define size_type size_t
#  if defined (__STL_DEBUG)
#   define __iterator__       _Vec_iter<_CharT, _Nonconst_traits<_CharT> >
#  else
#   define __iterator__  _CharT*
#  endif
#   define iterator      __iterator__
# else
#  define __size_type__ __STL_TYPENAME_ON_RETURN_TYPE basic_string<_CharT,_Traits,_Alloc>::size_type
#  define __iterator__  __STL_TYPENAME_ON_RETURN_TYPE basic_string<_CharT,_Traits,_Alloc>::iterator
# endif

__STL_BEGIN_NAMESPACE

#if defined (__STL_MEMBER_TEMPLATES) && ! defined (__STL_INLINE_MEMBER_TEMPLATES)
template <class _CharT, class _Traits, class _Alloc>  
template <class _ForwardIter>
basic_string<_CharT, _Traits, _Alloc>& 
basic_string<_CharT, _Traits, _Alloc>::append(_ForwardIter __first, _ForwardIter __last, 
					      forward_iterator_tag)
{
  __stl_debug_do(__check_range(__first, __last));
  if (__first != __last) {
    const size_type __old_size = size();
    difference_type __n = 0;
    distance(__first, __last, __n);
    if (__STATIC_CAST(size_type,__n) > max_size() || 
	__old_size > max_size() - __STATIC_CAST(size_type,__n))
      _M_throw_length_error();
    if (__old_size + __n > capacity()) {
      const size_type __len = __old_size +
	max(__old_size, __STATIC_CAST(size_type,__n)) + 1;
      pointer __new_start = _M_end_of_storage.allocate(__len);
      pointer __new_finish = __new_start;
      __STL_TRY {
	__new_finish = uninitialized_copy(_M_start, _M_finish, __new_start);
	__new_finish = uninitialized_copy(__first, __last, __new_finish);
	_M_construct_null(__new_finish);
      }
      __STL_UNWIND((destroy(__new_start,__new_finish),
		    _M_end_of_storage.deallocate(__new_start,__len)));
      destroy(_M_start, _M_finish + 1);
      _M_deallocate_block();
      _M_start = __new_start;
      _M_finish = __new_finish;
      _M_end_of_storage._M_data = __new_start + __len; 
    }
    else {
      _ForwardIter __f1 = __first;
      ++__f1;
      uninitialized_copy(__f1, __last, _M_finish + 1);
      __STL_TRY {
	_M_construct_null(_M_finish + __n);
      }
      __STL_UNWIND(destroy(_M_finish + 1, _M_finish + __n));
      _Traits::assign(*_M_finish, *__first);
      _M_finish += __n;
    }
  }
  return *this;  
}

template <class _CharT, class _Traits, class _Alloc>  template <class _ForwardIter>
void 
basic_string<_CharT, _Traits, _Alloc>::insert(iterator __position, 
					      _ForwardIter __first, _ForwardIter __last, 
					      forward_iterator_tag)  {
  __stl_debug_do(__check_range(__first,__last));
  if (__first != __last) {
    difference_type __n = 0;
    distance(__first, __last, __n);
    if (_M_end_of_storage._M_data - _M_finish >= __n + 1) {
      const difference_type __elems_after = _M_finish - _Make_ptr(__position);
      pointer __old_finish = _M_finish;
      if (__elems_after >= __n) {
	uninitialized_copy((_M_finish - __n) + 1, _M_finish + 1,
			   _M_finish + 1);
	_M_finish += __n;
	_Traits::move(_Make_ptr(__position) + __n,
		      _Make_ptr(__position), (__elems_after - __n) + 1);
	_M_copy(__first, __last, _Make_ptr(__position));
      }
      else {
	_ForwardIter __mid = __first;
	advance(__mid, __elems_after + 1);
	uninitialized_copy(__mid, __last, _M_finish + 1);
	_M_finish += __n - __elems_after;
	__STL_TRY {
	  uninitialized_copy(_Make_ptr(__position), __old_finish + 1, _M_finish);
	  _M_finish += __elems_after;
	}
	__STL_UNWIND((destroy(__old_finish + 1, _M_finish), 
		      _M_finish = __old_finish));
	_M_copy(__first, __mid, _Make_ptr(__position));
      }
    }
    else {
      const size_type __old_size = size();        
      const size_type __len
	= __old_size + max(__old_size, __STATIC_CAST(size_type,__n)) + 1;
      pointer __new_start = _M_end_of_storage.allocate(__len);
      pointer __new_finish = __new_start;
      __STL_TRY {
	__new_finish = uninitialized_copy(_M_start, _Make_ptr(__position), __new_start);
	__new_finish = uninitialized_copy(__first, __last, __new_finish);
	__new_finish
	  = uninitialized_copy(_Make_ptr(__position), _M_finish, __new_finish);
	_M_construct_null(__new_finish);
      }
      __STL_UNWIND((destroy(__new_start,__new_finish),
		    _M_end_of_storage.deallocate(__new_start,__len)));
      destroy(_M_start, _M_finish + 1);
      _M_deallocate_block();
      _M_start = __new_start;
      _M_finish = __new_finish;
      _M_end_of_storage._M_data = __new_start + __len; 
    }
  }
}

# endif /* __STL_INLINE_MEMBER_TEMPLATES */


// ------------------------------------------------------------
// Non-inline declarations.

# if (__STL_STATIC_TEMPLATE_DATA > 0)
template <class _CharT, class _Traits, class _Alloc> 
const __size_type__
basic_string<_CharT,_Traits,_Alloc>::npos = (size_t)-1;
# else /* __STL_STATIC_TEMPLATE_DATA */
template class basic_string<char,char_traits<char>,allocator<char> >;
const size_t string::npos __STL_WEAK = (size_t)-1;
#  ifdef __STL_HAS_WCHAR_T
template class basic_string<wchar_t,char_traits<wchar_t>,allocator<wchar_t> >;
const size_t wstring::npos __STL_WEAK = (size_t)-1;
#  endif
# endif /* __STL_STATIC_TEMPLATE_DATA */

// _String_base methods
template <class _Tp, class _Alloc> 
void _String_base<_Tp,_Alloc>::_M_throw_length_error() const {
  __STL_THROW(length_error(string("basic_string")));
}

template <class _Tp, class _Alloc> 
void _String_base<_Tp, _Alloc>::_M_throw_out_of_range() const {
  __STL_THROW(out_of_range(string("basic_string")));
}

// Change the string's capacity so that it is large enough to hold
//  at least __res_arg elements, plus the terminating _CharT().  Note that,
//  if __res_arg < capacity(), this member function may actually decrease
//  the string's capacity.
template <class _CharT, class _Traits, class _Alloc> 
void basic_string<_CharT,_Traits,_Alloc>::reserve(__size_type__ __res_arg) {
  if (__res_arg > max_size())
    _M_throw_length_error();

  size_type __n = max(__res_arg, size()) + 1;
  pointer __new_start = _M_end_of_storage.allocate(__n);
  pointer __new_finish = __new_start;

  __STL_TRY {
    __new_finish = uninitialized_copy(_M_start, _M_finish, __new_start);
    _M_construct_null(__new_finish);
  }
  __STL_UNWIND((destroy(__new_start, __new_finish), 
                _M_end_of_storage.deallocate(__new_start, __n)));

  destroy(_M_start, _M_finish + 1);
  _M_deallocate_block();
  _M_start = __new_start;
  _M_finish = __new_finish;
  _M_end_of_storage._M_data = __new_start + __n;
}

template <class _CharT, class _Traits, class _Alloc> 
basic_string<_CharT,_Traits,_Alloc>& 
basic_string<_CharT,_Traits,_Alloc>::append(__size_type__ __n, _CharT __c) {
  if (__n > max_size() || size() > max_size() - __n)
    _M_throw_length_error();
  if (size() + __n > capacity())
    reserve(size() + max(size(), __n));
  if (__n > 0) {
    uninitialized_fill_n(_M_finish + 1, __n - 1, __c);
    __STL_TRY {
      _M_construct_null(_M_finish + __n);
    }
    __STL_UNWIND(destroy(_M_finish + 1, _M_finish + __n));
    _Traits::assign(*_M_finish, __c);
    _M_finish += __n;
  }
  return *this;
}

#ifndef __STL_MEMBER_TEMPLATES

template <class _Tp, class _Traits, class _Alloc> 
basic_string<_Tp, _Traits, _Alloc>& 
basic_string<_Tp, _Traits, _Alloc>::append(const _Tp* __first,
                                           const _Tp* __last)
{
  if (__first != __last) {
    const size_type __old_size = size();
    ptrdiff_t __n = __last - __first;
    if ((size_type)__n > max_size() || __old_size > max_size() - __n)
      _M_throw_length_error();
    if (__old_size + __n > capacity()) {
      const size_type __len = __old_size + max(__old_size, (size_t) __n) + 1;
      pointer __new_start = _M_end_of_storage.allocate(__len);
      pointer __new_finish = __new_start;
      __STL_TRY {
        __new_finish = uninitialized_copy(_M_start, _M_finish, __new_start);
        __new_finish = uninitialized_copy(__first, __last, __new_finish);
        _M_construct_null(__new_finish);
      }
      __STL_UNWIND((destroy(__new_start,__new_finish),
                    _M_end_of_storage.deallocate(__new_start,__len)));
      destroy(_M_start, _M_finish + 1);
      _M_deallocate_block();
      _M_start = __new_start;
      _M_finish = __new_finish;
      _M_end_of_storage._M_data = __new_start + __len; 
    }
    else {
      const _Tp* __f1 = __first;
      ++__f1;
      uninitialized_copy(__f1, __last, _M_finish + 1);
      __STL_TRY {
        _M_construct_null(_M_finish + __n);
      }
      __STL_UNWIND(destroy(_M_finish + 1, _M_finish + __n));
      _Traits::assign(*_M_finish, *__first);
      _M_finish += __n;
    }
  }
  return *this;  
}

#endif /* __STL_MEMBER_TEMPLATES */

template <class _CharT, class _Traits, class _Alloc> 
basic_string<_CharT,_Traits,_Alloc>& 
basic_string<_CharT,_Traits,_Alloc>::assign(__size_type__ __n, _CharT __c) {
  if (__n <= size()) {
    _Traits::assign(_M_start, __n, __c);
    erase(begin() + __n, end());
  }
  else {
    _Traits::assign(_M_start, size(), __c);
    append(__n - size(), __c);
  }
  return *this;
}

template <class _CharT, class _Traits, class _Alloc> 
basic_string<_CharT,_Traits,_Alloc>& 
basic_string<_CharT,_Traits,_Alloc>::assign(const _CharT* __f, 
                                            const _CharT* __l)
{
  __stl_debug_do(__check_range(__f, __l));
  const ptrdiff_t __n = __l - __f;
  if (__STATIC_CAST(const size_type,__n) <= size()) {
    _Traits::copy(_M_start, __f, __n);
    erase(begin() + __n, end());
  }
  else {
    _Traits::copy(_M_start, __f, size());
    append(__f + size(), __l);
  }
  return *this;
}

template <class _CharT, class _Traits, class _Alloc>
_CharT* 
basic_string<_CharT,_Traits,_Alloc>
  ::_M_insert_aux(_CharT* __p,
                  _CharT __c)
{
  pointer __new_pos = __p;
  if (_M_finish + 1 < _M_end_of_storage._M_data) {
    _M_construct_null(_M_finish + 1);
    _Traits::move(__p + 1, __p, _M_finish - __p);
    _Traits::assign(*__p, __c);
    ++_M_finish;
  }
  else {
    const size_type __old_len = size();
    const size_type __len = __old_len +
                            max(__old_len, __STATIC_CAST(size_type,1)) + 1;
    pointer __new_start = _M_end_of_storage.allocate(__len);
    pointer __new_finish = __new_start;
    __STL_TRY {
      __new_pos = uninitialized_copy(_M_start, __p, __new_start);
      construct(__new_pos, __c);
      __new_finish = __new_pos + 1;
      __new_finish = uninitialized_copy(__p, _M_finish, __new_finish);
      _M_construct_null(__new_finish);