-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathtinystream.py
More file actions
353 lines (273 loc) · 9.34 KB
/
tinystream.py
File metadata and controls
353 lines (273 loc) · 9.34 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
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
import enum
import functools
import itertools
from typing import Iterable, TypeVar, Callable, List, Dict, Tuple, Iterator, Generic, Type
T = TypeVar("T")
R = TypeVar("R")
K = TypeVar("K")
Mapper = Callable[[T], R] | Type[R]
FlatMapper = Callable[[T], Iterable[R]]
Consumer = Callable[[T], None]
Comparator = Callable[[T, T], int]
Reducer = Callable[[T, T], R]
Predicate = Callable[[T], bool]
Supplier = Callable[[], T]
Key = int|str
def _key_exists(x: any, key: Key, invert: bool = False):
def _hasattr():
if invert:
return not hasattr(x, key)
else:
return hasattr(x, key)
if isinstance(x, (list, tuple)):
size = len(x)
if invert:
return key >= size
else:
return key < size
elif isinstance(x, enum.Enum):
return _hasattr()
elif isinstance(x, (dict, Iterable)):
if invert:
return key not in x
else:
return key in x
else:
return _hasattr()
def _get_key_value(x: any, key: Key) -> any:
if isinstance(x, (list, dict, tuple)):
return x[key]
else:
return getattr(x, key)
class Opt(Generic[T]):
def __init__(self, value: T):
self.__val = value
@property
def absent(self):
return self.__val is None
@property
def present(self):
return not self.absent
def get(self, *args) -> T:
if self.present:
return self.__val
elif len(args) > 0:
if isinstance(args[0], Callable):
return args[0]()
else:
return args[0]
else:
raise Exception("Cannot get value of empty Opt without default value")
def if_present(self, consumer: Consumer[T]):
if self.present:
consumer(self.get())
def filter(self, predicate: Predicate[T]):
if predicate(self.__val):
return self
else:
return EmptyOpt()
def map(self, mapper: Mapper[T, R]) -> "Opt[R]":
if self.absent:
return EmptyOpt()
else:
return Opt[R](mapper(self.__val))
def if_absent(self, supplier: Supplier[R] | any):
if self.absent:
if isinstance(supplier, Callable):
return Opt[R](supplier())
else:
return Opt[R](supplier)
else:
return self
def type(self, typehint: Type[R]) -> "Opt[R]":
return self
def filter_type(self, typehint: Type[R]) -> "Opt[R]":
return self.filter(lambda x: isinstance(x, typehint))
def filter_key(self, key: Key, invert: bool = False):
if _key_exists(self.__val, key, invert):
return self
else:
return EmptyOpt()
def filter_key_value(self, key: Key, value: any):
if _key_exists(self.__val, key, False) and _get_key_value(self.__val, key) == value:
return self
else:
return EmptyOpt()
def map_key(self, key: Key):
if _key_exists(self.__val, key):
return Opt(_get_key_value(self.__val, key))
else:
return EmptyOpt()
def kmap(self, key: Key):
"""This is an alias for map_key"""
return self.map_key(key)
def map_keys(self, *iterables):
inst = self
for key in iterables:
inst = inst.map_key(key)
return inst
def stream(self):
return Stream(self.__val)
@property
def len(self):
if self.absent:
return 0
else:
return len(self.__val)
def map_kwargs(self, mapper: Type[R]) -> "Opt[R]":
return self.map(lambda x: mapper(**x))
class EmptyOpt(Opt[None]):
def __init__(self):
super().__init__(None)
def map(self, mapper: Mapper[T, R]):
return self
def filter(self, predicate: Predicate[T]):
return self
def map_key(self, key: Key):
return self
def filter_key(self, key: Key, invert: bool = False):
return self
def filter_key_value(self, key: Key, value: any):
return self
@property
def absent(self):
return True
def stream(self):
return Stream([])
@property
def len(self):
return 0
class Stream(Iterator[T]):
def __init__(self, iterable: Iterable[T]):
self.__iterable = self.__normalize_iterator(iterable)
self.__collected: List[T] = None
self.__on_end: Callable = None
@staticmethod
def of_dict(source_dict: Dict[K, T]):
return Stream[Tuple[K, T]](source_dict)
@staticmethod
def of_many(*iterables):
return Stream([]).concat(*iterables)
def on_end(self, cb: Callable) -> "Stream[R]":
if self.__on_end:
raise AttributeError("on_end is immutable")
self.__on_end = cb
return self
def end(self):
if self.__on_end:
self.__on_end()
self.__iterable = iter([])
self.__on_end = None
def __next__(self) -> T | None:
try:
return next(self.__iterable)
except StopIteration as e:
self.end()
raise e
def __iter__(self) -> Iterator[T]:
return self
def __normalize_iterator(self, iterable: Iterable[T]) -> Iterable[T]:
if isinstance(iterable, list):
return iter(iterable)
elif isinstance(iterable, dict):
return iter(iterable.items())
elif isinstance(iterable, str):
return iter(iterable)
else:
return iterable
def map(self, mapper: Mapper[T, R]):
return Stream[R](map(mapper, self))
def map_kwargs(self, mapper: Type[R]) -> "Stream[R]":
return self.map(lambda x: mapper(**x))
def map_key(self, key: Key):
return self.filter_key(key).map(lambda x: _get_key_value(x, key))
def kmap(self, key: Key):
"""This is an alias for map_key"""
return self.map_key(key)
def map_keys(self, *iterables):
inst = self
for key in iterables:
inst = inst.map_key(key)
return inst
def type(self, typehint: Type[R]) -> "Stream[R]":
return self
def filter_type(self, typehint: Type[R]) -> "Stream[R]":
return self.filter(lambda x: isinstance(x, typehint))
def filter(self, predicate: Predicate[T]):
return Stream[T](filter(predicate, self.__iterable))
def filter_key(self, key: Key, invert: bool = False):
return self.filter(lambda x: _key_exists(x, key, invert))
def filter_key_value(self, key: Key, value: any):
return self.filter(lambda x: _key_exists(x, key, False) and _get_key_value(x, key) == value)
def flatmap(self, mapper: FlatMapper[T, R] = None):
def __flatmap(f, xs):
return (y for ys in xs for y in f(ys))
def __flatten(xs):
return (y for ys in xs for y in ys)
if mapper is not None:
return Stream[R](__flatmap(mapper, self))
else:
return Stream[R](__flatten(self))
def peek(self, consumer: Consumer[T]):
def __peek(x: T):
consumer(x)
return x
return Stream[T](map(__peek, self))
def sort(self, compare: Comparator[T], reverse: bool = False):
key = functools.cmp_to_key(compare)
sort = sorted(self.__iterable, key=key, reverse=reverse)
return Stream[T](sort)
def sorted(self, key: any = None, reverse: bool = False):
sort = sorted(self.__iterable, key=key, reverse=reverse)
return Stream[T](sort)
def next(self) -> Opt[T]:
try:
next = self.__next__()
except StopIteration as e:
next = None
return Opt(next)
def collect(self):
"""Collects all items to a list and ends the stream"""
if not self.__collected:
self.__collected = list(self)
return self.__collected
def __getitem__(self, index: int) -> Opt[T]:
collection = self.collect()
if 0 <= index < len(collection):
return Opt(collection[index])
else:
return EmptyOpt()
def join(self, separator: str) -> str:
"""Joins the string to the elements and ends the stream"""
return separator.join(map(str, self))
def count(self):
"""Collects and counts all items and ends the stream"""
return len(self.collect())
def reverse(self):
copy = self.collect().copy()
copy.reverse()
return Stream[T](copy)
def reduce(self, cb: Reducer) -> Opt[R]:
try:
return Opt(functools.reduce(cb, self))
except TypeError:
return Opt(None)
def sum(self) -> Opt[T]:
"""Sums all numbers and ends the stream"""
return self.reduce(lambda x, y: x + y)
def max(self) -> Opt[T]:
return self.reduce(lambda x, y: x if x > y else y)
def min(self) -> Opt[T]:
return self.reduce(lambda x, y: x if x < y else y)
def limit(self, limit: int):
def __limit():
for i in range(limit):
yield self.__next__()
return Stream[T](__limit())
def concat(self, *iterables):
iterators = [self]
for iterator in iterables:
iterators.append(self.__normalize_iterator(iterator))
return Stream[T](itertools.chain(*iterators))
def find(self, predicate: Predicate[T]) -> Opt[T]:
return self.filter(predicate).next()