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
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404 | class frozendict(DataType, Generic[K, V]):
"""An immutable, persistent dictionary backed by a HAMT."""
def __init__(self, *args, shallow: bool = False, **kwargs) -> None:
def _freeze(v):
match v:
case dict():
return frozendict(v)
case list():
return [_freeze(item) for item in v]
case _:
return v
match args:
case (frozendict() as other, *_):
object.__setattr__(self, "_frozendict__root", other.__root)
object.__setattr__(self, "_frozendict__size", other.__size)
case _:
from funstruct.util.tailrec import tail_call, tco
source = dict(*args, **kwargs)
items = list(source.items())
@tco
def _build(idx, root):
if idx >= len(items):
return root
k, v = items[idx]
return tail_call(_build)(
idx + 1, root.put(k, v if shallow else _freeze(v), hash(k), 0)
)
object.__setattr__(self, "_frozendict__root", _build(0, _EMPTY))
object.__setattr__(self, "_frozendict__size", len(items))
object.__setattr__(self, "_frozendict__hash_cache", None)
def __setattr__(self, name, value):
raise AttributeError("frozendict is immutable")
def __delattr__(self, name):
raise AttributeError("frozendict is immutable")
def __getitem__(self, key: K) -> V:
result = self.__root.get(key, hash(key), 0)
if result is None and not self.__contains__(key):
raise KeyError(key)
return result
def get(self, key: K) -> V | None:
return self.__root.get(key, hash(key), 0)
def __eq__(self, other: object) -> bool:
match other:
case frozendict():
if self.__size != other.__size:
return False
return all(other.get(k) == v for k, v in self.items())
case dict():
if self.__size != len(other):
return False
return all(other.get(k) == v for k, v in self.items())
case _:
return False
def __contains__(self, key) -> bool:
for k, _ in self.__root.items_iter():
if k == key:
return True
return False
def __len__(self) -> int:
return self.__size
def keys(self) -> KeysView[K]:
return dict(self.items()).keys()
def values(self) -> ValuesView[V]:
return dict(self.items()).values()
def items(self) -> ItemsView[K, V]:
return dict(self.__root.items_iter()).items()
def __iter__(self) -> Iterator[K]:
for k, _ in self.__root.items_iter():
yield k
def __repr__(self) -> str:
return f"frozendict({dict(self.__root.items_iter())})"
def __str__(self) -> str:
return self.__repr__()
def __hash__(self) -> int:
if self.__hash_cache is None:
h = 0
for k, v in self.__root.items_iter():
h ^= hash((k, v))
object.__setattr__(self, "_frozendict__hash_cache", h)
return self.__hash_cache
def put(self, k: K, v: V) -> frozendict[K, V]:
new_root = self.__root.put(k, v, hash(k), 0)
new_fd = object.__new__(frozendict)
new_size = self.__size if k in self else self.__size + 1
object.__setattr__(new_fd, "_frozendict__root", new_root)
object.__setattr__(new_fd, "_frozendict__size", new_size)
object.__setattr__(new_fd, "_frozendict__hash_cache", None)
return new_fd
def remove(self, k: K) -> frozendict[K, V]:
if k not in self:
return self
new_root = self.__root.remove(k, hash(k), 0)
new_fd = object.__new__(frozendict)
object.__setattr__(new_fd, "_frozendict__root", new_root)
object.__setattr__(new_fd, "_frozendict__size", self.__size - 1)
object.__setattr__(new_fd, "_frozendict__hash_cache", None)
return new_fd
def combine(self, other: frozendict[K, V]) -> frozendict[K, V]:
result = self
for k, v in other.__root.items_iter():
result = result.put(k, v)
return result
def __add__(self, other: frozendict[K, V]) -> frozendict[K, V]:
return self.combine(other)
def _map_internal(self, f: Callable[[V], V2]) -> frozendict[K, V2]:
root = _EMPTY
size = 0
for k, v in self.__root.items_iter():
root = root.put(k, f(v), hash(k), 0)
size += 1
new_fd = object.__new__(frozendict)
object.__setattr__(new_fd, "_frozendict__root", root)
object.__setattr__(new_fd, "_frozendict__size", size)
object.__setattr__(new_fd, "_frozendict__hash_cache", None)
return new_fd
def _fold_left_internal(self, acc: B, f: Callable[[B, V], B]) -> B:
for _, v in self.__root.items_iter():
acc = f(acc, v)
return acc
def _fold_right_internal(self, acc: B, f: Callable[[V, B], B]) -> B:
items = list(self.__root.items_iter())
for _, v in reversed(items):
acc = f(v, acc)
return acc
def to_dict(self) -> dict:
"""Recursively convert to plain Python dicts. Inverse of deep-freeze.
>>> frozendict({"a": {"b": 1}}).to_dict()
{'a': {'b': 1}}
"""
def _thaw(v):
match v:
case frozendict():
return v.to_dict()
case list():
return [_thaw(item) for item in v]
case _:
return v
return {k: _thaw(v) for k, v in self.__root.items_iter()}
@classmethod
def fromkeys(cls, *args, **kwargs) -> frozendict:
return cls(dict.fromkeys(*args, **kwargs))
@staticmethod
def new() -> frozendict:
return frozendict()
@staticmethod
def combine_dicts(fd1: frozendict, fd2: frozendict) -> frozendict:
return fd1.combine(fd2)
def __bool__(self) -> bool:
return self.__size > 0
|