Struct holochain::prelude::dependencies::kitsune_p2p_types::dht::spacetime::Segment
Expand description
Any interval in space or time is represented by a node in a tree, so our way of describing intervals uses tree coordinates as well: The length of an interval is 2^(power), and the position of its left edge is at (offset * length).
Fields§
§power: u8
The exponent, where length = 2^power
offset: O
The offset from the origin, measured in number of lengths
Implementations§
§impl<O> Segment<O>where
O: Offset,
impl<O> Segment<O>where
O: Offset,
pub fn num_quanta(&self) -> u64
pub fn num_quanta(&self) -> u64
How many quanta does this segment cover?
pub fn absolute_length(&self, topo: &Topology) -> u64
pub fn absolute_length(&self, topo: &Topology) -> u64
The length, in absolute terms (Location or microseconds of time)
pub fn quantum_bounds(
&self,
topo: &Topology
) -> (<O as Offset>::Quantum, <O as Offset>::Quantum)
pub fn quantum_bounds(
&self,
topo: &Topology
) -> (<O as Offset>::Quantum, <O as Offset>::Quantum)
Get the quanta which bound this segment
pub fn contains_quantum(
&self,
topo: &Topology,
coord: <O as Offset>::Quantum
) -> bool
pub fn contains_quantum(
&self,
topo: &Topology,
coord: <O as Offset>::Quantum
) -> bool
The segment contains the given quantum coord
§impl Segment<SpaceOffset>
impl Segment<SpaceOffset>
pub fn loc_bounds(&self, topo: &Topology) -> (DhtLocation, DhtLocation)
pub fn loc_bounds(&self, topo: &Topology) -> (DhtLocation, DhtLocation)
Get the start and end bounds, in absolute Loc coordinates, for this segment
§impl Segment<TimeOffset>
impl Segment<TimeOffset>
pub fn timestamp_bounds(&self, topo: &Topology) -> (Timestamp, Timestamp)
pub fn timestamp_bounds(&self, topo: &Topology) -> (Timestamp, Timestamp)
Get the start and end bounds, in absolute Timestamp coordinates, for this segment
Trait Implementations§
§impl<'de, O> Deserialize<'de> for Segment<O>where
O: Offset + Deserialize<'de>,
impl<'de, O> Deserialize<'de> for Segment<O>where
O: Offset + Deserialize<'de>,
§fn deserialize<__D>(
__deserializer: __D
) -> Result<Segment<O>, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(
__deserializer: __D
) -> Result<Segment<O>, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
§impl<O> Ord for Segment<O>where
O: Ord + Offset,
impl<O> Ord for Segment<O>where
O: Ord + Offset,
§impl<O> PartialEq<Segment<O>> for Segment<O>where
O: PartialEq<O> + Offset,
impl<O> PartialEq<Segment<O>> for Segment<O>where
O: PartialEq<O> + Offset,
§impl<O> PartialOrd<Segment<O>> for Segment<O>where
O: PartialOrd<O> + Offset,
impl<O> PartialOrd<Segment<O>> for Segment<O>where
O: PartialOrd<O> + Offset,
§fn partial_cmp(&self, other: &Segment<O>) -> Option<Ordering>
fn partial_cmp(&self, other: &Segment<O>) -> Option<Ordering>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read more§impl<O> Serialize for Segment<O>where
O: Offset + Serialize,
impl<O> Serialize for Segment<O>where
O: Offset + Serialize,
§fn serialize<__S>(
&self,
__serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
fn serialize<__S>(
&self,
__serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
Serialize this value into the given Serde serializer. Read more
impl<O> Copy for Segment<O>where
O: Copy + Offset,
impl<O> Eq for Segment<O>where
O: Eq + Offset,
impl<O> StructuralEq for Segment<O>where
O: Offset,
impl<O> StructuralPartialEq for Segment<O>where
O: Offset,
Auto Trait Implementations§
impl<O> RefUnwindSafe for Segment<O>where
O: RefUnwindSafe,
impl<O> Send for Segment<O>where
O: Send,
impl<O> Sync for Segment<O>where
O: Sync,
impl<O> Unpin for Segment<O>where
O: Unpin,
impl<O> UnwindSafe for Segment<O>where
O: UnwindSafe,
Blanket Implementations§
§impl<T> Any for Twhere
T: Any + ?Sized,
impl<T> Any for Twhere
T: Any + ?Sized,
§fn type_id_compat(&self) -> TypeId
fn type_id_compat(&self) -> TypeId
TODO: once 1.33.0 is the minimum supported compiler version, remove
Any::type_id_compat and use StdAny::type_id instead.
https://github.com/rust-lang/rust/issues/27745
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata
) -> <T as Pointee>::Metadata
fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata
) -> <T as Pointee>::Metadata
Converts some archived metadata to the pointer metadata for itself.
§impl<F, W, T, D> Deserialize<With<T, W>, D> for Fwhere
W: DeserializeWith<F, T, D>,
D: Fallible + ?Sized,
F: ?Sized,
impl<F, W, T, D> Deserialize<With<T, W>, D> for Fwhere
W: DeserializeWith<F, T, D>,
D: Fallible + ?Sized,
F: ?Sized,
§fn deserialize(
&self,
deserializer: &mut D
) -> Result<With<T, W>, <D as Fallible>::Error>
fn deserialize(
&self,
deserializer: &mut D
) -> Result<With<T, W>, <D as Fallible>::Error>
Deserializes using the given deserializer
source§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§impl<T> FutureExt for T
impl<T> FutureExt for T
§fn with_context(self, otel_cx: Context) -> WithContext<Self> ⓘ
fn with_context(self, otel_cx: Context) -> WithContext<Self> ⓘ
§fn with_current_context(self) -> WithContext<Self> ⓘ
fn with_current_context(self) -> WithContext<Self> ⓘ
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.§impl<T> Upcastable for Twhere
T: 'static + Any + Send + Sync,
impl<T> Upcastable for Twhere
T: 'static + Any + Send + Sync,
§fn upcast_any_ref(&self) -> &(dyn Any + 'static)
fn upcast_any_ref(&self) -> &(dyn Any + 'static)
upcast ref
§fn upcast_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn upcast_any_mut(&mut self) -> &mut (dyn Any + 'static)
upcast mut ref