Struct SharedEntry 

pub struct SharedEntry {
    pub revision: u64,
    pub value: Value,
    pub writers: BTreeSet<SharedWriter>,
}

One value one writer published into a shared resource.

Fields

revision: u64

How many writes to this key have been accepted. A per-key revision is the only one that can be stored beside a value without making arrival order observable: a resource-wide write index stored per key would differ between two runs that accepted the same contributions in a different order, even though every value and every merge was identical.

value: Value

writers: BTreeSet<SharedWriter>

The effects the stored value is made of. A scalar value has exactly the writer that put it there; an accumulated collection has every member that contributed to it, because no single one of them owns the merged value and naming the last arrival would make the provenance depend on completion order. A key with no writer was declared by the run itself.

Trait Implementations

impl Clone for SharedEntry

fn clone(&self) -> SharedEntry

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SharedEntry

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for SharedEntry

fn deserialize<__D>( __deserializer: __D, ) -> Result<SharedEntry, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for SharedEntry

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for SharedEntry

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for SharedEntry