Skip to content

Commit f1e4108

Browse files
committed
docs: say what the graphed hooks do without the project's labels
The hist.graphed docstring and the test-module header carried graphed-project work-item and freeze-tag labels an upstream reader cannot resolve; they now state the same behaviour in plain words. Assisted-by: ClaudeCode:claude-opus-5
1 parent 44f6358 commit f1e4108

2 files changed

Lines changed: 7 additions & 7 deletions

File tree

‎src/hist/graphed/hist.py‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -52,6 +52,6 @@ def fill(
5252
class Hist(FillModeMixin, HistInMemory[S], ghb.Histogram, Generic[S], family=hist): # type: ignore[misc]
5353
"""A `hist.Hist` whose fills are DEFERRED graphed computations: QuickConstruct
5454
(`Hist.new.Reg(...).Double()`) and named-axis fills record into the graphed IR. Evaluation
55-
is graphed's own idiom — `plan()` + an R7 executor (whose result wraps back into an
55+
is graphed's own idiom — `plan()` + a graphed executor (whose result wraps back into an
5656
in-memory `hist.Hist` via `hist.Hist(value)`), or the reference `session.materialize` on a
5757
fill node."""

‎tests/test_graphed.py‎

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,9 @@
1-
# Tests for hist.graphed — deferred hist filling on graphed task graphs (HIST-1; P0.1 of the
2-
# ADL-benchmarks port). QuickConstruct-built deferred histograms must equal their eager hist.Hist
3-
# twins BIT FOR BIT over graphed-numpy AND graphed-awkward sources and over a real uproot TTree,
4-
# with named-axis fills, weights, NamedHist, and the partition-wise efficiency witness (the
5-
# source's whole-dataset loader never runs). Evaluation is graphed's idiom [freeze-HIST-2,
6-
# user-directed]: plan() + an R7 executor; hist.Hist(value) wraps results back in-memory.
1+
# Tests for hist.graphed — deferred hist filling on graphed task graphs. QuickConstruct-built
2+
# deferred histograms must equal their eager hist.Hist twins BIT FOR BIT over graphed-numpy AND
3+
# graphed.awkward sources and over a real uproot TTree, with named-axis fills, weights, NamedHist,
4+
# and the partition-wise efficiency witness (the source's whole-dataset loader never runs).
5+
# Evaluation is graphed's idiom: plan() + a graphed executor; hist.Hist(value) wraps results back
6+
# in-memory.
77
from __future__ import annotations
88

99
import numpy as np

0 commit comments

Comments
 (0)