-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtreeiterator.hpp
153 lines (135 loc) · 2.9 KB
/
treeiterator.hpp
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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
#pragma once
#include <iostream>
#include <iterator>
#include <cstddef>
#include "iterator_traits.hpp"
#include "tools.hpp"
#include "RBT.hpp"
namespace ft
{
template<typename T>
struct Node;
template <typename T>
struct const_bin_iterator;
template <typename T>
struct bin_iterator
{
public:
typedef Node<T> node_type;
typedef node_type* node_pointer;
typedef T value_type;
typedef T* pointer;
typedef T& reference;
typedef ptrdiff_t difference_type;
typedef std::bidirectional_iterator_tag iterator_category;
bin_iterator() : _it(NULL) {}
bin_iterator(Node<T> *ptr) : _it(ptr) {}
bin_iterator(const bin_iterator &it) : _it(it._it) {}
bin_iterator &operator++()
{
_it = succesor(_it);
return *this;
}
bin_iterator &operator--()
{
_it = predecessor(_it);
return *this;
}
bin_iterator operator++(int)
{
bin_iterator tmp = *this;
_it = succesor(_it);
return tmp;
}
bin_iterator operator--(int)
{
bin_iterator tmp = *this;
_it = predecessor(_it);
return tmp;
}
reference operator*() const
{
return (_it->element);
}
pointer operator->() const
{
return &(operator*());
}
bool operator==(const bin_iterator &other) const
{
return _it == other._it;
}
bool operator!=(const bin_iterator &other) const
{
return _it != other._it;
}
node_pointer base() const
{
return _it;
}
~bin_iterator() {}
private:
node_pointer _it;
};
template <typename T>
struct const_bin_iterator
{
public:
typedef Node<T> node_type;
typedef node_type* node_pointer;
typedef const T value_type;
typedef const T* pointer;
typedef const T& reference;
typedef ptrdiff_t difference_type;
typedef std::bidirectional_iterator_tag iterator_category;
const_bin_iterator() : _it(NULL) {}
const_bin_iterator(node_pointer ptr) : _it(ptr) {}
const_bin_iterator(const const_bin_iterator &it) : _it(it._it) {}
const_bin_iterator(const bin_iterator<T> &it) : _it(it.base()) {}
const_bin_iterator &operator++()
{
_it = succesor(_it);
return *this;
}
const_bin_iterator &operator--()
{
_it = predecessor(_it);
return *this;
}
const_bin_iterator operator++(int)
{
const_bin_iterator tmp = *this;
_it = succesor(_it);
return tmp;
}
const_bin_iterator operator--(int)
{
const_bin_iterator tmp = *this;
_it = predecessor(_it);
return tmp;
}
reference operator*() const
{
return (_it->element);
}
pointer operator->() const
{
return &(_it->element);
}
bool operator==(const const_bin_iterator &other) const
{
return _it == other._it;
}
bool operator!=(const const_bin_iterator &other) const
{
return _it != other._it;
}
node_pointer base() const
{
return _it;
}
~const_bin_iterator() {}
private:
node_pointer _it;
};
}