Struct ImageRequestQueueInner

struct ImageRequestQueueInner {
    limit: usize,
    requests: HashMap<ImageRequestId, ImageRequest>,
    ongoing: HashSet<ImageRequestId>,
    stalled: HashSet<ImageRequestId>,
    queue_default: VecDeque<ImageRequestId>,
    queue_low: VecDeque<ImageRequestId>,
}

Fields

limit: usize

The current limit of the ongoing requests count.

This may change if an error is encountered, to let the system recover.

requests: HashMap<ImageRequestId, ImageRequest>

The image requests in the queue.

ongoing: HashSet<ImageRequestId>

The ongoing requests.

stalled: HashSet<ImageRequestId>

The stalled requests.

queue_default: VecDeque<ImageRequestId>

The queue of requests with default priority.

queue_low: VecDeque<ImageRequestId>

The queue of requests with low priority.

Implementations

impl ImageRequestQueueInner

fn is_limit_reached(&self) -> bool

Whether we have reache the current limit of concurrent requests.

fn add_request(&mut self, request_id: ImageRequestId, request: ImageRequest)

Add the given request to the queue.

fn add_download_request( &mut self, client: Client, settings: MediaRequestParameters, dimensions: Option<FrameDimensions>, priority: ImageRequestPriority, ) -> ImageRequestHandle

Add a request to download an image.

If another request for the same image already exists, this will reuse the same request.

fn add_file_request( &mut self, file: File, dimensions: Option<FrameDimensions>, ) -> ImageRequestHandle

Add a request to load an image from a file.

If another request for the same file already exists, this will reuse the same request.

fn mark_as_stalled(&mut self, request_id: ImageRequestId)

Mark the request with the given ID as stalled.

fn retry_request(&mut self, request_id: &ImageRequestId, lower_limit: bool)

Retry the request with the given ID.

If lower_limit is true, we will also lower the limit of the queue.

fn remove_request(&mut self, request_id: &ImageRequestId)

Remove the request with the given ID.

fn spawn_next(&mut self)

Spawn as many requests as possible.