williamr@2: /* williamr@2: * © Portions copyright (c) 2006-2007 Nokia Corporation. All rights reserved. williamr@2: * williamr@2: * Copyright (c) 1994 williamr@2: * Hewlett-Packard Company williamr@2: * williamr@2: * Copyright (c) 1996,1997 williamr@2: * Silicon Graphics Computer Systems, Inc. williamr@2: * williamr@2: * Copyright (c) 1997 williamr@2: * Moscow Center for SPARC Technology williamr@2: * williamr@2: * Copyright (c) 1999 williamr@2: * Boris Fomitchev williamr@2: * williamr@2: * This material is provided "as is", with absolutely no warranty expressed williamr@2: * or implied. Any use is at your own risk. williamr@2: * williamr@2: * Permission to use or copy this software for any purpose is hereby granted williamr@2: * without fee, provided the above notices are retained on all copies. williamr@2: * Permission to modify the code and to distribute modified code is granted, williamr@2: * provided the above notices are retained, and a notice that the code was williamr@2: * modified is included with the above copyright notice. williamr@2: * williamr@2: */ williamr@2: #ifndef _STLP_STRING_C williamr@2: #define _STLP_STRING_C williamr@2: williamr@2: #ifndef _STLP_STRING_H williamr@2: # include <stl/_string.h> williamr@2: #endif williamr@2: williamr@2: # ifdef _STLP_DEBUG williamr@2: # define basic_string _Nondebug_string williamr@2: # endif williamr@2: williamr@2: # if defined (_STLP_USE_OWN_NAMESPACE) || !defined (_STLP_USE_NATIVE_STRING) williamr@2: williamr@2: # if defined (_STLP_NESTED_TYPE_PARAM_BUG) williamr@2: # define __size_type__ size_t williamr@2: # define size_type size_t williamr@2: # define iterator _CharT* williamr@2: # else williamr@2: # define __size_type__ _STLP_TYPENAME_ON_RETURN_TYPE basic_string<_CharT,_Traits,_Alloc>::size_type williamr@2: # endif williamr@2: williamr@2: _STLP_BEGIN_NAMESPACE williamr@2: williamr@2: // ------------------------------------------------------------ williamr@2: // Non-inline declarations. williamr@2: williamr@2: williamr@2: // Change the string's capacity so that it is large enough to hold williamr@2: // at least __res_arg elements, plus the terminating _CharT(). Note that, williamr@2: // if __res_arg < capacity(), this member function may actually decrease williamr@2: // the string's capacity. williamr@2: template <class _CharT, class _Traits, class _Alloc> williamr@2: _STLP_EXP_DECLSPEC void basic_string<_CharT,_Traits,_Alloc>::reserve(size_type __res_arg) { williamr@2: williamr@2: if (__res_arg >= capacity()) williamr@2: { williamr@2: if (__res_arg > max_size()) williamr@2: this->_M_throw_length_error(); williamr@2: williamr@2: size_type __n = __res_arg + 1; williamr@2: _STLP_LEAVE_VOLATILE pointer __new_start = this->_M_end_of_storage.allocate(__n); williamr@2: _STLP_LEAVE_VOLATILE pointer __new_finish = __new_start; williamr@2: williamr@2: _STLP_TRY { williamr@2: __new_finish = uninitialized_copy(this->_M_start, this->_M_finish, __new_start); williamr@2: _M_construct_null(__new_finish); williamr@2: } williamr@2: _STLP_UNWIND((_STLP_STD::_Destroy(__new_start, __new_finish), williamr@2: this->_M_end_of_storage.deallocate(__new_start, __n))); williamr@2: williamr@2: _STLP_STD::_Destroy(this->_M_start, this->_M_finish + 1); williamr@2: this->_M_deallocate_block(); williamr@2: this->_M_start = __new_start; williamr@2: this->_M_finish = __new_finish; williamr@2: this->_M_end_of_storage._M_data = __new_start + __n; williamr@2: } williamr@2: } williamr@2: williamr@2: template <class _CharT, class _Traits, class _Alloc> williamr@2: _STLP_EXP_DECLSPEC basic_string<_CharT,_Traits,_Alloc>& williamr@2: basic_string<_CharT,_Traits,_Alloc>::append(size_type __n, _CharT __c) williamr@2: { williamr@2: if (__n > max_size() || size() > max_size() - __n) williamr@2: this->_M_throw_length_error(); williamr@2: if (size() + __n > capacity()) williamr@2: reserve(size() + (max)(size(), __n)); williamr@2: if (__n > 0) { williamr@2: uninitialized_fill_n(this->_M_finish + 1, __n - 1, __c); williamr@2: _STLP_TRY { williamr@2: _M_construct_null(this->_M_finish + __n); williamr@2: } williamr@2: _STLP_UNWIND(_STLP_STD::_Destroy(this->_M_finish + 1, this->_M_finish + __n)); williamr@2: _Traits::assign(*end(), __c); williamr@2: this->_M_finish += __n; williamr@2: } williamr@2: return *this; williamr@2: } williamr@2: williamr@2: #ifndef _STLP_MEMBER_TEMPLATES williamr@2: williamr@2: template <class _CharT, class _Traits, class _Alloc> williamr@2: _STLP_EXP_DECLSPEC basic_string<_CharT, _Traits, _Alloc>& williamr@2: basic_string<_CharT, _Traits, _Alloc>::append(const _CharT* __first, williamr@2: const _CharT* __last) williamr@2: { williamr@2: if (__first != __last) { williamr@2: const size_type __old_size = size(); williamr@2: ptrdiff_t __n = __last - __first; williamr@2: if ((size_type)__n > max_size() || __old_size > max_size() - __n) williamr@2: this->_M_throw_length_error(); williamr@2: if (__old_size + __n > capacity()) { williamr@2: const size_type __len = __old_size + (max)(__old_size, (size_t) __n) + 1; williamr@2: pointer __new_start = this->_M_end_of_storage.allocate(__len); williamr@2: _STLP_LEAVE_VOLATILE pointer __new_finish = __new_start; williamr@2: _STLP_TRY { williamr@2: __new_finish = uninitialized_copy(this->_M_start, this->_M_finish, __new_start); williamr@2: __new_finish = uninitialized_copy(__first, __last, __new_finish); williamr@2: _M_construct_null(__new_finish); williamr@2: } williamr@2: _STLP_UNWIND((_STLP_STD::_Destroy(__new_start,__new_finish), williamr@2: this->_M_end_of_storage.deallocate(__new_start,__len))); williamr@2: _STLP_STD::_Destroy(this->_M_start, this->_M_finish + 1); williamr@2: this->_M_deallocate_block(); williamr@2: this->_M_start = __new_start; williamr@2: this->_M_finish = __new_finish; williamr@2: this->_M_end_of_storage._M_data = __new_start + __len; williamr@2: } williamr@2: else { williamr@2: const _CharT* __f1 = __first; williamr@2: ++__f1; williamr@2: uninitialized_copy(__f1, __last, this->_M_finish + 1); williamr@2: _STLP_TRY { williamr@2: _M_construct_null(this->_M_finish + __n); williamr@2: } williamr@2: _STLP_UNWIND(_STLP_STD::_Destroy(this->_M_finish + 1, this->_M_finish + __n)); williamr@2: _Traits::assign(*end(), *__first); williamr@2: this->_M_finish += __n; williamr@2: } williamr@2: } williamr@2: return *this; williamr@2: } williamr@2: williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@2: williamr@2: template <class _CharT, class _Traits, class _Alloc> williamr@2: _STLP_EXP_DECLSPEC basic_string<_CharT,_Traits,_Alloc>& williamr@2: basic_string<_CharT,_Traits,_Alloc>::assign(size_type __n, _CharT __c) { williamr@2: if (__n <= size()) { williamr@2: _Traits::assign(this->_M_start, __n, __c); williamr@2: erase(begin() + __n, end()); williamr@2: } williamr@2: else { williamr@2: _Traits::assign(this->_M_start, size(), __c); williamr@2: append(__n - size(), __c); williamr@2: } williamr@2: return *this; williamr@2: } williamr@2: williamr@2: template <class _CharT, class _Traits, class _Alloc> williamr@2: _CharT* basic_string<_CharT,_Traits,_Alloc> ::_M_insert_aux(_CharT* __p, williamr@2: _CharT __c) williamr@2: { williamr@2: pointer __new_pos = __p; williamr@2: if (this->_M_finish + 1 < this->_M_end_of_storage._M_data) { williamr@2: _M_construct_null(this->_M_finish + 1); williamr@2: _Traits::move(__p + 1, __p, this->_M_finish - __p); williamr@2: _Traits::assign(*__p, __c); williamr@2: ++this->_M_finish; williamr@2: } williamr@2: else { williamr@2: const size_type __old_len = size(); williamr@2: const size_type __len = __old_len + williamr@2: (max)(__old_len, __STATIC_CAST(size_type,1)) + 1; williamr@2: pointer __new_start = this->_M_end_of_storage.allocate(__len); williamr@2: _STLP_LEAVE_VOLATILE pointer __new_finish = __new_start; williamr@2: _STLP_TRY { williamr@2: __new_pos = uninitialized_copy(this->_M_start, __p, __new_start); williamr@2: _Construct(__new_pos, __c); williamr@2: __new_finish = __new_pos + 1; williamr@2: __new_finish = uninitialized_copy(__p, this->_M_finish, __new_finish); williamr@2: _M_construct_null(__new_finish); williamr@2: } williamr@2: _STLP_UNWIND((_STLP_STD::_Destroy(__new_start,__new_finish), williamr@2: this->_M_end_of_storage.deallocate(__new_start,__len))); williamr@2: _STLP_STD::_Destroy(this->_M_start, this->_M_finish + 1); williamr@2: this->_M_deallocate_block(); williamr@2: this->_M_start = __new_start; williamr@2: this->_M_finish = __new_finish; williamr@2: this->_M_end_of_storage._M_data = __new_start + __len; williamr@2: } williamr@2: return __new_pos; williamr@2: } williamr@2: williamr@2: template <class _CharT, class _Traits, class _Alloc> williamr@2: _STLP_EXP_DECLSPEC void basic_string<_CharT,_Traits,_Alloc>::insert(iterator __position, williamr@2: size_t __n, _CharT __c) williamr@2: { williamr@2: if (__n != 0) { williamr@2: if (size_type(this->_M_end_of_storage._M_data - this->_M_finish) >= __n + 1) { williamr@2: const size_type __elems_after = this->_M_finish - __position; williamr@2: pointer __old_finish = this->_M_finish; williamr@2: if (__elems_after >= __n) { williamr@2: uninitialized_copy((this->_M_finish - __n) + 1, this->_M_finish + 1, williamr@2: this->_M_finish + 1); williamr@2: this->_M_finish += __n; williamr@2: _Traits::move(__position + __n, williamr@2: __position, (__elems_after - __n) + 1); williamr@2: _Traits::assign(__position, __n, __c); williamr@2: } williamr@2: else { williamr@2: uninitialized_fill_n(this->_M_finish + 1, __n - __elems_after - 1, __c); williamr@2: this->_M_finish += __n - __elems_after; williamr@2: _STLP_TRY { williamr@2: uninitialized_copy(__position, __old_finish + 1, this->_M_finish); williamr@2: this->_M_finish += __elems_after; williamr@2: } williamr@2: _STLP_UNWIND((_STLP_STD::_Destroy(__old_finish + 1, this->_M_finish), williamr@2: this->_M_finish = __old_finish)); williamr@2: _Traits::assign(__position, __elems_after + 1, __c); williamr@2: } williamr@2: } williamr@2: else { williamr@2: const size_type __old_size = size(); williamr@2: const size_type __len = __old_size + (max)(__old_size, __n) + 1; williamr@2: pointer __new_start = this->_M_end_of_storage.allocate(__len); williamr@2: _STLP_LEAVE_VOLATILE pointer __new_finish = __new_start; williamr@2: _STLP_TRY { williamr@2: __new_finish = uninitialized_copy(this->_M_start, __position, __new_start); williamr@2: __new_finish = uninitialized_fill_n(__new_finish, __n, __c); williamr@2: __new_finish = uninitialized_copy(__position, this->_M_finish, williamr@2: __new_finish); williamr@2: _M_construct_null(__new_finish); williamr@2: } williamr@2: _STLP_UNWIND((_STLP_STD::_Destroy(__new_start,__new_finish), williamr@2: this->_M_end_of_storage.deallocate(__new_start,__len))); williamr@2: _STLP_STD::_Destroy(this->_M_start, this->_M_finish + 1); williamr@2: this->_M_deallocate_block(); williamr@2: this->_M_start = __new_start; williamr@2: this->_M_finish = __new_finish; williamr@2: this->_M_end_of_storage._M_data = __new_start + __len; williamr@2: } williamr@2: } williamr@2: } williamr@2: williamr@2: #ifndef _STLP_MEMBER_TEMPLATES williamr@2: williamr@2: template <class _CharT, class _Traits, class _Alloc> williamr@2: _STLP_EXP_DECLSPEC void williamr@2: basic_string<_CharT,_Traits,_Alloc>::insert(iterator __position, williamr@2: const _CharT* __first, williamr@2: const _CharT* __last) williamr@2: { williamr@2: if (__first != __last) { williamr@2: const ptrdiff_t __n = __last - __first; williamr@2: if (this->_M_end_of_storage._M_data - this->_M_finish >= __n + 1) { williamr@2: const ptrdiff_t __elems_after = this->_M_finish - __position; williamr@2: pointer __old_finish = this->_M_finish; williamr@2: if (__elems_after >= __n) { williamr@2: uninitialized_copy((this->_M_finish - __n) + 1, this->_M_finish + 1, williamr@2: this->_M_finish + 1); williamr@2: this->_M_finish += __n; williamr@2: _Traits::move(__position + __n, williamr@2: __position, (__elems_after - __n) + 1); williamr@2: _M_copy(__first, __last, __position); williamr@2: } williamr@2: else { williamr@2: const _CharT* __mid = __first; williamr@2: advance(__mid, __elems_after + 1); williamr@2: uninitialized_copy(__mid, __last, this->_M_finish + 1); williamr@2: this->_M_finish += __n - __elems_after; williamr@2: _STLP_TRY { williamr@2: uninitialized_copy(__position, __old_finish + 1, this->_M_finish); williamr@2: this->_M_finish += __elems_after; williamr@2: } williamr@2: _STLP_UNWIND((_STLP_STD::_Destroy(__old_finish + 1, this->_M_finish), williamr@2: this->_M_finish = __old_finish)); williamr@2: _M_copy(__first, __mid, __position); williamr@2: } williamr@2: } williamr@2: else { williamr@2: size_type __old_size = size(); williamr@2: size_type __len williamr@2: = __old_size + (max)(__old_size, __STATIC_CAST(const size_type,__n)) + 1; williamr@2: pointer __new_start = this->_M_end_of_storage.allocate(__len); williamr@2: _STLP_LEAVE_VOLATILE pointer __new_finish = __new_start; williamr@2: _STLP_TRY { williamr@2: __new_finish = uninitialized_copy(this->_M_start, __position, __new_start); williamr@2: __new_finish = uninitialized_copy(__first, __last, __new_finish); williamr@2: __new_finish williamr@2: = uninitialized_copy(__position, this->_M_finish, __new_finish); williamr@2: _M_construct_null(__new_finish); williamr@2: } williamr@2: _STLP_UNWIND((_STLP_STD::_Destroy(__new_start,__new_finish), williamr@2: this->_M_end_of_storage.deallocate(__new_start,__len))); williamr@2: _STLP_STD::_Destroy(this->_M_start, this->_M_finish + 1); williamr@2: this->_M_deallocate_block(); williamr@2: this->_M_start = __new_start; williamr@2: this->_M_finish = __new_finish; williamr@2: this->_M_end_of_storage._M_data = __new_start + __len; williamr@2: } williamr@2: } williamr@2: } williamr@2: williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@2: williamr@2: template <class _CharT, class _Traits, class _Alloc> williamr@2: _STLP_EXP_DECLSPEC basic_string<_CharT,_Traits,_Alloc>& williamr@2: basic_string<_CharT,_Traits,_Alloc>::replace(iterator __first, iterator __last, size_type __n, _CharT __c) williamr@2: { williamr@2: size_type __len = (size_type)(__last - __first); williamr@2: williamr@2: if (__len >= __n) { williamr@2: _Traits::assign(__first, __n, __c); williamr@2: erase(__first + __n, __last); williamr@2: } williamr@2: else { williamr@2: _Traits::assign(__first, __len, __c); williamr@2: insert(__last, __n - __len, __c); williamr@2: } williamr@2: return *this; williamr@2: } williamr@2: williamr@2: #ifndef _STLP_MEMBER_TEMPLATES williamr@2: williamr@2: williamr@2: template <class _CharT, class _Traits, class _Alloc> williamr@2: _STLP_EXP_DECLSPEC basic_string<_CharT,_Traits,_Alloc>& williamr@2: basic_string<_CharT,_Traits,_Alloc> ::replace(iterator __first, iterator __last, williamr@2: const _CharT* __f, const _CharT* __l) williamr@2: { williamr@2: const ptrdiff_t __n = __l - __f; williamr@2: const difference_type __len = __last - __first; williamr@2: if (__len >= __n) { williamr@2: _M_copy(__f, __l, __first); williamr@2: erase(__first + __n, __last); williamr@2: } williamr@2: else { williamr@2: const _CharT* __m = __f + __len; williamr@2: _M_copy(__f, __m, __first); williamr@2: insert(__last, __m, __l); williamr@2: } williamr@2: return *this; williamr@2: } williamr@2: williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@2: williamr@2: template <class _CharT, class _Traits, class _Alloc> williamr@2: _STLP_EXP_DECLSPEC __size_type__ williamr@2: basic_string<_CharT,_Traits,_Alloc> ::find(const _CharT* __s, size_type __pos, size_type __n) const williamr@2: { williamr@2: #ifndef __SYMBIAN32__ // A different implementation without using search williamr@2: if (__pos + __n > size()) williamr@2: return npos; williamr@2: else { williamr@2: const const_pointer __result = williamr@2: _STLP_STD::search((const _CharT*)this->_M_start + __pos, (const _CharT*)this->_M_finish, williamr@2: __s, __s + __n, _Eq_traits<_Traits>()); williamr@2: return __result != this->_M_finish ? __result - this->_M_start : npos; williamr@2: } williamr@2: #else williamr@2: const size_type __len = this->size(); williamr@2: size_t __tpos = __pos; williamr@2: const _CharT* __data = this->_M_start; williamr@2: while (__tpos + __n <= __len) { williamr@2: if (traits_type::compare(__data + __tpos, __s, __n) == 0) williamr@2: return __tpos; williamr@2: ++__tpos; williamr@2: } williamr@2: return npos; williamr@2: #endif //__SYMBIAN32__ williamr@2: } williamr@2: williamr@2: template <class _CharT, class _Traits, class _Alloc> williamr@2: _STLP_EXP_DECLSPEC __size_type__ williamr@2: basic_string<_CharT,_Traits,_Alloc> ::find(_CharT __c, size_type __pos) const williamr@2: { williamr@2: if (__pos >= size()) williamr@2: return npos; williamr@2: else { williamr@2: const const_pointer __result = williamr@2: _STLP_STD::find_if((const _CharT*)this->_M_start + __pos, (const _CharT*)this->_M_finish, williamr@2: _Eq_char_bound<_Traits>(__c)); williamr@2: return __result != this->_M_finish ? __result - this->_M_start : npos; williamr@2: } williamr@2: } williamr@2: williamr@2: template <class _CharT, class _Traits, class _Alloc> williamr@2: _STLP_EXP_DECLSPEC __size_type__ williamr@2: basic_string<_CharT,_Traits,_Alloc> ::rfind(const _CharT* __s, size_type __pos, size_type __n) const williamr@2: { williamr@2: const size_t __len = size(); williamr@2: williamr@2: if (__n > __len) williamr@2: return npos; williamr@2: else if (__n == 0) williamr@2: return (min) (__len, __pos); williamr@2: else { williamr@2: const_pointer __last = this->_M_start + (min) (__len - __n, __pos) + __n; williamr@2: const_pointer __result = _STLP_STD::find_end((const_pointer)this->_M_start, __last, williamr@2: __s, __s + __n, williamr@2: _Eq_traits<_Traits>()); williamr@2: return __result != __last ? __result - this->_M_start : npos; williamr@2: } williamr@2: } williamr@2: williamr@2: template <class _CharT, class _Traits, class _Alloc> williamr@2: _STLP_EXP_DECLSPEC __size_type__ williamr@2: basic_string<_CharT,_Traits,_Alloc> ::rfind(_CharT __c, size_type __pos) const williamr@2: { williamr@2: const size_type __len = size(); williamr@2: williamr@2: if (__len < 1) williamr@2: return npos; williamr@2: else { williamr@2: const const_iterator __last = begin() + (min) (__len - 1, __pos) + 1; williamr@2: const_reverse_iterator __rresult = williamr@2: _STLP_STD::find_if(const_reverse_iterator(__last), rend(), williamr@2: _Eq_char_bound<_Traits>(__c)); williamr@2: return __rresult != rend() ? (__rresult.base() - 1) - begin() : npos; williamr@2: } williamr@2: } williamr@2: williamr@2: template <class _CharT, class _Traits, class _Alloc> williamr@2: _STLP_EXP_DECLSPEC __size_type__ williamr@2: basic_string<_CharT,_Traits,_Alloc> williamr@2: ::find_first_of(const _CharT* __s, size_type __pos, size_type __n) const williamr@2: { williamr@2: if (__pos >= size()) williamr@2: return npos; williamr@2: else { williamr@2: const_iterator __result = __find_first_of(begin() + __pos, end(), williamr@2: __s, __s + __n, williamr@2: _Eq_traits<_Traits>()); williamr@2: return __result != end() ? __result - begin() : npos; williamr@2: } williamr@2: } williamr@2: williamr@2: williamr@2: template <class _CharT, class _Traits, class _Alloc> williamr@2: _STLP_EXP_DECLSPEC __size_type__ williamr@2: basic_string<_CharT,_Traits,_Alloc> williamr@2: ::find_last_of(const _CharT* __s, size_type __pos, size_type __n) const williamr@2: { williamr@2: const size_type __len = size(); williamr@2: williamr@2: if (__len < 1) williamr@2: return npos; williamr@2: else { williamr@2: const const_iterator __last = begin() + (min) (__len - 1, __pos) + 1; williamr@2: const const_reverse_iterator __rresult = williamr@2: __find_first_of(const_reverse_iterator(__last), rend(), williamr@2: __s, __s + __n, williamr@2: _Eq_traits<_Traits>()); williamr@2: return __rresult != rend() ? (__rresult.base() - 1) - begin() : npos; williamr@2: } williamr@2: } williamr@2: williamr@2: williamr@2: template <class _CharT, class _Traits, class _Alloc> williamr@2: _STLP_EXP_DECLSPEC __size_type__ williamr@2: basic_string<_CharT,_Traits,_Alloc> ::find_first_not_of(const _CharT* __s, size_type __pos, size_type __n) const williamr@2: { williamr@2: typedef typename _Traits::char_type _CharType; williamr@2: if (__pos > size()) williamr@2: return npos; williamr@2: else { williamr@2: const_pointer __result = _STLP_STD::find_if((const _CharT*)this->_M_start + __pos, williamr@2: (const _CharT*)this->_M_finish, williamr@2: _Not_within_traits<_Traits>((const _CharType*)__s, williamr@2: (const _CharType*)__s + __n)); williamr@2: return __result != this->_M_finish ? __result - this->_M_start : npos; williamr@2: } williamr@2: } williamr@2: williamr@2: template <class _CharT, class _Traits, class _Alloc> williamr@2: _STLP_EXP_DECLSPEC __size_type__ williamr@2: basic_string<_CharT,_Traits,_Alloc> ::find_first_not_of(_CharT __c, size_type __pos) const williamr@2: { williamr@2: if (__pos > size()) williamr@2: return npos; williamr@2: else { williamr@2: const_pointer __result = _STLP_STD::find_if((const _CharT*)this->_M_start + __pos, (const _CharT*)this->_M_finish, williamr@2: _Neq_char_bound<_Traits>(__c)); williamr@2: return __result != this->_M_finish ? __result - this->_M_start : npos; williamr@2: } williamr@2: } williamr@2: williamr@2: template <class _CharT, class _Traits, class _Alloc> williamr@2: _STLP_EXP_DECLSPEC __size_type__ williamr@2: basic_string<_CharT,_Traits,_Alloc> ::find_last_not_of(const _CharT* __s, size_type __pos, size_type __n) const williamr@2: { williamr@2: typedef typename _Traits::char_type _CharType; williamr@2: const size_type __len = size(); williamr@2: williamr@2: if (__len < 1) williamr@2: return npos; williamr@2: else { williamr@2: const_iterator __last = begin() + (min) (__len - 1, __pos) + 1; williamr@2: const_reverse_iterator __rlast = const_reverse_iterator(__last); williamr@2: const_reverse_iterator __rresult = williamr@2: _STLP_STD::find_if(__rlast, rend(), williamr@2: _Not_within_traits<_Traits>((const _CharType*)__s, williamr@2: (const _CharType*)__s + __n)); williamr@2: return __rresult != rend() ? (__rresult.base() - 1) - begin() : npos; williamr@2: } williamr@2: } williamr@2: williamr@2: template <class _CharT, class _Traits, class _Alloc> williamr@2: _STLP_EXP_DECLSPEC __size_type__ williamr@2: basic_string<_CharT, _Traits, _Alloc> ::find_last_not_of(_CharT __c, size_type __pos) const williamr@2: { williamr@2: const size_type __len = size(); williamr@2: williamr@2: if (__len < 1) williamr@2: return npos; williamr@2: else { williamr@2: const_iterator __last = begin() + (min) (__len - 1, __pos) + 1; williamr@2: const_reverse_iterator __rlast = const_reverse_iterator(__last); williamr@2: const_reverse_iterator __rresult = williamr@2: _STLP_STD::find_if(__rlast, rend(), williamr@2: _Neq_char_bound<_Traits>(__c)); williamr@2: return __rresult != rend() ? (__rresult.base() - 1) - begin() : npos; williamr@2: } williamr@2: } williamr@2: williamr@2: template <class _CharT, class _Traits, class _Alloc> williamr@2: void _STLP_CALL _S_string_copy(const basic_string<_CharT,_Traits,_Alloc>& __s, williamr@2: _CharT* __buf, williamr@2: size_t __n) williamr@2: { williamr@2: if (__n > 0) { williamr@2: __n = (min) (__n - 1, __s.size()); williamr@2: _STLP_STD::copy(__s.begin(), __s.begin() + __n, __buf); williamr@2: __buf[__n] = _CharT(); williamr@2: } williamr@2: } williamr@2: _STLP_END_NAMESPACE williamr@2: williamr@2: // _string_fwd has to see clean basic_string williamr@2: # undef basic_string williamr@2: williamr@2: # if !defined (_STLP_LINK_TIME_INSTANTIATION) williamr@2: # include <stl/_string_fwd.c> williamr@2: # endif williamr@2: williamr@2: # ifdef _STLP_DEBUG williamr@2: # define basic_string _Nondebug_string williamr@2: # endif williamr@2: williamr@2: # include <stl/_range_errors.h> williamr@2: _STLP_BEGIN_NAMESPACE williamr@2: williamr@2: // _String_base methods williamr@2: template <class _Tp, class _Alloc> williamr@2: void _String_base<_Tp,_Alloc>::_M_throw_length_error() const { williamr@2: __stl_throw_length_error("basic_string"); williamr@2: } williamr@2: williamr@2: template <class _Tp, class _Alloc> williamr@2: void _String_base<_Tp, _Alloc>::_M_throw_out_of_range() const { williamr@2: __stl_throw_out_of_range("basic_string"); williamr@2: } williamr@2: williamr@2: template <class _Tp, class _Alloc> williamr@2: void _String_base<_Tp, _Alloc>::_M_allocate_block(size_t __n) { williamr@2: if ((__n <= (max_size()+1)) && (__n>0)){ williamr@2: _M_start = _M_end_of_storage.allocate(__n); williamr@2: _M_finish = _M_start; williamr@2: _M_end_of_storage._M_data = _M_start + __n; williamr@2: } williamr@2: else williamr@2: _M_throw_length_error(); williamr@2: } williamr@2: williamr@2: template <class _CharT, class _Traits, class _Alloc> williamr@2: _STLP_EXP_DECLSPEC basic_string<_CharT, _Traits, _Alloc>::basic_string() williamr@2: : _String_base<_CharT,_Alloc>(allocator_type()) williamr@2: { williamr@2: this->_M_start = this->_M_end_of_storage.allocate(8); williamr@2: this->_M_finish = this->_M_start; williamr@2: this->_M_end_of_storage._M_data = this->_M_start + 8; williamr@2: _M_terminate_string(); williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: } williamr@2: williamr@2: williamr@2: template <class _CharT, class _Traits, class _Alloc> williamr@2: _STLP_EXP_DECLSPEC basic_string<_CharT, _Traits, _Alloc>::basic_string(const _CharT* __s, williamr@2: const allocator_type& __a) williamr@2: : _String_base<_CharT,_Alloc>(__a) williamr@2: { williamr@2: _STLP_FIX_LITERAL_BUG(__s) williamr@2: _M_range_initialize(__s, __s + traits_type::length(__s)); williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: } williamr@2: williamr@2: williamr@2: template <class _CharT, class _Traits, class _Alloc> williamr@2: _STLP_EXP_DECLSPEC basic_string<_CharT, _Traits, _Alloc>::basic_string(const basic_string<_CharT, _Traits, _Alloc> & __s) williamr@2: : _String_base<_CharT,_Alloc>(__s.get_allocator()) williamr@2: { williamr@2: _M_range_initialize(__s._M_start, __s._M_finish); williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: } williamr@2: williamr@2: # if defined ( __SUNPRO_CC) && ! defined(_STLP_STATIC_CONST_INIT_BUG) williamr@2: template <class _CharT, class _Traits, class _Alloc> const size_t basic_string<_CharT, _Traits, _Alloc>::npos; williamr@2: # endif williamr@2: williamr@2: _STLP_END_NAMESPACE williamr@2: williamr@2: # undef basic_string williamr@2: # undef __size_type__ williamr@2: # undef size_type williamr@2: # undef iterator williamr@2: # endif /* NATIVE */ williamr@2: williamr@2: #endif /* _STLP_STRING_C */ williamr@2: williamr@2: // Local Variables: williamr@2: // mode:C++ williamr@2: // End: