Struct ReuseKey 

pub struct ReuseKey { /* private fields */ }

Available on crate feature net only.

Exact identity of the reuse requirements of a connection or a request.

Keys compare by value. Their hash only indexes them: distinct keys never match on a hash collision. Keys built from a type or inline bits do not allocate, and clones never do; Self::new and Self::and allocate once per key they build.

Pools compare keys under their locks: a value’s Eq must be cheap and side-effect free, and never call into a pool.

Implementations

impl ReuseKey

pub fn of<T>() -> ReuseKey

where T: 'static + ?Sized,

The key of T itself, for fixed requirements or a classifier.

Equal to Self::from_bits::<T>(0).

pub fn from_bits<T>(bits: u128) -> ReuseKey

where T: 'static + ?Sized,

Inline bits, such as an id or a digest, in the namespace of T.

pub fn new<T>(value: T) -> ReuseKey

where T: Eq + Hash + Debug + Send + Sync + 'static,

A value compared with its own Eq, allocated once.

pub fn from_arc<T>(value: Arc<T>) -> ReuseKey

where T: Eq + Hash + Debug + Send + Sync + 'static,

A value compared with its own Eq, sharing an existing allocation.

pub fn and(self, other: ReuseKey) -> ReuseKey

Both keys in order: equal only to a composition of the same keys, in the same order and grouping.

Trait Implementations

impl Clone for ReuseKey

fn clone(&self) -> ReuseKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ReuseKey

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

Formats the value using the given formatter.

impl Eq for ReuseKey

impl Hash for ReuseKey

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

where H: Hasher,

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 PartialEq for ReuseKey

fn eq(&self, other: &ReuseKey) -> bool

Equality operator ==.

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

Inequality operator !=.