2 unstable releases

0.2.0 Apr 30, 2024
0.1.0 Apr 29, 2024

#2096 in Algorithms

Download history 904/week @ 2024-12-21 692/week @ 2024-12-28 1288/week @ 2025-01-04 719/week @ 2025-01-11 499/week @ 2025-01-18 197/week @ 2025-01-25 622/week @ 2025-02-01 554/week @ 2025-02-08 544/week @ 2025-02-15 518/week @ 2025-02-22 500/week @ 2025-03-01 635/week @ 2025-03-08 667/week @ 2025-03-15 544/week @ 2025-03-22 582/week @ 2025-03-29 745/week @ 2025-04-05

2,603 downloads per month

MIT/Apache

10KB
185 lines

Order keeping job processing queue.

This module provides a multithreaded worker pool that processes tasks while keeping the order of outputs.

Example:

struct Add;

impl ordq::Work for Add {
    type I = (i32, i32);
    type O = i32;

    fn run(&mut self, x: Self::I) -> Self::O {
        x.0 + x.1
    }
}

let (tx, rx) = ordq::new(1024, vec![Add, Add]);

tx.send((1, 2));
tx.send((3, 4));
tx.send((5, 6));

tx.close();

assert_eq!(rx.recv(), Some(Ok(3)));
assert_eq!(rx.recv(), Some(Ok(7)));
assert_eq!(rx.recv(), Some(Ok(11)));
assert_eq!(rx.recv(), None);
assert_eq!(rx.recv(), None);

ordq

Order keeping job processing queue

Example:

struct Add;

impl ordq::Work for Add {
    type I = (i32, i32);
    type O = i32;

    fn run(&mut self, x: Self::I) -> Self::O {
        x.0 + x.1
    }
}

# fn test_jobq() {
let (tx, rx) = ordq::new(1024, vec![Add, Add]);

tx.send((1, 2));
tx.send((3, 4));

tx.close();

assert_eq!(rx.recv(), Some(Ok(3)));
assert_eq!(rx.recv(), Some(Ok(7)));
assert_eq!(rx.recv(), None);
assert_eq!(rx.recv(), None);
# }

Dependencies

~0.5–1MB
~21K SLoC