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
// Boost.Range library
//
// Copyright Neil Groves 2014. Use, modification and distribution is subject
// to the Boost Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
// For more information, see http://www.boost.org/libs/range
//
#ifndef BOOST_RANGE_UNIT_TEST_ADAPTOR_MOCK_ITERATOR_HPP_INCLUDED
#define BOOST_RANGE_UNIT_TEST_ADAPTOR_MOCK_ITERATOR_HPP_INCLUDED
#include <boost/iterator/iterator_facade.hpp>
namespace boost
{
namespace range
{
namespace unit_test
{
template<typename TraversalTag>
class mock_iterator
: public boost::iterator_facade<
mock_iterator<TraversalTag>,
int,
TraversalTag,
const int&
>
{
public:
mock_iterator()
: m_value(0)
{
}
explicit mock_iterator(int value)
: m_value(value)
{
}
private:
void increment()
{
++m_value;
}
void decrement()
{
--m_value;
}
bool equal(const mock_iterator& other) const
{
return m_value == other.m_value;
}
void advance(std::ptrdiff_t offset)
{
m_value += offset;
}
std::ptrdiff_t distance_to(const mock_iterator& other) const
{
return other.m_value - m_value;
}
const int& dereference() const
{
return m_value;
}
int m_value;
friend class boost::iterator_core_access;
};
} // namespace unit_test
} // namespace range
} // namespace boost
#endif // include guard