git-bisectlib 0.16.1__tar.gz → 0.16.2__tar.gz

{git_bisectlib-0.16.1 → git_bisectlib-0.16.2}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: git_bisectlib
-Version: 0.16.1
+Version: 0.16.2
 Summary: Write tiny git bisect recipes in Python; watch progress live in .bisect/status.md.
 Author-email: Martin Leitner-Ankerl <martin.ankerl@gmail.com>
 License: MIT
@@ -152,7 +152,7 @@ Date:   2026-06-15 11:40:00 +0200
  1 file changed, 6 insertions(+), 6 deletions(-)
 ```
 
-| good | bad | midpoint | range | status |
+| good | bad | probe | range | status |
 |------|-----|----------|-------|--------|
 | `2801e9572` …, Bob | `79cb050c2` …, Alice | `cb5394973` …, Carol | 27d 15h · 11 commits | 🟢 good |
 | `cb5394973` …, Carol | `79cb050c2` …, Alice | `95345541b` …, Dan | 12d 7h · 6 commits | 🔴 bad · 81.2s |
@@ -160,7 +160,7 @@ Date:   2026-06-15 11:40:00 +0200
 | `cb5394973` …, Carol | `5c9dcafb3` …, Eve | `19d89b121` …, Fay | 3d 5h · 2 commits | 🟢 good |
 ````
 
-Each row reads in causal order — the **input range** (`good`/`bad`) → the **midpoint** git
+Each row reads in causal order — the **input range** (`good`/`bad`) → the **probe** git
 chose → the **result** — so you see the range funnel down as you scan. The report is
 re-rendered the moment each command *starts*, links every step to its live-streamed log
 under `.bisect/<sha>/`, and — when the search resolves — shows the culprit the way

{git_bisectlib-0.16.1 → git_bisectlib-0.16.2}/README.md

@@ -135,7 +135,7 @@ Date:   2026-06-15 11:40:00 +0200
  1 file changed, 6 insertions(+), 6 deletions(-)
 ```
 
-| good | bad | midpoint | range | status |
+| good | bad | probe | range | status |
 |------|-----|----------|-------|--------|
 | `2801e9572` …, Bob | `79cb050c2` …, Alice | `cb5394973` …, Carol | 27d 15h · 11 commits | 🟢 good |
 | `cb5394973` …, Carol | `79cb050c2` …, Alice | `95345541b` …, Dan | 12d 7h · 6 commits | 🔴 bad · 81.2s |
@@ -143,7 +143,7 @@ Date:   2026-06-15 11:40:00 +0200
 | `cb5394973` …, Carol | `5c9dcafb3` …, Eve | `19d89b121` …, Fay | 3d 5h · 2 commits | 🟢 good |
 ````
 
-Each row reads in causal order — the **input range** (`good`/`bad`) → the **midpoint** git
+Each row reads in causal order — the **input range** (`good`/`bad`) → the **probe** git
 chose → the **result** — so you see the range funnel down as you scan. The report is
 re-rendered the moment each command *starts*, links every step to its live-streamed log
 under `.bisect/<sha>/`, and — when the search resolves — shows the culprit the way

{git_bisectlib-0.16.1 → git_bisectlib-0.16.2}/bisectlib/__init__.py

@@ -65,7 +65,7 @@ from typing import Callable, Literal, NoReturn, Optional, Union
 _BadWhen = Literal["fail", "pass"]
 _OnTimeout = Literal["abort", "skip", "bad"]
 
-__version__ = "0.16.1"
+__version__ = "0.16.2"
 
 __all__ = [
     "run", "test", "hammer", "check",       # the verbs
@@ -1428,7 +1428,7 @@ def replace(path: str, old: Union[str, "re.Pattern"], new: str, *,
     old_str = old.pattern if isinstance(old, re.Pattern) else str(old)
     _final.setdefault("fixups", []).append(
         {"kind": "replace", "path": path,
-         "detail": f"{old_str} → {new}"})
+         "old": old_str, "new": new})
     sys.stderr.write(f"  edit {path}: {n} replacement(s)\n")
 
 

{git_bisectlib-0.16.1 → git_bisectlib-0.16.2}/bisectlib/_report.py

@@ -123,7 +123,7 @@ class Sidecar:
 class Row:
     bad: str          # input-range bad bound (sha) before this evaluation
     good: str         # input-range good bound (sha) before this evaluation
-    midpoint: str     # the commit evaluated this step
+    probe: str     # the commit evaluated this step
     status: str       # good | bad | skip | todo
     n_commits: int = 0          # candidate commits still in range at this step
     span_seconds: int = 0       # wall span between good and bad commit dates
@@ -229,7 +229,7 @@ def build_report(
     current_good: Optional[str] = None
     active_goods: list[str] = []   # every good marked so far (defines the range)
     rows: list[Row] = []
-    seen_midpoints: set[str] = set()
+    seen_probes: set[str] = set()
 
     def ready() -> bool:
         return current_bad is not None and current_good is not None
@@ -259,17 +259,17 @@ def build_report(
         if current_good is None or is_ancestor(repo, current_good, sha):
             current_good = sha
 
-    def add_row(midpoint: str, status: str) -> None:
+    def add_row(probe: str, status: str) -> None:
         rows.append(
             Row(
                 bad=current_bad,
                 good=current_good,
-                midpoint=midpoint,
+                probe=probe,
                 status=status,
                 goods=list(active_goods),
             )
         )
-        seen_midpoints.add(midpoint)
+        seen_probes.add(probe)
 
     for verb, args in ops:
         revs = [a for a in args if not a.startswith("-")]
@@ -338,14 +338,14 @@ def build_report(
         if n_remaining <= 1:
             first_bad = current_bad
 
-    # In-flight row: HEAD is the midpoint git currently has checked out, awaiting a
+    # In-flight row: HEAD is the probe git currently has checked out, awaiting a
     # verdict, and is not yet a logged marking.
     in_progress = False
     if (
         ready()
         and first_bad is None
         and head
-        and head not in seen_midpoints
+        and head not in seen_probes
         and head != current_good
     ):
         within_range = (
@@ -355,7 +355,7 @@ def build_report(
         # A per-commit sidecar written by the engine is proof HEAD is the commit
         # being evaluated right now — trust it when the ancestry checks can't
         # confirm the range (shallow/grafted clone, or an anchor good that isn't a
-        # topological ancestor of the midpoint). This keeps status.md live (the
+        # topological ancestor of the probe). This keeps status.md live (the
         # in-flight row and its steps refresh after every command) on such repos.
         has_sidecar = bool(logs_dir) and (Path(logs_dir) / head / "eval.json").is_file()
         if within_range or has_sidecar:
@@ -365,7 +365,7 @@ def build_report(
     # Gather subjects + dates for every sha we reference.
     shas = set()
     for r in rows:
-        shas.update([r.bad, r.good, r.midpoint])
+        shas.update([r.bad, r.good, r.probe])
     shas.update([orig_bad, current_bad, current_good, *orig_goods])
     shas.discard(None)
     subjects, dates, authors = _commit_meta(repo, shas)
@@ -381,7 +381,7 @@ def build_report(
             r.bad_date = dates.get(r.bad, "")
             r.span_seconds = _date_delta_seconds(r.good_date, r.bad_date)
         if logs_dir:
-            r.sidecar = _load_sidecar(logs_dir, r.midpoint)
+            r.sidecar = _load_sidecar(logs_dir, r.probe)
 
     # The in-flight commit (HEAD) is a `todo` row because git hasn't recorded its
     # mark yet — but if the recipe already finished and its sidecar carries a
@@ -640,7 +640,7 @@ def render_markdown(rep: Report, details: bool = False, color: bool = True) -> s
         lines.append(f"> ⚠️ {rep.note}")
     lines.append("")
 
-    lines.append("| good | bad | midpoint | range | status |")
+    lines.append("| good | bad | probe | range | status |")
     lines.append("|------|-----|----------|-------|--------|")
     for r in rep.rows:
         rng = f"{fmt_duration(r.span_seconds)} · {r.n_commits} commits"
@@ -649,7 +649,7 @@ def render_markdown(rep: Report, details: bool = False, color: bool = True) -> s
         if extra:
             status += f" · {extra}"
         lines.append(
-            f"| {cell(r.good)} | {cell(r.bad)} | {cell(r.midpoint)} | {rng} | {status} |"
+            f"| {cell(r.good)} | {cell(r.bad)} | {cell(r.probe)} | {rng} | {status} |"
         )
     lines.append("")
 
@@ -660,15 +660,20 @@ def render_markdown(rep: Report, details: bool = False, color: bool = True) -> s
             lines.append("")
             for r in detail_rows:
                 lines.append(
-                    f"### `{rep.short(r.midpoint)}` — {rep.subject(r.midpoint)} "
+                    f"### `{rep.short(r.probe)}` — {rep.subject(r.probe)} "
                     f"({icon(r.status)})"
                 )
-                if r.sidecar.fixups:
-                    fx = ", ".join(
-                        f"{f.get('kind')}: `{f.get('detail', f.get('path',''))}`"
-                        for f in r.sidecar.fixups
-                    )
-                    lines.append(f"- fixups: {fx}")
+                for f in r.sidecar.fixups:
+                    kind = f.get("kind", "")
+                    if kind == "replace":
+                        lines.append(
+                            f"- replace: in `{f['path']}`: "
+                            f"`{f['old']}` → `{f['new']}`"
+                        )
+                    else:
+                        lines.append(
+                            f"- {kind}: `{f.get('detail', f.get('path', ''))}`"
+                        )
                 for s in r.sidecar.steps:
                     if s.verb != "hammer":
                         continue
@@ -693,7 +698,7 @@ def render_markdown(rep: Report, details: bool = False, color: bool = True) -> s
                     # link the step to its captured log file (relative to status.md,
                     # which sits alongside the per-commit <sha>/ log dirs); the log
                     # streams live, so the link is watchable while the step runs
-                    step = f"[{s.verb}]({r.midpoint}/{s.log})" if s.log else s.verb
+                    step = f"[{s.verb}]({r.probe}/{s.log})" if s.log else s.verb
                     lines.append(
                         f"| {step} | `{s.cmd}` | {code} | {dur} |"
                     )

{git_bisectlib-0.16.1 → git_bisectlib-0.16.2}/git_bisectlib.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: git_bisectlib
-Version: 0.16.1
+Version: 0.16.2
 Summary: Write tiny git bisect recipes in Python; watch progress live in .bisect/status.md.
 Author-email: Martin Leitner-Ankerl <martin.ankerl@gmail.com>
 License: MIT
@@ -152,7 +152,7 @@ Date:   2026-06-15 11:40:00 +0200
  1 file changed, 6 insertions(+), 6 deletions(-)
 ```
 
-| good | bad | midpoint | range | status |
+| good | bad | probe | range | status |
 |------|-----|----------|-------|--------|
 | `2801e9572` …, Bob | `79cb050c2` …, Alice | `cb5394973` …, Carol | 27d 15h · 11 commits | 🟢 good |
 | `cb5394973` …, Carol | `79cb050c2` …, Alice | `95345541b` …, Dan | 12d 7h · 6 commits | 🔴 bad · 81.2s |
@@ -160,7 +160,7 @@ Date:   2026-06-15 11:40:00 +0200
 | `cb5394973` …, Carol | `5c9dcafb3` …, Eve | `19d89b121` …, Fay | 3d 5h · 2 commits | 🟢 good |
 ````
 
-Each row reads in causal order — the **input range** (`good`/`bad`) → the **midpoint** git
+Each row reads in causal order — the **input range** (`good`/`bad`) → the **probe** git
 chose → the **result** — so you see the range funnel down as you scan. The report is
 re-rendered the moment each command *starts*, links every step to its live-streamed log
 under `.bisect/<sha>/`, and — when the search resolves — shows the culprit the way

{git_bisectlib-0.16.1 → git_bisectlib-0.16.2}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "git_bisectlib"
-version = "0.16.1"
+version = "0.16.2"
 description = "Write tiny git bisect recipes in Python; watch progress live in .bisect/status.md."
 readme = "README.md"
 requires-python = ">=3.10"

{git_bisectlib-0.16.1 → git_bisectlib-0.16.2}/tests/test_report.py

@@ -83,9 +83,9 @@ class TestReport(unittest.TestCase):
         rep = _report.build_report(d)
         self.assertIsNotNone(rep)
         self.assertGreaterEqual(len(rep.rows), 1)
-        # first row's midpoint is the first commit git checked out
+        # first row's probe is the first commit git checked out
         first = rep.rows[0]
-        self.assertEqual(first.midpoint, head1)
+        self.assertEqual(first.probe, head1)
         self.assertEqual(first.status, "bad" if has_bug else "good")
         # there should be an in-flight todo row for the new HEAD
         self.assertTrue(rep.in_progress)
@@ -106,7 +106,7 @@ class TestReport(unittest.TestCase):
     def test_range_count_excludes_all_goods(self):
         # In a merge DAG, git's candidate range excludes ancestors of EVERY good,
         # not just the latest. With a good anchor on a side branch that diverges
-        # from the mainline midpoint, counting only `latest_good..bad` overcounts.
+        # from the mainline probe, counting only `latest_good..bad` overcounts.
         d = tempfile.mkdtemp(prefix="bisect-report-dag-")
         run(d, "git", "init", "-q")
         run(d, "git", "config", "user.email", "t@t.t")
@@ -184,8 +184,8 @@ class TestReport(unittest.TestCase):
             without_sc = _report.build_report(d)  # no sidecar → no invented row
         finally:
             _report.is_ancestor = orig
-        self.assertIn(head, [r.midpoint for r in with_sc.rows])
-        self.assertNotIn(head, [r.midpoint for r in without_sc.rows])
+        self.assertIn(head, [r.probe for r in with_sc.rows])
+        self.assertNotIn(head, [r.probe for r in without_sc.rows])
         run(d, "git", "bisect", "reset")
 
     def test_cells_show_date_and_author_not_subject(self):
@@ -256,12 +256,12 @@ class TestReport(unittest.TestCase):
         # a finalized sidecar surfaces the real verdict on the in-flight row
         write(pending=False, outcome="bad")
         rep = _report.build_report(d, logs_dir=logs)
-        row = next(r for r in rep.rows if r.midpoint == head)
+        row = next(r for r in rep.rows if r.probe == head)
         self.assertEqual(row.status, "bad")
         # while still pending, it stays `todo`
         write(pending=True, outcome="good")
         rep = _report.build_report(d, logs_dir=logs)
-        row = next(r for r in rep.rows if r.midpoint == head)
+        row = next(r for r in rep.rows if r.probe == head)
         self.assertEqual(row.status, "todo")
         run(d, "git", "bisect", "reset")
 
@@ -280,7 +280,7 @@ class TestReport(unittest.TestCase):
             rep = _report.build_report(d)
         finally:
             _report.is_ancestor = orig
-        self.assertIn(m1, [r.midpoint for r in rep.rows])
+        self.assertIn(m1, [r.probe for r in rep.rows])
         run(d, "git", "bisect", "reset")
 
     def test_render_format(self):
@@ -291,13 +291,13 @@ class TestReport(unittest.TestCase):
         rep = _report.build_report(d)
         rep.rows[0].sidecar = _report.Sidecar(
             fixups=[{"kind": "replace", "path": "f",
-                     "detail": "OLD_VALUE → NEW_VALUE"}], steps=[])
+                     "old": "OLD_VALUE", "new": "NEW_VALUE"}], steps=[])
         md = _report.render_markdown(rep, details=True)
-        self.assertIn("| good | bad | midpoint | range | status |", md)
+        self.assertIn("| good | bad | probe | range | status |", md)
         self.assertRegex(md, r"🟢|🔴")                     # status icons
         self.assertNotIn("✅", md)
         self.assertNotIn("→ ", md.split("## Details")[0])  # no dates/arrows in range
-        self.assertIn("`OLD_VALUE → NEW_VALUE`", md)        # full fixup in backticks
+        self.assertIn("in `f`: `OLD_VALUE` → `NEW_VALUE`", md)
         run(d, "git", "bisect", "reset")
 
     def test_no_bisect_returns_none(self):