Struct PullPlan 

pub struct PullPlan { /* private fields */ }

Sealed init-time plan. One entry per unique name registered. Owns an Arc<PolydatProgram> so cycle-time resolve only needs the per-fiber state.

Implementations

impl PullPlan

pub fn len(&self) -> usize

Number of distinct names in this plan.

pub fn is_empty(&self) -> bool

Whether this plan has no entries.

pub fn names(&self) -> Vec<&str>

The names in the plan, in registration order. Diagnostic only.

pub fn program(&self) -> &Arc<PolydatProgram>

The program this plan was sealed against.

pub fn resolve(&self, kernel: &mut dyn Kernel) -> ResolvedPulls

Materialize every entry against kernel, a kernel of this plan’s program on any engine (its indices are the program’s). Output entries go through pull_at (eval cone if not current); input entries through input_value_at (cell-aware for shared slots).

O(plan_len) on the hot path — no name hashing.

pub fn resolve_with(&self, kernel: &mut ScopeKernel) -> ResolvedPulls

Convenience: resolve against a scope kernel. Provided so test scaffolding and other ergonomic call sites don’t have to name the trait object.