Per-item database queries: six recorded examples
The downloads contain six original inputs, their expected labels and one recorded API observation per input revision. Disagreements stay visible.
Review the lookup code and helper behavior. Distinguish per-item queries from a batched fetch or required sequential calls; concurrent scheduling alone does not make database queries batched.
Scheduling and query count are separate. Running independent lookups together may reduce waiting, but the code can still issue one database operation for every item. The Batched example changes the lookup shape itself.
This classification does not measure latency, database load or query plans. The Sequential outcome preserves cases where a documented dependency makes ordered calls necessary rather than assuming all loops are mistakes.
This original code-reading exercise adapts a rule in the jev-lint repository linked by the cited X post. Snippets, labels and missing-context handling are authored for this page. It does not execute code, reproduce a repository scan or certify an application as safe.

Use the sample to understand the rule, then test your own input for per-item database queries.

Review the lookup code and helper behavior.

Open the decision rules and keep the intended distinction between Peritem, Batched, Sequential, Unclear. 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 Unclear before using a result. The label is a decision about the supplied information, not an executed action.
| Original input | Observed label | Leading probability |
|---|---|---|
| Looped lookups | Peritem | 100% |
| Concurrent lookups | Peritem | 100% |
| One membership query | Batched | 100% |
| Dependent traversal | Sequential | 61.0% |
| Unknown batch helper | Unclear | 70.0% |
| Lookup from loaded map | Batched | 100% |
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.
It may change scheduling, but independent calls remain independent calls. Batching requires a collective operation or a documented batching layer.
No. A later key may depend on an earlier result. Supply that contract so the review can distinguish it from independent lookups.
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.