pub enum RoutingOptions {
IntermediatePath(BoundedVec<NodeId, { RoutingOptions::MAX_INTERMEDIATE_HOPS }>),
Hops(BoundedSize<{ RoutingOptions::MAX_INTERMEDIATE_HOPS }>),
}Expand description
Represents routing options in a mixnet with a maximum number of hops.
Variants§
IntermediatePath(BoundedVec<NodeId, { RoutingOptions::MAX_INTERMEDIATE_HOPS }>)
A fixed intermediate path consisting of at most RoutingOptions::MAX_INTERMEDIATE_HOPS hops.
Hops(BoundedSize<{ RoutingOptions::MAX_INTERMEDIATE_HOPS }>)
Random intermediate path with at least the given number of hops,
but at most RoutingOptions::MAX_INTERMEDIATE_HOPS.
Implementations§
Source§impl RoutingOptions
impl RoutingOptions
Sourcepub const MAX_INTERMEDIATE_HOPS: usize = 3usize
pub const MAX_INTERMEDIATE_HOPS: usize = 3usize
The maximum number of hops this instance can represent.
Sourcepub fn invert(self) -> RoutingOptions
pub fn invert(self) -> RoutingOptions
Inverts the intermediate path if this is an instance of RoutingOptions::IntermediatePath.
Otherwise, does nothing.
Sourcepub fn count_hops(&self) -> usize
pub fn count_hops(&self) -> usize
Returns the number of hops this instance represents.
This value is guaranteed to be between 0 and RoutingOptions::MAX_INTERMEDIATE_HOPS.
Trait Implementations§
Source§impl Clone for RoutingOptions
impl Clone for RoutingOptions
Source§fn clone(&self) -> RoutingOptions
fn clone(&self) -> RoutingOptions
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 Debug for RoutingOptions
impl Debug for RoutingOptions
Source§impl<'de> Deserialize<'de> for RoutingOptions
impl<'de> Deserialize<'de> for RoutingOptions
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl PartialEq for RoutingOptions
impl PartialEq for RoutingOptions
Source§impl Serialize for RoutingOptions
impl Serialize for RoutingOptions
impl Eq for RoutingOptions
impl StructuralPartialEq for RoutingOptions
Auto Trait Implementations§
impl Freeze for RoutingOptions
impl RefUnwindSafe for RoutingOptions
impl Send for RoutingOptions
impl Sync for RoutingOptions
impl Unpin for RoutingOptions
impl UnwindSafe for RoutingOptions
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more