pub struct Write<V, P = BTreeSet<WriteId>> {
pub id: WriteId,
pub timestamp: Timestamp,
pub had_read: P,
pub changes: BTreeMap<RowId, Change<V>>,
}Expand description
A decoded write’s merge inputs, independent of its storage encoding.
Fields§
§id: WriteIdDevice and original write number.
timestamp: TimestampUnique total-order timestamp (§7.2).
had_read: PThe writes in the author’s read_through prefix and its own earlier
writes (§7.1). Consuming a write does not imply retaining its row changes.
The sequence resolves this relation from the prefix and own predecessors.
changes: BTreeMap<RowId, Change<V>>At most one change for each table, key and audience.
Implementations§
Trait Implementations§
impl<V: Eq, P: Eq> Eq for Write<V, P>
impl<V, P> StructuralPartialEq for Write<V, P>
Auto Trait Implementations§
impl<V, P> Freeze for Write<V, P>where
P: Freeze,
impl<V, P> RefUnwindSafe for Write<V, P>where
P: RefUnwindSafe,
V: RefUnwindSafe,
impl<V, P> Send for Write<V, P>
impl<V, P> Sync for Write<V, P>
impl<V, P> Unpin for Write<V, P>where
P: Unpin,
impl<V, P> UnsafeUnpin for Write<V, P>where
P: UnsafeUnpin,
impl<V, P> UnwindSafe for Write<V, P>where
P: UnwindSafe,
V: RefUnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more