Enum BoundaryPolicy 

pub enum BoundaryPolicy {
    Tight,
    DelayedSense,
    DelayedCoupling(Domain),
}

The boundary policy for an edge between two ports, given the directed signal-flow orientation and component memory.

This is the single source of truth for “how must an edge between these two kinds of ports be treated at a stage boundary”. A later formation phase reads BoundaryPolicy::directive to decide whether to co-solve the two ends (tight) or cut + route them with a delay (sense / coupling).

Variants

Tight

Co-solve: the two ports belong to the same solved system (an ordinary forward cascade edge, a conducting edge). No boundary cut.

DelayedSense

Cut + sense with a one-sample delay: a FEEDBACK edge into a control electrode (e.g. an output tap rectified back into a sidechain grid). The sense path is broken to keep the forward solve causal.

DelayedCoupling(Domain)

Cut + couple across a non-electrical Domain with a one-sample delay: a transducer edge (photocoupler LED drive, OTA Iabc CV). The two networks never share a node; the coupling is delivered next sample.

Implementations

impl BoundaryPolicy

pub fn classify( ends: (PortClass, PortClass), flow_is_back_edge: bool, has_memory: bool, ) -> Self

The whole rule table. ends are the two port classes of an edge, flow_is_back_edge is true when the edge runs against the directed signal flow (feedback), and has_memory records whether the coupling element carries state/taus (photocoupler cell, etc.).

Rules (in priority order):

1. an edge into a PortClass::Transducer → BoundaryPolicy::DelayedCoupling.
2. a BACK-edge into a PortClass::ControlInput → BoundaryPolicy::DelayedSense.
3. a FORWARD edge into a PortClass::ControlInput (cascade) → BoundaryPolicy::Tight.
4. everything else → BoundaryPolicy::Tight.

has_memory is part of the signature because a future refinement may route a memoryless transducer differently from a stateful one; in the Phase-1 table it does not change the outcome (a transducer coupling is always delayed, with or without its own state).

pub fn directive(&self) -> Directive

The declarative consequence a formation consumer applies (Phase 1: all consumers are absent, so this output is never acted on).

Trait Implementations

impl Clone for BoundaryPolicy

fn clone(&self) -> BoundaryPolicy

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for BoundaryPolicy

impl Debug for BoundaryPolicy

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Eq for BoundaryPolicy

impl PartialEq for BoundaryPolicy

fn eq(&self, other: &BoundaryPolicy) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for BoundaryPolicy