Enum stateright::actor::Network

pub enum Network<Msg>where
    Msg: Eq + Hash,{
    UnorderedDuplicating(HashableHashSet<Envelope<Msg>>),
    UnorderedNonDuplicating(HashableHashMap<Envelope<Msg>, usize>),
    Ordered(BTreeMap<(Id, Id), VecDeque<Msg>>),
}

Represents a network of messages.

Variants

UnorderedDuplicating(HashableHashSet<Envelope<Msg>>)

Indicates that messages have no ordering (racing one another), and can be redelivered.

UnorderedNonDuplicating(HashableHashMap<Envelope<Msg>, usize>)

Indicates that messages have no ordering (racing one another), and will not be redelivered.

Ordered(BTreeMap<(Id, Id), VecDeque<Msg>>)

Indicates that directed message flows between pairs of actors are ordered. Does not indicate any ordering across different flows. Each direction for a pair of actors is a different flow.

See Also

The ordered_reliable_link module partially implements this contract as long as actors do not restart. A later version of the module and checker will account for actor restarts.

Implementations

impl<Msg> Network<Msg>where Msg: Eq + Hash,

pub fn new_ordered(envelopes: impl IntoIterator<Item = Envelope<Msg>>) -> Self

Indicates that directed message flows between pairs of actors are ordered. Does not indicate any ordering across different flows. Each direction for a pair of actors is a different flow.

See Also

The ordered_reliable_link module partially implements this contract as long as actors do not restart. A later version of the module and checker will account for actor restarts.

pub fn new_unordered_duplicating( envelopes: impl IntoIterator<Item = Envelope<Msg>> ) -> Self

Indicates that messages have no ordering (racing one another), and can be redelivered.

See also: Self::new_unordered_nonduplicating

pub fn new_unordered_nonduplicating( envelopes: impl IntoIterator<Item = Envelope<Msg>> ) -> Self

Indicates that messages have no ordering (racing one another), and will not be redelivered.

See also: Self::new_unordered_duplicating

pub fn names() -> Vec<&'static str>

Returns a vector of names that can be parsed using FromStr.

pub fn iter_all(&self) -> NetworkIter<'_, Msg>

Returns an iterator over all envelopes in the network.

pub fn iter_deliverable(&self) -> NetworkDeliverableIter<'_, Msg>

Returns an iterator over all distinct deliverable envelopes in the network.

pub fn len(&self) -> usize

Returns the number of messages in the network.

Trait Implementations

impl<Msg> Clone for Network<Msg>where Msg: Eq + Hash + Clone,

fn clone(&self) -> Network<Msg>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<Msg> Debug for Network<Msg>where Msg: Eq + Hash + Debug,

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

Formats the value using the given formatter.

impl<Msg> FromStr for Network<Msg>where Msg: Eq + Hash,

type Err = String

The associated error which can be returned from parsing.

fn from_str(s: &str) -> Result<Self, Self::Err>

Parses a string s to return a value of this type.

impl<Msg> Hash for Network<Msg>where Msg: Eq + Hash + Hash,

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<Msg> Ord for Network<Msg>where Msg: Eq + Hash + Ord,

fn cmp(&self, other: &Network<Msg>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl<Msg> PartialEq<Network<Msg>> for Network<Msg>where Msg: Eq + Hash + PartialEq,

fn eq(&self, other: &Network<Msg>) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

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

impl<Msg> PartialOrd<Network<Msg>> for Network<Msg>where Msg: Eq + Hash + PartialOrd,

fn partial_cmp(&self, other: &Network<Msg>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<Msg> Rewrite<Id> for Network<Msg>where Msg: Eq + Hash + Rewrite<Id>,

fn rewrite<S>(&self, plan: &RewritePlan<Id, S>) -> Self

Generates a corresponding instance with values revised based on a particular RewritePlan.

impl<Msg> Serialize for Network<Msg>where Msg: Eq + Hash + Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<Msg> Eq for Network<Msg>where Msg: Eq + Hash + Eq,

impl<Msg> StructuralEq for Network<Msg>where Msg: Eq + Hash,

impl<Msg> StructuralPartialEq for Network<Msg>where Msg: Eq + Hash,