Struct WrapperResolver 

pub struct WrapperResolver { /* private fields */ }

Resolves a WrapperPlan for a parsed op template.

Stateless apart from the session config it holds (the default-order tiebreaker). Repeated calls with the same inputs produce identical plans.

Implementations

impl WrapperResolver

pub fn with_default_order( registry: &WrapperRegistry, ) -> Result<Self, ResolveError>

Construct a resolver with the built-in default order.

pub fn from_names( names: &[&str], registry: &WrapperRegistry, ) -> Result<Self, ResolveError>

Construct a resolver from an explicit list of wrapper names (innermost-to-outermost). Validates against the registry’s constraint graph; rejects unknown names and orderings that violate forbids_outer.

pub fn resolve( &self, subject: WrapperSubject<'_>, registry: &WrapperRegistry, ) -> Result<WrapperPlan, ResolveError>

Resolve the wrapper plan for one op template.

pub fn default_order(&self) -> &[WrapperName]

The innermost-to-outermost default order this resolver uses as a tiebreaker. Useful for diagnostics (nmbrs describe wrappers).

pub fn resolve_with_order( &self, subject: WrapperSubject<'_>, registry: &WrapperRegistry, order: &[&str], ) -> Result<WrapperPlan, ResolveError>

SRD-32a Push 3 — resolve a plan using an explicit per-op innermost-to-outermost order list. The list MUST be a permutation of the wrappers triggered on this op (after transitive activation):

• listing a wrapper whose trigger doesn’t fire is a hard error (silently dropping it would mask typos),
• omitting one whose trigger does fire is a hard error (skipping a wrapper changes semantics).

All other constraint checks (mutually_exclusive_with, requires_inner cycles, forbids_outer) run exactly as they do for the default-order path — same code, same error shapes.