Subversion Repositories Kolibri OS

/*

 *

 * 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-1998

 * 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_ITERATOR_H

#define __SGI_STL_INTERNAL_ITERATOR_H

namespace std

{

template 

class back_insert_iterator {

protected:

  _Container* container;

public:

  typedef _Container          container_type;

  typedef output_iterator_tag iterator_category;

  typedef void                value_type;

  typedef void                difference_type;

  typedef void                pointer;

  typedef void                reference;

  explicit back_insert_iterator(_Container& __x) : container(&__x) {}

  back_insert_iterator<_Container>&

  operator=(const typename _Container::value_type& __value) {

    container->push_back(__value);

    return *this;

  }

  back_insert_iterator<_Container>& operator*() { return *this; }

  back_insert_iterator<_Container>& operator++() { return *this; }

  back_insert_iterator<_Container>& operator++(int) { return *this; }

};

template 

inline back_insert_iterator<_Container> back_inserter(_Container& __x) {

  return back_insert_iterator<_Container>(__x);

}

template 

class front_insert_iterator {

protected:

  _Container* container;

public:

  typedef _Container          container_type;

  typedef output_iterator_tag iterator_category;

  typedef void                value_type;

  typedef void                difference_type;

  typedef void                pointer;

  typedef void                reference;

  explicit front_insert_iterator(_Container& __x) : container(&__x) {}

  front_insert_iterator<_Container>&

  operator=(const typename _Container::value_type& __value) {

    container->push_front(__value);

    return *this;

  }

  front_insert_iterator<_Container>& operator*() { return *this; }

  front_insert_iterator<_Container>& operator++() { return *this; }

  front_insert_iterator<_Container>& operator++(int) { return *this; }

};

template 

inline front_insert_iterator<_Container> front_inserter(_Container& __x) {

  return front_insert_iterator<_Container>(__x);

}

template 

class insert_iterator {

protected:

  _Container* container;

  typename _Container::iterator iter;

public:

  typedef _Container          container_type;

  typedef output_iterator_tag iterator_category;

  typedef void                value_type;

  typedef void                difference_type;

  typedef void                pointer;

  typedef void                reference;

  insert_iterator(_Container& __x, typename _Container::iterator __i)

    : container(&__x), iter(__i) {}

  insert_iterator<_Container>&

  operator=(const typename _Container::value_type& __value) {

    iter = container->insert(iter, __value);

    ++iter;

    return *this;

  }

  insert_iterator<_Container>& operator*() { return *this; }

  insert_iterator<_Container>& operator++() { return *this; }

  insert_iterator<_Container>& operator++(int) { return *this; }

};

template 

inline

insert_iterator<_Container> inserter(_Container& __x, _Iterator __i)

{

  typedef typename _Container::iterator __iter;

  return insert_iterator<_Container>(__x, __iter(__i));

}

template 

          class _Distance = ptrdiff_t>

class reverse_bidirectional_iterator {

  typedef reverse_bidirectional_iterator<_BidirectionalIterator, _Tp,

                                         _Reference, _Distance>  _Self;

protected:

  _BidirectionalIterator current;

public:

  typedef bidirectional_iterator_tag iterator_category;

  typedef _Tp                        value_type;

  typedef _Distance                  difference_type;

  typedef _Tp*                       pointer;

  typedef _Reference                 reference;

  reverse_bidirectional_iterator() {}

  explicit reverse_bidirectional_iterator(_BidirectionalIterator __x)

    : current(__x) {}

  _BidirectionalIterator base() const { return current; }

  _Reference operator*() const {

    _BidirectionalIterator __tmp = current;

    return *--__tmp;

  }

  pointer operator->() const { return &(operator*()); }

  _Self& operator++() {

    --current;

    return *this;

  }

  _Self operator++(int) {

    _Self __tmp = *this;

    --current;

    return __tmp;

  }

  _Self& operator--() {

    ++current;

    return *this;

  }

  _Self operator--(int) {

    _Self __tmp = *this;

    ++current;

    return __tmp;

  }

};

template 

inline bool operator==(

    const reverse_bidirectional_iterator<_BiIter, _Tp, _Ref, _Distance>& __x,

    const reverse_bidirectional_iterator<_BiIter, _Tp, _Ref, _Distance>& __y)

{

  return __x.base() == __y.base();

}

template 

inline bool operator!=(

    const reverse_bidirectional_iterator<_BiIter, _Tp, _Ref, _Distance>& __x,

    const reverse_bidirectional_iterator<_BiIter, _Tp, _Ref, _Distance>& __y)

{

  return !(__x == __y);

}

// This is the new version of reverse_iterator, as defined in the

//  draft C++ standard.  It relies on the iterator_traits template,

//  which in turn relies on partial specialization.  The class

//  reverse_bidirectional_iterator is no longer part of the draft

//  standard, but it is retained for backward compatibility.

template 

class reverse_iterator

{

protected:

  _Iterator current;

public:

  typedef typename iterator_traits<_Iterator>::iterator_category

          iterator_category;

  typedef typename iterator_traits<_Iterator>::value_type

          value_type;

  typedef typename iterator_traits<_Iterator>::difference_type

          difference_type;

  typedef typename iterator_traits<_Iterator>::pointer

          pointer;

  typedef typename iterator_traits<_Iterator>::reference

          reference;

  typedef _Iterator iterator_type;

  typedef reverse_iterator<_Iterator> _Self;

public:

  reverse_iterator() {}

  explicit reverse_iterator(iterator_type __x) : current(__x) {}

  reverse_iterator(const _Self& __x) : current(__x.current) {}

  template 

  reverse_iterator(const reverse_iterator<_Iter>& __x)

    : current(__x.base()) {}

  iterator_type base() const { return current; }

  reference operator*() const {

    _Iterator __tmp = current;

    return *--__tmp;

  }

  pointer operator->() const { return &(operator*()); }

  _Self& operator++() {

    --current;

    return *this;

  }

  _Self operator++(int) {

    _Self __tmp = *this;

    --current;

    return __tmp;

  }

  _Self& operator--() {

    ++current;

    return *this;

  }

  _Self operator--(int) {

    _Self __tmp = *this;

    ++current;

    return __tmp;

  }

  _Self operator+(difference_type __n) const {

    return _Self(current - __n);

  }

  _Self& operator+=(difference_type __n) {

    current -= __n;

    return *this;

  }

  _Self operator-(difference_type __n) const {

    return _Self(current + __n);

  }

  _Self& operator-=(difference_type __n) {

    current += __n;

    return *this;

  }

  reference operator[](difference_type __n) const { return *(*this + __n); }

};

template 

inline bool operator==(const reverse_iterator<_Iterator>& __x,

                       const reverse_iterator<_Iterator>& __y) {

  return __x.base() == __y.base();

}

template 

inline bool operator<(const reverse_iterator<_Iterator>& __x,

                      const reverse_iterator<_Iterator>& __y) {

  return __y.base() < __x.base();

}

template 

inline bool operator!=(const reverse_iterator<_Iterator>& __x,

                       const reverse_iterator<_Iterator>& __y) {

  return !(__x == __y);

}

template 

inline bool operator>(const reverse_iterator<_Iterator>& __x,

                      const reverse_iterator<_Iterator>& __y) {

  return __y < __x;

}

template 

inline bool operator<=(const reverse_iterator<_Iterator>& __x,

                       const reverse_iterator<_Iterator>& __y) {

  return !(__y < __x);

}

template 

inline bool operator>=(const reverse_iterator<_Iterator>& __x,

                      const reverse_iterator<_Iterator>& __y) {

  return !(__x < __y);

}

template 

inline typename reverse_iterator<_Iterator>::difference_type

operator-(const reverse_iterator<_Iterator>& __x,

          const reverse_iterator<_Iterator>& __y) {

  return __y.base() - __x.base();

}

template 

inline reverse_iterator<_Iterator>

operator+(typename reverse_iterator<_Iterator>::difference_type __n,

          const reverse_iterator<_Iterator>& __x) {

  return reverse_iterator<_Iterator>(__x.base() - __n);

}

template 

          class _CharT = char, class _Traits = char_traits<_CharT>,

          class _Dist = ptrdiff_t>

class istream_iterator {

public:

  typedef _CharT                         char_type;

  typedef _Traits                        traits_type;

  typedef basic_istream<_CharT, _Traits> istream_type;

  typedef input_iterator_tag             iterator_category;

  typedef _Tp                            value_type;

  typedef _Dist                          difference_type;

  typedef const _Tp*                     pointer;

  typedef const _Tp&                     reference;

  istream_iterator() : _M_stream(0), _M_ok(false) {}

  istream_iterator(istream_type& __s) : _M_stream(&__s) { _M_read(); }

  reference operator*() const { return _M_value; }

  pointer operator->() const { return &(operator*()); }

  istream_iterator& operator++() {

    _M_read();

    return *this;

  }

  istream_iterator operator++(int)  {

    istream_iterator __tmp = *this;

    _M_read();

    return __tmp;

  }

  bool _M_equal(const istream_iterator& __x) const

    { return (_M_ok == __x._M_ok) && (!_M_ok || _M_stream == __x._M_stream); }

private:

  istream_type* _M_stream;

  _Tp _M_value;

  bool _M_ok;

  void _M_read() {

    _M_ok = (_M_stream && *_M_stream) ? true : false;

    if (_M_ok) {

      *_M_stream >> _M_value;

      _M_ok = *_M_stream ? true : false;

    }

  }

};

template 

inline bool

operator==(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x,

           const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y) {

  return __x._M_equal(__y);

}

template 

inline bool

operator!=(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x,

           const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y) {

  return !__x._M_equal(__y);

}

template 

          class _CharT = char, class _Traits = char_traits<_CharT> >

class ostream_iterator {

public:

  typedef _CharT                         char_type;

  typedef _Traits                        traits_type;

  typedef basic_ostream<_CharT, _Traits> ostream_type;

  typedef output_iterator_tag            iterator_category;

  typedef void                           value_type;

  typedef void                           difference_type;

  typedef void                           pointer;

  typedef void                           reference;

  ostream_iterator(ostream_type& __s) : _M_stream(&__s), _M_string(0) {}

  ostream_iterator(ostream_type& __s, const _CharT* __c)

    : _M_stream(&__s), _M_string(__c)  {}

  ostream_iterator<_Tp>& operator=(const _Tp& __value) {

    *_M_stream << __value;

    if (_M_string) *_M_stream << _M_string;

    return *this;

  }

  ostream_iterator<_Tp>& operator*() { return *this; }

  ostream_iterator<_Tp>& operator++() { return *this; }

  ostream_iterator<_Tp>& operator++(int) { return *this; }

private:

  ostream_type* _M_stream;

  const _CharT* _M_string;

};

// This iterator adapter is 'normal' in the sense that it does not

// change the semantics of any of the operators of its itererator

// parameter.  Its primary purpose is to convert an iterator that is

// not a class, e.g. a pointer, into an iterator that is a class.

// The _Container parameter exists solely so that different containers

// using this template can instantiate different types, even if the

// _Iterator parameter is the same.

template

class __normal_iterator

  : public iterator::iterator_category,

                    iterator_traits<_Iterator>::value_type,

                    iterator_traits<_Iterator>::difference_type,

                    iterator_traits<_Iterator>::pointer,

                    iterator_traits<_Iterator>::reference>

{

protected:

  _Iterator _M_current;

public:

  typedef __normal_iterator<_Iterator, _Container> normal_iterator_type;

  typedef iterator_traits<_Iterator>  			__traits_type;

  typedef typename __traits_type::iterator_category 	iterator_category;

  typedef typename __traits_type::value_type 		value_type;

  typedef typename __traits_type::difference_type 	difference_type;

  typedef typename __traits_type::pointer          	pointer;

  typedef typename __traits_type::reference 		reference;

  __normal_iterator() : _M_current(_Iterator()) { }

  explicit __normal_iterator(const _Iterator& __i) : _M_current(__i) { }

  // Allow iterator to const_iterator conversion

  template

  inline __normal_iterator(const __normal_iterator<_Iter, _Container>& __i)

    : _M_current(__i.base()) { }

  // Forward iterator requirements

  reference

  operator*() const { return *_M_current; }

  pointer

  operator->() const { return _M_current; }

  normal_iterator_type&

  operator++() { ++_M_current; return *this; }

  normal_iterator_type

  operator++(int) { return __normal_iterator(_M_current++); }

  // Bidirectional iterator requirements

  normal_iterator_type&

  operator--() { --_M_current; return *this; }

  normal_iterator_type

  operator--(int) { return __normal_iterator(_M_current--); }

  // Random access iterator requirements

  reference

  operator[](const difference_type& __n) const

  { return _M_current[__n]; }

  normal_iterator_type&

  operator+=(const difference_type& __n)

  { _M_current += __n; return *this; }

  normal_iterator_type

  operator+(const difference_type& __n) const

  { return __normal_iterator(_M_current + __n); }

  normal_iterator_type&

  operator-=(const difference_type& __n)

  { _M_current -= __n; return *this; }

  normal_iterator_type

  operator-(const difference_type& __n) const

  { return __normal_iterator(_M_current - __n); }

  difference_type

  operator-(const normal_iterator_type& __i) const

  { return _M_current - __i._M_current; }

  const _Iterator&

  base() const { return _M_current; }

};

// forward iterator requirements

template

inline bool

operator==(const __normal_iterator<_IteratorL, _Container>& __lhs,

	   const __normal_iterator<_IteratorR, _Container>& __rhs)

{ return __lhs.base() == __rhs.base(); }

template

inline bool

operator!=(const __normal_iterator<_IteratorL, _Container>& __lhs,

	   const __normal_iterator<_IteratorR, _Container>& __rhs)

{ return !(__lhs == __rhs); }

// random access iterator requirements

template

inline bool

operator<(const __normal_iterator<_IteratorL, _Container>& __lhs,

	  const __normal_iterator<_IteratorR, _Container>& __rhs)

{ return __lhs.base() < __rhs.base(); }

template

inline bool

operator>(const __normal_iterator<_IteratorL, _Container>& __lhs,

	  const __normal_iterator<_IteratorR, _Container>& __rhs)

{ return __rhs < __lhs; }

template

inline bool

operator<=(const __normal_iterator<_IteratorL, _Container>& __lhs,

	   const __normal_iterator<_IteratorR, _Container>& __rhs)

{ return !(__rhs < __lhs); }

template

inline bool

operator>=(const __normal_iterator<_IteratorL, _Container>& __lhs,

	   const __normal_iterator<_IteratorR, _Container>& __rhs)

{ return !(__lhs < __rhs); }

template

inline __normal_iterator<_Iterator, _Container>

operator+(__normal_iterator<_Iterator, _Container>::difference_type __n,

          const __normal_iterator<_Iterator, _Container>& __i)

{ return __normal_iterator<_Iterator, _Container>(__i.base() + __n); }

} // namespace std

#endif /* __SGI_STL_INTERNAL_ITERATOR_H */

// Local Variables:

// mode:C++

// End: