📄 _algobase.h
字号:
/* * * 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. * *//* NOTE: This is an internal header file, included by other STL headers. * You should not attempt to use it directly. */#ifndef _STLP_INTERNAL_ALGOBASE_H#define _STLP_INTERNAL_ALGOBASE_H# if ! defined (_STLP_CSTDDEF)///# include <cstddef># endif#ifndef _STLP_CSTRING///# include <cstring>#include <monapi/string.h>#endif#ifndef _STLP_CLIMITS///# include <climits>#endif# if ! defined (_STLP_CSTDLIB)///# include <cstdlib># endif# ifndef _STLP_INTERNAL_PAIR_H# include <stl/_pair.h># endif#ifndef _STLP_INTERNAL_ITERATOR_BASE_H# include <stl/_iterator_base.h>#endif_STLP_BEGIN_NAMESPACE// swap and iter_swaptemplate <class _Tp>inline void swap(_Tp& __a, _Tp& __b) { _Tp __tmp = __a; __a = __b; __b = __tmp;}template <class _ForwardIter1, class _ForwardIter2>inline void iter_swap(_ForwardIter1 __i1, _ForwardIter2 __i2) { swap(*__i1, *__i2);}//--------------------------------------------------// min and max# if !defined (__BORLANDC__) || defined (_STLP_USE_OWN_NAMESPACE)template <class _Tp>inline const _Tp& (min)(const _Tp& __a, const _Tp& __b) { return __b < __a ? __b : __a; }template <class _Tp>inline const _Tp& (max)(const _Tp& __a, const _Tp& __b) { return __a < __b ? __b : __a; }#endif /* __BORLANDC__ */# if defined (__BORLANDC__) && ( __BORLANDC__ < 0x530 || defined (_STLP_USE_OWN_NAMESPACE))inline unsigned long (min) (unsigned long __a, unsigned long __b) { return __b < __a ? __b : __a; }inline unsigned long (max) (unsigned long __a, unsigned long __b) { return __a < __b ? __b : __a; }# endiftemplate <class _Tp, class _Compare>inline const _Tp& (min)(const _Tp& __a, const _Tp& __b, _Compare __comp) { return __comp(__b, __a) ? __b : __a;}template <class _Tp, class _Compare>inline const _Tp& (max)(const _Tp& __a, const _Tp& __b, _Compare __comp) { return __comp(__a, __b) ? __b : __a;}//--------------------------------------------------// copy// All of these auxiliary functions serve two purposes. (1) Replace// calls to copy with memmove whenever possible. (Memmove, not memcpy,// because the input and output ranges are permitted to overlap.)// (2) If we're using random access iterators, then write the loop as// a for loop with an explicit count.template <class _InputIter, class _OutputIter, class _Distance>inline _OutputIter __copy(_InputIter __first, _InputIter __last, _OutputIter __result, const input_iterator_tag &, _Distance*) { for ( ; __first != __last; ++__result, ++__first) *__result = *__first; return __result;}# if defined (_STLP_NONTEMPL_BASE_MATCH_BUG) template <class _InputIter, class _OutputIter, class _Distance>inline _OutputIter __copy(_InputIter __first, _InputIter __last, _OutputIter __result, const forward_iterator_tag &, _Distance* ) { for ( ; __first != __last; ++__result, ++__first) *__result = *__first; return __result;}template <class _InputIter, class _OutputIter, class _Distance>inline _OutputIter __copy(_InputIter __first, _InputIter __last, _OutputIter __result, const bidirectional_iterator_tag &, _Distance* __dis) { for ( ; __first != __last; ++__result, ++__first) *__result = *__first; return __result;}# endif template <class _RandomAccessIter, class _OutputIter, class _Distance>inline _OutputIter__copy(_RandomAccessIter __first, _RandomAccessIter __last, _OutputIter __result, const random_access_iterator_tag &, _Distance*) { for (_Distance __n = __last - __first; __n > 0; --__n) { *__result = *__first; ++__first; ++__result; } return __result;}inline void*__copy_trivial(const void* __first, const void* __last, void* __result) { return (__last == __first) ? __result : ((char*)memmove(__result, __first, ((const char*)__last - (const char*)__first))) + ((const char*)__last - (const char*)__first);}//--------------------------------------------------// copy_backward auxiliary functionstemplate <class _BidirectionalIter1, class _BidirectionalIter2, class _Distance>inline _BidirectionalIter2 __copy_backward(_BidirectionalIter1 __first, _BidirectionalIter1 __last, _BidirectionalIter2 __result, const bidirectional_iterator_tag &, _Distance*) { while (__first != __last) *--__result = *--__last; return __result;}template <class _RandomAccessIter, class _BidirectionalIter, class _Distance>inline _BidirectionalIter __copy_backward(_RandomAccessIter __first, _RandomAccessIter __last, _BidirectionalIter __result, const random_access_iterator_tag &, _Distance*){ for (_Distance __n = __last - __first; __n > 0; --__n) *--__result = *--__last; return __result;}inline void*__copy_trivial_backward(const void* __first, const void* __last, void* __result) { const ptrdiff_t _Num = (const char*)__last - (const char*)__first; return (_Num > 0) ? memmove((char*)__result - _Num, __first, _Num) : __result ;}template <class _InputIter, class _OutputIter>inline _OutputIter __copy_ptrs(_InputIter __first, _InputIter __last, _OutputIter __result, const __false_type&) { return __copy(__first, __last, __result, _STLP_ITERATOR_CATEGORY(__first, _InputIter), _STLP_DISTANCE_TYPE(__first, _InputIter));}template <class _InputIter, class _OutputIter>inline _OutputIter __copy_ptrs(_InputIter __first, _InputIter __last, _OutputIter __result, const __true_type&) {// we know they all pointers, so this cast is OK // return (_OutputIter)__copy_trivial(&(*__first), &(*__last), &(*__result)); return (_OutputIter)__copy_trivial(__first, __last, __result);}template <class _InputIter, class _OutputIter>inline _OutputIter __copy_aux(_InputIter __first, _InputIter __last, _OutputIter __result, const __true_type&) { return __copy_ptrs(__first, __last, __result, _IsOKToMemCpy(_STLP_VALUE_TYPE(__first, _InputIter), _STLP_VALUE_TYPE(__result, _OutputIter))._Ret());}template <class _InputIter, class _OutputIter>inline _OutputIter __copy_aux(_InputIter __first, _InputIter __last, _OutputIter __result, const __false_type&) { return __copy(__first, __last, __result, _STLP_ITERATOR_CATEGORY(__first, _InputIter), _STLP_DISTANCE_TYPE(__first, _InputIter));}template <class _InputIter, class _OutputIter>inline _OutputIter copy(_InputIter __first, _InputIter __last, _OutputIter __result) { _STLP_DEBUG_CHECK(__check_range(__first, __last)) return __copy_aux(__first, __last, __result, _BothPtrType< _InputIter, _OutputIter> :: _Ret());}template <class _InputIter, class _OutputIter>inline _OutputIter __copy_backward_ptrs(_InputIter __first, _InputIter __last, _OutputIter __result, const __false_type&) { return __copy_backward(__first, __last, __result, _STLP_ITERATOR_CATEGORY(__first, _InputIter), _STLP_DISTANCE_TYPE(__first, _InputIter));}template <class _InputIter, class _OutputIter>inline _OutputIter __copy_backward_ptrs(_InputIter __first, _InputIter __last, _OutputIter __result, const __true_type&) { return (_OutputIter)__copy_trivial_backward(__first, __last, __result); }template <class _InputIter, class _OutputIter>inline _OutputIter __copy_backward_aux(_InputIter __first, _InputIter __last, _OutputIter __result, const __false_type&) { return __copy_backward(__first, __last, __result, _STLP_ITERATOR_CATEGORY(__first,_InputIter), _STLP_DISTANCE_TYPE(__first, _InputIter));}template <class _InputIter, class _OutputIter>inline _OutputIter __copy_backward_aux(_InputIter __first, _InputIter __last, _OutputIter __result, const __true_type&) { return __copy_backward_ptrs(__first, __last, __result, _IsOKToMemCpy(_STLP_VALUE_TYPE(__first, _InputIter), _STLP_VALUE_TYPE(__result, _OutputIter))._Ret());}template <class _InputIter, class _OutputIter>inline _OutputIter copy_backward(_InputIter __first, _InputIter __last, _OutputIter __result) { _STLP_DEBUG_CHECK(__check_range(__first, __last)) return __copy_backward_aux(__first, __last, __result, _BothPtrType< _InputIter, _OutputIter> :: _Ret() );}#if ! defined (_STLP_CLASS_PARTIAL_SPECIALIZATION) && ! defined ( _STLP_SIMULATE_PARTIAL_SPEC_FOR_TYPE_TRAITS )#define _STLP_DECLARE_COPY_TRIVIAL(_Tp) \inline _Tp* copy(const _Tp* __first, const _Tp* __last, _Tp* __result) \{ return (_Tp*)__copy_trivial(__first, __last, __result); } \inline _Tp* copy_backward(const _Tp* __first, const _Tp* __last, _Tp* __result) \{ return (_Tp*)__copy_trivial_backward(__first, __last, __result); }_STLP_DECLARE_COPY_TRIVIAL(char)# ifndef _STLP_NO_SIGNED_BUILTINS_STLP_DECLARE_COPY_TRIVIAL(signed char)# endif_STLP_DECLARE_COPY_TRIVIAL(unsigned char)_STLP_DECLARE_COPY_TRIVIAL(short)_STLP_DECLARE_COPY_TRIVIAL(unsigned short)_STLP_DECLARE_COPY_TRIVIAL(int)_STLP_DECLARE_COPY_TRIVIAL(unsigned int)_STLP_DECLARE_COPY_TRIVIAL(long)_STLP_DECLARE_COPY_TRIVIAL(unsigned long)#if !defined(_STLP_NO_WCHAR_T) && !defined (_STLP_WCHAR_T_IS_USHORT) _STLP_DECLARE_COPY_TRIVIAL(wchar_t)#endif#ifdef _STLP_LONG_LONG_STLP_DECLARE_COPY_TRIVIAL(long long)_STLP_DECLARE_COPY_TRIVIAL(unsigned long long)#endif _STLP_DECLARE_COPY_TRIVIAL(float)_STLP_DECLARE_COPY_TRIVIAL(double)# ifndef _STLP_NO_LONG_DOUBLE_STLP_DECLARE_COPY_TRIVIAL(long double)# endif#undef _STLP_DECLARE_COPY_TRIVIAL#endif /* _STLP_CLASS_PARTIAL_SPECIALIZATION *///--------------------------------------------------// copy_n (not part of the C++ standard)template <class _InputIter, class _Size, class _OutputIter>_STLP_INLINE_LOOP pair<_InputIter, _OutputIter> __copy_n(_InputIter __first, _Size __count, _OutputIter __result, const input_iterator_tag &) { for ( ; __count > 0; --__count) { *__result = *__first; ++__first; ++__result; } return pair<_InputIter, _OutputIter>(__first, __result);
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -