stl_algobase.h
资源名称:Vc_STL.rar [点击查看]
上传用户:sichengcw
上传日期:2009-02-17
资源大小:202k
文件大小:14k
源码类别:
STL
开发平台:
Visual C++
- /*
- *
- * Copyright (c) 1994
- * Hewlett-Packard Company
- *
- * Permission to use, copy, modify, distribute and sell this software
- * and its documentation for any purpose is hereby granted without fee,
- * provided that the above copyright notice appear in all copies and
- * that both that copyright notice and this permission notice appear
- * in supporting documentation. Hewlett-Packard Company makes no
- * representations about the suitability of this software for any
- * purpose. It is provided "as is" without express or implied warranty.
- *
- *
- * Copyright (c) 1996
- * Silicon Graphics Computer Systems, Inc.
- *
- * Permission to use, copy, modify, distribute and sell this software
- * and its documentation for any purpose is hereby granted without fee,
- * provided that the above copyright notice appear in all copies and
- * that both that copyright notice and this permission notice appear
- * in supporting documentation. Silicon Graphics makes no
- * representations about the suitability of this software for any
- * purpose. It is provided "as is" without express or implied warranty.
- */
- /* NOTE: This is an internal header file, included by other STL headers.
- * You should not attempt to use it directly.
- */
- #ifndef __SGI_STL_INTERNAL_ALGOBASE_H
- #define __SGI_STL_INTERNAL_ALGOBASE_H
- #ifndef __STL_CONFIG_H
- #include <stl_config.h>
- #endif
- #ifndef __SGI_STL_INTERNAL_RELOPS
- #include <stl_relops.h>
- #endif
- #ifndef __SGI_STL_INTERNAL_PAIR_H
- #include <stl_pair.h>
- #endif
- #ifndef __TYPE_TRAITS_H_
- #include <type_traits.h>
- #endif
- #include <string.h>
- #include <limits.h>
- #include <stdlib.h>
- #include <stddef.h>
- #include <new.h>
- #include <iostream.h>
- #ifndef __SGI_STL_INTERNAL_ITERATOR_H
- #include <stl_iterator.h>
- #endif
- __STL_BEGIN_NAMESPACE
- template <class ForwardIterator1, class ForwardIterator2, class T>
- inline void __iter_swap(ForwardIterator1 a, ForwardIterator2 b, T*) {
- T tmp = *a;
- *a = *b;
- *b = tmp;
- }
- template <class ForwardIterator1, class ForwardIterator2>
- inline void iter_swap(ForwardIterator1 a, ForwardIterator2 b) {
- __iter_swap(a, b, value_type(a));
- }
- template <class T>
- inline void swap(T& a, T& b) {
- T tmp = a;
- a = b;
- b = tmp;
- }
- #ifndef __BORLANDC__
- #undef min
- #undef max
- template <class T>
- inline const T& min(const T& a, const T& b) {
- return b < a ? b : a;
- }
- template <class T>
- inline const T& max(const T& a, const T& b) {
- return a < b ? b : a;
- }
- #endif /* __BORLANDC__ */
- template <class T, class Compare>
- inline const T& min(const T& a, const T& b, Compare comp) {
- return comp(b, a) ? b : a;
- }
- template <class T, class Compare>
- inline const T& max(const T& a, const T& b, Compare comp) {
- return comp(a, b) ? b : a;
- }
- template <class InputIterator, class OutputIterator>
- inline OutputIterator __copy(InputIterator first, InputIterator last,
- OutputIterator result, input_iterator_tag)
- {
- for ( ; first != last; ++result, ++first)
- *result = *first;
- return result;
- }
- template <class RandomAccessIterator, class OutputIterator, class Distance>
- inline OutputIterator
- __copy_d(RandomAccessIterator first, RandomAccessIterator last,
- OutputIterator result, Distance*)
- {
- for (Distance n = last - first; n > 0; --n, ++result, ++first)
- *result = *first;
- return result;
- }
- template <class RandomAccessIterator, class OutputIterator>
- inline OutputIterator
- __copy(RandomAccessIterator first, RandomAccessIterator last,
- OutputIterator result, random_access_iterator_tag)
- {
- return __copy_d(first, last, result, distance_type(first));
- }
- template <class InputIterator, class OutputIterator>
- struct __copy_dispatch
- {
- OutputIterator operator()(InputIterator first, InputIterator last,
- OutputIterator result) {
- return __copy(first, last, result, iterator_category(first));
- }
- };
- #ifdef __STL_CLASS_PARTIAL_SPECIALIZATION
- template <class T>
- inline T* __copy_t(const T* first, const T* last, T* result, __true_type) {
- memmove(result, first, sizeof(T) * (last - first));
- return result + (last - first);
- }
- template <class T>
- inline T* __copy_t(const T* first, const T* last, T* result, __false_type) {
- return __copy_d(first, last, result, (ptrdiff_t*) 0);
- }
- template <class T>
- struct __copy_dispatch<T*, T*>
- {
- T* operator()(T* first, T* last, T* result) {
- typedef typename __type_traits<T>::has_trivial_assignment_operator t;
- return __copy_t(first, last, result, t());
- }
- };
- template <class T>
- struct __copy_dispatch<const T*, T*>
- {
- T* operator()(const T* first, const T* last, T* result) {
- typedef typename __type_traits<T>::has_trivial_assignment_operator t;
- return __copy_t(first, last, result, t());
- }
- };
- #endif /* __STL_CLASS_PARTIAL_SPECIALIZATION */
- template <class InputIterator, class OutputIterator>
- inline OutputIterator copy(InputIterator first, InputIterator last,
- OutputIterator result)
- {
- return __copy_dispatch<InputIterator,OutputIterator>()(first, last, result);
- }
- inline char* copy(const char* first, const char* last, char* result) {
- memmove(result, first, last - first);
- return result + (last - first);
- }
- inline wchar_t* copy(const wchar_t* first, const wchar_t* last,
- wchar_t* result) {
- memmove(result, first, sizeof(wchar_t) * (last - first));
- return result + (last - first);
- }
- template <class BidirectionalIterator1, class BidirectionalIterator2>
- inline BidirectionalIterator2 __copy_backward(BidirectionalIterator1 first,
- BidirectionalIterator1 last,
- BidirectionalIterator2 result) {
- while (first != last) *--result = *--last;
- return result;
- }
- template <class BidirectionalIterator1, class BidirectionalIterator2>
- struct __copy_backward_dispatch
- {
- BidirectionalIterator2 operator()(BidirectionalIterator1 first,
- BidirectionalIterator1 last,
- BidirectionalIterator2 result) {
- return __copy_backward(first, last, result);
- }
- };
- #ifdef __STL_CLASS_PARTIAL_SPECIALIZATION
- template <class T>
- inline T* __copy_backward_t(const T* first, const T* last, T* result,
- __true_type) {
- const ptrdiff_t N = last - first;
- memmove(result - N, first, sizeof(T) * N);
- return result - N;
- }
- template <class T>
- inline T* __copy_backward_t(const T* first, const T* last, T* result,
- __false_type) {
- return __copy_backward(first, last, result);
- }
- template <class T>
- struct __copy_backward_dispatch<T*, T*>
- {
- T* operator()(T* first, T* last, T* result) {
- typedef typename __type_traits<T>::has_trivial_assignment_operator t;
- return __copy_backward_t(first, last, result, t());
- }
- };
- template <class T>
- struct __copy_backward_dispatch<const T*, T*>
- {
- T* operator()(const T* first, const T* last, T* result) {
- typedef typename __type_traits<T>::has_trivial_assignment_operator t;
- return __copy_backward_t(first, last, result, t());
- }
- };
- #endif /* __STL_CLASS_PARTIAL_SPECIALIZATION */
- template <class BidirectionalIterator1, class BidirectionalIterator2>
- inline BidirectionalIterator2 copy_backward(BidirectionalIterator1 first,
- BidirectionalIterator1 last,
- BidirectionalIterator2 result) {
- return __copy_backward_dispatch<BidirectionalIterator1,
- BidirectionalIterator2>()(first, last,
- result);
- }
- template <class InputIterator, class Size, class OutputIterator>
- pair<InputIterator, OutputIterator> __copy_n(InputIterator first, Size count,
- OutputIterator result,
- input_iterator_tag) {
- for ( ; count > 0; --count, ++first, ++result)
- *result = *first;
- return pair<InputIterator, OutputIterator>(first, result);
- }
- template <class RandomAccessIterator, class Size, class OutputIterator>
- inline pair<RandomAccessIterator, OutputIterator>
- __copy_n(RandomAccessIterator first, Size count,
- OutputIterator result,
- random_access_iterator_tag) {
- RandomAccessIterator last = first + count;
- return pair<RandomAccessIterator, OutputIterator>(last,
- copy(first, last, result));
- }
- template <class InputIterator, class Size, class OutputIterator>
- inline pair<InputIterator, OutputIterator>
- copy_n(InputIterator first, Size count,
- OutputIterator result) {
- return __copy_n(first, count, result, iterator_category(first));
- }
- template <class ForwardIterator, class T>
- void fill(ForwardIterator first, ForwardIterator last, const T& value) {
- for ( ; first != last; ++first)
- *first = value;
- }
- template <class OutputIterator, class Size, class T>
- OutputIterator fill_n(OutputIterator first, Size n, const T& value) {
- for ( ; n > 0; --n, ++first)
- *first = value;
- return first;
- }
- template <class InputIterator1, class InputIterator2>
- pair<InputIterator1, InputIterator2> mismatch(InputIterator1 first1,
- InputIterator1 last1,
- InputIterator2 first2) {
- while (first1 != last1 && *first1 == *first2) {
- ++first1;
- ++first2;
- }
- return pair<InputIterator1, InputIterator2>(first1, first2);
- }
- template <class InputIterator1, class InputIterator2, class BinaryPredicate>
- pair<InputIterator1, InputIterator2> mismatch(InputIterator1 first1,
- InputIterator1 last1,
- InputIterator2 first2,
- BinaryPredicate binary_pred) {
- while (first1 != last1 && binary_pred(*first1, *first2)) {
- ++first1;
- ++first2;
- }
- return pair<InputIterator1, InputIterator2>(first1, first2);
- }
- template <class InputIterator1, class InputIterator2>
- inline bool equal(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2) {
- for ( ; first1 != last1; ++first1, ++first2)
- if (*first1 != *first2)
- return false;
- return true;
- }
- template <class InputIterator1, class InputIterator2, class BinaryPredicate>
- inline bool equal(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, BinaryPredicate binary_pred) {
- for ( ; first1 != last1; ++first1, ++first2)
- if (!binary_pred(*first1, *first2))
- return false;
- return true;
- }
- template <class InputIterator1, class InputIterator2>
- bool lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, InputIterator2 last2) {
- for ( ; first1 != last1 && first2 != last2; ++first1, ++first2) {
- if (*first1 < *first2)
- return true;
- if (*first2 < *first1)
- return false;
- }
- return first1 == last1 && first2 != last2;
- }
- template <class InputIterator1, class InputIterator2, class Compare>
- bool lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, InputIterator2 last2,
- Compare comp) {
- for ( ; first1 != last1 && first2 != last2; ++first1, ++first2) {
- if (comp(*first1, *first2))
- return true;
- if (comp(*first2, *first1))
- return false;
- }
- return first1 == last1 && first2 != last2;
- }
- inline bool
- lexicographical_compare(const unsigned char* first1,
- const unsigned char* last1,
- const unsigned char* first2,
- const unsigned char* last2)
- {
- const size_t len1 = last1 - first1;
- const size_t len2 = last2 - first2;
- const int result = memcmp(first1, first2, min(len1, len2));
- return result != 0 ? result < 0 : len1 < len2;
- }
- inline bool lexicographical_compare(const char* first1, const char* last1,
- const char* first2, const char* last2)
- {
- #if CHAR_MAX == SCHAR_MAX
- return lexicographical_compare((const signed char*) first1,
- (const signed char*) last1,
- (const signed char*) first2,
- (const signed char*) last2);
- #else
- return lexicographical_compare((const unsigned char*) first1,
- (const unsigned char*) last1,
- (const unsigned char*) first2,
- (const unsigned char*) last2);
- #endif
- }
- template <class InputIterator1, class InputIterator2>
- int lexicographical_compare_3way(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, InputIterator2 last2)
- {
- while (first1 != last1 && first2 != last2) {
- if (*first1 < *first2) return -1;
- if (*first2 < *first1) return 1;
- ++first1; ++first2;
- }
- if (first2 == last2) {
- return !(first1 == last1);
- } else {
- return -1;
- }
- }
- inline int
- lexicographical_compare_3way(const unsigned char* first1,
- const unsigned char* last1,
- const unsigned char* first2,
- const unsigned char* last2)
- {
- const ptrdiff_t len1 = last1 - first1;
- const ptrdiff_t len2 = last2 - first2;
- const int result = memcmp(first1, first2, min(len1, len2));
- return result != 0 ? result : (len1 == len2 ? 0 : (len1 < len2 ? -1 : 1));
- }
- inline int lexicographical_compare_3way(const char* first1, const char* last1,
- const char* first2, const char* last2)
- {
- #if CHAR_MAX == SCHAR_MAX
- return lexicographical_compare_3way(
- (const signed char*) first1,
- (const signed char*) last1,
- (const signed char*) first2,
- (const signed char*) last2);
- #else
- return lexicographical_compare_3way((const unsigned char*) first1,
- (const unsigned char*) last1,
- (const unsigned char*) first2,
- (const unsigned char*) last2);
- #endif
- }
- __STL_END_NAMESPACE
- #endif /* __SGI_STL_INTERNAL_ALGOBASE_H */
- // Local Variables:
- // mode:C++
- // End: