williamr@2: /*
williamr@2:  *
williamr@2:  * Copyright (c) 1994
williamr@2:  * Hewlett-Packard Company
williamr@2:  *
williamr@2:  * Copyright (c) 1996-1998
williamr@2:  * Silicon Graphics Computer Systems, Inc.
williamr@2:  *
williamr@2:  * Copyright (c) 1997
williamr@2:  * Moscow Center for SPARC Technology
williamr@2:  *
williamr@4:  * 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@4:  * 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: 
williamr@2: /* NOTE: This is an internal header file, included by other STL headers.
williamr@2:  *   You should not attempt to use it directly.
williamr@2:  */
williamr@2: 
williamr@2: #ifndef _STLP_INTERNAL_ITERATOR_BASE_H
williamr@2: #define _STLP_INTERNAL_ITERATOR_BASE_H
williamr@2: 
williamr@4: #ifndef _STLP_INTERNAL_CSTDDEF
williamr@4: #  include <stl/_cstddef.h>
williamr@2: #endif
williamr@2: 
williamr@4: //# if defined  (_STLP_IMPORT_VENDOR_CSTD) && ! defined (_STLP_VENDOR_GLOBAL_CSTD)
williamr@4: //_STLP_BEGIN_NAMESPACE
williamr@4: //using namespace _STLP_VENDOR_CSTD;
williamr@4: //_STLP_END_NAMESPACE
williamr@4: //#endif /* _STLP_IMPORT_VENDOR_CSTD */
williamr@2: 
williamr@4: #if !defined(_STLP_USE_OLD_HP_ITERATOR_QUERIES) && !defined(_STLP_CLASS_PARTIAL_SPECIALIZATION)
williamr@4: #  ifndef _STLP_TYPE_TRAITS_H
williamr@4: #    include <stl/type_traits.h>
williamr@4: #  endif
williamr@2: #endif
williamr@2: 
williamr@2: _STLP_BEGIN_NAMESPACE
williamr@2: 
williamr@2: struct input_iterator_tag {};
williamr@2: struct output_iterator_tag {};
williamr@2: struct forward_iterator_tag : public input_iterator_tag {};
williamr@2: struct bidirectional_iterator_tag : public forward_iterator_tag {};
williamr@2: struct random_access_iterator_tag : public bidirectional_iterator_tag {};
williamr@2: 
williamr@2: 
williamr@4: template <class _Category, class _Tp, _STLP_DFL_TMPL_PARAM(_Distance,ptrdiff_t),
williamr@4:           _STLP_DFL_TMPL_PARAM(_Pointer,_Tp*), _STLP_DFL_TMPL_PARAM(_Reference,_Tp&) >
williamr@2: struct iterator {
williamr@2:   typedef _Category  iterator_category;
williamr@2:   typedef _Tp        value_type;
williamr@2:   typedef _Distance  difference_type;
williamr@2:   typedef _Pointer   pointer;
williamr@2:   typedef _Reference reference;
williamr@2: };
williamr@2: _STLP_TEMPLATE_NULL
williamr@2: struct iterator<output_iterator_tag, void, void, void, void> {
williamr@2:   typedef output_iterator_tag  iterator_category;
williamr@2: #ifdef _STLP_CLASS_PARTIAL_SPECIALIZATION
williamr@2:   typedef void                value_type;
williamr@2:   typedef void                difference_type;
williamr@2:   typedef void                pointer;
williamr@2:   typedef void                reference;
williamr@2: #endif
williamr@2: };
williamr@2: 
williamr@4: #if defined (_STLP_USE_OLD_HP_ITERATOR_QUERIES)
williamr@2: #  define _STLP_ITERATOR_CATEGORY(_It, _Tp) iterator_category(_It)
williamr@2: #  define _STLP_DISTANCE_TYPE(_It, _Tp)     distance_type(_It)
williamr@2: #  define _STLP_VALUE_TYPE(_It, _Tp)        value_type(_It)
williamr@4: //Old HP iterator queries do not give information about the iterator
williamr@4: //associated reference type so we consider that it is not a real reference.
williamr@4: #  define _STLP_IS_REF_TYPE_REAL_REF(_It, _Tp) __false_type()
williamr@4: #else
williamr@4: #  if defined (_STLP_CLASS_PARTIAL_SPECIALIZATION)
williamr@4: #    define _STLP_VALUE_TYPE(_It, _Tp)        (typename iterator_traits< _Tp >::value_type*)0
williamr@4: #    define _STLP_DISTANCE_TYPE(_It, _Tp)     (typename iterator_traits< _Tp >::difference_type*)0
williamr@4: #    if defined (__BORLANDC__) || defined (__SUNPRO_CC) || ( defined (__MWERKS__) && (__MWERKS__ <= 0x2303)) || ( defined (__sgi) && defined (_COMPILER_VERSION)) || defined (__DMC__)
williamr@4: #      define _STLP_ITERATOR_CATEGORY(_It, _Tp) iterator_traits< _Tp >::iterator_category()
williamr@4: #    else
williamr@4: #      define _STLP_ITERATOR_CATEGORY(_It, _Tp) typename iterator_traits< _Tp >::iterator_category()
williamr@4: #    endif
williamr@4: #    define _STLP_IS_REF_TYPE_REAL_REF(_It, _Tp) _IsRefType< typename iterator_traits< _Tp >::reference >::_Ret()
williamr@2: #  else
williamr@4: #    define _STLP_ITERATOR_CATEGORY(_It, _Tp)   __iterator_category(_It, _IsPtrType<_Tp>::_Ret())
williamr@4: #    define _STLP_DISTANCE_TYPE(_It, _Tp)       (ptrdiff_t*)0
williamr@4: #    define _STLP_VALUE_TYPE(_It, _Tp)          __value_type(_It, _IsPtrType<_Tp>::_Ret() )
williamr@4: #    define _STLP_IS_REF_TYPE_REAL_REF(_It, _Tp) __false_type()
williamr@2: #  endif
williamr@4: #endif
williamr@2: 
williamr@2: template <class _Iterator>
williamr@2: struct iterator_traits {
williamr@2:   typedef typename _Iterator::iterator_category iterator_category;
williamr@2:   typedef typename _Iterator::value_type        value_type;
williamr@2:   typedef typename _Iterator::difference_type   difference_type;
williamr@2:   typedef typename _Iterator::pointer           pointer;
williamr@2:   typedef typename _Iterator::reference         reference;
williamr@2: };
williamr@2: 
williamr@2: 
williamr@4: #if defined (_STLP_CLASS_PARTIAL_SPECIALIZATION) && ! defined (__SUNPRO_CC)
williamr@2: #  define _STLP_DIFFERENCE_TYPE(_Iterator) typename iterator_traits<_Iterator>::difference_type
williamr@4: #else
williamr@2: #  define _STLP_DIFFERENCE_TYPE(_Iterator) ptrdiff_t
williamr@4: #endif
williamr@2: 
williamr@4: #ifdef _STLP_CLASS_PARTIAL_SPECIALIZATION
williamr@2: 
williamr@2: // fbp : this order keeps gcc happy
williamr@2: template <class _Tp>
williamr@2: struct iterator_traits<const _Tp*> {
williamr@4:   typedef random_access_iterator_tag  iterator_category;
williamr@2:   typedef _Tp                         value_type;
williamr@2:   typedef ptrdiff_t                   difference_type;
williamr@2:   typedef const _Tp*                  pointer;
williamr@2:   typedef const _Tp&                  reference;
williamr@2: };
williamr@2: 
williamr@2: template <class _Tp>
williamr@2: struct iterator_traits<_Tp*> {
williamr@4:   typedef random_access_iterator_tag  iterator_category;
williamr@2:   typedef _Tp                         value_type;
williamr@2:   typedef ptrdiff_t                   difference_type;
williamr@2:   typedef _Tp*                        pointer;
williamr@2:   typedef _Tp&                        reference;
williamr@2: };
williamr@2: 
williamr@2: #  if defined (__BORLANDC__)
williamr@2: template <class _Tp>
williamr@2: struct iterator_traits<_Tp* const> {
williamr@4:   typedef random_access_iterator_tag  iterator_category;
williamr@2:   typedef _Tp                         value_type;
williamr@2:   typedef ptrdiff_t                   difference_type;
williamr@2:   typedef const _Tp*                  pointer;
williamr@2:   typedef const _Tp&                  reference;
williamr@2: };
williamr@2: #  endif
williamr@2: 
williamr@4: #endif /* _STLP_CLASS_PARTIAL_SPECIALIZATION */
williamr@2: 
williamr@2: 
williamr@4: #if defined (_STLP_CLASS_PARTIAL_SPECIALIZATION) || \
williamr@4:    (defined (_STLP_SIMULATE_PARTIAL_SPEC_FOR_TYPE_TRAITS) && ! defined (_STLP_NO_ARROW_OPERATOR))
williamr@2: #  define _STLP_POINTERS_SPECIALIZE( _TpP )
williamr@2: #  define _STLP_DEFINE_ARROW_OPERATOR  pointer operator->() const { return &(operator*()); }
williamr@4: #else
williamr@2: #  include <stl/_ptrs_specialize.h>
williamr@4: #endif
williamr@2: 
williamr@4: #ifndef _STLP_USE_OLD_HP_ITERATOR_QUERIES
williamr@2: // The overloaded functions iterator_category, distance_type, and
williamr@2: // value_type are not part of the C++ standard.  (They have been
williamr@2: // replaced by struct iterator_traits.)  They are included for
williamr@2: // backward compatibility with the HP STL.
williamr@2: // We introduce internal names for these functions.
williamr@2: 
williamr@4: #  ifdef _STLP_CLASS_PARTIAL_SPECIALIZATION
williamr@2: 
williamr@2: template <class _Iter>
williamr@2: inline typename iterator_traits<_Iter>::iterator_category __iterator_category(const _Iter&) {
williamr@2:   typedef typename iterator_traits<_Iter>::iterator_category _Category;
williamr@2:   return _Category();
williamr@2: }
williamr@2: 
williamr@2: template <class _Iter>
williamr@2: inline typename iterator_traits<_Iter>::difference_type* __distance_type(const _Iter&) {
williamr@2:   typedef typename iterator_traits<_Iter>::difference_type _diff_type;
williamr@2:   return __STATIC_CAST(_diff_type*,0);
williamr@2: }
williamr@2: 
williamr@2: template <class _Iter>
williamr@2: inline typename iterator_traits<_Iter>::value_type* __value_type(const _Iter&) {
williamr@2:   typedef typename iterator_traits<_Iter>::value_type _value_type;
williamr@2:   return __STATIC_CAST(_value_type*,0);
williamr@2: }
williamr@2: 
williamr@4: #  else /* _STLP_CLASS_PARTIAL_SPECIALIZATION */
williamr@2: 
williamr@2: template <class _Iter>
williamr@4: inline random_access_iterator_tag
williamr@2: __iterator_category(const _Iter&, const __true_type&) {
williamr@2:   return random_access_iterator_tag();
williamr@2: }
williamr@2: 
williamr@2: template <class _Iter>
williamr@2: inline _STLP_TYPENAME_ON_RETURN_TYPE iterator_traits<_Iter>::iterator_category
williamr@2: __iterator_category(const _Iter&, const __false_type&) {
williamr@2:   typedef typename iterator_traits<_Iter>::iterator_category _Category;
williamr@2:   return _Category();
williamr@2: }
williamr@2: 
williamr@2: 
williamr@2: template <class _Iter>
williamr@4: inline ptrdiff_t* _STLP_CALL __distance_type(const _Iter&) { return __STATIC_CAST(ptrdiff_t*, 0); }
williamr@2: 
williamr@2: template <class _Iter>
williamr@4: inline _STLP_TYPENAME_ON_RETURN_TYPE iterator_traits<_Iter>::value_type*
williamr@2: __value_type(const _Iter&, const __false_type&) {
williamr@2:   typedef typename iterator_traits<_Iter>::value_type _value_type;
williamr@2:   return __STATIC_CAST(_value_type*,0);
williamr@2: }
williamr@2: 
williamr@2: template <class _Tp>
williamr@4: inline _Tp*
williamr@2: __value_type(const _Tp*, const __true_type&) {
williamr@2:   return __STATIC_CAST(_Tp*, 0);
williamr@2: }
williamr@2: 
williamr@4: #  endif /* _STLP_CLASS_PARTIAL_SPECIALIZATION */
williamr@2: 
williamr@4: #else /* _STLP_USE_OLD_HP_ITERATOR_QUERIES */
williamr@2: template <class _Category, class _Tp, class _Distance, class _Pointer, class _Reference>
williamr@2: inline _Category _STLP_CALL iterator_category(const iterator<_Category,_Tp,_Distance,_Pointer,_Reference>&) { return _Category(); }
williamr@2: template <class _Category, class _Tp, class _Distance, class _Pointer, class _Reference>
williamr@4: inline _Tp* _STLP_CALL value_type(const iterator<_Category,_Tp,_Distance,_Pointer,_Reference>&) { return __STATIC_CAST(_Tp*, 0); }
williamr@2: template <class _Category, class _Tp, class _Distance, class _Pointer, class _Reference>
williamr@4: inline _Distance* _STLP_CALL distance_type(const iterator<_Category,_Tp,_Distance,_Pointer,_Reference>&) { return __STATIC_CAST(_Distance*, 0); }
williamr@2: template <class _Tp>
williamr@2: inline random_access_iterator_tag _STLP_CALL iterator_category(const _Tp*) { return random_access_iterator_tag(); }
williamr@2: template <class _Tp>
williamr@4: inline _Tp* _STLP_CALL value_type(const _Tp*) { return __STATIC_CAST(_Tp*, 0); }
williamr@2: template <class _Tp>
williamr@4: inline ptrdiff_t* _STLP_CALL distance_type(const _Tp*) { return __STATIC_CAST(ptrdiff_t*, 0); }
williamr@2: #endif /* _STLP_USE_OLD_HP_ITERATOR_QUERIES */
williamr@2: 
williamr@2: # if ! defined (_STLP_NO_ANACHRONISMS)
williamr@2: // The base classes input_iterator, output_iterator, forward_iterator,
williamr@2: // bidirectional_iterator, and random_access_iterator are not part of
williamr@2: // the C++ standard.  (They have been replaced by struct iterator.)
williamr@2: // They are included for backward compatibility with the HP STL.
williamr@4: template <class _Tp, class _Distance> struct input_iterator :
williamr@2:   public iterator <input_iterator_tag, _Tp, _Distance, _Tp*, _Tp&> {};
williamr@2: struct output_iterator : public iterator <output_iterator_tag, void, void, void, void> {};
williamr@2: template <class _Tp, class _Distance> struct forward_iterator :
williamr@2:   public iterator<forward_iterator_tag, _Tp, _Distance, _Tp*, _Tp&> {};
williamr@2: template <class _Tp, class _Distance> struct bidirectional_iterator :
williamr@2:   public iterator<bidirectional_iterator_tag, _Tp, _Distance, _Tp*, _Tp&> {};
williamr@2: template <class _Tp, class _Distance> struct random_access_iterator :
williamr@2:   public iterator<random_access_iterator_tag, _Tp, _Distance, _Tp*, _Tp&> {};
williamr@2: 
williamr@2: # if defined (_STLP_BASE_MATCH_BUG) && defined (_STLP_USE_OLD_HP_ITERATOR_QUERIES)
williamr@4: template <class _Tp, class _Distance>
williamr@4: inline input_iterator_tag _STLP_CALL
williamr@2: iterator_category(const input_iterator<_Tp, _Distance>&) { return input_iterator_tag(); }
williamr@2: inline output_iterator_tag _STLP_CALL
williamr@2: iterator_category(const output_iterator&) { return output_iterator_tag(); }
williamr@4: template <class _Tp, class _Distance>
williamr@2: inline forward_iterator_tag _STLP_CALL
williamr@2: iterator_category(const forward_iterator<_Tp, _Distance>&) { return forward_iterator_tag(); }
williamr@4: template <class _Tp, class _Distance>
williamr@4: inline bidirectional_iterator_tag _STLP_CALL
williamr@2: iterator_category(const bidirectional_iterator<_Tp, _Distance>&) { return bidirectional_iterator_tag(); }
williamr@4: template <class _Tp, class _Distance>
williamr@2: inline random_access_iterator_tag _STLP_CALL
williamr@2: iterator_category(const random_access_iterator<_Tp, _Distance>&) { return random_access_iterator_tag(); }
williamr@4: template <class _Tp, class _Distance>
williamr@4: inline _Tp*  _STLP_CALL value_type(const input_iterator<_Tp, _Distance>&) { return __STATIC_CAST(_Tp*, 0); }
williamr@4: template <class _Tp, class _Distance>
williamr@4: inline _Tp* _STLP_CALL value_type(const forward_iterator<_Tp, _Distance>&) { return __STATIC_CAST(_Tp*, 0); }
williamr@4: template <class _Tp, class _Distance>
williamr@4: inline _Tp* _STLP_CALL value_type(const bidirectional_iterator<_Tp, _Distance>&) { return __STATIC_CAST(_Tp*, 0); }
williamr@4: template <class _Tp, class _Distance>
williamr@4: inline _Tp* _STLP_CALL value_type(const random_access_iterator<_Tp, _Distance>&) { return __STATIC_CAST(_Tp*, 0); }
williamr@4: template <class _Tp, class _Distance>
williamr@4: inline _Distance* _STLP_CALL distance_type(const input_iterator<_Tp, _Distance>&) { return __STATIC_CAST(_Distance*, 0); }
williamr@4: template <class _Tp, class _Distance>
williamr@4: inline _Distance* _STLP_CALL distance_type(const forward_iterator<_Tp, _Distance>&) { return __STATIC_CAST(_Distance*, 0); }
williamr@4: template <class _Tp, class _Distance>
williamr@4: inline _Distance* _STLP_CALL distance_type(const bidirectional_iterator<_Tp, _Distance>&) { return __STATIC_CAST(_Distance*, 0);}
williamr@4: template <class _Tp, class _Distance>
williamr@4: inline _Distance* _STLP_CALL distance_type(const random_access_iterator<_Tp, _Distance>&) { return __STATIC_CAST(_Distance*, 0); }
williamr@2: # endif /* BASE_MATCH */
williamr@2: 
williamr@2: #endif /* _STLP_NO_ANACHRONISMS */
williamr@2: 
williamr@2: template <class _InputIterator, class _Distance>
williamr@2: inline void _STLP_CALL __distance(const _InputIterator& __first, const _InputIterator& __last,
williamr@4:                                   _Distance& __n, const input_iterator_tag &) {
williamr@2:   _InputIterator __it(__first);
williamr@2:   while (__it != __last) { ++__it; ++__n; }
williamr@2: }
williamr@2: 
williamr@4: 
williamr@4: # if defined (_STLP_NONTEMPL_BASE_MATCH_BUG)
williamr@2: template <class _ForwardIterator, class _Distance>
williamr@2: inline void _STLP_CALL __distance(const _ForwardIterator& __first, const _ForwardIterator& __last,
williamr@4:                                   _Distance& __n, const forward_iterator_tag &) {
williamr@2:   _ForwardIterator __it(__first);
williamr@2:   while (__it != __last) { ++__first; ++__n; }
williamr@2: }
williamr@2: 
williamr@2: template <class _BidirectionalIterator, class _Distance>
williamr@4: _STLP_INLINE_LOOP void _STLP_CALL __distance(const _BidirectionalIterator& __first,
williamr@4:                                              const _BidirectionalIterator& __last,
williamr@4:                                              _Distance& __n, const bidirectional_iterator_tag &) {
williamr@2:   _BidirectionalIterator __it(__first);
williamr@2:   while (__it != __last) { ++__it; ++__n; }
williamr@2: }
williamr@2: # endif
williamr@2: 
williamr@2: template <class _RandomAccessIterator, class _Distance>
williamr@4: inline void _STLP_CALL __distance(const _RandomAccessIterator& __first,
williamr@4:                                   const _RandomAccessIterator& __last,
williamr@4:                                   _Distance& __n, const random_access_iterator_tag &) {
williamr@2:   __n += __last - __first;
williamr@2: }
williamr@2: 
williamr@4: #ifndef _STLP_NO_ANACHRONISMS
williamr@2: template <class _InputIterator, class _Distance>
williamr@4: inline void _STLP_CALL distance(const _InputIterator& __first,
williamr@4:         const _InputIterator& __last, _Distance& __n) {
williamr@2:   __distance(__first, __last, __n, _STLP_ITERATOR_CATEGORY(__first, _InputIterator));
williamr@2: }
williamr@2: #endif
williamr@2: 
williamr@2: template <class _InputIterator>
williamr@2: inline _STLP_DIFFERENCE_TYPE(_InputIterator) _STLP_CALL
williamr@2: __distance(const _InputIterator& __first, const _InputIterator& __last, const input_iterator_tag &) {
williamr@2:   _STLP_DIFFERENCE_TYPE(_InputIterator) __n = 0;
williamr@4:   _InputIterator __it(__first);
williamr@2:   while (__it != __last) {
williamr@2:     ++__it; ++__n;
williamr@2:   }
williamr@2:   return __n;
williamr@2: }
williamr@2: 
williamr@4: # if defined (_STLP_NONTEMPL_BASE_MATCH_BUG)
williamr@2: template <class _ForwardIterator>
williamr@4: inline _STLP_DIFFERENCE_TYPE(_ForwardIterator) _STLP_CALL
williamr@2: __distance(const _ForwardIterator& __first, const _ForwardIterator& __last,
williamr@2:            const forward_iterator_tag &)
williamr@2: {
williamr@2:   _STLP_DIFFERENCE_TYPE(_ForwardIterator) __n = 0;
williamr@2:   _ForwardIterator __it(__first);
williamr@2:   while (__it != __last) {
williamr@2:     ++__it; ++__n;
williamr@2:   }
williamr@2:   return __n;
williamr@4: 
williamr@2: }
williamr@2: 
williamr@2: template <class _BidirectionalIterator>
williamr@4: _STLP_INLINE_LOOP _STLP_DIFFERENCE_TYPE(_BidirectionalIterator) _STLP_CALL
williamr@4: __distance(const _BidirectionalIterator& __first,
williamr@2:            const _BidirectionalIterator& __last,
williamr@2:            const bidirectional_iterator_tag &) {
williamr@2:   _STLP_DIFFERENCE_TYPE(_BidirectionalIterator) __n = 0;
williamr@2:   _BidirectionalIterator __it(__first);
williamr@2:   while (__it != __last) {
williamr@2:     ++__it; ++__n;
williamr@2:   }
williamr@2:   return __n;
williamr@2: }
williamr@2: # endif
williamr@2: 
williamr@2: template <class _RandomAccessIterator>
williamr@2: inline _STLP_DIFFERENCE_TYPE(_RandomAccessIterator) _STLP_CALL
williamr@2: __distance(const _RandomAccessIterator& __first, const _RandomAccessIterator& __last,
williamr@2:            const random_access_iterator_tag &) {
williamr@2:   return __last - __first;
williamr@2: }
williamr@2: 
williamr@2: template <class _InputIterator>
williamr@2: inline _STLP_DIFFERENCE_TYPE(_InputIterator) _STLP_CALL
williamr@4: distance(_InputIterator __first, _InputIterator __last) {
williamr@4:   return __distance(__first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIterator));
williamr@2: }
williamr@2: 
williamr@2: // fbp: those are being used for iterator/const_iterator definitions everywhere
williamr@2: template <class _Tp>
williamr@2: struct _Nonconst_traits;
williamr@2: 
williamr@2: template <class _Tp>
williamr@2: struct _Const_traits {
williamr@2:   typedef _Tp value_type;
williamr@2:   typedef const _Tp&  reference;
williamr@2:   typedef const _Tp*  pointer;
williamr@4:   typedef _Const_traits<_Tp> _ConstTraits;
williamr@4:   typedef _Nonconst_traits<_Tp> _NonConstTraits;
williamr@2: };
williamr@2: 
williamr@2: template <class _Tp>
williamr@2: struct _Nonconst_traits {
williamr@2:   typedef _Tp value_type;
williamr@2:   typedef _Tp& reference;
williamr@2:   typedef _Tp* pointer;
williamr@4:   typedef _Const_traits<_Tp> _ConstTraits;
williamr@4:   typedef _Nonconst_traits<_Tp> _NonConstTraits;
williamr@2: };
williamr@2: 
williamr@4: /*
williamr@4:  * dums: A special iterator/const_iterator traits for set and multiset for which even
williamr@4:  * the iterator is not mutable
williamr@4:  */
williamr@4: template <class _Tp>
williamr@4: struct _Nonconst_Const_traits;
williamr@4: 
williamr@4: template <class _Tp>
williamr@4: struct _Const_Const_traits {
williamr@4:   typedef _Tp value_type;
williamr@4:   typedef const _Tp&  reference;
williamr@4:   typedef const _Tp*  pointer;
williamr@4:   typedef _Const_Const_traits<_Tp> _ConstTraits;
williamr@4:   typedef _Nonconst_Const_traits<_Tp> _NonConstTraits;
williamr@4: };
williamr@4: 
williamr@4: template <class _Tp>
williamr@4: struct _Nonconst_Const_traits {
williamr@4:   typedef _Tp value_type;
williamr@4:   typedef const _Tp& reference;
williamr@4:   typedef const _Tp* pointer;
williamr@4:   typedef _Const_Const_traits<_Tp> _ConstTraits;
williamr@4:   typedef _Nonconst_Const_traits<_Tp> _NonConstTraits;
williamr@4: };
williamr@4: 
williamr@4: /*
williamr@4:  * A macro to generate a new iterator traits from one of the
williamr@4:  * previous one. Changing the iterator traits type make iterators
williamr@4:  * from different containers not comparable.
williamr@4:  */
williamr@4: #define _STLP_CREATE_ITERATOR_TRAITS_BASE(Motif, Traits)        \
williamr@4: template <class _Tp>                                            \
williamr@4: struct _##Motif;                                                \
williamr@4: template <class _Tp>                                            \
williamr@4: struct _Const##Motif : public _STLP_STD::_Const_##Traits<_Tp> {  \
williamr@4:   typedef _Const##Motif<_Tp> _ConstTraits;                      \
williamr@4:   typedef _##Motif<_Tp> _NonConstTraits;                        \
williamr@4: };                                                              \
williamr@4: template <class _Tp>                                            \
williamr@4: struct _##Motif : public _STLP_STD::_Nonconst_##Traits<_Tp> {    \
williamr@4:   typedef _Const##Motif<_Tp> _ConstTraits;                      \
williamr@4:   typedef _##Motif<_Tp> _NonConstTraits;                        \
williamr@4: };
williamr@4: 
williamr@4: #define _STLP_CREATE_ITERATOR_TRAITS(Motif, Traits)             \
williamr@4: _STLP_MOVE_TO_PRIV_NAMESPACE                                    \
williamr@4: _STLP_CREATE_ITERATOR_TRAITS_BASE(Motif, Traits)                \
williamr@4: _STLP_MOVE_TO_STD_NAMESPACE
williamr@4: 
williamr@4: #define _STLP_CREATE_HASH_ITERATOR_TRAITS(Motif, Traits)        \
williamr@4: _STLP_MOVE_TO_PRIV_NAMESPACE                                    \
williamr@4: _STLP_CREATE_ITERATOR_TRAITS_BASE(NonLocal##Motif, Traits)      \
williamr@4: _STLP_CREATE_ITERATOR_TRAITS_BASE(Local##Motif, Traits)         \
williamr@4: template <class _Tp>                                            \
williamr@4: struct _##Motif {                                               \
williamr@4:   typedef _ConstNonLocal##Motif<_Tp> _ConstTraits;              \
williamr@4:   typedef _NonLocal##Motif<_Tp> _NonConstTraits;                \
williamr@4:   typedef _ConstLocal##Motif<_Tp> _ConstLocalTraits;            \
williamr@4:   typedef _Local##Motif<_Tp> _NonConstLocalTraits;              \
williamr@4: };                                                              \
williamr@4: _STLP_MOVE_TO_STD_NAMESPACE
williamr@4: 
williamr@4: /*
williamr@2: #  if defined (_STLP_BASE_TYPEDEF_BUG)
williamr@2: // this workaround is needed for SunPro 4.0.1
williamr@2: template <class _Traits>
williamr@4: struct __cnst_traits_aux : private _Traits {
williamr@2:   typedef typename _Traits::value_type value_type;
williamr@2: };
williamr@2: #  define __TRAITS_VALUE_TYPE(_Traits) __cnst_traits_aux<_Traits>::value_type
williamr@2: #  else
williamr@2: #  define __TRAITS_VALUE_TYPE(_Traits) _Traits::value_type
williamr@2: #  endif
williamr@4: */
williamr@2: 
williamr@4: #if defined (_STLP_MSVC)
williamr@2: // MSVC specific
williamr@2: template <class _InputIterator, class _Dist>
williamr@4: inline void  _STLP_CALL _Distance(_InputIterator __first,
williamr@4:                                   _InputIterator __last, _Dist& __n) {
williamr@2:   __distance(__first, __last, __n, _STLP_ITERATOR_CATEGORY(__first, _InputIterator));
williamr@2: }
williamr@4: #endif
williamr@2: 
williamr@2: template <class _InputIter, class _Distance>
williamr@4: _STLP_INLINE_LOOP void  _STLP_CALL
williamr@4: __advance(_InputIter& __i, _Distance __n, const input_iterator_tag &) {
williamr@2:   while (__n--) ++__i;
williamr@2: }
williamr@2: 
williamr@2: // fbp : added output iterator tag variant
williamr@2: template <class _InputIter, class _Distance>
williamr@4: _STLP_INLINE_LOOP void  _STLP_CALL
williamr@4: __advance(_InputIter& __i, _Distance __n, const output_iterator_tag &) {
williamr@2:   while (__n--) ++__i;
williamr@2: }
williamr@2: 
williamr@4: #if defined (_STLP_NONTEMPL_BASE_MATCH_BUG)
williamr@2: template <class _ForwardIterator, class _Distance>
williamr@4: _STLP_INLINE_LOOP void _STLP_CALL
williamr@4: __advance(_ForwardIterator& i, _Distance n, const forward_iterator_tag &) {
williamr@4:   while (n--) ++i;
williamr@2: }
williamr@4: #endif
williamr@2: 
williamr@2: template <class _BidirectionalIterator, class _Distance>
williamr@4: _STLP_INLINE_LOOP void _STLP_CALL
williamr@4: __advance(_BidirectionalIterator& __i, _Distance __n,
williamr@4:           const bidirectional_iterator_tag &) {
williamr@2:   if (__n > 0)
williamr@2:     while (__n--) ++__i;
williamr@2:   else
williamr@2:     while (__n++) --__i;
williamr@2: }
williamr@2: 
williamr@2: template <class _RandomAccessIterator, class _Distance>
williamr@4: inline void _STLP_CALL
williamr@4: __advance(_RandomAccessIterator& __i, _Distance __n,
williamr@4:           const random_access_iterator_tag &) {
williamr@2:   __i += __n;
williamr@2: }
williamr@2: 
williamr@2: template <class _InputIterator, class _Distance>
williamr@2: inline void _STLP_CALL advance(_InputIterator& __i, _Distance __n) {
williamr@2:   __advance(__i, __n, _STLP_ITERATOR_CATEGORY(__i, _InputIterator));
williamr@2: }
williamr@2: 
williamr@2: _STLP_END_NAMESPACE
williamr@2: 
williamr@4: #if defined (_STLP_DEBUG) && !defined (_STLP_DEBUG_H)
williamr@2: #  include <stl/debug/_debug.h>
williamr@4: #endif
williamr@2: 
williamr@2: #endif /* _STLP_INTERNAL_ITERATOR_BASE_H */
williamr@2: 
williamr@2: 
williamr@2: // Local Variables:
williamr@2: // mode:C++
williamr@2: // End: