Struct Watermark
pub struct Watermark { /* private fields */ }Expand description
A per-store high-water mark: the last position this side has seen from each origin store it knows about.
A version vector rather than a scalar, and that is a constraint the port imposes rather than a convenience. A hub sees many logs and a spoke sees one; a scalar watermark can express the spoke and cannot express the hub, so a scalar would make hub-and-spoke a special case of peer-to-peer when the specification requires both to be first-class (SY-10).
Kept sorted by StoreId so that two watermarks compare and serialise
canonically.
Implementations§
§impl Watermark
impl Watermark
pub const fn new() -> Self
pub const fn new() -> Self
An empty watermark: nothing seen from anybody.
pub fn get(&self, store: StoreId) -> Option<SequencePosition>
pub fn get(&self, store: StoreId) -> Option<SequencePosition>
The last position seen from store, if any.
pub fn advance(&mut self, store: StoreId, position: SequencePosition)
pub fn advance(&mut self, store: StoreId, position: SequencePosition)
Raises the mark for store to position, if that is an advance.
Monotonic on purpose: a watermark that can go backwards turns a re-delivered batch into a replay of everything after it.
pub fn iter(&self) -> impl Iterator<Item = (StoreId, SequencePosition)> + '_
pub fn iter(&self) -> impl Iterator<Item = (StoreId, SequencePosition)> + '_
Every mark, ascending by StoreId.
Trait Implementations§
§impl<'de> Deserialize<'de> for Watermark
Re-canonicalises on the way in (WF-10): an unsorted sequence decodes sorted,
and two marks for one store keep the higher — the watermark
Watermark::advance would build from the same pairs.
impl<'de> Deserialize<'de> for Watermark
Re-canonicalises on the way in (WF-10): an unsorted sequence decodes sorted,
and two marks for one store keep the higher — the watermark
Watermark::advance would build from the same pairs.
Sorted once and folded in one pass, not advanced pair by pair: advance
inserts into a sorted vector, so a peer’s descending sequence would shift
every mark on every insert, quadratic in the length of input it chose.
A derive straight onto marks is the wrong implementation this replaces. It
would hand a peer’s unsorted vector to Watermark::get, whose binary
search then misses marks that are there, and the runner re-sends what the far
side already holds.
§fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error>
fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error>
impl Eq for Watermark
§impl Serialize for Watermark
On the wire, a sequence of (store, position) pairs in ascending store
order. Hand-written rather than derived, and only for decoding’s sake.
impl Serialize for Watermark
On the wire, a sequence of (store, position) pairs in ascending store
order. Hand-written rather than derived, and only for decoding’s sake.