tnfr 4.5.2__py3-none-any.whl → 6.0.0__py3-none-any.whl

tnfr/utils/cache.pyi

@@ -0,0 +1,156 @@
+from __future__ import annotations
+
+import threading
+from collections.abc import Callable, Hashable, Iterable, Iterator, Mapping, MutableMapping
+from typing import Any, ContextManager, Generic, TypeVar
+
+import networkx as nx
+
+from ..cache import CacheCapacityConfig, CacheManager
+from ..types import GraphLike, NodeId, TNFRGraph, TimingContext
+
+K = TypeVar("K", bound=Hashable)
+V = TypeVar("V")
+T = TypeVar("T")
+
+__all__ = (
+    "EdgeCacheManager",
+    "NODE_SET_CHECKSUM_KEY",
+    "cached_node_list",
+    "cached_nodes_and_A",
+    "clear_node_repr_cache",
+    "configure_graph_cache_limits",
+    "edge_version_cache",
+    "edge_version_update",
+    "ensure_node_index_map",
+    "ensure_node_offset_map",
+    "get_graph_version",
+    "increment_edge_version",
+    "increment_graph_version",
+    "node_set_checksum",
+    "stable_json",
+)
+
+NODE_SET_CHECKSUM_KEY: str
+
+
+class LRUCache(MutableMapping[K, V], Generic[K, V]):
+    def __init__(self, maxsize: int = ...) -> None: ...
+
+    def __getitem__(self, __key: K) -> V: ...
+
+    def __setitem__(self, __key: K, __value: V) -> None: ...
+
+    def __delitem__(self, __key: K) -> None: ...
+
+    def __iter__(self) -> Iterator[K]: ...
+
+    def __len__(self) -> int: ...
+
+
+class EdgeCacheState:
+    cache: MutableMapping[Hashable, Any]
+    locks: MutableMapping[Hashable, threading.RLock]
+    max_entries: int | None
+
+
+class EdgeCacheManager:
+    _STATE_KEY: str
+
+    def __init__(self, graph: MutableMapping[str, Any]) -> None: ...
+
+    def record_hit(self) -> None: ...
+
+    def record_miss(self, *, track_metrics: bool = ...) -> None: ...
+
+    def record_eviction(self, *, track_metrics: bool = ...) -> None: ...
+
+    def timer(self) -> TimingContext: ...
+
+    def _default_state(self) -> EdgeCacheState: ...
+
+    def resolve_max_entries(self, max_entries: int | None | object) -> int | None: ...
+
+    def _build_state(self, max_entries: int | None) -> EdgeCacheState: ...
+
+    def _ensure_state(
+        self, state: EdgeCacheState | None, max_entries: int | None | object
+    ) -> EdgeCacheState: ...
+
+    def _reset_state(self, state: EdgeCacheState | None) -> EdgeCacheState: ...
+
+    def get_cache(
+        self,
+        max_entries: int | None | object,
+        *,
+        create: bool = ...,
+    ) -> tuple[
+        MutableMapping[Hashable, Any] | None,
+        MutableMapping[Hashable, threading.RLock] | None,
+    ]: ...
+
+    def clear(self) -> None: ...
+
+
+def get_graph_version(graph: Any, key: str, default: int = ...) -> int: ...
+
+
+def increment_graph_version(graph: Any, key: str) -> int: ...
+
+
+def stable_json(obj: Any) -> str: ...
+
+
+def clear_node_repr_cache() -> None: ...
+
+
+def node_set_checksum(
+    G: nx.Graph,
+    nodes: Iterable[Any] | None = ...,
+    *,
+    presorted: bool = ...,
+    store: bool = ...,
+) -> str: ...
+
+
+def cached_node_list(G: nx.Graph) -> tuple[Any, ...]: ...
+
+
+def ensure_node_index_map(G: TNFRGraph) -> dict[NodeId, int]: ...
+
+
+def ensure_node_offset_map(G: TNFRGraph) -> dict[NodeId, int]: ...
+
+
+def configure_graph_cache_limits(
+    G: GraphLike | TNFRGraph | MutableMapping[str, Any],
+    *,
+    default_capacity: int | None | object = CacheManager._MISSING,
+    overrides: Mapping[str, int | None] | None = ...,
+    replace_overrides: bool = ...,
+) -> CacheCapacityConfig: ...
+
+
+def increment_edge_version(G: Any) -> None: ...
+
+
+def edge_version_cache(
+    G: Any,
+    key: Hashable,
+    builder: Callable[[], T],
+    *,
+    max_entries: int | None | object = CacheManager._MISSING,
+) -> T: ...
+
+
+def cached_nodes_and_A(
+    G: nx.Graph,
+    *,
+    cache_size: int | None = ...,
+    require_numpy: bool = ...,
+    prefer_sparse: bool = ...,
+    nodes: tuple[Any, ...] | None = ...,
+) -> tuple[tuple[Any, ...], Any]: ...
+
+
+def edge_version_update(G: TNFRGraph) -> ContextManager[None]: ...

tnfr/{collections_utils.py → utils/data.py}

@@ -1,4 +1,4 @@
-"""Utilities for working with generic collections and weight mappings."""
+"""Utilities for manipulating collections and scalar values within TNFR."""
 
 from __future__ import annotations
 
@@ -8,39 +8,70 @@ from collections.abc import Collection, Iterable, Mapping, Sequence
 from itertools import islice
 from typing import Any, Callable, Iterator, TypeVar, cast
 
-from .logging_utils import get_logger
-from .logging_utils import warn_once as _warn_once_factory
-from .value_utils import convert_value
-from .helpers.numeric import kahan_sum_nd
+from ..helpers.numeric import kahan_sum_nd
+from .init import get_logger, warn_once as _warn_once_factory
 
 T = TypeVar("T")
 
-logger = get_logger(__name__)
+_collections_logger = get_logger("tnfr.utils.data.collections")
+_value_logger = get_logger("tnfr.utils.data")
 
 STRING_TYPES = (str, bytes, bytearray)
 
 NEGATIVE_WEIGHTS_MSG = "Negative weights detected: %s"
 
-_NEGATIVE_WARN_ONCE_MAXSIZE = 1024
+_MAX_NEGATIVE_WARN_ONCE = 1024
+
+__all__ = (
+    "convert_value",
+    "MAX_MATERIALIZE_DEFAULT",
+    "normalize_materialize_limit",
+    "is_non_string_sequence",
+    "flatten_structure",
+    "STRING_TYPES",
+    "ensure_collection",
+    "normalize_weights",
+    "negative_weights_warn_once",
+    "normalize_counter",
+    "mix_groups",
+)
+
+
+def convert_value(
+    value: Any,
+    conv: Callable[[Any], T],
+    *,
+    strict: bool = False,
+    key: str | None = None,
+    log_level: int | None = None,
+) -> tuple[bool, T | None]:
+    """Attempt to convert a value and report failures."""
+
+    try:
+        return True, conv(value)
+    except (ValueError, TypeError) as exc:
+        if strict:
+            raise
+        level = log_level if log_level is not None else logging.DEBUG
+        if key is not None:
+            _value_logger.log(level, "Could not convert value for %r: %s", key, exc)
+        else:
+            _value_logger.log(level, "Could not convert value: %s", exc)
+        return False, None
 
 
 def negative_weights_warn_once(
-    *, maxsize: int = _NEGATIVE_WARN_ONCE_MAXSIZE
+    *, maxsize: int = _MAX_NEGATIVE_WARN_ONCE
 ) -> Callable[[Mapping[str, float]], None]:
-    """Return a ``WarnOnce`` callable for negative weight warnings.
-
-    The returned callable may be reused across multiple
-    :func:`normalize_weights` invocations to suppress duplicate warnings for
-    the same keys.
-    """
+    """Return a ``WarnOnce`` callable for negative weight warnings."""
 
-    return _warn_once_factory(logger, NEGATIVE_WEIGHTS_MSG, maxsize=maxsize)
+    return _warn_once_factory(_collections_logger, NEGATIVE_WEIGHTS_MSG, maxsize=maxsize)
 
 
 def _log_negative_weights(negatives: Mapping[str, float]) -> None:
     """Log negative weight warnings without deduplicating keys."""
 
-    logger.warning(NEGATIVE_WEIGHTS_MSG, negatives)
+    _collections_logger.warning(NEGATIVE_WEIGHTS_MSG, negatives)
 
 
 def _resolve_negative_warn_handler(
@@ -57,6 +88,7 @@ def _resolve_negative_warn_handler(
 
 def is_non_string_sequence(obj: Any) -> bool:
     """Return ``True`` if ``obj`` is an ``Iterable`` but not string-like or a mapping."""
+
     return isinstance(obj, Iterable) and not isinstance(obj, (*STRING_TYPES, Mapping))
 
 
@@ -65,20 +97,7 @@ def flatten_structure(
     *,
     expand: Callable[[Any], Iterable[Any] | None] | None = None,
 ) -> Iterator[Any]:
-    """Yield leaf items from ``obj``.
-
-    The order of yielded items follows the order of the input iterable when it
-    is defined. For unordered iterables like :class:`set` the resulting order is
-    arbitrary. Mappings are treated as atomic items and not expanded.
-
-    Parameters
-    ----------
-    obj:
-        Object that may contain nested iterables.
-    expand:
-        Optional callable returning a replacement iterable for ``item``. When
-        it returns ``None`` the ``item`` is processed normally.
-    """
+    """Yield leaf items from ``obj`` following breadth-first semantics."""
 
     stack = deque([obj])
     seen: set[int] = set()
@@ -100,30 +119,13 @@ def flatten_structure(
             yield item
 
 
-__all__ = (
-    "MAX_MATERIALIZE_DEFAULT",
-    "normalize_materialize_limit",
-    "is_non_string_sequence",
-    "flatten_structure",
-    "STRING_TYPES",
-    "ensure_collection",
-    "normalize_weights",
-    "negative_weights_warn_once",
-    "normalize_counter",
-    "mix_groups",
-)
-
 MAX_MATERIALIZE_DEFAULT: int = 1000
-"""Default materialization limit used by :func:`ensure_collection`.
-
-This guard prevents accidentally consuming huge or infinite iterables when a
-limit is not explicitly provided. Pass ``max_materialize=None`` to disable the
-limit.
-"""
+"""Default materialization limit used by :func:`ensure_collection`."""
 
 
 def normalize_materialize_limit(max_materialize: int | None) -> int | None:
     """Normalize and validate ``max_materialize`` returning a usable limit."""
+
     if max_materialize is None:
         return None
     limit = int(max_materialize)
@@ -138,34 +140,17 @@ def ensure_collection(
     max_materialize: int | None = MAX_MATERIALIZE_DEFAULT,
     error_msg: str | None = None,
 ) -> Collection[T]:
-    """Return ``it`` as a :class:`Collection`, materializing when needed.
-
-    Checks are executed in the following order:
-
-    1. Existing collections are returned directly. String-like inputs
-       (``str``, ``bytes`` and ``bytearray``) are wrapped as a single item
-       tuple.
-    2. The object must be an :class:`Iterable`; otherwise ``TypeError`` is
-       raised.
-    3. Remaining iterables are materialized up to ``max_materialize`` items.
-       ``None`` disables the limit. ``error_msg`` customizes the
-       :class:`ValueError` raised when the iterable yields more items than
-       allowed. The input is consumed at most once and no extra items beyond the
-       limit are stored in memory.
-    """
-
-    # Step 1: early-return for collections and raw strings/bytes
+    """Return ``it`` as a :class:`Collection`, materializing when needed."""
+
     if isinstance(it, Collection):
         if isinstance(it, STRING_TYPES):
             return (cast(T, it),)
         else:
             return it
 
-    # Step 2: ensure the input is iterable
     if not isinstance(it, Iterable):
         raise TypeError(f"{it!r} is not iterable")
 
-    # Step 3: validate limit and materialize items once
     limit = normalize_materialize_limit(max_materialize)
     if limit is None:
         return tuple(it)
@@ -231,28 +216,8 @@ def normalize_weights(
     warn_once: bool | Callable[[Mapping[str, float]], None] = True,
     error_on_conversion: bool = False,
 ) -> dict[str, float]:
-    """Normalize ``keys`` in mapping ``dict_like`` so their sum is 1.
-
-    ``keys`` may be any iterable of strings and is materialized once while
-    collapsing repeated entries preserving their first occurrence.
-
-    Negative weights are handled according to ``error_on_negative``. When
-    ``True`` a :class:`ValueError` is raised. Otherwise negatives are logged,
-    replaced with ``0`` and the remaining weights are renormalized. If all
-    weights are non-positive a uniform distribution is returned.
-
-    Conversion errors are controlled separately by ``error_on_conversion``. When
-    ``True`` any :class:`TypeError` or :class:`ValueError` while converting a
-    value to ``float`` is propagated. Otherwise the error is logged and the
-    ``default`` value is used.
-
-    ``warn_once`` accepts either a boolean or a callable. ``False`` logs all
-    negative weights using :func:`logging.Logger.warning`. ``True`` (the
-    default) creates a fresh :class:`~tnfr.logging_utils.WarnOnce` instance for
-    the call, emitting a single warning containing all negative keys. To reuse
-    deduplication state across calls, pass a callable such as
-    :func:`negative_weights_warn_once`.
-    """
+    """Normalize ``keys`` in mapping ``dict_like`` so their sum is 1."""
+
     weights, keys_list, total = _convert_and_validate_weights(
         dict_like,
         keys,
@@ -273,6 +238,7 @@ def normalize_counter(
     counts: Mapping[str, float | int],
 ) -> tuple[dict[str, float], float]:
     """Normalize a ``Counter`` returning proportions and total."""
+
     total = kahan_sum_nd(((c,) for c in counts.values()), dims=1)[0]
     if total <= 0:
         return {}, 0
@@ -287,6 +253,7 @@ def mix_groups(
     prefix: str = "_",
 ) -> dict[str, float]:
     """Aggregate values of ``dist`` according to ``groups``."""
+
     out: dict[str, float] = dict(dist)
     out.update(
         {

tnfr/utils/data.pyi

@@ -0,0 +1,73 @@
+from __future__ import annotations
+
+from collections.abc import Collection, Iterable, Iterator, Mapping, Sequence
+from typing import Any, Callable, TypeVar
+
+T = TypeVar("T")
+
+STRING_TYPES: tuple[type[str] | type[bytes] | type[bytearray], ...]
+MAX_MATERIALIZE_DEFAULT: int
+NEGATIVE_WEIGHTS_MSG: str
+
+__all__: tuple[str, ...]
+
+
+def convert_value(
+    value: Any,
+    conv: Callable[[Any], T],
+    *,
+    strict: bool = ...,
+    key: str | None = ...,
+    log_level: int | None = ...,
+) -> tuple[bool, T | None]: ...
+
+
+def negative_weights_warn_once(
+    *,
+    maxsize: int = ...,
+) -> Callable[[Mapping[str, float]], None]: ...
+
+
+def is_non_string_sequence(obj: Any) -> bool: ...
+
+
+def flatten_structure(
+    obj: Any,
+    *,
+    expand: Callable[[Any], Iterable[Any] | None] | None = ...,
+) -> Iterator[Any]: ...
+
+
+def normalize_materialize_limit(max_materialize: int | None) -> int | None: ...
+
+
+def ensure_collection(
+    it: Iterable[T],
+    *,
+    max_materialize: int | None = ...,
+    error_msg: str | None = ...,
+) -> Collection[T]: ...
+
+
+def normalize_weights(
+    dict_like: Mapping[str, Any],
+    keys: Iterable[str] | Sequence[str],
+    default: float = ...,
+    *,
+    error_on_negative: bool = ...,
+    warn_once: bool | Callable[[Mapping[str, float]], None] = ...,
+    error_on_conversion: bool = ...,
+) -> dict[str, float]: ...
+
+
+def normalize_counter(
+    counts: Mapping[str, float | int],
+) -> tuple[dict[str, float], float]: ...
+
+
+def mix_groups(
+    dist: Mapping[str, float],
+    groups: Mapping[str, Iterable[str]],
+    *,
+    prefix: str = ...,
+) -> dict[str, float]: ...

tnfr/utils/graph.py

@@ -0,0 +1,87 @@
+"""Utilities for graph-level bookkeeping shared by TNFR components."""
+
+from __future__ import annotations
+
+import warnings
+from types import MappingProxyType
+from typing import Any, Mapping, MutableMapping
+
+from ..types import GraphLike, TNFRGraph
+
+__all__ = (
+    "get_graph",
+    "get_graph_mapping",
+    "mark_dnfr_prep_dirty",
+    "supports_add_edge",
+    "GraphLike",
+)
+
+
+def get_graph(
+    obj: GraphLike | TNFRGraph | MutableMapping[str, Any]
+) -> MutableMapping[str, Any]:
+    """Return the graph-level metadata mapping for ``obj``.
+
+    ``obj`` must be a :class:`~tnfr.types.TNFRGraph` instance or fulfil the
+    :class:`~tnfr.types.GraphLike` protocol. The function normalises access to
+    the ``graph`` attribute exposed by ``networkx``-style graphs and wrappers,
+    always returning the underlying metadata mapping. A pre-extracted mapping
+    is also accepted for legacy call sites.
+    """
+
+    graph = getattr(obj, "graph", None)
+    if graph is not None:
+        return graph
+    if isinstance(obj, MutableMapping):
+        return obj
+    raise TypeError("Unsupported graph object: metadata mapping not accessible")
+
+
+def get_graph_mapping(
+    G: GraphLike | TNFRGraph | MutableMapping[str, Any], key: str, warn_msg: str
+) -> Mapping[str, Any] | None:
+    """Return an immutable view of ``G``'s stored mapping for ``key``.
+
+    The ``G`` argument follows the :class:`~tnfr.types.GraphLike` protocol, is
+    a concrete :class:`~tnfr.types.TNFRGraph` or provides the metadata mapping
+    directly. The helper validates that the stored value is a mapping before
+    returning a read-only proxy.
+    """
+
+    graph = get_graph(G)
+    getter = getattr(graph, "get", None)
+    if getter is None:
+        return None
+
+    data = getter(key)
+    if data is None:
+        return None
+    if not isinstance(data, Mapping):
+        warnings.warn(warn_msg, UserWarning, stacklevel=2)
+        return None
+    return MappingProxyType(data)
+
+
+def mark_dnfr_prep_dirty(
+    G: GraphLike | TNFRGraph | MutableMapping[str, Any]
+) -> None:
+    """Flag ΔNFR preparation data as stale by marking ``G.graph``.
+
+    ``G`` is constrained to the :class:`~tnfr.types.GraphLike` protocol, a
+    concrete :class:`~tnfr.types.TNFRGraph` or an explicit metadata mapping,
+    ensuring the metadata storage is available for mutation.
+    """
+
+    graph = get_graph(G)
+    graph["_dnfr_prep_dirty"] = True
+
+
+def supports_add_edge(graph: GraphLike | TNFRGraph) -> bool:
+    """Return ``True`` if ``graph`` exposes an ``add_edge`` method.
+
+    The ``graph`` parameter must implement :class:`~tnfr.types.GraphLike` or be
+    a :class:`~tnfr.types.TNFRGraph`, aligning runtime expectations with the
+    type contract enforced throughout the engine.
+    """
+
+    return hasattr(graph, "add_edge")

tnfr/utils/graph.pyi

@@ -0,0 +1,10 @@
+from typing import Any
+
+__all__: Any
+
+def __getattr__(name: str) -> Any: ...
+
+get_graph: Any
+get_graph_mapping: Any
+mark_dnfr_prep_dirty: Any
+supports_add_edge: Any