pub struct LoopId {
pub min_vertex: VertexId,
pub len: u32,
pub hash: u64,
}Expand description
A content fingerprint of a boundary loop, valid across edits and transactions for as long as the loop’s vertex sequence is unchanged.
Fields§
§min_vertex: VertexIdThe smallest vertex id on the loop.
len: u32The number of vertices on the loop.
hash: u64FNV-1a 64 over the little-endian bytes of the vertex ids in
BoundaryLoop::vertices order: for a closed loop, starting at
min_vertex; for an open chain, from its first end.
Trait Implementations§
impl Copy for LoopId
impl Eq for LoopId
impl StructuralPartialEq for LoopId
Auto Trait Implementations§
impl Freeze for LoopId
impl RefUnwindSafe for LoopId
impl Send for LoopId
impl Sync for LoopId
impl Unpin for LoopId
impl UnsafeUnpin for LoopId
impl UnwindSafe for LoopId
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