Struct RingContract 

pub struct RingContract {
    pub max_concurrent_push: u8,
    pub max_concurrent_pop: u8,
    pub ordering: OrderingContract,
    pub capacity_bound: Option<u32>,
}

Declared operation envelope for a ring. The two count bounds use 0 to mean “unbounded”.

Fields

max_concurrent_push: u8

Max concurrently-registered producers (0 = unbounded).

max_concurrent_pop: u8

Max concurrently-registered consumers (0 = unbounded).

ordering: OrderingContract

The ordering envelope the consumers may observe.

capacity_bound: Option<u32>

Optional hard ceiling on ring capacity (None = unbounded).

Implementations

impl RingContract

pub fn from_counts(max_producers: usize, max_consumers: usize) -> Self

A contract that PINS the peer counts: registration past max_producers / max_consumers returns TooManyProducers / TooManyConsumers instead of growing the ring. No ordering constraint, no capacity bound. The common fixed-topology declaration.

pub fn unbounded() -> Self

The fully-unbounded contract: any peer counts, any capacity, no ordering constraint. The DEFAULT for rings with no declared contract - registration never fails under it (peers grow the ring on demand up to the substrate slot ceilings).

pub fn permits_producer(&self, active: usize) -> bool

May another producer attach, given active are registered?

pub fn permits_consumer(&self, active: usize) -> bool

May another consumer attach, given active are registered?

pub fn permits_capacity(&self, capacity: usize) -> bool

Is a ring of capacity slots legal under the contract?

pub fn permits_shape(&self, shape: RingShape) -> bool

Is shape legal under the ordering contract? Global total order is preserved only by the single-stream Spsc and the shared-sequence Vyukov; the partitioned per-producer-lane shapes (Mpsc, Mpmc) interleave producers, so both are illegal under a Fifo contract. Every other contract permits every shape (FifoPerProducer is exactly what the lanes deliver).

pub fn permits_config(&self, shape: RingShape, capacity: usize) -> bool

Feasible-region oracle for an adaptive policy: is a candidate (shape, capacity) configuration legal? A policy filters every move it proposes through this, so an aggressive auto-morph cannot violate the declared envelope.

Trait Implementations

impl Clone for RingContract

fn clone(&self) -> RingContract

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for RingContract

impl Debug for RingContract

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

Formats the value using the given formatter.

impl Eq for RingContract

impl PartialEq for RingContract

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for RingContract