pub struct SplitId(/* private fields */);Expand description
Deterministic identity of one split, minted by the planner.
Stable across replans of unchanged work — the property that makes
replanning idempotent (create-if-absent in the store) and progress
resumable across owners. Validated at construction so key-encoding
problems surface as Fatal here, not
as opaque backend write failures: 1–128 bytes of [A-Za-z0-9_-]
(. is reserved as the store’s key-hierarchy separator).
Implementations§
Trait Implementations§
impl Eq for SplitId
Source§impl Ord for SplitId
impl Ord for SplitId
1.21.0 (const: unstable) · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
Source§impl PartialOrd for SplitId
impl PartialOrd for SplitId
impl StructuralPartialEq for SplitId
Auto Trait Implementations§
impl Freeze for SplitId
impl RefUnwindSafe for SplitId
impl Send for SplitId
impl Sync for SplitId
impl Unpin for SplitId
impl UnsafeUnpin for SplitId
impl UnwindSafe for SplitId
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.