Struct QuicAssociationAdmission
pub struct QuicAssociationAdmission(/* private fields */);Available on crate features
quic and std only.Expand description
Admission shared, by cloning, by every producer and listener of one policy domain.
Implementations§
§impl QuicAssociationAdmission
impl QuicAssociationAdmission
pub fn try_new(
limits: AssociationLimits,
) -> Result<QuicAssociationAdmission, AdmissionError>
pub fn try_new( limits: AssociationLimits, ) -> Result<QuicAssociationAdmission, AdmissionError>
Admission under limits, which must not let one source exhaust them.
pub fn try_acquire(
&self,
key: AssociationKey,
) -> Result<AssociationPermit, AdmissionError>
pub fn try_acquire( &self, key: AssociationKey, ) -> Result<AssociationPermit, AdmissionError>
Admit the association at key, held until the permit is dropped. IPv4-mapped IPv6
addresses count as their IPv4 form.
pub fn record_dropped_datagrams(&self, count: u64)
pub fn record_dropped_datagrams(&self, count: u64)
Count datagrams a producer dropped instead of queueing them for an association.
pub fn stats(&self) -> AdmissionStats
pub fn stats(&self) -> AdmissionStats
What was refused and rejected so far.
Trait Implementations§
§impl Clone for QuicAssociationAdmission
impl Clone for QuicAssociationAdmission
§fn clone(&self) -> QuicAssociationAdmission
fn clone(&self) -> QuicAssociationAdmission
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl !RefUnwindSafe for QuicAssociationAdmission
impl !UnwindSafe for QuicAssociationAdmission
impl Freeze for QuicAssociationAdmission
impl Send for QuicAssociationAdmission
impl Sync for QuicAssociationAdmission
impl Unpin for QuicAssociationAdmission
impl UnsafeUnpin for QuicAssociationAdmission
Blanket Implementations§
§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
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<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> ⓘ
§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§impl<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
Wrap the input message
T in a rama_grpc::Request§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
§fn and<P, B, E>(self, other: P) -> And<T, P>
fn and<P, B, E>(self, other: P) -> And<T, P>
Create a new
Policy that returns Action::Follow only if self and other return
Action::Follow. Read more