Struct LayerSet 

pub struct LayerSet(/* private fields */);

Which layers of view-state a carrier moves. Layers degrade, never block: a carrier moves donor.donates() & receiver.receives(), and any layer outside that intersection is simply dropped.

Implementations

impl LayerSet

pub const NAV: Self

pub const FORM: Self

pub const SESSION: Self

pub const DOM: Self

pub const VISUAL: Self

pub const fn empty() -> Self

The empty set.

pub const fn all() -> Self

Every layer.

pub const fn contains(self, other: Self) -> bool

Does this set contain every layer in other?

pub const fn intersect(self, other: Self) -> Self

Layers in both sets — what a (donor, receiver) pair can actually carry.

pub const fn union(self, other: Self) -> Self

Layers in either set. The const companion to intersect, for building a fixed layer set (e.g. an adapter’s RECEIVES) in a const.

pub const fn is_empty(self) -> bool

Is the set empty?

Trait Implementations

impl BitOr for LayerSet

type Output = LayerSet

The resulting type after applying the | operator.

fn bitor(self, rhs: Self) -> Self

Performs the | operation.

impl Clone for LayerSet

fn clone(&self) -> LayerSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for LayerSet

impl Debug for LayerSet

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

Formats the value using the given formatter.

impl Default for LayerSet

fn default() -> LayerSet

Returns the “default value” for a type.

impl Eq for LayerSet

impl PartialEq for LayerSet

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for LayerSet