|
| 1 | +import json |
| 2 | +from abc import abstractmethod |
| 3 | +from typing import Any, Optional |
| 4 | + |
| 5 | +from .trie import AbstractTrie, Iterator, TrieKey |
| 6 | + |
| 7 | + |
| 8 | +class SerializedTrie(AbstractTrie): |
| 9 | + @property |
| 10 | + @abstractmethod |
| 11 | + def _trie(self): |
| 12 | + pass |
| 13 | + |
| 14 | + def close(self): |
| 15 | + self._trie.close() |
| 16 | + |
| 17 | + def commit(self): |
| 18 | + self._trie.commit() |
| 19 | + |
| 20 | + def rollback(self): |
| 21 | + self._trie.rollback() |
| 22 | + |
| 23 | + @abstractmethod |
| 24 | + def _load(self, key: TrieKey, value: Optional[bytes]) -> Optional[Any]: |
| 25 | + pass |
| 26 | + |
| 27 | + @abstractmethod |
| 28 | + def _dump(self, key: TrieKey, value: Optional[Any]) -> Optional[bytes]: |
| 29 | + pass |
| 30 | + |
| 31 | + def __setitem__(self, key, value): |
| 32 | + self._trie[key] = self._dump(key, value) |
| 33 | + |
| 34 | + def __getitem__(self, key): |
| 35 | + raw = self._trie[key] |
| 36 | + return self._load(key, raw) |
| 37 | + |
| 38 | + def __delitem__(self, key): |
| 39 | + del self._trie[key] |
| 40 | + |
| 41 | + def __len__(self): |
| 42 | + return len(self._trie) |
| 43 | + |
| 44 | + def view(self, key: Optional[TrieKey] = None) -> "SerializedTrie": |
| 45 | + if not key: |
| 46 | + return self |
| 47 | + |
| 48 | + raw_trie = self._trie.view(key) |
| 49 | + trie = type(self)() |
| 50 | + # pylint: disable-next=protected-access |
| 51 | + trie._trie = raw_trie # type: ignore |
| 52 | + return trie |
| 53 | + |
| 54 | + def items(self, *args, **kwargs): |
| 55 | + yield from ( |
| 56 | + (key, self._load(key, raw)) |
| 57 | + for key, raw in self._trie.items(*args, **kwargs) |
| 58 | + ) |
| 59 | + |
| 60 | + def ls(self, key, with_values=False): |
| 61 | + entries = self._trie.ls(key, with_values=with_values) |
| 62 | + if with_values: |
| 63 | + yield from ( |
| 64 | + (ekey, self._load(ekey, evalue)) for ekey, evalue in entries |
| 65 | + ) |
| 66 | + else: |
| 67 | + yield from entries |
| 68 | + |
| 69 | + def traverse(self, node_factory, prefix=None): |
| 70 | + def _node_factory_wrapper(path_conv, path, children, value): |
| 71 | + return node_factory( |
| 72 | + path_conv, path, children, self._load(path, value) |
| 73 | + ) |
| 74 | + |
| 75 | + return self._trie.traverse(_node_factory_wrapper, prefix=prefix) |
| 76 | + |
| 77 | + def diff(self, *args, **kwargs): |
| 78 | + yield from self._trie.diff(*args, **kwargs) |
| 79 | + |
| 80 | + def has_node(self, key): |
| 81 | + return self._trie.has_node(key) |
| 82 | + |
| 83 | + def shortest_prefix(self, key): |
| 84 | + sprefix = self._trie.shortest_prefix(key) |
| 85 | + if sprefix is None: |
| 86 | + return None |
| 87 | + |
| 88 | + skey, raw = sprefix |
| 89 | + return key, self._load(skey, raw) |
| 90 | + |
| 91 | + def prefixes(self, key): |
| 92 | + for prefix, raw in self._trie.prefixes(key): |
| 93 | + yield (prefix, self._load(prefix, raw)) |
| 94 | + |
| 95 | + def longest_prefix(self, key): |
| 96 | + lprefix = self._trie.longest_prefix(key) |
| 97 | + if lprefix is None: |
| 98 | + return None |
| 99 | + |
| 100 | + lkey, raw = lprefix |
| 101 | + return lkey, self._load(lkey, raw) |
| 102 | + |
| 103 | + def __iter__(self) -> Iterator[TrieKey]: |
| 104 | + yield from self._trie |
| 105 | + |
| 106 | + |
| 107 | +class JSONTrie(SerializedTrie): # pylint: disable=abstract-method |
| 108 | + def _load(self, key: TrieKey, value: Optional[bytes]) -> Optional[Any]: |
| 109 | + if value is None: |
| 110 | + return None |
| 111 | + return json.loads(value.decode("utf-8")) |
| 112 | + |
| 113 | + def _dump(self, key: TrieKey, value: Optional[Any]) -> Optional[bytes]: |
| 114 | + if value is None: |
| 115 | + return None |
| 116 | + return json.dumps(value).encode("utf-8") |
0 commit comments