omlish 0.0.0.dev447__py3-none-any.whl → 0.0.0.dev484__py3-none-any.whl

omlish/collections/attrregistry.py

@@ -0,0 +1,210 @@
+"""
+TODO:
+ - lock?
+"""
+import dataclasses as dc
+import typing as ta
+import weakref
+
+from .. import check
+from .. import lang
+from .mappings import dict_factory
+
+
+T = ta.TypeVar('T')
+K = ta.TypeVar('K')
+V = ta.TypeVar('V')
+
+
+##
+
+
+class AttrRegistry(ta.Generic[K, V]):
+    """
+    MRO-honoring class member registry. There are many ways to do this, and this one is attr name based: a class is
+    considered to have objects registered to it based on whether or not they are accessible by a non-shadowed,
+    MRO-resolved named attribute on that class.
+
+    Care must be taken when overriding registered objects from superclasses in subclasses - shadowing the attribute name
+    of the superclass member will not automatically register the new member with the same name to the registry - it must
+    be explicitly registered itself. This is a feature, allowing for selective de-registration of objects in subclasses
+    via name shadowing.
+    """
+
+    def __init__(
+            self,
+            *,
+            requires_override: bool = False,
+            is_override: ta.Callable[[ta.Any], bool] | None = None,
+            forbid_duplicates: bool = False,
+            identity: bool = False,
+            weak: bool = False,
+    ) -> None:
+        super().__init__()
+
+        self._requires_override = requires_override
+        self._is_override = is_override
+        self._forbid_duplicates = forbid_duplicates
+        self._identity = identity
+        self._weak = weak
+
+        self._objs: ta.MutableMapping[K, V] = dict_factory(identity=identity, weak=weak)()
+        self._invalidate_callbacks: list[ta.Callable[[], None]] = []
+
+    def add_invalidate_callback(self, callback: ta.Callable[[], None]) -> None:
+        self._invalidate_callbacks.append(callback)
+
+    @ta.overload
+    def register(self, obj: K, val: V) -> None:
+        ...
+
+    @ta.overload
+    def register(self, val: V) -> ta.Callable[[T], T]:
+        ...
+
+    def register(self, *args):
+        def inner(obj, val):
+            check.not_in(obj, self._objs)
+
+            self._objs[obj] = val
+
+            for iv in self._invalidate_callbacks:
+                iv()
+
+            return obj
+
+        if len(args) == 1:
+            return lambda obj: inner(obj, args[0])
+        elif len(args) == 2:
+            inner = inner(*args)
+            return None
+        else:
+            raise TypeError(args)
+
+    def _lookup(self, obj: ta.Any) -> lang.Maybe[V]:
+        if not self._identity:
+            try:
+                hash(obj)
+            except TypeError:
+                return lang.empty()
+
+        try:
+            val = self._objs[obj]
+        except KeyError:
+            return lang.empty()
+        else:
+            return lang.just(val)
+
+    @dc.dataclass()
+    class DuplicatesForbiddenError(Exception):
+        owner_cls: type
+        instance_cls: type
+        att: str
+        ex_att: str
+
+    def collect(self, instance_cls: type, owner_cls: type | None = None) -> dict[str, tuple[K, V]]:
+        if owner_cls is None:
+            owner_cls = instance_cls
+
+        mro = instance_cls.__mro__[-2::-1]
+        try:
+            mro_pos = mro.index(owner_cls)
+        except ValueError:
+            raise TypeError(f'Owner class {owner_cls} not in mro of instance class {instance_cls}') from None
+
+        mro_dct: dict[str, list[tuple[type, ta.Any]]] = {}
+        for cur_cls in mro[:mro_pos + 1]:
+            for att, obj in cur_cls.__dict__.items():
+                if att not in mro_dct:
+                    if not self._lookup(obj).present:
+                        continue
+
+                try:
+                    lst = mro_dct[att]
+                except KeyError:
+                    lst = mro_dct[att] = []
+                lst.append((cur_cls, obj))
+
+        #
+
+        seen: ta.MutableMapping[ta.Any, str] | None = None
+        if self._forbid_duplicates:
+            seen = dict_factory(identity=self._identity)()
+
+        out: dict[str, tuple[K, V]] = {}
+        for att, lst in mro_dct.items():
+            if not lst:
+                raise RuntimeError
+            _, obj = lst[-1]
+
+            if len(lst) > 1:
+                if self._requires_override and not (self._is_override or lang.is_override)(obj):
+                    raise lang.RequiresOverrideError(
+                        att,
+                        instance_cls,
+                        lst[-1][0],
+                        lst[0][0],
+                    )
+
+            if not (mv := self._lookup(obj)).present:
+                continue
+
+            if seen is not None:
+                try:
+                    ex_att = seen[obj]
+                except KeyError:
+                    pass
+                else:
+                    raise AttrRegistry.DuplicatesForbiddenError(owner_cls, instance_cls, att, ex_att)  # noqa
+                seen[obj] = att
+
+            out[att] = (obj, mv.must())
+
+        return out
+
+
+##
+
+
+class AttrRegistryCache(ta.Generic[K, V, T]):
+    def __init__(
+            self,
+            registry: AttrRegistry[K, V],
+            prepare: ta.Callable[[type, dict[str, tuple[K, V]]], T],
+    ) -> None:
+        super().__init__()
+
+        self._registry = registry
+        self._prepare = prepare
+
+        self._cache: dict[ta.Any, T] = {}
+
+        def cache_remove(k, self_ref=weakref.ref(self)):
+            if (ref_self := self_ref()) is not None:
+                cache = ref_self._cache  # noqa
+                try:
+                    del cache[k]
+                except KeyError:
+                    pass
+
+        self._cache_remove = cache_remove
+
+        registry.add_invalidate_callback(self._cache.clear)
+
+    def get(self, instance_cls: type) -> T:
+        cls_ref = weakref.ref(instance_cls)
+        try:
+            return self._cache[cls_ref]
+        except KeyError:
+            pass
+        del cls_ref
+
+        collected = self._registry.collect(instance_cls)
+        out = self._prepare(instance_cls, collected)
+        self._cache[weakref.ref(instance_cls, self._cache_remove)] = out
+        return out
+
+
+class SimpleAttrRegistryCache(AttrRegistryCache[K, V, dict[str, tuple[K, V]]], ta.Generic[K, V]):
+    def __init__(self, registry: AttrRegistry[K, V]) -> None:
+        super().__init__(registry, lambda _, dct: dct)

omlish/collections/cache/impl.py

@@ -41,6 +41,7 @@ def LRU(cache: 'Cache') -> None:  # noqa
     cache._kill(cache._root.lru_next)  # type: ignore  # noqa
 
 
+# aka FIFO
 def LRI(cache: 'Cache') -> None:  # noqa
     cache._kill(cache._root.ins_next)  # type: ignore  # noqa
 

omlish/collections/identity.py

@@ -105,6 +105,7 @@ class IdentityWeakKeyDictionary(ta.MutableMapping[K, V]):
 
     TODO:
      - audit for freethreaded
+      - leans on stdlib impls so shouldn't matter?
     """
 
     def __init__(self, *args: ta.Any, **kwargs: ta.Any) -> None:

omlish/collections/mappings.py

@@ -1,6 +1,12 @@
 import typing as ta
 import weakref
 
+from .. import lang
+
+
+with lang.auto_proxy_import(globals()):
+    from . import identity as _identity
+
 
 T = ta.TypeVar('T')
 K = ta.TypeVar('K')
@@ -63,6 +69,9 @@ class TypeMap(ta.Generic[T]):
     def __iter__(self) -> ta.Iterator[T]:
         return iter(self._items)
 
+    def __contains__(self, ty: type[T]) -> bool:
+        return ty in self._items
+
     def get(self, ty: type[T]) -> T | None:
         return self._dct.get(ty)
 
@@ -138,3 +147,22 @@ class MissingDict(dict[K, V]):
     def __missing__(self, key):
         v = self[key] = self._missing_fn(key)
         return v
+
+
+##
+
+
+def dict_factory[K, V](
+        *,
+        identity: bool = False,
+        weak: bool = False,
+) -> ta.Callable[..., ta.MutableMapping[K, V]]:
+    if identity:
+        if weak:
+            return _identity.IdentityWeakKeyDictionary
+        else:
+            return _identity.IdentityKeyDict
+    elif weak:
+        return weakref.WeakKeyDictionary
+    else:
+        return dict

omlish/collections/trie.py

@@ -37,12 +37,16 @@ class Trie(ta.MutableMapping[ta.Sequence[K], V], ta.Generic[K, V]):
         def children(self) -> ta.Mapping[K2, 'Trie.Node[K2, V2]']:
             return self._children
 
-    def __init__(self) -> None:
+    def __init__(self, items: ta.Iterable[tuple[ta.Iterable[K], V]] | None = None) -> None:
         super().__init__()
 
         self._len = 0
         self._root: Trie.Node[K, V] = Trie.Node()
 
+        if items is not None:
+            for k, v in items:
+                self[k] = v
+
     @property
     def root(self) -> Node[K, V]:
         return self._root

omlish/collections/utils.py

@@ -7,7 +7,9 @@ from .identity import IdentitySet
 
 T = ta.TypeVar('T')
 K = ta.TypeVar('K')
+K2 = ta.TypeVar('K2')
 V = ta.TypeVar('V')
+V2 = ta.TypeVar('V2')
 
 
 ##
@@ -135,6 +137,81 @@ def make_map_by(
 ##
 
 
+@ta.overload
+def map_keys(
+        fn: ta.Callable[[K], K2],
+        dct: ta.Mapping[K, V] | ta.Iterable[tuple[K, V]],
+        *,
+        identity: ta.Literal[False] = False,
+        strict: bool = False,
+) -> dict[K2, V]:
+    return {}
+
+
+@ta.overload
+def map_keys(
+        fn: ta.Callable[[K], K2],
+        dct: ta.Mapping[K, V] | ta.Iterable[tuple[K, V]],
+        *,
+        identity: bool = False,
+        strict: bool = False,
+) -> ta.MutableMapping[K2, V]:
+    return {}
+
+
+def map_keys(
+        fn,
+        dct,
+        *,
+        identity=False,
+        strict=False,
+):
+    return make_map(
+        ((fn(k), v) for k, v in (dct.items() if isinstance(dct, ta.Mapping) else dct)),
+        identity=identity,
+        strict=strict,
+    )
+
+
+@ta.overload
+def map_values(
+        fn: ta.Callable[[V], V2],
+        dct: ta.Mapping[K, V] | ta.Iterable[tuple[K, V]],
+        *,
+        identity: ta.Literal[False] = False,
+        strict: bool = False,
+) -> dict[K, V2]:
+    return {}
+
+
+@ta.overload
+def map_values(
+        fn: ta.Callable[[V], V2],
+        dct: ta.Mapping[K, V] | ta.Iterable[tuple[K, V]],
+        *,
+        identity: bool = False,
+        strict: bool = False,
+) -> ta.MutableMapping[K2, V]:
+    return {}
+
+
+def map_values(
+        fn,
+        dct,
+        *,
+        identity=False,
+        strict=False,
+):
+    return make_map(
+        ((k, fn(v)) for k, v in (dct.items() if isinstance(dct, ta.Mapping) else dct)),
+        identity=identity,
+        strict=strict,
+    )
+
+
+##
+
+
 @ta.overload
 def multi_map(
         kvs: ta.Iterable[tuple[K, V]],

omlish/concurrent/all.py

@@ -12,6 +12,7 @@ with _lang.auto_proxy_init(globals()):
     from .futures import (  # noqa
         FutureError,
         FutureTimeoutError,
-        wait_futures,
+        wait_all_futures_or_raise,
         wait_dependent_futures,
+        wait_futures,
     )

omlish/concurrent/futures.py

@@ -48,6 +48,13 @@ def wait_futures(
         raise_exceptions: bool = False,
         cancel_on_exception: bool = False,
 ) -> bool:
+    # TODO:
+    #  - raise_exceptions 'at_end', ExceptionGroup
+    #  - more responsive than tick_interval_s - semaphore, add callbacks to each fut to decrement, sleep with a timed
+    #    wait on sem
+    #  - cancel_on_timeout
+    #  - obviate wait_all_futures_or_raise
+
     start = time.time()
 
     not_done = set(futures)
@@ -72,6 +79,24 @@ def wait_futures(
     return False
 
 
+def wait_all_futures_or_raise(futures: ta.Sequence[cf.Future]) -> None:
+    done, not_done = cf.wait(futures, return_when=cf.ALL_COMPLETED)
+    if not_done:
+        raise RuntimeError(f'Not all futures finished: {not_done}')
+
+    excs: list[Exception] = []
+    for f in done:
+        try:
+            f.result()
+        except Exception as e:  # noqa
+            excs.append(e)
+
+    if len(excs) == 1:
+        raise excs[0]
+    elif excs:
+        raise ExceptionGroup('One or more futures failed', excs)
+
+
 def wait_dependent_futures(
         executor: cf.Executor,
         dependency_sets_by_fn: ta.Mapping[ta.Callable, ta.AbstractSet[ta.Callable]],

omlish/concurrent/threadlets.py

@@ -75,7 +75,7 @@ class GreenletThreadlet(Threadlet):
 
     @property
     def parent(self) -> ta.Optional['GreenletThreadlet']:
-        return GreenletThreadlet(self.g.parent)
+        return GreenletThreadlet(p) if (p := self.g.parent) is not None else None
 
     @property
     def dead(self) -> bool:

omlish/daemons/reparent.py

@@ -10,13 +10,12 @@ def reparent_process(
         no_close_stdio: bool = False,
 ) -> None:
     if (pid := os.fork()):  # noqa
-        sys.exit(0)
-        raise RuntimeError('Unreachable')  # noqa
+        raise SystemExit(0)
 
     os.setsid()
 
     if (pid := os.fork()):  # noqa
-        sys.exit(0)
+        raise SystemExit(0)
 
     if not no_close_stdio:
         rn_fd = os.open('/dev/null', os.O_RDONLY)

omlish/daemons/spawning.py

@@ -2,7 +2,6 @@ import abc
 import enum
 import functools
 import os
-import sys
 import threading
 import typing as ta
 
@@ -166,9 +165,9 @@ class ForkSpawner(Spawner, dc.Frozen):
         try:
             spawn.fn()
         except BaseException:  # noqa
-            sys.exit(1)
+            raise SystemExit(1) from None
         else:
-            sys.exit(0)
+            raise SystemExit(0)
 
         raise RuntimeError('Unreachable')  # noqa
 

omlish/dataclasses/__init__.py

@@ -159,6 +159,8 @@ with _lang.auto_proxy_init(globals()) as _api_cap:
         is_immediate_dataclass,
 
         dataclass_maybe_post_init as maybe_post_init,
+
+        dataclass_descriptor_method as descriptor_method,
     )
 
 

omlish/dataclasses/impl/api/classes/decorator.py

@@ -10,6 +10,7 @@ from ..... import lang
 from ...._internals import STD_FIELDS_ATTR
 from ...._internals import STD_PARAMS_ATTR
 from ....specs import ClassSpec
+from ....specs import ReprFn
 from ...processing.driving import drive_cls_processing
 from ...utils import class_decorator
 from ..fields.building import build_cls_std_fields
@@ -53,6 +54,7 @@ def dataclass(
 
         repr_id: bool | None = None,
         terse_repr: bool | None = None,
+        default_repr_fn: ReprFn | None = None,
 
         allow_redundant_decorator: bool | None = None,
 
@@ -158,6 +160,7 @@ def dataclass(
 
                 repr_id=repr_id,
                 terse_repr=terse_repr,
+                default_repr_fn=default_repr_fn,
 
                 allow_redundant_decorator=allow_redundant_decorator,
             ),

omlish/dataclasses/impl/api/classes/make.py

@@ -4,6 +4,7 @@ import sys
 import types
 import typing as ta
 
+from ....specs import ReprFn
 from .decorator import dataclass
 
 
@@ -53,6 +54,7 @@ def make_dataclass(  # noqa
 
         repr_id: bool | None = None,
         terse_repr: bool | None = None,
+        default_repr_fn: ReprFn | None = None,
 
         allow_redundant_decorator: bool | None = None,
 
@@ -174,6 +176,7 @@ def make_dataclass(  # noqa
 
         repr_id=repr_id,
         terse_repr=terse_repr,
+        default_repr_fn=default_repr_fn,
 
         allow_redundant_decorator=allow_redundant_decorator,
     )

omlish/dataclasses/impl/concerns/repr.py

@@ -32,6 +32,7 @@ class ReprPlan(Plan):
 
     id: bool = False
     terse: bool = False
+    default_fn: OpRef[ReprFn] | None = None
 
 
 @register_generator_type(ReprPlan)
@@ -66,11 +67,17 @@ class ReprGenerator(Generator[ReprPlan]):
                 fn=fnr,
             ))
 
+        drf: OpRef | None = None
+        if ctx.cs.default_repr_fn is not None:
+            drf = OpRef(f'repr.default_fn')
+            orm[drf] = ctx.cs.default_repr_fn
+
         return PlanResult(
             ReprPlan(
                 fields=tuple(rfs),
                 id=ctx.cs.repr_id,
                 terse=ctx.cs.terse_repr,
+                default_fn=drf,
             ),
             orm,
         )
@@ -85,10 +92,16 @@ class ReprGenerator(Generator[ReprPlan]):
             if not (pl.terse and not f.kw_only):
                 pfx = f'{f.name}='
 
+            fn: OpRef[ReprFn] | None = None
             if f.fn is not None:
-                ors.add(f.fn)
+                fn = f.fn
+            elif pl.default_fn is not None:
+                fn = pl.default_fn
+
+            if fn is not None:
+                ors.add(fn)
                 part_lines.extend([
-                    f'    if (s := {f.fn.ident()}(self.{f.name})) is not None:',
+                    f'    if (s := {fn.ident()}(self.{f.name})) is not None:',
                     f'        parts.append(f"{pfx}{{s}}")',
                 ])
             else: