async-priority-limiter 0.4.4

Throttles prioritised tasks by limiting the max concurrent tasks and minimum time between tasks, with up to two levels based on keys
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80

use crate::{BoxFuture, traits::Key};

use std::{cmp::Ordering, fmt::Debug};
use tokio::sync::oneshot;

pub(crate) struct Task<K: Key, P: Ord, T> {
    pub(crate) index: Option<u64>,
    pub(crate) priority: P,
    pub(crate) key: Option<K>,
    pub(crate) job: BoxFuture<T>,
    pub(crate) reply: oneshot::Sender<T>,
}

impl<T, P: Ord + Debug, K: Key + Debug> Debug for Task<K, P, T> {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        f.debug_struct("Task<T, P>")
            .field("index", &self.index)
            .field("priority", &self.priority)
            .field("key", &self.key)
            .finish_non_exhaustive()
    }
}

impl<T, P: Ord, K: Key> Task<K, P, T> {
    pub fn new<J: Future<Output = T> + Send + 'static>(
        job: J,
        priority: P,
        reply: oneshot::Sender<T>,
    ) -> Self {
        Self {
            job: Box::pin(job),
            priority,
            reply,
            key: None,
            index: None,
        }
    }

    pub fn new_with_key<J: Future<Output = T> + Send + 'static>(
        job: J,
        priority: P,
        reply: oneshot::Sender<T>,
        key: K,
    ) -> Self {
        Self {
            job: Box::pin(job),
            priority,
            reply,
            key: Some(key),
            index: None,
        }
    }

    pub fn with_index(mut self, index: u64) -> Self {
        self.index = Some(index);
        self
    }
}

impl<T, P: Ord, K: Key> PartialEq for Task<K, P, T> {
    fn eq(&self, other: &Self) -> bool {
        self.priority == other.priority
    }
}

impl<T, P: Ord, K: Key> Eq for Task<K, P, T> {}

impl<T, P: Ord, K: Key> PartialOrd for Task<K, P, T> {
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}

impl<T, P: Ord, K: Key> Ord for Task<K, P, T> {
    fn cmp(&self, other: &Self) -> Ordering {
        self.priority
            .cmp(&other.priority)
            .then(other.index.cmp(&self.index))
    }
}