#[repr(C, align(16))]pub struct TopologicalDeltaEntry {
pub source_vertex: u32,
pub target_vertex: u32,
pub edge_anchor_idx: u32,
pub op_domain_and_slot: u16,
pub seq_no: u16,
}Expand description
16-byte cache-aligned delta entry scoped to a specific graph_slot ($0 \dots M$)
inside the host PoetGeometry.
Fields§
§source_vertex: u32§target_vertex: u32§edge_anchor_idx: u32Backing NQuin slot index or host Geometry $k$-cell index.
op_domain_and_slot: u16[0..3]: DeltaOpKind (Tombstone=0, Insert=1, Reify=2, AnchorBind=3)
[4..7]: AnchorDomain nibble (0..=4 or 0xF for SemanticQuin)
[8..15]: Harboured graph slot index m in 0..harboured_graph_count
seq_no: u16Monotonic sequence number within the open edit session.
Implementations§
Source§impl TopologicalDeltaEntry
impl TopologicalDeltaEntry
pub const fn pack_op_domain_slot( op: DeltaOpKind, domain: AnchorDomain, graph_slot: u8, ) -> u16
pub const fn new_insert( graph_slot: u8, source_vertex: u32, target_vertex: u32, edge_anchor_idx: u32, seq_no: u16, ) -> Self
pub const fn new_tombstone( graph_slot: u8, source_vertex: u32, target_vertex: u32, seq_no: u16, ) -> Self
pub const fn new_reify( graph_slot: u8, source_vertex: u32, target_vertex: u32, edge_anchor_idx: u32, seq_no: u16, ) -> Self
pub const fn new_anchor_bind( graph_slot: u8, vertex: u32, cell_index: u32, domain: AnchorDomain, seq_no: u16, ) -> Self
pub const fn op_kind(&self) -> DeltaOpKind
pub const fn graph_slot(&self) -> u8
pub const fn anchor_domain(&self) -> AnchorDomain
Trait Implementations§
Source§impl Clone for TopologicalDeltaEntry
impl Clone for TopologicalDeltaEntry
impl Copy for TopologicalDeltaEntry
Source§impl Debug for TopologicalDeltaEntry
impl Debug for TopologicalDeltaEntry
Source§impl Default for TopologicalDeltaEntry
impl Default for TopologicalDeltaEntry
Source§impl<'de> Deserialize<'de> for TopologicalDeltaEntry
impl<'de> Deserialize<'de> for TopologicalDeltaEntry
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl Eq for TopologicalDeltaEntry
Source§impl PartialEq for TopologicalDeltaEntry
impl PartialEq for TopologicalDeltaEntry
impl Pod for TopologicalDeltaEntry
Source§impl Serialize for TopologicalDeltaEntry
impl Serialize for TopologicalDeltaEntry
impl StructuralPartialEq for TopologicalDeltaEntry
Auto Trait Implementations§
impl Freeze for TopologicalDeltaEntry
impl RefUnwindSafe for TopologicalDeltaEntry
impl Send for TopologicalDeltaEntry
impl Sync for TopologicalDeltaEntry
impl Unpin for TopologicalDeltaEntry
impl UnsafeUnpin for TopologicalDeltaEntry
impl UnwindSafe for TopologicalDeltaEntry
Blanket Implementations§
§impl<S, A> Aggregate<Result<S, Error>> for Awhere
A: Aggregate<S>,
impl<S, A> Aggregate<Result<S, Error>> for Awhere
A: Aggregate<S>,
Aggregate shares in an MPC protocol.
impl<T> AnyBitPattern for Twhere
T: Pod,
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
§impl<T> CheckedBitPattern for Twhere
T: AnyBitPattern,
impl<T> CheckedBitPattern for Twhere
T: AnyBitPattern,
§type Bits = T
type Bits = T
Self must have the same layout as the specified Bits except for
the possible invalid bit patterns being checked during
is_valid_bit_pattern.§fn is_valid_bit_pattern(_bits: &T) -> bool
fn is_valid_bit_pattern(_bits: &T) -> bool
If this function returns true, then it must be valid to reinterpret
bits
as &Self.Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
§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
§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
Compare self to
key and return true if they are equal.§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
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
impl<T> Interleave for Twhere
T: Pod,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreimpl<T> NoUninit for Twhere
T: Pod,
§impl<T> NoneValue for Twhere
T: Default,
impl<T> NoneValue for Twhere
T: Default,
type NoneType = T
§fn null_value() -> T
fn null_value() -> T
The none-equivalent value.