-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathiterator.py
More file actions
187 lines (141 loc) · 4.04 KB
/
iterator.py
File metadata and controls
187 lines (141 loc) · 4.04 KB
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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
"""
Iterator classes for pystl containers.
This module provides iterator support for STL-style containers,
enabling both C++ STL-style iteration and Python iteration protocols.
"""
from typing import TypeVar, Generic, List
from abc import ABC, abstractmethod
T = TypeVar('T')
class Iterator(ABC, Generic[T]):
"""
Abstract base class for iterators.
Provides the foundation for both forward and reverse iterators.
"""
@abstractmethod
def __next__(self) -> T:
"""Get the next element."""
pass
@abstractmethod
def __iter__(self):
"""Return the iterator itself."""
pass
class VectorIterator(Iterator[T]):
"""
Forward iterator for vector.
This iterator traverses the vector from beginning to end.
"""
def __init__(self, data: List[T], index: int = 0) -> None:
"""
Initialize vector iterator.
Args:
data: Reference to the vector's internal data
index: Starting position
"""
self._data = data
self._index = index
def __next__(self) -> T:
"""
Get the next element.
Returns:
The next element in the vector.
Raises:
StopIteration: When iteration is complete.
"""
if self._index >= len(self._data):
raise StopIteration
value = self._data[self._index]
self._index += 1
return value
def __iter__(self):
"""Return the iterator itself."""
return self
class VectorReverseIterator(Iterator[T]):
"""
Reverse iterator for vector.
This iterator traverses the vector from end to beginning.
"""
def __init__(self, data: List[T], index: int = -1) -> None:
"""
Initialize reverse vector iterator.
Args:
data: Reference to the vector's internal data
index: Starting position (default: last element)
"""
self._data = data
if index == -1:
self._index = len(data) - 1
else:
self._index = index
def __next__(self) -> T:
"""
Get the next element (in reverse order).
Returns:
The next element in reverse order.
Raises:
StopIteration: When iteration is complete.
"""
if self._index < 0:
raise StopIteration
value = self._data[self._index]
self._index -= 1
return value
def __iter__(self):
"""Return the iterator itself."""
return self
class SetIterator(Iterator[T]):
"""
Iterator for set.
This iterator traverses the set elements.
Note: Order is not guaranteed (matches Python set behavior).
"""
def __init__(self, data: set) -> None:
"""
Initialize set iterator.
Args:
data: Reference to the set's internal data
"""
self._iterator = iter(data)
def __next__(self) -> T:
"""
Get the next element.
Returns:
The next element in the set.
Raises:
StopIteration: When iteration is complete.
"""
return next(self._iterator)
def __iter__(self):
"""Return the iterator itself."""
return self
class MapIterator(Iterator):
"""
Iterator for map.
This iterator traverses the map's key-value pairs.
Returns tuples of (key, value).
"""
def __init__(self, data: dict) -> None:
"""
Initialize map iterator.
Args:
data: Reference to the map's internal data
"""
self._iterator = iter(data.items())
def __next__(self):
"""
Get the next key-value pair.
Returns:
Tuple of (key, value).
Raises:
StopIteration: When iteration is complete.
"""
return next(self._iterator)
def __iter__(self):
"""Return the iterator itself."""
return self
__all__ = [
'Iterator',
'VectorIterator',
'VectorReverseIterator',
'SetIterator',
'MapIterator'
]