1 // Iterators -*- C++ -*-
3 // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
4 // Free Software Foundation, Inc.
6 // This file is part of the GNU ISO C++ Library. This library is free
7 // software; you can redistribute it and/or modify it under the
8 // terms of the GNU General Public License as published by the
9 // Free Software Foundation; either version 2, or (at your option)
12 // This library is distributed in the hope that it will be useful,
13 // but WITHOUT ANY WARRANTY; without even the implied warranty of
14 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 // GNU General Public License for more details.
17 // You should have received a copy of the GNU General Public License along
18 // with this library; see the file COPYING. If not, write to the Free
19 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
22 // As a special exception, you may use this file as part of a free software
23 // library without restriction. Specifically, if other files instantiate
24 // templates or use macros or inline functions from this file, or you compile
25 // this file and link it with other files to produce an executable, this
26 // file does not by itself cause the resulting executable to be covered by
27 // the GNU General Public License. This exception does not however
28 // invalidate any other reasons why the executable file might be covered by
29 // the GNU General Public License.
34 * Hewlett-Packard Company
36 * Permission to use, copy, modify, distribute and sell this software
37 * and its documentation for any purpose is hereby granted without fee,
38 * provided that the above copyright notice appear in all copies and
39 * that both that copyright notice and this permission notice appear
40 * in supporting documentation. Hewlett-Packard Company makes no
41 * representations about the suitability of this software for any
42 * purpose. It is provided "as is" without express or implied warranty.
45 * Copyright (c) 1996-1998
46 * Silicon Graphics Computer Systems, Inc.
48 * Permission to use, copy, modify, distribute and sell this software
49 * and its documentation for any purpose is hereby granted without fee,
50 * provided that the above copyright notice appear in all copies and
51 * that both that copyright notice and this permission notice appear
52 * in supporting documentation. Silicon Graphics makes no
53 * representations about the suitability of this software for any
54 * purpose. It is provided "as is" without express or implied warranty.
57 /** @file stl_iterator.h
58 * This is an internal header file, included by other library headers.
59 * You should not attempt to use it directly.
61 * This file implements reverse_iterator, back_insert_iterator,
62 * front_insert_iterator, insert_iterator, __normal_iterator, and their
63 * supporting functions and overloaded operators.
66 #ifndef _STL_ITERATOR_H
67 #define _STL_ITERATOR_H 1
69 #include <bits/cpp_type_traits.h>
70 #include <ext/type_traits.h>
71 #include <bits/stl_move.h>
73 _GLIBCXX_BEGIN_NAMESPACE(std
)
75 // 24.4.1 Reverse iterators
77 * "Bidirectional and random access iterators have corresponding reverse
78 * %iterator adaptors that iterate through the data structure in the
79 * opposite direction. They have the same signatures as the corresponding
80 * iterators. The fundamental relation between a reverse %iterator and its
81 * corresponding %iterator @c i is established by the identity:
83 * &*(reverse_iterator(i)) == &*(i - 1)
86 * This mapping is dictated by the fact that while there is always a
87 * pointer past the end of an array, there might not be a valid pointer
88 * before the beginning of an array." [24.4.1]/1,2
90 * Reverse iterators can be tricky and surprising at first. Their
91 * semantics make sense, however, and the trickiness is a side effect of
92 * the requirement that the iterators must be safe.
94 template<typename _Iterator
>
95 class reverse_iterator
96 : public iterator
<typename iterator_traits
<_Iterator
>::iterator_category
,
97 typename iterator_traits
<_Iterator
>::value_type
,
98 typename iterator_traits
<_Iterator
>::difference_type
,
99 typename iterator_traits
<_Iterator
>::pointer
,
100 typename iterator_traits
<_Iterator
>::reference
>
106 typedef _Iterator iterator_type
;
107 typedef typename iterator_traits
<_Iterator
>::difference_type
109 typedef typename iterator_traits
<_Iterator
>::reference reference
;
110 typedef typename iterator_traits
<_Iterator
>::pointer pointer
;
114 * The default constructor default-initializes member @p current.
115 * If it is a pointer, that means it is zero-initialized.
117 // _GLIBCXX_RESOLVE_LIB_DEFECTS
118 // 235 No specification of default ctor for reverse_iterator
119 reverse_iterator() : current() { }
122 * This %iterator will move in the opposite direction that @p x does.
125 reverse_iterator(iterator_type __x
) : current(__x
) { }
128 * The copy constructor is normal.
130 reverse_iterator(const reverse_iterator
& __x
)
131 : current(__x
.current
) { }
134 * A reverse_iterator across other types can be copied in the normal
137 template<typename _Iter
>
138 reverse_iterator(const reverse_iterator
<_Iter
>& __x
)
139 : current(__x
.base()) { }
142 * @return @c current, the %iterator used for underlying work.
156 _Iterator __tmp
= current
;
167 { return &(operator*()); }
189 reverse_iterator __tmp
= *this;
214 reverse_iterator __tmp
= *this;
225 operator+(difference_type __n
) const
226 { return reverse_iterator(current
- __n
); }
234 operator+=(difference_type __n
)
246 operator-(difference_type __n
) const
247 { return reverse_iterator(current
+ __n
); }
255 operator-=(difference_type __n
)
267 operator[](difference_type __n
) const
268 { return *(*this + __n
); }
273 * @param x A %reverse_iterator.
274 * @param y A %reverse_iterator.
275 * @return A simple bool.
277 * Reverse iterators forward many operations to their underlying base()
278 * iterators. Others are implemented in terms of one another.
281 template<typename _Iterator
>
283 operator==(const reverse_iterator
<_Iterator
>& __x
,
284 const reverse_iterator
<_Iterator
>& __y
)
285 { return __x
.base() == __y
.base(); }
287 template<typename _Iterator
>
289 operator<(const reverse_iterator
<_Iterator
>& __x
,
290 const reverse_iterator
<_Iterator
>& __y
)
291 { return __y
.base() < __x
.base(); }
293 template<typename _Iterator
>
295 operator!=(const reverse_iterator
<_Iterator
>& __x
,
296 const reverse_iterator
<_Iterator
>& __y
)
297 { return !(__x
== __y
); }
299 template<typename _Iterator
>
301 operator>(const reverse_iterator
<_Iterator
>& __x
,
302 const reverse_iterator
<_Iterator
>& __y
)
303 { return __y
< __x
; }
305 template<typename _Iterator
>
307 operator<=(const reverse_iterator
<_Iterator
>& __x
,
308 const reverse_iterator
<_Iterator
>& __y
)
309 { return !(__y
< __x
); }
311 template<typename _Iterator
>
313 operator>=(const reverse_iterator
<_Iterator
>& __x
,
314 const reverse_iterator
<_Iterator
>& __y
)
315 { return !(__x
< __y
); }
317 template<typename _Iterator
>
318 inline typename reverse_iterator
<_Iterator
>::difference_type
319 operator-(const reverse_iterator
<_Iterator
>& __x
,
320 const reverse_iterator
<_Iterator
>& __y
)
321 { return __y
.base() - __x
.base(); }
323 template<typename _Iterator
>
324 inline reverse_iterator
<_Iterator
>
325 operator+(typename reverse_iterator
<_Iterator
>::difference_type __n
,
326 const reverse_iterator
<_Iterator
>& __x
)
327 { return reverse_iterator
<_Iterator
>(__x
.base() - __n
); }
329 // _GLIBCXX_RESOLVE_LIB_DEFECTS
330 // DR 280. Comparison of reverse_iterator to const reverse_iterator.
331 template<typename _IteratorL
, typename _IteratorR
>
333 operator==(const reverse_iterator
<_IteratorL
>& __x
,
334 const reverse_iterator
<_IteratorR
>& __y
)
335 { return __x
.base() == __y
.base(); }
337 template<typename _IteratorL
, typename _IteratorR
>
339 operator<(const reverse_iterator
<_IteratorL
>& __x
,
340 const reverse_iterator
<_IteratorR
>& __y
)
341 { return __y
.base() < __x
.base(); }
343 template<typename _IteratorL
, typename _IteratorR
>
345 operator!=(const reverse_iterator
<_IteratorL
>& __x
,
346 const reverse_iterator
<_IteratorR
>& __y
)
347 { return !(__x
== __y
); }
349 template<typename _IteratorL
, typename _IteratorR
>
351 operator>(const reverse_iterator
<_IteratorL
>& __x
,
352 const reverse_iterator
<_IteratorR
>& __y
)
353 { return __y
< __x
; }
355 template<typename _IteratorL
, typename _IteratorR
>
357 operator<=(const reverse_iterator
<_IteratorL
>& __x
,
358 const reverse_iterator
<_IteratorR
>& __y
)
359 { return !(__y
< __x
); }
361 template<typename _IteratorL
, typename _IteratorR
>
363 operator>=(const reverse_iterator
<_IteratorL
>& __x
,
364 const reverse_iterator
<_IteratorR
>& __y
)
365 { return !(__x
< __y
); }
367 template<typename _IteratorL
, typename _IteratorR
>
368 inline typename reverse_iterator
<_IteratorL
>::difference_type
369 operator-(const reverse_iterator
<_IteratorL
>& __x
,
370 const reverse_iterator
<_IteratorR
>& __y
)
371 { return __y
.base() - __x
.base(); }
374 // 24.4.2.2.1 back_insert_iterator
376 * @brief Turns assignment into insertion.
378 * These are output iterators, constructed from a container-of-T.
379 * Assigning a T to the iterator appends it to the container using
382 * Tip: Using the back_inserter function to create these iterators can
385 template<typename _Container
>
386 class back_insert_iterator
387 : public iterator
<output_iterator_tag
, void, void, void, void>
390 _Container
* container
;
393 /// A nested typedef for the type of whatever container you used.
394 typedef _Container container_type
;
396 /// The only way to create this %iterator is with a container.
398 back_insert_iterator(_Container
& __x
) : container(&__x
) { }
401 * @param value An instance of whatever type
402 * container_type::const_reference is; presumably a
403 * reference-to-const T for container<T>.
404 * @return This %iterator, for chained operations.
406 * This kind of %iterator doesn't really have a "position" in the
407 * container (you can think of the position as being permanently at
408 * the end, if you like). Assigning a value to the %iterator will
409 * always append the value to the end of the container.
411 back_insert_iterator
&
412 operator=(typename
_Container::const_reference __value
)
414 container
->push_back(__value
);
418 #ifdef __GXX_EXPERIMENTAL_CXX0X__
419 back_insert_iterator
&
420 operator=(typename
_Container::value_type
&& __value
)
422 container
->push_back(std::move(__value
));
427 /// Simply returns *this.
428 back_insert_iterator
&
432 /// Simply returns *this. (This %iterator does not "move".)
433 back_insert_iterator
&
437 /// Simply returns *this. (This %iterator does not "move".)
444 * @param x A container of arbitrary type.
445 * @return An instance of back_insert_iterator working on @p x.
447 * This wrapper function helps in creating back_insert_iterator instances.
448 * Typing the name of the %iterator requires knowing the precise full
449 * type of the container, which can be tedious and impedes generic
450 * programming. Using this function lets you take advantage of automatic
451 * template parameter deduction, making the compiler match the correct
454 template<typename _Container
>
455 inline back_insert_iterator
<_Container
>
456 back_inserter(_Container
& __x
)
457 { return back_insert_iterator
<_Container
>(__x
); }
460 * @brief Turns assignment into insertion.
462 * These are output iterators, constructed from a container-of-T.
463 * Assigning a T to the iterator prepends it to the container using
466 * Tip: Using the front_inserter function to create these iterators can
469 template<typename _Container
>
470 class front_insert_iterator
471 : public iterator
<output_iterator_tag
, void, void, void, void>
474 _Container
* container
;
477 /// A nested typedef for the type of whatever container you used.
478 typedef _Container container_type
;
480 /// The only way to create this %iterator is with a container.
481 explicit front_insert_iterator(_Container
& __x
) : container(&__x
) { }
484 * @param value An instance of whatever type
485 * container_type::const_reference is; presumably a
486 * reference-to-const T for container<T>.
487 * @return This %iterator, for chained operations.
489 * This kind of %iterator doesn't really have a "position" in the
490 * container (you can think of the position as being permanently at
491 * the front, if you like). Assigning a value to the %iterator will
492 * always prepend the value to the front of the container.
494 front_insert_iterator
&
495 operator=(typename
_Container::const_reference __value
)
497 container
->push_front(__value
);
501 #ifdef __GXX_EXPERIMENTAL_CXX0X__
502 front_insert_iterator
&
503 operator=(typename
_Container::value_type
&& __value
)
505 container
->push_front(std::move(__value
));
510 /// Simply returns *this.
511 front_insert_iterator
&
515 /// Simply returns *this. (This %iterator does not "move".)
516 front_insert_iterator
&
520 /// Simply returns *this. (This %iterator does not "move".)
521 front_insert_iterator
527 * @param x A container of arbitrary type.
528 * @return An instance of front_insert_iterator working on @p x.
530 * This wrapper function helps in creating front_insert_iterator instances.
531 * Typing the name of the %iterator requires knowing the precise full
532 * type of the container, which can be tedious and impedes generic
533 * programming. Using this function lets you take advantage of automatic
534 * template parameter deduction, making the compiler match the correct
537 template<typename _Container
>
538 inline front_insert_iterator
<_Container
>
539 front_inserter(_Container
& __x
)
540 { return front_insert_iterator
<_Container
>(__x
); }
543 * @brief Turns assignment into insertion.
545 * These are output iterators, constructed from a container-of-T.
546 * Assigning a T to the iterator inserts it in the container at the
547 * %iterator's position, rather than overwriting the value at that
550 * (Sequences will actually insert a @e copy of the value before the
551 * %iterator's position.)
553 * Tip: Using the inserter function to create these iterators can
556 template<typename _Container
>
557 class insert_iterator
558 : public iterator
<output_iterator_tag
, void, void, void, void>
561 _Container
* container
;
562 typename
_Container::iterator iter
;
565 /// A nested typedef for the type of whatever container you used.
566 typedef _Container container_type
;
569 * The only way to create this %iterator is with a container and an
570 * initial position (a normal %iterator into the container).
572 insert_iterator(_Container
& __x
, typename
_Container::iterator __i
)
573 : container(&__x
), iter(__i
) {}
576 * @param value An instance of whatever type
577 * container_type::const_reference is; presumably a
578 * reference-to-const T for container<T>.
579 * @return This %iterator, for chained operations.
581 * This kind of %iterator maintains its own position in the
582 * container. Assigning a value to the %iterator will insert the
583 * value into the container at the place before the %iterator.
585 * The position is maintained such that subsequent assignments will
586 * insert values immediately after one another. For example,
588 * // vector v contains A and Z
590 * insert_iterator i (v, ++v.begin());
595 * // vector v contains A, 1, 2, 3, and Z
599 operator=(typename
_Container::const_reference __value
)
601 iter
= container
->insert(iter
, __value
);
606 #ifdef __GXX_EXPERIMENTAL_CXX0X__
608 operator=(typename
_Container::value_type
&& __value
)
610 iter
= container
->insert(iter
, std::move(__value
));
616 /// Simply returns *this.
621 /// Simply returns *this. (This %iterator does not "move".)
626 /// Simply returns *this. (This %iterator does not "move".)
633 * @param x A container of arbitrary type.
634 * @return An instance of insert_iterator working on @p x.
636 * This wrapper function helps in creating insert_iterator instances.
637 * Typing the name of the %iterator requires knowing the precise full
638 * type of the container, which can be tedious and impedes generic
639 * programming. Using this function lets you take advantage of automatic
640 * template parameter deduction, making the compiler match the correct
643 template<typename _Container
, typename _Iterator
>
644 inline insert_iterator
<_Container
>
645 inserter(_Container
& __x
, _Iterator __i
)
647 return insert_iterator
<_Container
>(__x
,
648 typename
_Container::iterator(__i
));
651 _GLIBCXX_END_NAMESPACE
653 _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx
)
655 // This iterator adapter is 'normal' in the sense that it does not
656 // change the semantics of any of the operators of its iterator
657 // parameter. Its primary purpose is to convert an iterator that is
658 // not a class, e.g. a pointer, into an iterator that is a class.
659 // The _Container parameter exists solely so that different containers
660 // using this template can instantiate different types, even if the
661 // _Iterator parameter is the same.
662 using std::iterator_traits
;
664 template<typename _Iterator
, typename _Container
>
665 class __normal_iterator
668 _Iterator _M_current
;
671 typedef _Iterator iterator_type
;
672 typedef typename iterator_traits
<_Iterator
>::iterator_category
674 typedef typename iterator_traits
<_Iterator
>::value_type value_type
;
675 typedef typename iterator_traits
<_Iterator
>::difference_type
677 typedef typename iterator_traits
<_Iterator
>::reference reference
;
678 typedef typename iterator_traits
<_Iterator
>::pointer pointer
;
680 __normal_iterator() : _M_current(_Iterator()) { }
683 __normal_iterator(const _Iterator
& __i
) : _M_current(__i
) { }
685 // Allow iterator to const_iterator conversion
686 template<typename _Iter
>
687 __normal_iterator(const __normal_iterator
<_Iter
,
688 typename __enable_if
<
689 (std::__are_same
<_Iter
, typename
_Container::pointer
>::__value
),
690 _Container
>::__type
>& __i
)
691 : _M_current(__i
.base()) { }
693 // Forward iterator requirements
696 { return *_M_current
; }
700 { return _M_current
; }
711 { return __normal_iterator(_M_current
++); }
713 // Bidirectional iterator requirements
723 { return __normal_iterator(_M_current
--); }
725 // Random access iterator requirements
727 operator[](const difference_type
& __n
) const
728 { return _M_current
[__n
]; }
731 operator+=(const difference_type
& __n
)
732 { _M_current
+= __n
; return *this; }
735 operator+(const difference_type
& __n
) const
736 { return __normal_iterator(_M_current
+ __n
); }
739 operator-=(const difference_type
& __n
)
740 { _M_current
-= __n
; return *this; }
743 operator-(const difference_type
& __n
) const
744 { return __normal_iterator(_M_current
- __n
); }
748 { return _M_current
; }
751 // Note: In what follows, the left- and right-hand-side iterators are
752 // allowed to vary in types (conceptually in cv-qualification) so that
753 // comparaison between cv-qualified and non-cv-qualified iterators be
754 // valid. However, the greedy and unfriendly operators in std::rel_ops
755 // will make overload resolution ambiguous (when in scope) if we don't
756 // provide overloads whose operands are of the same type. Can someone
757 // remind me what generic programming is about? -- Gaby
759 // Forward iterator requirements
760 template<typename _IteratorL
, typename _IteratorR
, typename _Container
>
762 operator==(const __normal_iterator
<_IteratorL
, _Container
>& __lhs
,
763 const __normal_iterator
<_IteratorR
, _Container
>& __rhs
)
764 { return __lhs
.base() == __rhs
.base(); }
766 template<typename _Iterator
, typename _Container
>
768 operator==(const __normal_iterator
<_Iterator
, _Container
>& __lhs
,
769 const __normal_iterator
<_Iterator
, _Container
>& __rhs
)
770 { return __lhs
.base() == __rhs
.base(); }
772 template<typename _IteratorL
, typename _IteratorR
, typename _Container
>
774 operator!=(const __normal_iterator
<_IteratorL
, _Container
>& __lhs
,
775 const __normal_iterator
<_IteratorR
, _Container
>& __rhs
)
776 { return __lhs
.base() != __rhs
.base(); }
778 template<typename _Iterator
, typename _Container
>
780 operator!=(const __normal_iterator
<_Iterator
, _Container
>& __lhs
,
781 const __normal_iterator
<_Iterator
, _Container
>& __rhs
)
782 { return __lhs
.base() != __rhs
.base(); }
784 // Random access iterator requirements
785 template<typename _IteratorL
, typename _IteratorR
, typename _Container
>
787 operator<(const __normal_iterator
<_IteratorL
, _Container
>& __lhs
,
788 const __normal_iterator
<_IteratorR
, _Container
>& __rhs
)
789 { return __lhs
.base() < __rhs
.base(); }
791 template<typename _Iterator
, typename _Container
>
793 operator<(const __normal_iterator
<_Iterator
, _Container
>& __lhs
,
794 const __normal_iterator
<_Iterator
, _Container
>& __rhs
)
795 { return __lhs
.base() < __rhs
.base(); }
797 template<typename _IteratorL
, typename _IteratorR
, typename _Container
>
799 operator>(const __normal_iterator
<_IteratorL
, _Container
>& __lhs
,
800 const __normal_iterator
<_IteratorR
, _Container
>& __rhs
)
801 { return __lhs
.base() > __rhs
.base(); }
803 template<typename _Iterator
, typename _Container
>
805 operator>(const __normal_iterator
<_Iterator
, _Container
>& __lhs
,
806 const __normal_iterator
<_Iterator
, _Container
>& __rhs
)
807 { return __lhs
.base() > __rhs
.base(); }
809 template<typename _IteratorL
, typename _IteratorR
, typename _Container
>
811 operator<=(const __normal_iterator
<_IteratorL
, _Container
>& __lhs
,
812 const __normal_iterator
<_IteratorR
, _Container
>& __rhs
)
813 { return __lhs
.base() <= __rhs
.base(); }
815 template<typename _Iterator
, typename _Container
>
817 operator<=(const __normal_iterator
<_Iterator
, _Container
>& __lhs
,
818 const __normal_iterator
<_Iterator
, _Container
>& __rhs
)
819 { return __lhs
.base() <= __rhs
.base(); }
821 template<typename _IteratorL
, typename _IteratorR
, typename _Container
>
823 operator>=(const __normal_iterator
<_IteratorL
, _Container
>& __lhs
,
824 const __normal_iterator
<_IteratorR
, _Container
>& __rhs
)
825 { return __lhs
.base() >= __rhs
.base(); }
827 template<typename _Iterator
, typename _Container
>
829 operator>=(const __normal_iterator
<_Iterator
, _Container
>& __lhs
,
830 const __normal_iterator
<_Iterator
, _Container
>& __rhs
)
831 { return __lhs
.base() >= __rhs
.base(); }
833 // _GLIBCXX_RESOLVE_LIB_DEFECTS
834 // According to the resolution of DR179 not only the various comparison
835 // operators but also operator- must accept mixed iterator/const_iterator
837 template<typename _IteratorL
, typename _IteratorR
, typename _Container
>
838 inline typename __normal_iterator
<_IteratorL
, _Container
>::difference_type
839 operator-(const __normal_iterator
<_IteratorL
, _Container
>& __lhs
,
840 const __normal_iterator
<_IteratorR
, _Container
>& __rhs
)
841 { return __lhs
.base() - __rhs
.base(); }
843 template<typename _Iterator
, typename _Container
>
844 inline typename __normal_iterator
<_Iterator
, _Container
>::difference_type
845 operator-(const __normal_iterator
<_Iterator
, _Container
>& __lhs
,
846 const __normal_iterator
<_Iterator
, _Container
>& __rhs
)
847 { return __lhs
.base() - __rhs
.base(); }
849 template<typename _Iterator
, typename _Container
>
850 inline __normal_iterator
<_Iterator
, _Container
>
851 operator+(typename __normal_iterator
<_Iterator
, _Container
>::difference_type
852 __n
, const __normal_iterator
<_Iterator
, _Container
>& __i
)
853 { return __normal_iterator
<_Iterator
, _Container
>(__i
.base() + __n
); }
855 _GLIBCXX_END_NAMESPACE
857 #ifdef __GXX_EXPERIMENTAL_CXX0X__
859 _GLIBCXX_BEGIN_NAMESPACE(std
)
861 // 24.4.3 Move iterators
864 * Class template move_iterator is an iterator adapter with the same
865 * behavior as the underlying iterator except that its dereference
866 * operator implicitly converts the value returned by the underlying
867 * iterator's dereference operator to an rvalue reference. Some
868 * generic algorithms can be called with move iterators to replace
869 * copying with moving.
872 template<typename _Iterator
>
876 _Iterator _M_current
;
879 typedef _Iterator iterator_type
;
880 typedef typename iterator_traits
<_Iterator
>::difference_type
882 typedef typename iterator_traits
<_Iterator
>::pointer pointer
;
883 typedef typename iterator_traits
<_Iterator
>::value_type value_type
;
884 typedef typename iterator_traits
<_Iterator
>::iterator_category
886 typedef value_type
&& reference
;
893 move_iterator(iterator_type __i
)
894 : _M_current(__i
) { }
896 template<typename _Iter
>
897 move_iterator(const move_iterator
<_Iter
>& __i
)
898 : _M_current(__i
.base()) { }
902 { return _M_current
; }
906 { return *_M_current
; }
910 { return _M_current
; }
922 move_iterator __tmp
= *this;
937 move_iterator __tmp
= *this;
943 operator+(difference_type __n
) const
944 { return move_iterator(_M_current
+ __n
); }
947 operator+=(difference_type __n
)
954 operator-(difference_type __n
) const
955 { return move_iterator(_M_current
- __n
); }
958 operator-=(difference_type __n
)
965 operator[](difference_type __n
) const
966 { return _M_current
[__n
]; }
969 template<typename _IteratorL
, typename _IteratorR
>
971 operator==(const move_iterator
<_IteratorL
>& __x
,
972 const move_iterator
<_IteratorR
>& __y
)
973 { return __x
.base() == __y
.base(); }
975 template<typename _IteratorL
, typename _IteratorR
>
977 operator!=(const move_iterator
<_IteratorL
>& __x
,
978 const move_iterator
<_IteratorR
>& __y
)
979 { return !(__x
== __y
); }
981 template<typename _IteratorL
, typename _IteratorR
>
983 operator<(const move_iterator
<_IteratorL
>& __x
,
984 const move_iterator
<_IteratorR
>& __y
)
985 { return __x
.base() < __y
.base(); }
987 template<typename _IteratorL
, typename _IteratorR
>
989 operator<=(const move_iterator
<_IteratorL
>& __x
,
990 const move_iterator
<_IteratorR
>& __y
)
991 { return !(__y
< __x
); }
993 template<typename _IteratorL
, typename _IteratorR
>
995 operator>(const move_iterator
<_IteratorL
>& __x
,
996 const move_iterator
<_IteratorR
>& __y
)
997 { return __y
< __x
; }
999 template<typename _IteratorL
, typename _IteratorR
>
1001 operator>=(const move_iterator
<_IteratorL
>& __x
,
1002 const move_iterator
<_IteratorR
>& __y
)
1003 { return !(__x
< __y
); }
1005 template<typename _IteratorL
, typename _IteratorR
>
1006 inline typename move_iterator
<_IteratorL
>::difference_type
1007 operator-(const move_iterator
<_IteratorL
>& __x
,
1008 const move_iterator
<_IteratorR
>& __y
)
1009 { return __x
.base() - __y
.base(); }
1011 template<typename _Iterator
>
1012 inline move_iterator
<_Iterator
>
1013 operator+(typename move_iterator
<_Iterator
>::difference_type __n
,
1014 const move_iterator
<_Iterator
>& __x
)
1015 { return __x
+ __n
; }
1017 template<typename _Iterator
>
1018 inline move_iterator
<_Iterator
>
1019 make_move_iterator(const _Iterator
& __i
)
1020 { return move_iterator
<_Iterator
>(__i
); }
1022 _GLIBCXX_END_NAMESPACE
1024 #define _GLIBCXX_MAKE_MOVE_ITERATOR(_Iter) std::make_move_iterator(_Iter)
1026 #define _GLIBCXX_MAKE_MOVE_ITERATOR(_Iter) (_Iter)
1027 #endif // __GXX_EXPERIMENTAL_CXX0X__