Closure ownership: six recorded examples
The downloads contain six original inputs, their expected labels and one recorded API observation per input revision. Disagreements stay visible.
Describe who stores the closure, its captures and their lifetimes. Trace explicit strong edges and weak captures before deciding whether the supplied graph contains a cycle.
A retain cycle needs a return path. A closure can strongly capture an object without a cycle when that object does not directly or indirectly retain the closure.
The examples make each edge explicit, including subscriptions between the owner and callback. Missing capture or storage facts go to review instead of being inferred from the word self.
The source linter checks escaping-closure cycles. This exercise describes an ownership graph; actual retention duration, cleanup and memory behavior still need runtime inspection.
This is an independently authored text demonstration inspired by the linked X discussion. Its rules and synthetic inputs are ours. It does not reproduce the author’s application, verify reported outcomes, or perform an external action.

Use the sample to understand the rule, then test your own input for closure ownership.

Describe who stores the closure, its captures and their lifetimes.

Open the decision rules and keep the intended distinction between Strong cycle, Weak capture, No cycle shown, Review. Edit the choices only when testing your own rule.

Use a sample first, then try your own input. Compare the selected label with the other returned probabilities.

Review Review before using a result. The label is a decision about the supplied information, not an executed action.
| Original input | Observed label | Leading probability |
|---|---|---|
| Stored closure captures owner | Strong cycle | 98.0% |
| Weak return edge | Weak capture | 91.0% |
| External one-shot closure | No cycle shown | 56.0% |
| Unknown registry ownership | Review | 100% |
| Indirect strong loop | Strong cycle | 96.0% |
| Nonowning capture with known lifetime | Weak capture | 93.0% |
These are six original synthetic inputs, tested once per request revision. The percentage is the leading option probability, not measured accuracy. Authored expectations and any disagreements remain in the downloadable evidence. 6 of 6 results matched the authored fixture expectations.Verified
The downloads contain six original inputs, their expected labels and one recorded API observation per input revision. Disagreements stay visible.
The single-request SDK runner uses your private TYPESAFE_API_KEY. The offline consumer reads saved observations, checks request hashes and prints a pending output. It does not call the model or change any external system.
# Offline: inspect the downloaded saved observations. No API key is needed.
python preview_choice_workflow.py samples.json saved-api-results.json
# Optional live request: install the SDK and set TYPESAFE_API_KEY privately.
npm install @typesafe-ai/sdk@0.6.0
node run-choice-sample.mjs samples.json case-1
# The live response prints to the terminal; it does not update saved-api-results.json.The input contract and these limits define what the result means.
No. A cycle requires a complete loop of strong ownership. Lifetime and release behavior are separate facts to inspect.
No. This example classifies the supplied graph. Selecting a capture mode requires the actual lifetime and behavior requirements.
It describes the distribution over the supplied choices for this request. These six synthetic examples are functional tests with authored expectations, not a production accuracy benchmark.
No. The demo displays a label and distribution. The downloadable consumer produces a pending preview packet. Application code and a separate authorization policy would control any real action.
Edit the example above to see how a changed fact affects the decision, or open the Playground for another task.