Enum holochain::prelude::dependencies::kitsune_p2p_types::dht_arc::DhtArcSet
source · pub enum DhtArcSet {
Full,
Partial(IntervalSet<DhtLocation>),
}
Variants§
Full
Full coverage.
This needs a special representation because the underlying IntervalSet
implementation excludes u32::MAX
from its set of valid bounds
Partial(IntervalSet<DhtLocation>)
Any coverage other than full, including empty
Implementations§
source§impl DhtArcSet
impl DhtArcSet
pub fn new_empty() -> DhtArcSet
pub fn new_full() -> DhtArcSet
pub fn normalized(self) -> DhtArcSet
pub fn from_bounds(start: DhtLocation, end: DhtLocation) -> DhtArcSet
pub fn from_interval<A>(arc: A) -> DhtArcSetwhere
A: Borrow<DhtArcRange>,
pub fn intervals(&self) -> Vec<DhtArcRange>
pub fn is_empty(&self) -> bool
pub fn contains(&self, t: DhtLocation) -> bool
sourcepub fn overlap(&self, other: &DhtArcSet) -> bool
pub fn overlap(&self, other: &DhtArcSet) -> bool
Cheap check if the two sets have a non-null intersection
pub fn union(&self, other: &DhtArcSet) -> DhtArcSet
pub fn intersection(&self, other: &DhtArcSet) -> DhtArcSet
pub fn size(&self) -> u32
pub fn print_arcs(&self, len: usize)
Trait Implementations§
source§impl From<&[DhtArcRange]> for DhtArcSet
impl From<&[DhtArcRange]> for DhtArcSet
source§fn from(arcs: &[DhtArcRange]) -> DhtArcSet
fn from(arcs: &[DhtArcRange]) -> DhtArcSet
Converts to this type from the input type.
source§impl From<&DhtArcRange> for DhtArcSet
impl From<&DhtArcRange> for DhtArcSet
source§fn from(arc: &DhtArcRange) -> DhtArcSet
fn from(arc: &DhtArcRange) -> DhtArcSet
Converts to this type from the input type.
source§impl From<DhtArcRange> for DhtArcSet
impl From<DhtArcRange> for DhtArcSet
source§fn from(arc: DhtArcRange) -> DhtArcSet
fn from(arc: DhtArcRange) -> DhtArcSet
Converts to this type from the input type.
source§impl From<Vec<(DhtLocation, DhtLocation)>> for DhtArcSet
impl From<Vec<(DhtLocation, DhtLocation)>> for DhtArcSet
source§fn from(pairs: Vec<(DhtLocation, DhtLocation)>) -> DhtArcSet
fn from(pairs: Vec<(DhtLocation, DhtLocation)>) -> DhtArcSet
Converts to this type from the input type.
source§impl PartialEq for DhtArcSet
impl PartialEq for DhtArcSet
impl Eq for DhtArcSet
impl StructuralPartialEq for DhtArcSet
Auto Trait Implementations§
impl RefUnwindSafe for DhtArcSet
impl Send for DhtArcSet
impl Sync for DhtArcSet
impl Unpin for DhtArcSet
impl UnwindSafe for DhtArcSet
Blanket Implementations§
source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
source§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.
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> CallHasher for T
impl<T> CallHasher for T
source§impl<F, W, T, D> Deserialize<With<T, W>, D> for F
impl<F, W, T, D> Deserialize<With<T, W>, D> for F
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.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.source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§impl<T> FutureExt for T
impl<T> FutureExt for T
source§fn with_context(self, otel_cx: Context) -> WithContext<Self> ⓘ
fn with_context(self, otel_cx: Context) -> WithContext<Self> ⓘ
source§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> ⓘ
source§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
source§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
Gets the layout of the type.
source§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
source§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 moresource§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).source§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.source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.source§impl<T> Upcastable for T
impl<T> Upcastable for T
source§fn upcast_any_ref(&self) -> &(dyn Any + 'static)
fn upcast_any_ref(&self) -> &(dyn Any + 'static)
upcast ref
source§fn upcast_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn upcast_any_mut(&mut self) -> &mut (dyn Any + 'static)
upcast mut ref