Struct PrivateInterest 

pub struct PrivateInterest<const MCL: usize, const MCC: usize, const MPL: usize, N, S> { /* private fields */ }

Confidential data that relates to determining the AreaOfInterest that peers might be interested in synchronising.

Implementations

impl<const MCL: usize, const MCC: usize, const MPL: usize, N, S> PrivateInterest<MCL, MCC, MPL, N, S>

pub fn new( namespace_id: N, subspace_id: Option<S>, path: Path<MCL, MCC, MPL>, ) -> Self

Returns a new PrivateInterest with the gives attributes.

pub fn namespace(&self) -> &N

Returns the Namespace ID of this PrivateInterest.

pub fn subspace(&self) -> Option<&S>

Returns the specific SubspaceId of this PrivateInterest, if present. None denotes interest in all subspaces of the namespace.

pub fn path(&self) -> &Path<MCL, MCC, MPL>

Returns the path of this PrivateInterest.

impl<const MCL: usize, const MCC: usize, const MPL: usize, N: PartialEq, S: PartialEq + Clone> PrivateInterest<MCL, MCC, MPL, N, S>

pub fn is_more_specific(&self, other: &Self) -> bool

Returns true is this PrivateInterest is more specific than other.

pub fn is_disjoint(&self, other: &Self) -> bool

Returns true is this PrivateInterest is disjoint from other, namely that there is no Entry which can be included in both.

pub fn is_less_specific(&self, other: &Self) -> bool

Returns true is this PrivateInterest is less specific than other.

pub fn is_comparable(&self, other: &Self) -> bool

Returns true is this PrivateInterest is comparable to other.

pub fn are_awkward(&self, other: &Self) -> bool

Returns true if self and other are awkward, meaning they are neither comparable nor disjoint.

impl<const MCL: usize, const MCC: usize, const MPL: usize, N: PartialEq, S: PartialEq + Clone> PrivateInterest<MCL, MCC, MPL, N, S>

pub fn includes_entry<PD>(&self, entry: &Entry<MCL, MCC, MPL, N, S, PD>) -> bool

Returns true if the given Entry is included by self.

impl<const MCL: usize, const MCC: usize, const MPL: usize, N, S: PartialEq + Clone> PrivateInterest<MCL, MCC, MPL, N, S>

pub fn includes_area(&self, area: &Area<MCL, MCC, MPL, S>) -> bool

Returns true if the given Area in included by self.

pub fn is_related_to_area(&self, area: &Area<MCL, MCC, MPL, S>) -> bool

Returns true if the given Area is related to self, that is:

• the path of self and the path of the area are related, and
• either self.subspace() is None or self.subspace() == area.subspace().

impl<const MCL: usize, const MCC: usize, const MPL: usize, N, S: PartialEq> PrivateInterest<MCL, MCC, MPL, N, S>

pub fn almost_includes_area(&self, area: &Area<MCL, MCC, MPL, S>) -> bool

Returns true if self almost includes the given Area.

impl<const MCL: usize, const MCC: usize, const MPL: usize, N: Clone, S: Clone> PrivateInterest<MCL, MCC, MPL, N, S>

pub fn relax(&self) -> Self

Clones self, but replaces the subspace id with None.

Trait Implementations

impl<'arbitrary, const MCL: usize, const MCC: usize, const MPL: usize, N: Arbitrary<'arbitrary>, S: Arbitrary<'arbitrary>> Arbitrary<'arbitrary> for PrivateInterest<MCL, MCC, MPL, N, S>

fn arbitrary(u: &mut Unstructured<'arbitrary>) -> Result<Self>

Generate an arbitrary value of Self from the given unstructured data.

fn arbitrary_take_rest(u: Unstructured<'arbitrary>) -> Result<Self>

Generate an arbitrary value of Self from the entirety of the given unstructured data.

fn size_hint(depth: usize) -> (usize, Option<usize>)

Get a size hint for how many bytes out of an Unstructured this type needs to construct itself.

fn try_size_hint( depth: usize, ) -> Result<(usize, Option<usize>), MaxRecursionReached>

Get a size hint for how many bytes out of an Unstructured this type needs to construct itself.

impl<const MCL: usize, const MCC: usize, const MPL: usize, N: Clone, S: Clone> Clone for PrivateInterest<MCL, MCC, MPL, N, S>

fn clone(&self) -> PrivateInterest<MCL, MCC, MPL, N, S>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<const MCL: usize, const MCC: usize, const MPL: usize, N: Debug, S: Debug> Debug for PrivateInterest<MCL, MCC, MPL, N, S>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<const MCL: usize, const MCC: usize, const MPL: usize, N: Hash, S: Hash> Hash for PrivateInterest<MCL, MCC, MPL, N, S>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<const MCL: usize, const MCC: usize, const MPL: usize, N: Ord, S: Ord> Ord for PrivateInterest<MCL, MCC, MPL, N, S>

fn cmp(&self, other: &PrivateInterest<MCL, MCC, MPL, N, S>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<const MCL: usize, const MCC: usize, const MPL: usize, N: PartialEq, S: PartialEq> PartialEq for PrivateInterest<MCL, MCC, MPL, N, S>

fn eq(&self, other: &PrivateInterest<MCL, MCC, MPL, N, S>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<const MCL: usize, const MCC: usize, const MPL: usize, N: PartialOrd, S: PartialOrd> PartialOrd for PrivateInterest<MCL, MCC, MPL, N, S>

fn partial_cmp( &self, other: &PrivateInterest<MCL, MCC, MPL, N, S>, ) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<const MCL: usize, const MCC: usize, const MPL: usize, N: Eq, S: Eq> Eq for PrivateInterest<MCL, MCC, MPL, N, S>

impl<const MCL: usize, const MCC: usize, const MPL: usize, N, S> StructuralPartialEq for PrivateInterest<MCL, MCC, MPL, N, S>