shove 0.11.2

Async tasks via pubsub on steroids. Comes with built-in support for complex queue configurations, audit logs, autoscaling consumer groups and more.
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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107

use crate::error::Result;
use crate::topology::QueueTopology;

use super::client::InMemoryBroker;

/// Creates the in-memory queues backing a [`QueueTopology`].
///
/// Idempotent — calling `declare` twice for the same topology is a no-op.
pub struct InMemoryTopologyDeclarer {
    broker: InMemoryBroker,
}

impl InMemoryTopologyDeclarer {
    pub fn new(broker: InMemoryBroker) -> Self {
        Self { broker }
    }

    pub fn shard_queue_name(main_queue: &str, shard: u16) -> String {
        format!("{main_queue}-seq-{shard}")
    }
}

impl InMemoryTopologyDeclarer {
    pub async fn declare(&self, topology: &QueueTopology) -> Result<()> {
        if let Some(seq) = topology.sequencing() {
            for shard in 0..seq.routing_shards() {
                let shard_name = Self::shard_queue_name(topology.queue(), shard);
                self.broker.declare(&shard_name);
                for hq in topology.shard_hold_queue_names(shard) {
                    self.broker.declare(hq.name());
                }
            }
        } else {
            self.broker.declare(topology.queue());
            for hq in topology.hold_queues() {
                self.broker.declare(hq.name());
            }
        }

        if let Some(dlq) = topology.dlq() {
            self.broker.declare(dlq);
        }

        Ok(())
    }
}

#[cfg(test)]
mod tests {
    use std::time::Duration;

    use super::*;
    use crate::topology::{SequenceFailure, TopologyBuilder};

    #[tokio::test]
    async fn declares_main_dlq_and_hold_queues() {
        let broker = InMemoryBroker::new();
        let topology = TopologyBuilder::new("orders")
            .hold_queue(Duration::from_secs(5))
            .hold_queue(Duration::from_secs(30))
            .dlq()
            .build();

        let declarer = InMemoryTopologyDeclarer::new(broker.clone());
        declarer.declare(&topology).await.unwrap();

        assert!(broker.lookup("orders").is_ok());
        assert!(broker.lookup("orders-hold-5s").is_ok());
        assert!(broker.lookup("orders-hold-30s").is_ok());
        assert!(broker.lookup("orders-dlq").is_ok());
    }

    #[tokio::test]
    async fn declare_is_idempotent() {
        let broker = InMemoryBroker::new();
        let topology = TopologyBuilder::new("idemp").dlq().build();
        let declarer = InMemoryTopologyDeclarer::new(broker.clone());
        declarer.declare(&topology).await.unwrap();
        declarer.declare(&topology).await.unwrap();
        assert!(broker.lookup("idemp").is_ok());
        assert!(broker.lookup("idemp-dlq").is_ok());
    }

    #[tokio::test]
    async fn declares_sequenced_shard_queues() {
        let broker = InMemoryBroker::new();
        let topology = TopologyBuilder::new("ledger")
            .sequenced(SequenceFailure::Skip)
            .routing_shards(4)
            .hold_queue(Duration::from_secs(5))
            .dlq()
            .build();

        let declarer = InMemoryTopologyDeclarer::new(broker.clone());
        declarer.declare(&topology).await.unwrap();

        for shard in 0..4 {
            assert!(broker.lookup(&format!("ledger-seq-{shard}")).is_ok());
            assert!(
                broker
                    .lookup(&format!("ledger-seq-{shard}-hold-5s"))
                    .is_ok()
            );
        }
        assert!(broker.lookup("ledger-dlq").is_ok());
    }
}