oxana 2.0.0-rc.3

A simple & fast job queue system.
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

use std::collections::HashMap;
use std::sync::Arc;
use tokio::sync::{Mutex, Semaphore};

pub struct SemaphoresMap {
    permits: usize,
    inner: Mutex<HashMap<String, Arc<Semaphore>>>,
}

impl SemaphoresMap {
    pub fn new(permits: usize) -> Self {
        Self {
            permits,
            inner: Mutex::new(HashMap::new()),
        }
    }

    pub async fn get_or_create(&self, key: String) -> Arc<Semaphore> {
        let mut map = self.inner.lock().await;
        Arc::clone(
            map.entry(key)
                .or_insert_with(|| Arc::new(Semaphore::new(self.permits))),
        )
    }

    pub async fn busy_count(&self) -> usize {
        let map = self.inner.lock().await;
        map.values()
            .map(|sem| self.permits - sem.available_permits())
            .sum()
    }
}