activegraph 1.0.3__tar.gz → 1.0.5__tar.gz

{activegraph-1.0.3 → activegraph-1.0.5}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: activegraph
-Version: 1.0.3
+Version: 1.0.5
 Summary: An event-sourced reactive graph runtime for long-running, auditable, agentic systems.
 Author: Active Graph contributors
 License: MIT
@@ -49,6 +49,7 @@ Provides-Extra: docs
 Requires-Dist: mkdocs>=1.6; extra == "docs"
 Requires-Dist: mkdocs-material>=9.5; extra == "docs"
 Requires-Dist: mkdocstrings[python]>=0.24; extra == "docs"
+Requires-Dist: mkdocs-llmstxt>=0.2; extra == "docs"
 
 # Active Graph
 
@@ -219,6 +220,13 @@ in [`docs/concepts/relations.md`](https://docs.activegraph.ai/concepts/relations
   per-error catalog.
 - **[10-minute tutorial](https://docs.activegraph.ai/quickstart/)** — install
   to a working custom behavior, including fork-and-diff.
+- **AI coding assistants** — the docs are machine-readable at
+  [docs.activegraph.ai/llms.txt](https://docs.activegraph.ai/llms.txt)
+  (structured index) and
+  [docs.activegraph.ai/llms-full.txt](https://docs.activegraph.ai/llms-full.txt)
+  (concatenated full content), generated from the same source markdown
+  as the rendered site. Built for AI agents evaluating the framework
+  via Claude Code, Cursor, Replit, and similar tooling.
 - **[CHANGELOG.md](CHANGELOG.md)** — every release, with per-version
   migration notes.
 - **[CONTRACT.md](CONTRACT.md)** — locked design decisions, version

{activegraph-1.0.3 → activegraph-1.0.5}/README.md

@@ -167,6 +167,13 @@ in [`docs/concepts/relations.md`](https://docs.activegraph.ai/concepts/relations
   per-error catalog.
 - **[10-minute tutorial](https://docs.activegraph.ai/quickstart/)** — install
   to a working custom behavior, including fork-and-diff.
+- **AI coding assistants** — the docs are machine-readable at
+  [docs.activegraph.ai/llms.txt](https://docs.activegraph.ai/llms.txt)
+  (structured index) and
+  [docs.activegraph.ai/llms-full.txt](https://docs.activegraph.ai/llms-full.txt)
+  (concatenated full content), generated from the same source markdown
+  as the rendered site. Built for AI agents evaluating the framework
+  via Claude Code, Cursor, Replit, and similar tooling.
 - **[CHANGELOG.md](CHANGELOG.md)** — every release, with per-version
   migration notes.
 - **[CONTRACT.md](CONTRACT.md)** — locked design decisions, version

{activegraph-1.0.3 → activegraph-1.0.5}/activegraph/__init__.py

@@ -222,4 +222,4 @@ __all__ = [
     "tool",
 ]
 
-__version__ = "1.0.3"
+__version__ = "1.0.5"

{activegraph-1.0.3 → activegraph-1.0.5}/activegraph/core/graph.py

@@ -181,6 +181,33 @@ class Graph:
             out.append(r)
         return out
 
+    def relations(
+        self,
+        source: Optional[str] = None,
+        target: Optional[str] = None,
+        type: Optional[str] = None,
+    ) -> list[Relation]:
+        """Return relations filtered by ``source``, ``target``, and/or ``type``.
+
+        v1.0.4 #1: the canonical filter API on ``Graph``. Decomposes the
+        v0 ``get_relations(object_id=, direction=)`` axis into separate
+        ``source`` and ``target`` slots so the call reads the way users
+        already write it (matches ``docs/concepts/graph.md``). Filter
+        kwargs compose by AND; calling with no kwargs returns every
+        relation. ``Graph.get_relations(object_id=, type=, direction=)``
+        stays as a backward-compatible alias.
+        """
+        out: list[Relation] = []
+        for r in self._relations.values():
+            if source is not None and r.source != source:
+                continue
+            if target is not None and r.target != target:
+                continue
+            if type is not None and r.type != type:
+                continue
+            out.append(r)
+        return out
+
     def neighborhood(self, object_id: str, depth: int = 1) -> tuple[list[Object], list[Relation]]:
         if object_id not in self._objects:
             return ([], [])

{activegraph-1.0.3 → activegraph-1.0.5}/activegraph.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: activegraph
-Version: 1.0.3
+Version: 1.0.5
 Summary: An event-sourced reactive graph runtime for long-running, auditable, agentic systems.
 Author: Active Graph contributors
 License: MIT
@@ -49,6 +49,7 @@ Provides-Extra: docs
 Requires-Dist: mkdocs>=1.6; extra == "docs"
 Requires-Dist: mkdocs-material>=9.5; extra == "docs"
 Requires-Dist: mkdocstrings[python]>=0.24; extra == "docs"
+Requires-Dist: mkdocs-llmstxt>=0.2; extra == "docs"
 
 # Active Graph
 
@@ -219,6 +220,13 @@ in [`docs/concepts/relations.md`](https://docs.activegraph.ai/concepts/relations
   per-error catalog.
 - **[10-minute tutorial](https://docs.activegraph.ai/quickstart/)** — install
   to a working custom behavior, including fork-and-diff.
+- **AI coding assistants** — the docs are machine-readable at
+  [docs.activegraph.ai/llms.txt](https://docs.activegraph.ai/llms.txt)
+  (structured index) and
+  [docs.activegraph.ai/llms-full.txt](https://docs.activegraph.ai/llms-full.txt)
+  (concatenated full content), generated from the same source markdown
+  as the rendered site. Built for AI agents evaluating the framework
+  via Claude Code, Cursor, Replit, and similar tooling.
 - **[CHANGELOG.md](CHANGELOG.md)** — every release, with per-version
   migration notes.
 - **[CONTRACT.md](CONTRACT.md)** — locked design decisions, version

{activegraph-1.0.3 → activegraph-1.0.5}/activegraph.egg-info/SOURCES.txt

@@ -120,6 +120,7 @@ tests/test_llm_tool_loop.py
 tests/test_llm_trace.py
 tests/test_llm_trace_snapshot.py
 tests/test_llm_types.py
+tests/test_llms_txt.py
 tests/test_migration.py
 tests/test_observability_logging.py
 tests/test_observability_metrics.py

{activegraph-1.0.3 → activegraph-1.0.5}/activegraph.egg-info/requires.txt

@@ -23,6 +23,7 @@ psycopg[binary]<4,>=3.1
 mkdocs>=1.6
 mkdocs-material>=9.5
 mkdocstrings[python]>=0.24
+mkdocs-llmstxt>=0.2
 
 [llm]
 anthropic>=0.40

{activegraph-1.0.3 → activegraph-1.0.5}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "activegraph"
-version = "1.0.3"
+version = "1.0.5"
 description = "An event-sourced reactive graph runtime for long-running, auditable, agentic systems."
 readme = "README.md"
 requires-python = ">=3.11"
@@ -65,6 +65,12 @@ docs = [
     "mkdocs>=1.6",
     "mkdocs-material>=9.5",
     "mkdocstrings[python]>=0.24",
+    # v1.0.5 #1: generates /llms.txt and /llms-full.txt at the site
+    # root so AI coding assistants fetching docs.activegraph.ai get
+    # clean markdown instead of mkdocs-rendered HTML. Same maintainer
+    # as mkdocstrings; native dual-output via the `full_output:` config
+    # key. Surfaced by the v1.0.4 external user-test.
+    "mkdocs-llmstxt>=0.2",
 ]
 
 [project.scripts]

{activegraph-1.0.3 → activegraph-1.0.5}/tests/test_doc_links.py

@@ -66,6 +66,22 @@ _DOCS_URL_RE = re.compile(
 )
 
 
+# URLs that are generated at build time and do NOT correspond to a
+# `docs/*.md` source file. These bypass the source-presence check
+# because their existence is verified by a dedicated build-time gate
+# rather than by source-tree presence.
+#
+# `/llms.txt` and `/llms-full.txt` (CONTRACT v1.0.5 #1) are emitted by
+# the `mkdocs-llmstxt` plugin during `mkdocs build`; their existence
+# and well-formedness are verified by `tests/test_llms_txt.py`. Any
+# URL added here must have a paired build-time test asserting the
+# file lands at the site root.
+_BUILD_GENERATED_URLS = frozenset({
+    "/llms.txt",
+    "/llms-full.txt",
+})
+
+
 def _strip_trailing_punct(s: str) -> str:
     """URLs in prose often end at sentence boundaries; trim trailing
     punctuation that isn't part of the URL."""
@@ -181,6 +197,10 @@ def test_every_referenced_docs_url_has_a_source_page() -> None:
     missing: dict[Path, list[tuple[str, list[Path]]]] = {}
     unmapped: list[tuple[str, list[Path]]] = []
     for url_path, sources in referenced.items():
+        if url_path in _BUILD_GENERATED_URLS:
+            # Existence guaranteed by tests/test_llms_txt.py at build
+            # time; no docs/*.md source to check.
+            continue
         expected = _url_to_source_path(url_path)
         if expected is None:
             unmapped.append((url_path, sources))

{activegraph-1.0.3 → activegraph-1.0.5}/tests/test_graph.py

@@ -129,6 +129,104 @@ def test_query_alias_still_works_with_positional_arg():
     assert {o.type for o in g.query("claim")} == {"claim"}
 
 
+# v1.0.4 #1: graph.relations(source=, target=, type=) as the canonical
+# filter API, decomposing the v0 get_relations(object_id=, direction=)
+# axis into separate source/target slots. The contract claim is the
+# eight filter combinations enumerated in CONTRACT v1.0.4 #1; the tests
+# anchor on each combination directly, not on equivalence to the alias.
+# The alias-still-works check is its own test.
+
+
+def _three_node_graph():
+    g = _g()
+    a = g.add_object("task", {"k": "a"})
+    b = g.add_object("task", {"k": "b"})
+    c = g.add_object("task", {"k": "c"})
+    rel_ab_dep = g.add_relation(a.id, b.id, "depends_on")
+    rel_ac_dep = g.add_relation(a.id, c.id, "depends_on")
+    rel_bc_blk = g.add_relation(b.id, c.id, "blocks")
+    rel_ba_dep = g.add_relation(b.id, a.id, "depends_on")
+    return g, a, b, c, rel_ab_dep, rel_ac_dep, rel_bc_blk, rel_ba_dep
+
+
+def test_relations_no_kwargs_returns_every_relation():
+    # Contract row 1: (None, None, None) -> every relation.
+    g, _, _, _, *rels = _three_node_graph()
+    out = g.relations()
+    assert {r.id for r in out} == {r.id for r in rels}
+
+
+def test_relations_source_only_returns_outgoing_from_source():
+    # Contract row 2: (A, None, None) -> relations where source == A.
+    g, a, b, c, rel_ab, rel_ac, _, _ = _three_node_graph()
+    out = g.relations(source=a.id)
+    assert {r.id for r in out} == {rel_ab.id, rel_ac.id}
+    assert all(r.source == a.id for r in out)
+
+
+def test_relations_target_only_returns_incoming_to_target():
+    # Contract row 3: (None, B, None) -> relations where target == B.
+    g, a, b, c, rel_ab, _, _, _ = _three_node_graph()
+    out = g.relations(target=b.id)
+    assert {r.id for r in out} == {rel_ab.id}
+    assert all(r.target == b.id for r in out)
+
+
+def test_relations_source_and_target_returns_intersection():
+    # Contract row 4: (A, B, None) -> relations from A to B.
+    g, a, b, c, rel_ab, _, _, rel_ba = _three_node_graph()
+    out = g.relations(source=a.id, target=b.id)
+    assert {r.id for r in out} == {rel_ab.id}
+    # Not the reverse direction.
+    assert rel_ba.id not in {r.id for r in out}
+
+
+def test_relations_type_only_returns_every_relation_of_type():
+    # Contract row 5: (None, None, T) -> every relation of type T.
+    g, *_, rel_bc_blk, _ = _three_node_graph()
+    out = g.relations(type="blocks")
+    assert {r.id for r in out} == {rel_bc_blk.id}
+    assert all(r.type == "blocks" for r in out)
+
+
+def test_relations_source_and_type_returns_outgoing_of_type():
+    # Contract row 6: (A, None, T) -> relations from A of type T.
+    g, a, _, _, rel_ab, rel_ac, _, _ = _three_node_graph()
+    out = g.relations(source=a.id, type="depends_on")
+    assert {r.id for r in out} == {rel_ab.id, rel_ac.id}
+
+
+def test_relations_target_and_type_returns_incoming_of_type():
+    # Contract row 7: (None, B, T) -> relations to B of type T.
+    g, a, b, _, rel_ab, _, _, _ = _three_node_graph()
+    out = g.relations(target=b.id, type="depends_on")
+    assert {r.id for r in out} == {rel_ab.id}
+
+
+def test_relations_source_target_and_type_most_specific():
+    # Contract row 8: (A, B, T) -> relations from A to B of type T.
+    g, a, b, _, rel_ab, _, _, rel_ba = _three_node_graph()
+    out = g.relations(source=a.id, target=b.id, type="depends_on")
+    assert {r.id for r in out} == {rel_ab.id}
+    # Different-direction same-type relation is excluded.
+    assert rel_ba.id not in {r.id for r in out}
+    # Wrong-type from A->B does not exist; sanity check empty for a wrong type.
+    assert g.relations(source=a.id, target=b.id, type="blocks") == []
+
+
+def test_get_relations_alias_still_works():
+    # Backward-compat: the v0 shape continues to work byte-identically.
+    # This is the alias relationship, not the contract claim — kept as
+    # its own test per CONTRACT v1.0.4 #1's Standing Rule §2 carve-out.
+    g, a, b, c, rel_ab, rel_ac, _, rel_ba = _three_node_graph()
+    out = g.get_relations(object_id=a.id, direction="outgoing")
+    assert {r.id for r in out} == {rel_ab.id, rel_ac.id}
+    incoming = g.get_relations(object_id=a.id, direction="incoming")
+    assert {r.id for r in incoming} == {rel_ba.id}
+    both = g.get_relations(object_id=a.id, direction="both")
+    assert {r.id for r in both} == {rel_ab.id, rel_ac.id, rel_ba.id}
+
+
 def test_neighborhood_walks_to_depth():
     g = _g()
     a = g.add_object("task", {})

activegraph-1.0.5/tests/test_llms_txt.py

@@ -0,0 +1,184 @@
+"""llms.txt / llms-full.txt generation gate. CONTRACT v1.0.5 #1.
+
+Builds the mkdocs site into a temp directory and asserts that
+``site/llms.txt`` and ``site/llms-full.txt`` exist after the build,
+are well-formed (H1, blockquote summary, at least one H2 section),
+and reference the nav-anchor pages named in CONTRACT v1.0.5 #1's
+contract claim. The "content coverage" assertion is the boundary
+guard against the failure mode where the build succeeds but emits
+an llms.txt that contains only the H1 — file existence alone is
+not sufficient.
+
+Standing Rule §2 shape: the test anchors on the contract boundary
+the v1.0.5 #1 amendment names ("both files exist after build and
+are well-formed"), not on the implementation path of the
+`mkdocs-llmstxt` plugin. If a future release swaps the plugin for
+a custom build script or a different plugin, this test stays
+correct without modification.
+
+Marked ``slow`` because ``mkdocs build`` takes several seconds.
+Local ``pytest`` skips it by default; the ``.github/workflows/docs.yml``
+workflow runs it explicitly via ``pytest -m slow tests/test_llms_txt.py``.
+The precedent is ``tests/test_doc_site_reachable.py`` (CONTRACT v1.1
+#9), which uses the same marker for the same reason.
+"""
+
+from __future__ import annotations
+
+import shutil
+import subprocess
+from pathlib import Path
+
+import pytest
+
+
+REPO_ROOT = Path(__file__).resolve().parent.parent
+MKDOCS_CONFIG = REPO_ROOT / "mkdocs.yml"
+
+
+@pytest.fixture(scope="module")
+def built_site(tmp_path_factory: pytest.TempPathFactory) -> Path:
+    """Run ``mkdocs build`` into a temp dir; return the site/ path.
+
+    Module-scoped: the build is shared across every assertion in
+    this file. The fixture skips the entire module if ``mkdocs`` is
+    not installed — keeps the gate honest about its hard dependency
+    on the docs-build environment without polluting unrelated test
+    runs.
+    """
+    if shutil.which("mkdocs") is None:
+        pytest.skip("mkdocs binary not available; install '.[docs]' to run")
+
+    site_dir = tmp_path_factory.mktemp("llms_txt_gate") / "site"
+    result = subprocess.run(
+        [
+            "mkdocs",
+            "build",
+            "--config-file",
+            str(MKDOCS_CONFIG),
+            "--site-dir",
+            str(site_dir),
+            "--clean",
+        ],
+        capture_output=True,
+        text=True,
+        cwd=REPO_ROOT,
+    )
+    if result.returncode != 0:
+        # Surface the actual mkdocs error so a failing gate is
+        # diagnosable from the CI log — not just "build failed."
+        pytest.fail(
+            "mkdocs build failed:\n"
+            f"stdout:\n{result.stdout}\nstderr:\n{result.stderr}"
+        )
+    return site_dir
+
+
+@pytest.mark.slow
+def test_llms_txt_exists(built_site: Path) -> None:
+    """Contract: ``/llms.txt`` is generated at site root after build."""
+    llms = built_site / "llms.txt"
+    assert llms.is_file(), (
+        f"site/llms.txt missing after mkdocs build (expected at {llms}). "
+        "Check the `llmstxt` plugin block in mkdocs.yml."
+    )
+
+
+@pytest.mark.slow
+def test_llms_full_txt_exists(built_site: Path) -> None:
+    """Contract: ``/llms-full.txt`` is generated at site root after build."""
+    llms_full = built_site / "llms-full.txt"
+    assert llms_full.is_file(), (
+        f"site/llms-full.txt missing after mkdocs build (expected at {llms_full}). "
+        "Check the `full_output:` key in the `llmstxt` plugin block."
+    )
+
+
+@pytest.mark.slow
+def test_llms_txt_h1_and_blockquote(built_site: Path) -> None:
+    """Contract: ``llms.txt`` starts with the H1 and a blockquote summary.
+
+    The plugin derives the H1 from ``site_name`` and the blockquote
+    from ``site_description``. The assertion shape catches both the
+    plugin-not-running case and the case where ``mkdocs.yml`` loses
+    one of those keys (which would break the llms.txt convention
+    described at llmstxt.org).
+    """
+    content = (built_site / "llms.txt").read_text(encoding="utf-8")
+    lines = content.splitlines()
+
+    assert lines[0] == "# Active Graph", (
+        f"llms.txt does not start with the expected H1; got: {lines[0]!r}"
+    )
+    # The blockquote summary line — first non-empty line after the H1.
+    blockquote = next((ln for ln in lines[1:] if ln.strip()), "")
+    assert blockquote.startswith("> "), (
+        f"llms.txt does not carry a blockquote summary; got: {blockquote!r}"
+    )
+    assert len(blockquote) > len("> "), (
+        "llms.txt blockquote summary is empty after the '> ' marker"
+    )
+
+
+@pytest.mark.slow
+def test_llms_txt_has_section_headers(built_site: Path) -> None:
+    """Contract: ``llms.txt`` carries H2 sections (navigation aid shape)."""
+    content = (built_site / "llms.txt").read_text(encoding="utf-8")
+    h2_count = sum(1 for ln in content.splitlines() if ln.startswith("## "))
+    assert h2_count >= 4, (
+        f"llms.txt has {h2_count} H2 section headers; expected at least 4 "
+        "(Quickstart / Concepts / Cookbook / Reference at minimum). "
+        "A file with the H1 but no sections is not useful as a nav aid."
+    )
+
+
+@pytest.mark.slow
+def test_llms_txt_references_nav_anchor_pages(built_site: Path) -> None:
+    """Contract: ``llms.txt`` references the nav-anchor pages by name.
+
+    The v1.0.5 #1 amendment names three anchors for the coverage
+    check: ``concepts/graph.md``, ``quickstart.md``, and at least
+    one cookbook page. These are the load-bearing entry points for
+    a first-time AI reader walking the index; if any one is
+    missing, the file fails to deliver on its navigation-aid
+    purpose.
+    """
+    content = (built_site / "llms.txt").read_text(encoding="utf-8")
+
+    assert "concepts/graph/" in content, (
+        "llms.txt does not reference docs/concepts/graph.md — the "
+        "primary entry point for the framework's primitive model."
+    )
+    assert "quickstart/" in content, (
+        "llms.txt does not reference docs/quickstart.md — the "
+        "ten-minute tutorial that the README points new users at."
+    )
+    assert "cookbook/" in content, (
+        "llms.txt does not reference any cookbook page — at least "
+        "one of common-patterns.md / debugging.md / multi-run-scripts.md "
+        "is expected."
+    )
+
+
+@pytest.mark.slow
+def test_llms_full_txt_well_formed(built_site: Path) -> None:
+    """Contract: ``llms-full.txt`` carries the H1 + actual page bodies.
+
+    Asserts on a distinctive prose marker from ``docs/quickstart.md``
+    so a file that contains the H1 and blockquote but no concatenated
+    bodies fails. The marker is the tutorial's opening sentence,
+    voice-locked since v1.0-rc1 and unlikely to churn.
+    """
+    content = (built_site / "llms-full.txt").read_text(encoding="utf-8")
+
+    assert content.startswith("# Active Graph"), (
+        "llms-full.txt does not start with the expected H1"
+    )
+    # Distinctive phrase from docs/quickstart.md's first paragraph —
+    # if llms-full.txt contains it, the quickstart body made it
+    # into the concatenated output.
+    assert "Ten minutes from install to a working custom behavior" in content, (
+        "llms-full.txt does not contain the quickstart body marker; "
+        "the file may be the index-only output instead of the "
+        "concatenated full content."
+    )

{activegraph-1.0.3 → activegraph-1.0.5}/tests/test_requeue_unfired.py

@@ -128,6 +128,70 @@ class TestRequeueUnfiredDoesNotFalselyRequeue:
                 except FileNotFoundError:
                     pass
 
+    def test_zero_subscriber_event_ids_are_absent_from_requeue_set_on_load(self):
+        """Boundary-anchored sibling to the queue_depth assertion above.
+
+        CONTRACT v0.5 #8 names the boundary as `Runtime.load` and the
+        subject as the requeue set itself: "events with NO
+        `behavior.started` referencing them are re-queued; events that
+        any behavior started on are NOT re-queued." A zero-subscriber
+        event has no `behavior.started` referencing it but is
+        popped-and-discarded by the runtime loop — so the contract
+        carve-out is that zero-subscriber events are NOT in the
+        requeue set on load.
+
+        The sibling test above asserts `queue_depth == 0` (the
+        implementation's symptom). This test asserts directly on the
+        boundary the contract names: it identifies the zero-subscriber
+        event IDs from the saved log, reloads, and verifies those IDs
+        are absent from `rt._queue` after `_requeue_unfired` ran on
+        load. Anchors on what the contract says, not on whether the
+        post-load queue depth happens to be zero (CONTRACT v1.0.4 #4,
+        Standing Rule §2).
+        """
+        _register_subscriber_for_goal_only()
+        with tempfile.NamedTemporaryFile(suffix=".db", delete=False) as f:
+            path = f.name
+        os.remove(path)
+        try:
+            g = Graph()
+            rt = Runtime(g, persist_to=path)
+            rt.run_goal("test_goal")
+            rt.save_state()
+
+            zero_subscriber_event_ids = {
+                e.id for e in rt.graph.events
+                if e.type == "downstream.no_subscribers"
+            }
+            assert zero_subscriber_event_ids, (
+                "Fixture is supposed to produce at least one "
+                "downstream.no_subscribers event. Without it, the "
+                "contract claim's specific subject (the zero-"
+                "subscriber carve-out) isn't being exercised."
+            )
+
+            _register_subscriber_for_goal_only()
+            rt2 = Runtime.load(path, run_id=rt.run_id)
+
+            requeued_event_ids = {e.id for e in rt2._queue._q}  # noqa: SLF001
+            falsely_requeued = zero_subscriber_event_ids & requeued_event_ids
+            assert not falsely_requeued, (
+                f"CONTRACT v0.5 #8 carve-out: zero-subscriber events are "
+                f"popped-and-discarded with no behavior.started emitted, "
+                f"so on Runtime.load they must NOT appear in the requeue "
+                f"set. The following zero-subscriber event IDs were "
+                f"falsely requeued: {sorted(falsely_requeued)}. This is "
+                f"the v0.5 #8 boundary the contract names; failure here "
+                f"means the requeue set itself violates the contract "
+                f"regardless of what queue_depth summarizes."
+            )
+        finally:
+            for suffix in ("", "-wal", "-shm"):
+                try:
+                    os.remove(path + suffix)
+                except FileNotFoundError:
+                    pass
+
 
 class TestRequeueUnfiredPreservesCrashRecovery:
     """The fix narrows the requeue scope to events after the last drain.