A collection sequence-literal call `Call(0, [callee, Seq(collection)])` → its `(callee, seq)`. The shared guard under every collection/map factory rec

Deterministic 64-bit mix (no random seed — determinism is a hard invariant).

Build a lambda `λ<pattern>. <Block[Return[body]]>` over a comprehension's iteration pattern (the `for x in …` target), so the body converges with a JS

Compare one repo's baseline vs current canonical output + runtime.

Symbols *bound* within one scope (params + assignment targets + `for`-pattern vars), NOT descending into nested functions. A name used but not bound h

Truthiness of an If/ternary condition. A concrete value decides as usual. A symbolic condition bails in strict mode; under #244 exploration it takes t

Turn a pair-local witness into the actionable source location while retaining its enclosing named unit as context. Whole-unit locations stay unchanged

Coarse value domain of a `Const`, read directly from its explicit [`ConstKind`] (no numeric-range inference — that packing was the source of the #308/

Containment of the smaller set in the larger: |a∩b| / min(|a|,|b|).

Compute coverage over a (raw) corpus. `top` caps the unhandled-kind histogram.

The declarative value fingerprint of the first `CssRule` unit in `src`.

Compute declaration facts for one file, selected by extension (the same vocabulary `nose query` discovers by). Returns `None` for extensions without a

Find the binding identifier inside a (possibly pointer/array) C declarator.

The definition rooted at `node` was DECORATED in source: its runtime binding is the decorator's result, not the lowered body. Consumers that attribute

Multiset difference of two decorator-line lists: `Some((a_only, b_only))` when they differ, `None` when identical.

Several child seeds can prove the same enclosing pair. Keep one deterministic strongest witness and discard pairs already accepted by ordinary scoring

Find maximal duplicated runs across all streams and cluster them into groups. A single forward pass keyed by k-gram hash: the first time a k-gram is s

The canonical value of a dict key→value entry — `Call(DictEntry, [k, v])` — shared by a dict `pair`, a dict-comprehension body, and a `d[k]=v` buildin

Walk `root` (respecting .gitignore) and collect supported source files, skipping any matching an `exclude` glob. The walk runs on multiple threads (`i

The flagged divergences as JSON item objects inside query-JSON's `base` view.

Resolve domain evidence for a variable occurrence without requiring an interner. This is the scoped-parameter fallback used by consumers that operate

Copies, dampened. Removable code grows with the number of copies, but with DIMINISHING returns: the first few dedups capture the design win, whereas a

Emit a commutative-but-not-associative comparison (`==`/`!=`): rewrite both operands, then order them by structural hash (ties keep source order) so `

Tag a value with the current path condition: under branch conditions, the returned/thrown value is `Phi(path, v, ⊥)` (a sentinel for "not on this path

Walk a (possibly nested) block, applying assignments to `env`, and return the value of the first `return` expression reached.