Struct Pending 

pub(super) struct Pending {
    pub(super) requests: HashMap<Arc<str>, PendingRequest>,
    pub(super) deadlines: DelayQueue<Arc<str>>,
    pub(super) resets: FuturesUnordered<Pin<Box<dyn Future<Output = Option<Arc<str>>> + Send>>>,
}

The requests waiting for their second stream, with their deadlines and the watches of their streams. All are bounded by the streams of a connection.

Fields

requests: HashMap<Arc<str>, PendingRequest>

deadlines: DelayQueue<Arc<str>>

resets: FuturesUnordered<Pin<Box<dyn Future<Output = Option<Arc<str>>> + Send>>>

The watches of the waiting streams, which let go of a stream once the client reset it. Otherwise the streams of a client which opens and resets them would count against the most streams of its connection until their deadline, as no new stream which could free them gets accepted once there is no room left.

Implementations

impl Pending

pub(super) fn new() -> Self

No pending requests.

fn wait( request_id: &Arc<str>, stream: Stream, ) -> (Waiting, Pin<Box<dyn Future<Output = Option<Arc<str>>> + Send>>)

A stream of a request which waits for the other one, and the watch for its reset, see Self::resets.

pub(super) fn get_or_insert( &mut self, request_id: &Arc<str>, ) -> &mut PendingRequest

The request, created with its deadline if it is new.

pub(super) fn remove(&mut self, request_id: &str) -> Option<PendingRequest>

Remove a request, with its deadline.

pub(super) fn remove_reset(&mut self, request_id: &str)

Let go of the streams of a request which the client reset, and of the request once it has no stream left.