Skip to main content

MultiplexPool

Struct MultiplexPool 

pub struct MultiplexPool<C, ID> { /* private fields */ }
Available on crate feature net only.
Expand description

Connection pool that multiplexes concurrent users over shared connections.

Implementations§

§

impl<C, ID> MultiplexPool<C, ID>

pub fn new() -> MultiplexPool<C, ID>

Create a MultiplexPool without limits: each connection serves as many concurrent users as its peer allows, and connections are added as needed.

pub fn maybe_with_max_streams_per_connection( self, max: Option<NonZero<usize>>, ) -> MultiplexPool<C, ID>

Serve at most this many concurrent users per connection, below what the connection’s MaxConcurrency allows. Unset, the peer decides.

pub fn maybe_set_max_streams_per_connection( &mut self, max: Option<NonZero<usize>>, ) -> &mut MultiplexPool<C, ID>

Serve at most this many concurrent users per connection, below what the connection’s MaxConcurrency allows. Unset, the peer decides.

pub fn with_max_streams_per_connection( self, max: NonZero<usize>, ) -> MultiplexPool<C, ID>

Serve at most this many concurrent users per connection, below what the connection’s MaxConcurrency allows. Unset, the peer decides.

pub fn set_max_streams_per_connection( &mut self, max: NonZero<usize>, ) -> &mut MultiplexPool<C, ID>

Serve at most this many concurrent users per connection, below what the connection’s MaxConcurrency allows. Unset, the peer decides.

pub fn without_max_streams_per_connection(self) -> MultiplexPool<C, ID>

Serve at most this many concurrent users per connection, below what the connection’s MaxConcurrency allows. Unset, the peer decides.

pub fn unset_max_streams_per_connection(&mut self) -> &mut MultiplexPool<C, ID>

Serve at most this many concurrent users per connection, below what the connection’s MaxConcurrency allows. Unset, the peer decides.

pub fn with_max_connections_total( self, max: NonZero<usize>, ) -> MultiplexPool<C, ID>

Keep at most max connections, stored or being established, across all ids, at most [Semaphore::MAX_PERMITS]. At the limit, SaturationPolicy decides. Without it, no limit.

Configure it before the pool is used: clones share its connections, and so the slots they hold. Waiting at the limit may use tokio timers (the default policy’s, the idle timeout’s): the runtime needs its time driver.

pub fn maybe_with_max_connections_total( self, max: Option<NonZero<usize>>, ) -> MultiplexPool<C, ID>

See Self::with_max_connections_total; None is no limit.

pub fn with_saturation_policy( self, policy: SaturationPolicy, ) -> MultiplexPool<C, ID>

What a checkout that needs a connection does at a limit, see Self::with_max_connections_total and Self::with_max_connections_per_id.

pub fn set_saturation_policy( &mut self, policy: SaturationPolicy, ) -> &mut MultiplexPool<C, ID>

What a checkout that needs a connection does at a limit, see Self::with_max_connections_total and Self::with_max_connections_per_id.

pub fn with_max_connections_per_id( self, max: NonZero<usize>, ) -> MultiplexPool<C, ID>

Keep at most max connections, stored or being established, per id (at most [Semaphore::MAX_PERMITS]): at the limit a checkout waits for its id’s capacity or, as SaturationPolicy allows, replaces one of the id’s idle connections; other ids go on. Without it, no limit.

Configure it before the pool is used: clones share the slots of each id. Waiting at the limit may use tokio timers (the default policy’s, the idle timeout’s): the runtime needs its time driver.

pub fn maybe_with_max_connections_per_id( self, max: Option<NonZero<usize>>, ) -> MultiplexPool<C, ID>

See Self::with_max_connections_per_id; None is no limit.

pub fn with_max_idle_per_id(self, max: NonZero<usize>) -> MultiplexPool<C, ID>

Keep at most max idle connections per id: once more go idle, the least recently used ones close. It never holds back a checkout, and nothing closes while checkouts wait. Without it, no limit.

Configure it before the pool is used: clones share their count.

pub fn maybe_with_max_idle_per_id( self, max: Option<NonZero<usize>>, ) -> MultiplexPool<C, ID>

See Self::with_max_idle_per_id; None is no limit.

pub fn with_max_idle_total(self, max: NonZero<usize>) -> MultiplexPool<C, ID>

Keep at most max idle connections across all ids, as Self::with_max_idle_per_id does per id.

pub fn maybe_with_max_idle_total( self, max: Option<NonZero<usize>>, ) -> MultiplexPool<C, ID>

See Self::with_max_idle_total; None is no limit.

pub fn maybe_with_idle_timeout( self, timeout: Option<Duration>, ) -> MultiplexPool<C, ID>

Drop connections that have been idle (no active streams) for longer than the given timeout. Only checked when a connection is requested, never by a scan of the pool: the connection a checkout is about to hand out is always checked, and checkouts of any id close the others about in the order they went idle, a few each once the first is due: one used again since it was last looked at may close up to a timeout late. A checkout waiting at a connection limit looks again once one would expire, on a tokio timer: the runtime needs its time driver enabled. Configure it before the pool is used: clones share their connections.

pub fn maybe_set_idle_timeout( &mut self, timeout: Option<Duration>, ) -> &mut MultiplexPool<C, ID>

Drop connections that have been idle (no active streams) for longer than the given timeout. Only checked when a connection is requested, never by a scan of the pool: the connection a checkout is about to hand out is always checked, and checkouts of any id close the others about in the order they went idle, a few each once the first is due: one used again since it was last looked at may close up to a timeout late. A checkout waiting at a connection limit looks again once one would expire, on a tokio timer: the runtime needs its time driver enabled. Configure it before the pool is used: clones share their connections.

pub fn with_idle_timeout(self, timeout: Duration) -> MultiplexPool<C, ID>

Drop connections that have been idle (no active streams) for longer than the given timeout. Only checked when a connection is requested, never by a scan of the pool: the connection a checkout is about to hand out is always checked, and checkouts of any id close the others about in the order they went idle, a few each once the first is due: one used again since it was last looked at may close up to a timeout late. A checkout waiting at a connection limit looks again once one would expire, on a tokio timer: the runtime needs its time driver enabled. Configure it before the pool is used: clones share their connections.

pub fn set_idle_timeout( &mut self, timeout: Duration, ) -> &mut MultiplexPool<C, ID>

Drop connections that have been idle (no active streams) for longer than the given timeout. Only checked when a connection is requested, never by a scan of the pool: the connection a checkout is about to hand out is always checked, and checkouts of any id close the others about in the order they went idle, a few each once the first is due: one used again since it was last looked at may close up to a timeout late. A checkout waiting at a connection limit looks again once one would expire, on a tokio timer: the runtime needs its time driver enabled. Configure it before the pool is used: clones share their connections.

pub fn without_idle_timeout(self) -> MultiplexPool<C, ID>

Drop connections that have been idle (no active streams) for longer than the given timeout. Only checked when a connection is requested, never by a scan of the pool: the connection a checkout is about to hand out is always checked, and checkouts of any id close the others about in the order they went idle, a few each once the first is due: one used again since it was last looked at may close up to a timeout late. A checkout waiting at a connection limit looks again once one would expire, on a tokio timer: the runtime needs its time driver enabled. Configure it before the pool is used: clones share their connections.

pub fn unset_idle_timeout(&mut self) -> &mut MultiplexPool<C, ID>

Drop connections that have been idle (no active streams) for longer than the given timeout. Only checked when a connection is requested, never by a scan of the pool: the connection a checkout is about to hand out is always checked, and checkouts of any id close the others about in the order they went idle, a few each once the first is due: one used again since it was last looked at may close up to a timeout late. A checkout waiting at a connection limit looks again once one would expire, on a tokio timer: the runtime needs its time driver enabled. Configure it before the pool is used: clones share their connections.

pub fn maybe_with_streams_hint( self, hint: Option<fn(&ID, &Extensions) -> Option<NonZero<usize>>>, ) -> MultiplexPool<C, ID>

Whether a request expects a connection to multiplex before the pool knows, so a burst on a new id waits for a few connects instead of each request dialing its own: the protocol is negotiated, so only a request can tell, such as one requiring a multiplexing protocol. The streams such a connection takes are what the pool’s multiplexed connections took last, the hint’s guess only if it saw none; once an id had a connection, what it took. It runs outside the pool’s locks.

pub fn maybe_set_streams_hint( &mut self, hint: Option<fn(&ID, &Extensions) -> Option<NonZero<usize>>>, ) -> &mut MultiplexPool<C, ID>

Whether a request expects a connection to multiplex before the pool knows, so a burst on a new id waits for a few connects instead of each request dialing its own: the protocol is negotiated, so only a request can tell, such as one requiring a multiplexing protocol. The streams such a connection takes are what the pool’s multiplexed connections took last, the hint’s guess only if it saw none; once an id had a connection, what it took. It runs outside the pool’s locks.

pub fn with_streams_hint( self, hint: fn(&ID, &Extensions) -> Option<NonZero<usize>>, ) -> MultiplexPool<C, ID>

Whether a request expects a connection to multiplex before the pool knows, so a burst on a new id waits for a few connects instead of each request dialing its own: the protocol is negotiated, so only a request can tell, such as one requiring a multiplexing protocol. The streams such a connection takes are what the pool’s multiplexed connections took last, the hint’s guess only if it saw none; once an id had a connection, what it took. It runs outside the pool’s locks.

pub fn set_streams_hint( &mut self, hint: fn(&ID, &Extensions) -> Option<NonZero<usize>>, ) -> &mut MultiplexPool<C, ID>

Whether a request expects a connection to multiplex before the pool knows, so a burst on a new id waits for a few connects instead of each request dialing its own: the protocol is negotiated, so only a request can tell, such as one requiring a multiplexing protocol. The streams such a connection takes are what the pool’s multiplexed connections took last, the hint’s guess only if it saw none; once an id had a connection, what it took. It runs outside the pool’s locks.

pub fn without_streams_hint(self) -> MultiplexPool<C, ID>

Whether a request expects a connection to multiplex before the pool knows, so a burst on a new id waits for a few connects instead of each request dialing its own: the protocol is negotiated, so only a request can tell, such as one requiring a multiplexing protocol. The streams such a connection takes are what the pool’s multiplexed connections took last, the hint’s guess only if it saw none; once an id had a connection, what it took. It runs outside the pool’s locks.

pub fn unset_streams_hint(&mut self) -> &mut MultiplexPool<C, ID>

Whether a request expects a connection to multiplex before the pool knows, so a burst on a new id waits for a few connects instead of each request dialing its own: the protocol is negotiated, so only a request can tell, such as one requiring a multiplexing protocol. The streams such a connection takes are what the pool’s multiplexed connections took last, the hint’s guess only if it saw none; once an id had a connection, what it took. It runs outside the pool’s locks.

pub fn maybe_with_max_wait_before_dial( self, wait: Option<Duration>, ) -> MultiplexPool<C, ID>

How long a checkout waits for connects in flight before it dials its own, if its limits let it. Unset, it waits for them until its caller’s deadline, if any (see Pool::get_conn).

pub fn maybe_set_max_wait_before_dial( &mut self, wait: Option<Duration>, ) -> &mut MultiplexPool<C, ID>

How long a checkout waits for connects in flight before it dials its own, if its limits let it. Unset, it waits for them until its caller’s deadline, if any (see Pool::get_conn).

pub fn with_max_wait_before_dial(self, wait: Duration) -> MultiplexPool<C, ID>

How long a checkout waits for connects in flight before it dials its own, if its limits let it. Unset, it waits for them until its caller’s deadline, if any (see Pool::get_conn).

pub fn set_max_wait_before_dial( &mut self, wait: Duration, ) -> &mut MultiplexPool<C, ID>

How long a checkout waits for connects in flight before it dials its own, if its limits let it. Unset, it waits for them until its caller’s deadline, if any (see Pool::get_conn).

pub fn without_max_wait_before_dial(self) -> MultiplexPool<C, ID>

How long a checkout waits for connects in flight before it dials its own, if its limits let it. Unset, it waits for them until its caller’s deadline, if any (see Pool::get_conn).

pub fn unset_max_wait_before_dial(&mut self) -> &mut MultiplexPool<C, ID>

How long a checkout waits for connects in flight before it dials its own, if its limits let it. Unset, it waits for them until its caller’s deadline, if any (see Pool::get_conn).

pub fn maybe_with_max_connecting_per_id( self, max: Option<NonZero<usize>>, ) -> MultiplexPool<C, ID>

At most this many connects in flight per id and reuse key: further checkouts that need a connection wait for one to land, as browsers open few connections per host at once. It also binds a checkout done waiting (see Self::with_max_wait_before_dial), and connects that turn out not to multiplex, so a cold burst on an HTTP/1 origin dials this many at a time, but not a checkout a total limit hands a slot: it dials with it. Unset, a burst dials what it needs.

pub fn maybe_set_max_connecting_per_id( &mut self, max: Option<NonZero<usize>>, ) -> &mut MultiplexPool<C, ID>

At most this many connects in flight per id and reuse key: further checkouts that need a connection wait for one to land, as browsers open few connections per host at once. It also binds a checkout done waiting (see Self::with_max_wait_before_dial), and connects that turn out not to multiplex, so a cold burst on an HTTP/1 origin dials this many at a time, but not a checkout a total limit hands a slot: it dials with it. Unset, a burst dials what it needs.

pub fn with_max_connecting_per_id( self, max: NonZero<usize>, ) -> MultiplexPool<C, ID>

At most this many connects in flight per id and reuse key: further checkouts that need a connection wait for one to land, as browsers open few connections per host at once. It also binds a checkout done waiting (see Self::with_max_wait_before_dial), and connects that turn out not to multiplex, so a cold burst on an HTTP/1 origin dials this many at a time, but not a checkout a total limit hands a slot: it dials with it. Unset, a burst dials what it needs.

pub fn set_max_connecting_per_id( &mut self, max: NonZero<usize>, ) -> &mut MultiplexPool<C, ID>

At most this many connects in flight per id and reuse key: further checkouts that need a connection wait for one to land, as browsers open few connections per host at once. It also binds a checkout done waiting (see Self::with_max_wait_before_dial), and connects that turn out not to multiplex, so a cold burst on an HTTP/1 origin dials this many at a time, but not a checkout a total limit hands a slot: it dials with it. Unset, a burst dials what it needs.

pub fn without_max_connecting_per_id(self) -> MultiplexPool<C, ID>

At most this many connects in flight per id and reuse key: further checkouts that need a connection wait for one to land, as browsers open few connections per host at once. It also binds a checkout done waiting (see Self::with_max_wait_before_dial), and connects that turn out not to multiplex, so a cold burst on an HTTP/1 origin dials this many at a time, but not a checkout a total limit hands a slot: it dials with it. Unset, a burst dials what it needs.

pub fn unset_max_connecting_per_id(&mut self) -> &mut MultiplexPool<C, ID>

At most this many connects in flight per id and reuse key: further checkouts that need a connection wait for one to land, as browsers open few connections per host at once. It also binds a checkout done waiting (see Self::with_max_wait_before_dial), and connects that turn out not to multiplex, so a cold burst on an HTTP/1 origin dials this many at a time, but not a checkout a total limit hands a slot: it dials with it. Unset, a burst dials what it needs.

pub fn with_selection(self, selection: MuxSelection) -> MultiplexPool<C, ID>

Set the MuxSelection strategy used to pick among same-id connections.

pub fn set_selection( &mut self, selection: MuxSelection, ) -> &mut MultiplexPool<C, ID>

Set the MuxSelection strategy used to pick among same-id connections.

pub fn maybe_with_metrics( self, metrics: Option<Arc<PoolMetrics>>, ) -> MultiplexPool<C, ID>

pub fn maybe_set_metrics( &mut self, metrics: Option<Arc<PoolMetrics>>, ) -> &mut MultiplexPool<C, ID>

pub fn with_metrics(self, metrics: Arc<PoolMetrics>) -> MultiplexPool<C, ID>

pub fn set_metrics( &mut self, metrics: Arc<PoolMetrics>, ) -> &mut MultiplexPool<C, ID>

pub fn without_metrics(self) -> MultiplexPool<C, ID>

pub fn unset_metrics(&mut self) -> &mut MultiplexPool<C, ID>

Trait Implementations§

§

impl<C, ID> Clone for MultiplexPool<C, ID>

§

fn clone(&self) -> MultiplexPool<C, ID>

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
§

impl<C, ID> Debug for MultiplexPool<C, ID>

§

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

Formats the value using the given formatter. Read more
§

impl<C, ID> Default for MultiplexPool<C, ID>

§

fn default() -> MultiplexPool<C, ID>

Returns the “default value” for a type. Read more
§

impl<C, ID> Extension for MultiplexPool<C, ID>
where C: Send + Sync + 'static, ID: Send + Sync + Debug + 'static,

§

impl<C, ID> NetExtension for MultiplexPool<C, ID>
where C: Send + Sync + 'static, ID: Send + Sync + Debug + 'static,

§

impl<C, ID> Pool<C, ID> for MultiplexPool<C, ID>
where C: Send + Sync + ExtensionsRef + 'static, ID: ConnID,

§

type Connection = MultiplexedConnection<C, ID>

§

type CreatePermit = MultiplexSlot

§

async fn get_conn( &self, id: &ID, input: &Extensions, deadline: Option<Instant>, ) -> Result<ConnectionResult<<MultiplexPool<C, ID> as Pool<C, ID>>::Connection, <MultiplexPool<C, ID> as Pool<C, ID>>::CreatePermit>, Box<dyn Error + Send + Sync>>

Get a compatible connection, or a permit to establish a new connection. Read more
§

fn abandon(&self, create_permit: MultiplexSlot, error: &ConnectionError)

The connection create_permit was for could not be established. Pools that let checkouts wait for it instead of dialing fail them alike.
§

async fn create( &self, id: ID, conn: C, slot: MultiplexSlot, input: &Extensions, ) -> Result<<MultiplexPool<C, ID> as Pool<C, ID>>::Connection, Box<dyn Error + Send + Sync>>

Admit the establishing request before publishing its new connection. Read more

Auto Trait Implementations§

§

impl<C, ID> !RefUnwindSafe for MultiplexPool<C, ID>

§

impl<C, ID> !UnwindSafe for MultiplexPool<C, ID>

§

impl<C, ID> Freeze for MultiplexPool<C, ID>
where Arc<Mutex<RawMutex, Storage<C, ID>>>: Freeze, Option<Arc<IdleLimits<ID>>>: Freeze, Option<fn(&ID, &Extensions) -> Option<NonZero<usize>>>: Freeze, Arc<Reaper<C, ID>>: Freeze,

§

impl<C, ID> Send for MultiplexPool<C, ID>
where Arc<Mutex<RawMutex, Storage<C, ID>>>: Send, Option<Arc<IdleLimits<ID>>>: Send, Option<fn(&ID, &Extensions) -> Option<NonZero<usize>>>: Send, Arc<Reaper<C, ID>>: Send,

§

impl<C, ID> Sync for MultiplexPool<C, ID>
where Arc<Mutex<RawMutex, Storage<C, ID>>>: Sync, Option<Arc<IdleLimits<ID>>>: Sync, Option<fn(&ID, &Extensions) -> Option<NonZero<usize>>>: Sync, Arc<Reaper<C, ID>>: Sync,

§

impl<C, ID> Unpin for MultiplexPool<C, ID>
where Arc<Mutex<RawMutex, Storage<C, ID>>>: Unpin, Option<Arc<IdleLimits<ID>>>: Unpin, Option<fn(&ID, &Extensions) -> Option<NonZero<usize>>>: Unpin, Arc<Reaper<C, ID>>: Unpin,

§

impl<C, ID> UnsafeUnpin for MultiplexPool<C, ID>
where Arc<Mutex<RawMutex, Storage<C, ID>>>: UnsafeUnpin, Option<Arc<IdleLimits<ID>>>: UnsafeUnpin, Option<fn(&ID, &Extensions) -> Option<NonZero<usize>>>: UnsafeUnpin, Arc<Reaper<C, ID>>: UnsafeUnpin,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
§

impl<'a, T, E> AsTaggedExplicit<'a, E> for T
where T: 'a,

§

fn explicit(self, class: Class, tag: u32) -> TaggedParser<'a, Explicit, Self, E>

§

impl<'a, T, E> AsTaggedImplicit<'a, E> for T
where T: 'a,

§

fn implicit( self, class: Class, constructed: bool, tag: u32, ) -> TaggedParser<'a, Implicit, Self, E>

Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<T> FromRef<T> for T
where T: Clone,

§

fn from_ref(input: &T) -> T

Converts to this type from a reference to the input type.
§

impl<T> FutureExt for T

§

fn with_context(self, otel_cx: Context) -> WithContext<Self> ⓘ

Attaches the provided Context to this type, returning a WithContext wrapper. Read more
§

fn with_current_context(self) -> WithContext<Self> ⓘ

Attaches the current Context to this type, returning a WithContext wrapper. Read more
§

impl<T> Instrument for T

§

fn instrument(self, span: Span) -> Instrumented<Self> ⓘ

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
§

fn in_current_span(self) -> Instrumented<Self> ⓘ

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
where F: FnOnce(&Self) -> bool,

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

§

fn into_request(self) -> Request<T>

Wrap the input message T in a rama_grpc::Request
§

impl<L> LayerExt<L> for L

§

fn named_layer<S>(&self, service: S) -> Layered<<L as Layer<S>>::Service, S>
where L: Layer<S>,

Applies the layer to a service and wraps it in Layered.
§

impl<T> Pointable for T

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
§

impl<T> PolicyExt for T
where T: ?Sized,

§

fn and<P, B, E>(self, other: P) -> And<T, P>
where T: Sized + Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow only if self and other return Action::Follow. Read more
§

fn or<P, B, E>(self, other: P) -> Or<T, P>
where T: Sized + Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow if either self or other returns Action::Follow. Read more
§

impl<T, U> RamaFrom<T> for U
where U: From<T>,

§

fn rama_from(value: T) -> U

§

impl<T, U, CrateMarker> RamaInto<U, CrateMarker> for T
where U: RamaFrom<T, CrateMarker>,

§

fn rama_into(self) -> U

§

impl<T, U> RamaTryFrom<T> for U
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

§

fn rama_try_from(value: T) -> Result<U, <U as RamaTryFrom<T>>::Error>

§

impl<T, U, CrateMarker> RamaTryInto<U, CrateMarker> for T
where U: RamaTryFrom<T, CrateMarker>,

§

type Error = <U as RamaTryFrom<T, CrateMarker>>::Error

§

fn rama_try_into(self) -> Result<U, <U as RamaTryFrom<T, CrateMarker>>::Error>

§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = !

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<V, F> ValueFormatter<&V> for F
where F: ValueFormatter<V> + ?Sized, V: ?Sized,

§

const SHAPE: FieldShape<'static>

Available on non-metrique_require_explicit_impls only.
The shape of values produced by this formatter. Read more
§

fn format_value(writer: impl ValueWriter, value: &&V)

Write value to writer
§

impl<V, F> ValueFormatter<Arc<V>> for F
where F: ValueFormatter<V> + ?Sized, V: ?Sized,

§

const SHAPE: FieldShape<'static>

Available on non-metrique_require_explicit_impls only.
The shape of values produced by this formatter. Read more
§

fn format_value(writer: impl ValueWriter, value: &Arc<V>)

Write value to writer
§

impl<V, F> ValueFormatter<Box<V>> for F
where F: ValueFormatter<V> + ?Sized, V: ?Sized,

§

const SHAPE: FieldShape<'static>

Available on non-metrique_require_explicit_impls only.
The shape of values produced by this formatter. Read more
§

fn format_value(writer: impl ValueWriter, value: &Box<V>)

Write value to writer
§

impl<V, F> ValueFormatter<Cow<'_, V>> for F
where V: ToOwned + ?Sized, F: ValueFormatter<V> + ?Sized,

§

const SHAPE: FieldShape<'static>

Available on non-metrique_require_explicit_impls only.
The shape of values produced by this formatter. Read more
§

fn format_value(writer: impl ValueWriter, value: &Cow<'_, V>)

Write value to writer
§

impl<V, F> ValueFormatter<Option<V>> for F
where F: ValueFormatter<V> + ?Sized,

§

const SHAPE: FieldShape<'static>

Available on non-metrique_require_explicit_impls only.
The shape of values produced by this formatter. Read more
§

fn format_value(writer: impl ValueWriter, value: &Option<V>)

Write value to writer
§

impl<T> WithSubscriber for T

§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> ⓘ
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
§

fn with_current_subscriber(self) -> WithDispatch<Self> ⓘ

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more