blob: dbe4b2baaebe5696655cf8ecb4ecb5e836f9608a (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
// IBM_PROLOG_BEGIN_TAG
// This is an automatically generated prolog.
//
// $Source: src/include/iterator $
//
// IBM CONFIDENTIAL
//
// COPYRIGHT International Business Machines Corp. 2012
//
// p1
//
// Object Code Only (OCO) source materials
// Licensed Internal Code Source Materials
// IBM HostBoot Licensed Internal Code
//
// The source code for this program is not published or other-
// wise divested of its trade secrets, irrespective of what has
// been deposited with the U.S. Copyright Office.
//
// Origin: 30
//
// IBM_PROLOG_END
#ifndef __STL_ITERATOR
#define __STL_ITERATOR
#include <stdint.h>
#ifdef __cplusplus
#include <util/impl/iterator.h>
namespace std
{
/** @struct iterator_traits
* Template class defining a mapping typenames to ones defined in an iterator.
*/
template <typename Iterator>
struct iterator_traits
{
typedef typename Iterator::value_type value_type;
typedef typename Iterator::difference_type difference_type;
typedef typename Iterator::pointer pointer;
typedef typename Iterator::reference reference;
};
/** @struct iterator_traits
* Template specialization of iterator traits for treating pointer types
* as an iterator.
*/
template <typename T>
struct iterator_traits<T*>
{
typedef T value_type;
typedef ptrdiff_t difference_type;
typedef T* pointer;
typedef T& reference;
};
/** Advance an iterator.
*
* @param[in] i - The iterator to advance.
* @param[in] n - The distance to advance the iterator.
*
* This function is equivalent to calling (++i) n times.
*
* If the iterator supports random access then this function will be
* implemented in linear time with respect to n.
*
*/
template <typename InputIterator, typename Distance>
void advance(InputIterator& i, Distance n)
{
Util::__Util_Iterator_Impl::advance<InputIterator, Distance>(i, n);
}
/** Determine the distance between two iterators.
*
* @param[in] first - The first iterator.
* @param[in] last - The last iterator.
*
* @return The distance between the two iterators.
*
* The distance between two iterators is the number of times first would
* need to be incremented so that it is equal to last.
*
* If the iterator supports random access then this function will be
* implemented in linear time with respect to the distance between the
* two iterators. A negative distance can only be obtained with random
* access iterators.
*/
template <typename InputIterator>
typename iterator_traits<InputIterator>::difference_type
distance(InputIterator first, InputIterator last)
{
return Util::__Util_Iterator_Impl::distance<
InputIterator,
typename iterator_traits<InputIterator>::difference_type>
(first, last);
}
}; // namespace std.
#endif
#endif
/* vim: set filetype=cpp : */
|
