/* * * * 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 # ifdef __STL_DEBUG # define basic_string _Nondebug_string # endif # if defined (__STL_USE_OWN_NAMESPACE) || !defined (__STL_USE_NATIVE_STRING) # if defined (__STL_NESTED_TYPE_PARAM_BUG) # define __size_type__ size_t # define size_type size_t # define __iterator__ _CharT* # 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 template basic_string<_CharT, _Traits, _Alloc>& basic_string<_CharT, _Traits, _Alloc>::append(_ForwardIter __first, _ForwardIter __last, forward_iterator_tag) { 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 template void basic_string<_CharT, _Traits, _Alloc>::insert(iterator __position, _ForwardIter __first, _ForwardIter __last, forward_iterator_tag) { 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 - __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(__position + __n, __position, (__elems_after - __n) + 1); _M_copy(__first, __last, __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(__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, __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, __position, __new_start); __new_finish = uninitialized_copy(__first, __last, __new_finish); __new_finish = uninitialized_copy(__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. // 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 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 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 basic_string<_CharT, _Traits, _Alloc>& basic_string<_CharT, _Traits, _Alloc>::append(const _CharT* __first, const _CharT* __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 _CharT* __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 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; } #if !defined(__STL_MEMBER_TEMPLATES) // dwa 2/4/00 - specializing the member template might be a better solution, // but I'm not sure how to write it correctly (and portably). If this is not // a specialization but it appears alongside the member template we get an // ambiguity error. template basic_string<_CharT,_Traits,_Alloc>& basic_string<_CharT,_Traits,_Alloc>::assign(const _CharT* __f, const _CharT* __l) { ptrdiff_t __n = __l - __f; if (__STATIC_CAST(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; } #endif template _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); } __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; } return __new_pos; } template void basic_string<_CharT,_Traits,_Alloc>::insert(__iterator__ __position, size_t __n, _CharT __c) { if (__n != 0) { if (size_type(_M_end_of_storage._M_data - _M_finish) >= __n + 1) { const size_type __elems_after = _M_finish - __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(__position + __n, __position, (__elems_after - __n) + 1); _Traits::assign(__position, __n, __c); } else { uninitialized_fill_n(_M_finish + 1, __n - __elems_after - 1, __c); _M_finish += __n - __elems_after; __STL_TRY { uninitialized_copy(__position, __old_finish + 1, _M_finish); _M_finish += __elems_after; } __STL_UNWIND((_Destroy(__old_finish + 1, _M_finish), _M_finish = __old_finish)); _Traits::assign(__position, __elems_after + 1, __c); } } else { const size_type __old_size = size(); const size_type __len = __old_size + max(__old_size, __n) + 1; 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_fill_n(__new_finish, __n, __c); __new_finish = uninitialized_copy(__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; } } } #ifndef __STL_MEMBER_TEMPLATES template void basic_string<_CharT,_Traits,_Alloc>::insert(__iterator__ __position, const _CharT* __first, const _CharT* __last) { if (__first != __last) { const ptrdiff_t __n = __last - __first; if (_M_end_of_storage._M_data - _M_finish >= __n + 1) { const ptrdiff_t __elems_after = _M_finish - __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(__position + __n, __position, (__elems_after - __n) + 1); _M_copy(__first, __last, __position); } else { const _CharT* __mid = __first; advance(__mid, __elems_after + 1); uninitialized_copy(__mid, __last, _M_finish + 1); _M_finish += __n - __elems_after; __STL_TRY { uninitialized_copy(__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, __position); } } else { size_type __old_size = size(); size_type __len = __old_size + max(__old_size, __STATIC_CAST(const 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, __position, __new_start); __new_finish = uninitialized_copy(__first, __last, __new_finish); __new_finish = uninitialized_copy(__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_MEMBER_TEMPLATES */ template basic_string<_CharT,_Traits,_Alloc>& basic_string<_CharT,_Traits,_Alloc> ::replace(iterator __first, iterator __last, __size_type__ __n, _CharT __c) { const size_type __len = __STATIC_CAST(const size_type,(__last - __first)); if (__len >= __n) { _Traits::assign(__first, __n, __c); erase(__first + __n, __last); } else { _Traits::assign(__first, __len, __c); insert(__last, __n - __len, __c); } return *this; } #ifndef __STL_MEMBER_TEMPLATES template basic_string<_CharT,_Traits,_Alloc>& basic_string<_CharT,_Traits,_Alloc> ::replace(iterator __first, iterator __last, const _CharT* __f, const _CharT* __l) { const ptrdiff_t __n = __l - __f; const difference_type __len = __last - __first; if (__len >= __n) { _M_copy(__f, __l, __first); erase(__first + __n, __last); } else { const _CharT* __m = __f + __len; _M_copy(__f, __m, __first); insert(__last, __m, __l); } return *this; } #endif /* __STL_MEMBER_TEMPLATES */ template __size_type__ basic_string<_CharT,_Traits,_Alloc> ::find(const _CharT* __s, size_type __pos, size_type __n) const { if (__pos + __n > size()) return npos; else { const const_pointer __result = search((const _CharT*)_M_start + __pos, (const _CharT*)_M_finish, __s, __s + __n, _Eq_traits<_Traits>()); return __result != _M_finish ? __result - _M_start : npos; } } template __size_type__ basic_string<_CharT,_Traits,_Alloc> ::find(_CharT __c, size_type __pos) const { if (__pos >= size()) return npos; else { const const_pointer __result = find_if((const _CharT*)_M_start + __pos, (const _CharT*)_M_finish, bind2nd(_Eq_traits<_Traits>(), __c)); return __result != _M_finish ? __result - _M_start : npos; } } template __size_type__ basic_string<_CharT,_Traits,_Alloc> ::rfind(const _CharT* __s, size_type __pos, size_type __n) const { const size_t __len = size(); if (__n > __len) return npos; else if (__n == 0) return min(__len, __pos); else { const_pointer __last = _M_start + min(__len - __n, __pos) + __n; const_pointer __result = find_end((const_pointer)_M_start, __last, __s, __s + __n, _Eq_traits<_Traits>()); return __result != __last ? __result - _M_start : npos; } } template __size_type__ basic_string<_CharT,_Traits,_Alloc> ::rfind(_CharT __c, size_type __pos) const { const size_type __len = size(); if (__len < 1) return npos; else { const const_iterator __last = begin() + min(__len - 1, __pos) + 1; const_reverse_iterator __rresult = find_if(const_reverse_iterator(__last), rend(), bind2nd(_Eq_traits<_Traits>(), __c)); return __rresult != rend() ? (__rresult.base() - 1) - begin() : npos; } } template __size_type__ basic_string<_CharT,_Traits,_Alloc> ::find_first_of(const _CharT* __s, size_type __pos, size_type __n) const { if (__pos >= size()) return npos; else { const_iterator __result = __STLPORT_STD::find_first_of(begin() + __pos, end(), __s, __s + __n, _Eq_traits<_Traits>()); return __result != end() ? __result - begin() : npos; } } template __size_type__ basic_string<_CharT,_Traits,_Alloc> ::find_last_of(const _CharT* __s, size_type __pos, size_type __n) const { const size_type __len = size(); if (__len < 1) return npos; else { const const_iterator __last = begin() + min(__len - 1, __pos) + 1; const const_reverse_iterator __rresult = __STLPORT_STD::find_first_of(const_reverse_iterator(__last), rend(), __s, __s + __n, _Eq_traits<_Traits>()); return __rresult != rend() ? (__rresult.base() - 1) - begin() : npos; } } template __size_type__ basic_string<_CharT,_Traits,_Alloc> ::find_first_not_of(const _CharT* __s, size_type __pos, size_type __n) const { typedef typename _Traits::char_type _CharType; if (__pos > size()) return npos; else { const_pointer __result = find_if((const _CharT*)_M_start + __pos, (const _CharT*)_M_finish, _Not_within_traits<_Traits>((const _CharType*)__s, (const _CharType*)__s + __n)); return __result != _M_finish ? __result - _M_start : npos; } } template __size_type__ basic_string<_CharT,_Traits,_Alloc> ::find_first_not_of(_CharT __c, size_type __pos) const { if (__pos > size()) return npos; else { const_pointer __result = find_if((const _CharT*)_M_start + __pos, (const _CharT*)_M_finish, not1(bind2nd(_Eq_traits<_Traits>(), __c))); return __result != _M_finish ? __result - _M_start : npos; } } template __size_type__ basic_string<_CharT,_Traits,_Alloc> ::find_last_not_of(const _CharT* __s, size_type __pos, size_type __n) const { typedef typename _Traits::char_type _CharType; const size_type __len = size(); if (__len < 1) return npos; else { const_iterator __last = begin() + min(__len - 1, __pos) + 1; const_reverse_iterator __rlast = const_reverse_iterator(__last); const_reverse_iterator __rresult = find_if(__rlast, rend(), _Not_within_traits<_Traits>((const _CharType*)__s, (const _CharType*)__s + __n)); return __rresult != rend() ? (__rresult.base() - 1) - begin() : npos; } } template __size_type__ basic_string<_CharT, _Traits, _Alloc> ::find_last_not_of(_CharT __c, size_type __pos) const { const size_type __len = size(); if (__len < 1) return npos; else { const_iterator __last = begin() + min(__len - 1, __pos) + 1; const_reverse_iterator __rlast = const_reverse_iterator(__last); const_reverse_iterator __rresult = find_if(__rlast, rend(), not1(bind2nd(_Eq_traits<_Traits>(), __c))); return __rresult != rend() ? (__rresult.base() - 1) - begin() : npos; } } template void __STL_CALL _S_string_copy(const basic_string<_CharT,_Traits,_Alloc>& __s, _CharT* __buf, size_t __n) { if (__n > 0) { __n = min(__n - 1, __s.size()); copy(__s.begin(), __s.begin() + __n, __buf); __buf[__n] = _CharT(); } } __STL_END_NAMESPACE // _string_fwd has to see clean basic_string # undef basic_string # if !defined (__STL_LINK_TIME_INSTANTIATION) # include # endif # ifdef __STL_DEBUG # define basic_string _Nondebug_string # endif # include __STL_BEGIN_NAMESPACE // _String_base methods template void _String_base<_Tp,_Alloc>::_M_throw_length_error() const { __stl_throw_length_error("basic_string"); } template void _String_base<_Tp, _Alloc>::_M_throw_out_of_range() const { __stl_throw_out_of_range("basic_string"); } __STL_END_NAMESPACE # undef basic_string # undef __size_type__ # undef size_type # undef __iterator__ # undef iterator # endif /* NATIVE */ #endif /* __STL_STRING_C */ // Local Variables: // mode:C++ // End: