#[repr(C)]pub struct PathConstraint {
pub permitted_realms: u64,
pub min_profile: u8,
pub max_cost: u16,
pub deadline_ms: u32,
pub require_loop_free: bool,
pub max_energy_uj: u32,
}Expand description
Hard path constraints. Feasibility never trades for a cheaper advertisement.
Fields§
§permitted_realms: u64Bitmask of permitted realm ids 0..63. Zero means none permitted → Denied.
min_profile: u80=P0 .. 3=P3. Path/edge profile below this is Denied.
max_cost: u16Path/edge cost cap. u16::MAX means unlimited.
deadline_ms: u32Additive latency cap in milliseconds. 0 means no deadline.
require_loop_free: bool§max_energy_uj: u32Energy cap in microjoules. 0 means no energy bound is required.
Implementations§
Source§impl PathConstraint
impl PathConstraint
pub const UNRESTRICTED: Self
Trait Implementations§
Source§impl Clone for PathConstraint
impl Clone for PathConstraint
impl Copy for PathConstraint
Source§impl Debug for PathConstraint
impl Debug for PathConstraint
impl Eq for PathConstraint
Source§impl PartialEq for PathConstraint
impl PartialEq for PathConstraint
impl StructuralPartialEq for PathConstraint
Auto Trait Implementations§
impl Freeze for PathConstraint
impl RefUnwindSafe for PathConstraint
impl Send for PathConstraint
impl Sync for PathConstraint
impl Unpin for PathConstraint
impl UnsafeUnpin for PathConstraint
impl UnwindSafe for PathConstraint
Blanket Implementations§
§impl<S, A> Aggregate<Result<S, Error>> for Awhere
A: Aggregate<S>,
impl<S, A> Aggregate<Result<S, Error>> for Awhere
A: Aggregate<S>,
Aggregate shares in an MPC protocol.
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
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
Checks if this value is equivalent to the given key. Read more
§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> ⓘ
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