?? stl_string.c
字號:
}
__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 <class _CharT, class _Traits, class _Alloc>
void basic_string<_CharT,_Traits,_Alloc>::insert(__iterator__ __position,
size_t __n, _CharT __c)
{
__stl_debug_do(__check_if_owner(&_M_iter_list,__position));
if (__n != 0) {
if (size_type(_M_end_of_storage._M_data - _M_finish) >= __n + 1) {
const size_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);
_Traits::assign(_Make_ptr(__position), __n, __c);
}
else {
uninitialized_fill_n(_M_finish + 1, __n - __elems_after - 1, __c);
_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));
_Traits::assign(_Make_ptr(__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, _Make_ptr(__position), __new_start);
__new_finish = uninitialized_fill_n(__new_finish, __n, __c);
__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;
}
}
}
#ifndef __STL_MEMBER_TEMPLATES
template <class _CharT, class _Traits, class _Alloc>
void
basic_string<_CharT,_Traits,_Alloc>::insert(__iterator__ __position,
const _CharT* __first,
const _CharT* __last)
{
__stl_debug_do(__check_if_owner(&_M_iter_list,__position) &&
__check_range(__first, __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 - _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 {
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(_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(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, _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_MEMBER_TEMPLATES */
template <class _CharT, class _Traits, class _Alloc>
basic_string<_CharT,_Traits,_Alloc>&
basic_string<_CharT,_Traits,_Alloc>
::replace(iterator __first, iterator __last, __size_type__ __n, _CharT __c)
{
__stl_debug_do(__check_if_owner(&_M_iter_list,__first)
&& __check_range(__first, __last));
const size_type __len = __STATIC_CAST(size_type,(__last - __first));
if (__len >= __n) {
_Traits::assign(_Make_ptr(__first), __n, __c);
erase(__first + __n, __last);
}
else {
_Traits::assign(_Make_ptr(__first), __len, __c);
insert(__last, __n - __len, __c);
}
return *this;
}
#ifndef __STL_MEMBER_TEMPLATES
template <class _CharT, class _Traits, class _Alloc>
basic_string<_CharT,_Traits,_Alloc>&
basic_string<_CharT,_Traits,_Alloc>
::replace(iterator __first, iterator __last,
const _CharT* __f, const _CharT* __l)
{
__stl_debug_do(__check_if_owner(&_M_iter_list,__first) &&
__check_range(__first, __last) &&
__check_range(__f, __l));
const ptrdiff_t __n = __l - __f;
const difference_type __len = __last - __first;
if (__len >= __n) {
_M_copy(__f, __l, _Make_ptr(__first));
erase(__first + __n, __last);
}
else {
const _CharT* __m = __f + __len;
_M_copy(__f, __m, _Make_ptr(__first));
insert(__last, __m, __l);
}
return *this;
}
#endif /* __STL_MEMBER_TEMPLATES */
template <class _CharT, class _Traits, class _Alloc>
__size_type__
basic_string<_CharT,_Traits,_Alloc>
::find(const _CharT* __s, size_type __pos, size_type __n) const
{
if (__pos >= 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 <class _CharT, class _Traits, class _Alloc>
__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 <class _CharT, class _Traits, class _Alloc>
__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 <class _CharT, class _Traits, class _Alloc>
__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 <class _CharT, class _Traits, class _Alloc>
__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 <class _CharT, class _Traits, class _Alloc>
__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 <class _CharT, class _Traits, class _Alloc>
__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 <class _CharT, class _Traits, class _Alloc>
__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 <class _CharT, class _Traits, class _Alloc>
__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 <class _CharT, class _Traits, class _Alloc>
__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;
}
}
#ifdef __STL_USE_NEW_IOSTREAMS
?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -