pub struct SubspaceId(/* private fields */);Expand description
The type of SubspaceIds used by Willow’25.
This is a thin wrapper around [u8; SUBSPACE_ID_WIDTH].
use willow25::prelude::*;
let subspace_id = SubspaceId::from([17; SUBSPACE_ID_WIDTH]);
assert_eq!(subspace_id.as_bytes(), &[17; 32]);Implementations§
Trait Implementations§
Source§impl Clone for SubspaceId
impl Clone for SubspaceId
Source§fn clone(&self) -> SubspaceId
fn clone(&self) -> SubspaceId
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Coordinatelike<MCL, MCC, MPL, SubspaceId> for (Path, SubspaceId, Timestamp)
impl Coordinatelike<MCL, MCC, MPL, SubspaceId> for (Path, SubspaceId, Timestamp)
Source§fn wdm_timestamp(&self) -> Timestamp
fn wdm_timestamp(&self) -> Timestamp
Returns the timestamp of
self.Source§impl Coordinatelike<MCL, MCC, MPL, SubspaceId> for (Path, Timestamp, SubspaceId)
impl Coordinatelike<MCL, MCC, MPL, SubspaceId> for (Path, Timestamp, SubspaceId)
Source§fn wdm_timestamp(&self) -> Timestamp
fn wdm_timestamp(&self) -> Timestamp
Returns the timestamp of
self.Source§impl Coordinatelike<MCL, MCC, MPL, SubspaceId> for (SubspaceId, Path, Timestamp)
impl Coordinatelike<MCL, MCC, MPL, SubspaceId> for (SubspaceId, Path, Timestamp)
Source§fn wdm_timestamp(&self) -> Timestamp
fn wdm_timestamp(&self) -> Timestamp
Returns the timestamp of
self.Source§impl Coordinatelike<MCL, MCC, MPL, SubspaceId> for (SubspaceId, Timestamp, Path)
impl Coordinatelike<MCL, MCC, MPL, SubspaceId> for (SubspaceId, Timestamp, Path)
Source§fn wdm_timestamp(&self) -> Timestamp
fn wdm_timestamp(&self) -> Timestamp
Returns the timestamp of
self.Source§impl Coordinatelike<MCL, MCC, MPL, SubspaceId> for (Timestamp, Path, SubspaceId)
impl Coordinatelike<MCL, MCC, MPL, SubspaceId> for (Timestamp, Path, SubspaceId)
Source§fn wdm_timestamp(&self) -> Timestamp
fn wdm_timestamp(&self) -> Timestamp
Returns the timestamp of
self.Source§impl Coordinatelike<MCL, MCC, MPL, SubspaceId> for (Timestamp, SubspaceId, Path)
impl Coordinatelike<MCL, MCC, MPL, SubspaceId> for (Timestamp, SubspaceId, Path)
Source§fn wdm_timestamp(&self) -> Timestamp
fn wdm_timestamp(&self) -> Timestamp
Returns the timestamp of
self.Source§impl Coordinatelike<MCL, MCC, MPL, SubspaceId> for Entry
impl Coordinatelike<MCL, MCC, MPL, SubspaceId> for Entry
Source§fn wdm_timestamp(&self) -> Timestamp
fn wdm_timestamp(&self) -> Timestamp
Returns the timestamp of
self.Source§impl Debug for SubspaceId
impl Debug for SubspaceId
Source§impl Entrylike<MCL, MCC, MPL, NamespaceId, SubspaceId, PayloadDigest> for Entry
impl Entrylike<MCL, MCC, MPL, NamespaceId, SubspaceId, PayloadDigest> for Entry
Source§fn wdm_namespace_id(&self) -> &NamespaceId
fn wdm_namespace_id(&self) -> &NamespaceId
Returns the namespace_id of
self.Source§fn wdm_payload_length(&self) -> u64
fn wdm_payload_length(&self) -> u64
Returns the payload_length of
self.Source§fn wdm_payload_digest(&self) -> &PayloadDigest
fn wdm_payload_digest(&self) -> &PayloadDigest
Returns the payload_digest of
self.Source§impl<'a> From<&'a SubspaceId> for &'a [u8; 32]
impl<'a> From<&'a SubspaceId> for &'a [u8; 32]
Source§fn from(value: &'a SubspaceId) -> Self
fn from(value: &'a SubspaceId) -> Self
Converts to this type from the input type.
Source§impl<'a> From<&'a mut SubspaceId> for &'a mut [u8; 32]
impl<'a> From<&'a mut SubspaceId> for &'a mut [u8; 32]
Source§fn from(value: &'a mut SubspaceId) -> Self
fn from(value: &'a mut SubspaceId) -> Self
Converts to this type from the input type.
Source§impl From<SubspaceId> for [u8; 32]
impl From<SubspaceId> for [u8; 32]
Source§fn from(value: SubspaceId) -> Self
fn from(value: SubspaceId) -> Self
Converts to this type from the input type.
Source§impl GreatestElement for SubspaceId
impl GreatestElement for SubspaceId
Source§impl Hash for SubspaceId
impl Hash for SubspaceId
Source§impl Keylike<MCL, MCC, MPL, SubspaceId> for (Path, SubspaceId)
impl Keylike<MCL, MCC, MPL, SubspaceId> for (Path, SubspaceId)
Source§fn wdm_subspace_id(&self) -> &SubspaceId
fn wdm_subspace_id(&self) -> &SubspaceId
Returns the subspace_id of
self.Source§impl Keylike<MCL, MCC, MPL, SubspaceId> for (Path, SubspaceId, Timestamp)
impl Keylike<MCL, MCC, MPL, SubspaceId> for (Path, SubspaceId, Timestamp)
Source§fn wdm_subspace_id(&self) -> &SubspaceId
fn wdm_subspace_id(&self) -> &SubspaceId
Returns the subspace_id of
self.Source§impl Keylike<MCL, MCC, MPL, SubspaceId> for (Path, Timestamp, SubspaceId)
impl Keylike<MCL, MCC, MPL, SubspaceId> for (Path, Timestamp, SubspaceId)
Source§fn wdm_subspace_id(&self) -> &SubspaceId
fn wdm_subspace_id(&self) -> &SubspaceId
Returns the subspace_id of
self.Source§impl Keylike<MCL, MCC, MPL, SubspaceId> for (SubspaceId, Path)
impl Keylike<MCL, MCC, MPL, SubspaceId> for (SubspaceId, Path)
Source§fn wdm_subspace_id(&self) -> &SubspaceId
fn wdm_subspace_id(&self) -> &SubspaceId
Returns the subspace_id of
self.Source§impl Keylike<MCL, MCC, MPL, SubspaceId> for (SubspaceId, Path, Timestamp)
impl Keylike<MCL, MCC, MPL, SubspaceId> for (SubspaceId, Path, Timestamp)
Source§fn wdm_subspace_id(&self) -> &SubspaceId
fn wdm_subspace_id(&self) -> &SubspaceId
Returns the subspace_id of
self.Source§impl Keylike<MCL, MCC, MPL, SubspaceId> for (SubspaceId, Timestamp, Path)
impl Keylike<MCL, MCC, MPL, SubspaceId> for (SubspaceId, Timestamp, Path)
Source§fn wdm_subspace_id(&self) -> &SubspaceId
fn wdm_subspace_id(&self) -> &SubspaceId
Returns the subspace_id of
self.Source§impl Keylike<MCL, MCC, MPL, SubspaceId> for (Timestamp, Path, SubspaceId)
impl Keylike<MCL, MCC, MPL, SubspaceId> for (Timestamp, Path, SubspaceId)
Source§fn wdm_subspace_id(&self) -> &SubspaceId
fn wdm_subspace_id(&self) -> &SubspaceId
Returns the subspace_id of
self.Source§impl Keylike<MCL, MCC, MPL, SubspaceId> for (Timestamp, SubspaceId, Path)
impl Keylike<MCL, MCC, MPL, SubspaceId> for (Timestamp, SubspaceId, Path)
Source§fn wdm_subspace_id(&self) -> &SubspaceId
fn wdm_subspace_id(&self) -> &SubspaceId
Returns the subspace_id of
self.Source§impl Keylike<MCL, MCC, MPL, SubspaceId> for Entry
impl Keylike<MCL, MCC, MPL, SubspaceId> for Entry
Source§fn wdm_subspace_id(&self) -> &SubspaceId
fn wdm_subspace_id(&self) -> &SubspaceId
Returns the subspace_id of
self.Source§impl LeastElement for SubspaceId
impl LeastElement for SubspaceId
Source§impl LowerSemilattice for SubspaceId
impl LowerSemilattice for SubspaceId
Source§fn greatest_lower_bound(&self, other: &Self) -> Self
fn greatest_lower_bound(&self, other: &Self) -> Self
Returns the greatest lower bound of
self and other, i.e., the unique greatest element in the type which is less than or equal to both self and other.Source§impl Ord for SubspaceId
impl Ord for SubspaceId
Source§fn cmp(&self, other: &SubspaceId) -> Ordering
fn cmp(&self, other: &SubspaceId) -> Ordering
1.21.0 · 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 PartialEq for SubspaceId
impl PartialEq for SubspaceId
Source§impl PartialOrd for SubspaceId
impl PartialOrd for SubspaceId
Source§impl RangeBounds<SubspaceId> for Area
impl RangeBounds<SubspaceId> for Area
Source§impl RangeBounds<SubspaceId> for Range3d
impl RangeBounds<SubspaceId> for Range3d
Source§impl TryPredecessor for SubspaceId
impl TryPredecessor for SubspaceId
Source§fn try_predecessor(&self) -> Option<Self>
fn try_predecessor(&self) -> Option<Self>
If
self has a predecessor, i.e., a unique greatest value which is strictly less than self, returns it. If there is no unique predecessor, returns None.Source§fn is_predecessor_of(&self, other: &Self) -> bool
fn is_predecessor_of(&self, other: &Self) -> bool
Returns
true iff self is the predecessor of other.Source§fn is_not_predecessor_of(&self, other: &Self) -> bool
fn is_not_predecessor_of(&self, other: &Self) -> bool
Returns
true iff self is not the predecessor of other.Source§impl TrySuccessor for SubspaceId
impl TrySuccessor for SubspaceId
Source§fn try_successor(&self) -> Option<Self>
fn try_successor(&self) -> Option<Self>
If
self has a successor, i.e., a unique least value which is strictly greater than self, returns it. If there is no unique successor, returns None.Source§fn is_successor_of(&self, other: &Self) -> bool
fn is_successor_of(&self, other: &Self) -> bool
Returns
true iff self is the successor of other.Source§fn is_not_successor_of(&self, other: &Self) -> bool
fn is_not_successor_of(&self, other: &Self) -> bool
Returns
true iff self is not the successor of other.Source§impl UpperSemilattice for SubspaceId
impl UpperSemilattice for SubspaceId
Source§fn least_upper_bound(&self, other: &Self) -> Self
fn least_upper_bound(&self, other: &Self) -> Self
Returns the least upper bound of
self and other, i.e., the unique least element in the type which is greater than or equal to both self and other.impl Eq for SubspaceId
impl PredecessorExceptForLeast for SubspaceId
impl StructuralPartialEq for SubspaceId
impl SuccessorExceptForGreatest for SubspaceId
Auto Trait Implementations§
impl Freeze for SubspaceId
impl RefUnwindSafe for SubspaceId
impl Send for SubspaceId
impl Sync for SubspaceId
impl Unpin for SubspaceId
impl UnwindSafe for SubspaceId
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> BoundedLowerSemilattice for Twhere
T: LowerSemilattice + LeastElement,
impl<T> BoundedLowerSemilattice for Twhere
T: LowerSemilattice + LeastElement,
Source§fn greatest_lower_bound_slice(values: &[Self]) -> Self
fn greatest_lower_bound_slice(values: &[Self]) -> Self
Computes the greatest lower bound of all values in the slice. For the empty slice, this is the least element.
Source§impl<T> BoundedUpperSemilattice for Twhere
T: UpperSemilattice + GreatestElement,
impl<T> BoundedUpperSemilattice for Twhere
T: UpperSemilattice + GreatestElement,
Source§fn least_upper_bound_slice(values: &[Self]) -> Self
fn least_upper_bound_slice(values: &[Self]) -> Self
Computes the least upper bound of all values in the slice. For the empty slice, this is the greatest element.