ruststream-lapin 0.5.2

RabbitMQ / AMQP 0.9.1 broker implementation for the RustStream messaging framework, backed by lapin.
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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
//! Integration tests against a real `RabbitMQ`.
//!
//! Every test is a no-op unless `AMQP_TEST_URL` points at a broker:
//!
//! ```text
//! just brokers-up
//! AMQP_TEST_URL=amqp://127.0.0.1:5672 cargo test --workspace --all-features -- --test-threads=1
//! ```
//!
//! These cover exactly what the in-process test broker does not simulate: declared topology and
//! bindings, queue types, redelivery flags, dead-lettering, prefetch, and the split between the
//! plain and transactional publish paths.

use std::collections::{HashMap, HashSet};
use std::convert::Infallible;
use std::sync::atomic::{AtomicU64, AtomicUsize, Ordering};
use std::sync::{Arc, Mutex};
use std::time::Duration;

use futures::{Stream, StreamExt};
use serde::Deserialize;
use tokio::sync::Notify;

use ruststream::runtime::{AppInfo, Ctx, HandlerResult, RustStream, State};
use ruststream::{
    Broker, FromRef, Headers, IncomingMessage, OutgoingMessage, Partitioned, Publisher, Subscriber,
    subscriber,
};
use ruststream_lapin::context::keys;
use ruststream_lapin::{
    Delay, LapinBroker, LapinMessage, PARTITION_KEY_HEADER, QueueType, RabbitExchange, RabbitQueue,
};

const WAIT: Duration = Duration::from_secs(5);
const SILENCE: Duration = Duration::from_millis(200);

fn amqp_url() -> Option<String> {
    std::env::var("AMQP_TEST_URL").ok()
}

/// Unique per test run and per call, so runs never see each other's queues.
fn unique(base: &str) -> String {
    static COUNTER: AtomicU64 = AtomicU64::new(0);
    let n = COUNTER.fetch_add(1, Ordering::Relaxed);
    format!("ruststream-it.{base}.{}-{n}", std::process::id())
}

/// A throwaway queue that vanishes with the test's connection: exclusive, because `RabbitMQ` 4
/// denies transient non-exclusive queues by default.
fn transient_queue(name: &str) -> RabbitQueue {
    RabbitQueue::new(name).durable(false).exclusive(true)
}

async fn next<S>(stream: &mut S) -> LapinMessage
where
    S: Stream<Item = Result<LapinMessage, ruststream_lapin::AmqpError>> + Unpin,
{
    tokio::time::timeout(WAIT, stream.next())
        .await
        .expect("delivery within timeout")
        .expect("stream has next")
        .expect("delivery ok")
}

async fn expect_silence<S>(stream: &mut S)
where
    S: Stream<Item = Result<LapinMessage, ruststream_lapin::AmqpError>> + Unpin,
{
    let outcome = tokio::time::timeout(SILENCE, stream.next()).await;
    assert!(outcome.is_err(), "expected no delivery, got one");
}

#[tokio::test(flavor = "multi_thread", worker_threads = 2)]
async fn round_trip_on_default_exchange() {
    let Some(url) = amqp_url() else { return };
    let broker = LapinBroker::new(url).declare_topology(true);
    Broker::connect(&broker).await.expect("connect");

    let queue = unique("round-trip");
    let mut subscriber = broker
        .subscribe(transient_queue(&queue))
        .await
        .expect("subscribe");

    let mut headers = Headers::new();
    headers.insert("content-type", "application/json");
    broker
        .publisher()
        .publish(OutgoingMessage::new(&queue, b"{\"id\":1}").with_headers(headers))
        .await
        .expect("publish");

    let mut stream = Box::pin(subscriber.stream());
    let msg = next(&mut stream).await;
    assert_eq!(msg.payload(), b"{\"id\":1}");
    assert_eq!(msg.headers().content_type(), Some("application/json"));
    assert_eq!(msg.routing_key(), queue);
    assert!(!msg.redelivered());
    msg.ack().await.expect("ack");

    drop(stream);
    broker.shutdown().await.expect("shutdown");
}

#[tokio::test(flavor = "multi_thread", worker_threads = 2)]
async fn topic_binding_routes_by_pattern() {
    let Some(url) = amqp_url() else { return };
    let broker = LapinBroker::new(url).declare_topology(true);
    Broker::connect(&broker).await.expect("connect");

    let exchange = unique("events");
    let queue = unique("orders");
    let def = transient_queue(&queue).bind(
        RabbitExchange::topic(&exchange)
            .durable(false)
            .auto_delete(true),
        "order.*",
    );
    let mut subscriber = broker.subscribe(def).await.expect("subscribe");

    let publisher = broker.publisher().exchange(&exchange);
    publisher
        .publish(OutgoingMessage::new("order.created", b"hit"))
        .await
        .expect("publish hit");
    publisher
        .publish(OutgoingMessage::new("payment.created", b"miss"))
        .await
        .expect("publish miss");

    let mut stream = Box::pin(subscriber.stream());
    let msg = next(&mut stream).await;
    assert_eq!(msg.payload(), b"hit");
    assert_eq!(msg.exchange(), exchange);
    assert_eq!(msg.routing_key(), "order.created");
    msg.ack().await.expect("ack");

    expect_silence(&mut stream).await;

    drop(stream);
    broker.shutdown().await.expect("shutdown");
}

#[tokio::test(flavor = "multi_thread", worker_threads = 2)]
async fn quorum_queue_declares_and_delivers() {
    let Some(url) = amqp_url() else { return };
    let broker = LapinBroker::new(url.clone()).declare_topology(true);
    Broker::connect(&broker).await.expect("connect");

    // Quorum queues must be durable and never auto-delete, so this one needs explicit cleanup.
    let queue = unique("quorum");
    let def = RabbitQueue::new(&queue).queue_type(QueueType::Quorum);
    let mut subscriber = broker.subscribe(def).await.expect("subscribe");

    broker
        .publisher()
        .publish(OutgoingMessage::new(&queue, b"q1"))
        .await
        .expect("publish");

    let mut stream = Box::pin(subscriber.stream());
    let msg = next(&mut stream).await;
    assert_eq!(msg.payload(), b"q1");
    msg.ack().await.expect("ack");

    drop(stream);
    drop(subscriber);
    broker.shutdown().await.expect("shutdown");

    let cleanup = lapin::Connection::connect(&url, lapin::ConnectionProperties::default())
        .await
        .expect("cleanup connect");
    let channel = cleanup.create_channel().await.expect("cleanup channel");
    channel
        .queue_delete(
            queue.as_str().into(),
            lapin::options::QueueDeleteOptions::default(),
        )
        .await
        .expect("cleanup queue delete");
    cleanup
        .close(200, "OK".into())
        .await
        .expect("cleanup close");
}

#[tokio::test(flavor = "multi_thread", worker_threads = 2)]
async fn nack_requeue_marks_redelivered() {
    let Some(url) = amqp_url() else { return };
    let broker = LapinBroker::new(url).declare_topology(true);
    Broker::connect(&broker).await.expect("connect");

    let queue = unique("requeue");
    let mut subscriber = broker
        .subscribe(transient_queue(&queue))
        .await
        .expect("subscribe");
    broker
        .publisher()
        .publish(OutgoingMessage::new(&queue, b"again"))
        .await
        .expect("publish");

    let mut stream = Box::pin(subscriber.stream());
    let first = next(&mut stream).await;
    assert!(!first.redelivered());
    first.nack(true).await.expect("nack requeue");

    let second = next(&mut stream).await;
    assert_eq!(second.payload(), b"again");
    assert!(
        second.redelivered(),
        "requeued delivery must carry the redelivered flag"
    );
    second.ack().await.expect("ack");

    drop(stream);
    broker.shutdown().await.expect("shutdown");
}

#[tokio::test(flavor = "multi_thread", worker_threads = 2)]
async fn reject_dead_letters_into_dlx() {
    let Some(url) = amqp_url() else { return };
    let broker = LapinBroker::new(url).declare_topology(true);
    Broker::connect(&broker).await.expect("connect");

    let dead = unique("dead");
    let mut dead_subscriber = broker
        .subscribe(transient_queue(&dead))
        .await
        .expect("subscribe dead queue");

    // Dead-letter through the default exchange straight into the dead queue.
    let queue = unique("work");
    let def = transient_queue(&queue)
        .dead_letter_exchange("")
        .dead_letter_routing_key(&dead);
    let mut subscriber = broker.subscribe(def).await.expect("subscribe work queue");

    broker
        .publisher()
        .publish(OutgoingMessage::new(&queue, b"poison"))
        .await
        .expect("publish");

    let mut work_stream = Box::pin(subscriber.stream());
    let msg = next(&mut work_stream).await;
    msg.nack(false).await.expect("reject");

    let mut dead_stream = Box::pin(dead_subscriber.stream());
    let dead_msg = next(&mut dead_stream).await;
    assert_eq!(dead_msg.payload(), b"poison");
    dead_msg.ack().await.expect("ack dead letter");

    drop(work_stream);
    drop(dead_stream);
    broker.shutdown().await.expect("shutdown");
}

#[tokio::test(flavor = "multi_thread", worker_threads = 2)]
async fn binary_header_values_round_trip() {
    let Some(url) = amqp_url() else { return };
    let broker = LapinBroker::new(url).declare_topology(true);
    Broker::connect(&broker).await.expect("connect");

    let queue = unique("binary");
    let mut subscriber = broker
        .subscribe(transient_queue(&queue))
        .await
        .expect("subscribe");

    let mut headers = Headers::new();
    headers.insert("x-blob", vec![0u8, 159, 146, 150]);
    headers.insert("x-tenant", "acme");
    broker
        .publisher()
        .publish(OutgoingMessage::new(&queue, b"payload").with_headers(headers))
        .await
        .expect("publish");

    let mut stream = Box::pin(subscriber.stream());
    let msg = next(&mut stream).await;
    assert_eq!(
        msg.headers().get("x-blob"),
        Some([0u8, 159, 146, 150].as_slice())
    );
    assert_eq!(msg.headers().get_str("x-tenant"), Some("acme"));
    msg.ack().await.expect("ack");

    drop(stream);
    broker.shutdown().await.expect("shutdown");
}

#[tokio::test(flavor = "multi_thread", worker_threads = 2)]
async fn prefetch_caps_unacknowledged_deliveries() {
    let Some(url) = amqp_url() else { return };
    let broker = LapinBroker::new(url).declare_topology(true);
    Broker::connect(&broker).await.expect("connect");

    let queue = unique("prefetch");
    let mut subscriber = broker
        .subscribe(transient_queue(&queue).prefetch(1))
        .await
        .expect("subscribe");

    let publisher = broker.publisher();
    for payload in [b"m1".as_slice(), b"m2", b"m3"] {
        publisher
            .publish(OutgoingMessage::new(&queue, payload))
            .await
            .expect("publish");
    }

    let mut stream = Box::pin(subscriber.stream());
    let first = next(&mut stream).await;
    assert_eq!(first.payload(), b"m1");

    // One unacknowledged delivery is the whole window: nothing else may arrive yet.
    expect_silence(&mut stream).await;

    first.ack().await.expect("ack first");
    let second = next(&mut stream).await;
    assert_eq!(second.payload(), b"m2");
    second.ack().await.expect("ack second");
    let third = next(&mut stream).await;
    third.ack().await.expect("ack third");

    drop(stream);
    broker.shutdown().await.expect("shutdown");
}

#[tokio::test(flavor = "multi_thread", worker_threads = 2)]
async fn server_tx_publisher_is_plain_outside_a_transaction() {
    let Some(url) = amqp_url() else { return };
    let broker = LapinBroker::new(url).declare_topology(true);
    Broker::connect(&broker).await.expect("connect");

    let queue = unique("server-tx-plain");
    let mut subscriber = broker
        .subscribe(transient_queue(&queue))
        .await
        .expect("subscribe");

    let publisher = broker.publisher().server_tx();
    publisher
        .publish(OutgoingMessage::new(&queue, b"direct"))
        .await
        .expect("publish");

    let mut stream = Box::pin(subscriber.stream());
    let msg = next(&mut stream).await;
    assert_eq!(msg.payload(), b"direct");
    msg.ack().await.expect("ack");

    drop(stream);
    broker.shutdown().await.expect("shutdown");
}

#[tokio::test(flavor = "multi_thread", worker_threads = 2)]
async fn partition_key_round_trips_through_the_header() {
    let Some(url) = amqp_url() else { return };
    let broker = LapinBroker::new(url).declare_topology(true);
    Broker::connect(&broker).await.expect("connect");

    let queue = unique("keyed");
    let mut subscriber = broker
        .subscribe(transient_queue(&queue))
        .await
        .expect("subscribe");

    let mut headers = Headers::new();
    headers.insert(PARTITION_KEY_HEADER, "tenant-a");
    broker
        .publisher()
        .publish(OutgoingMessage::new(&queue, b"payload").with_headers(headers))
        .await
        .expect("publish");

    let mut stream = Box::pin(subscriber.stream());
    let msg = next(&mut stream).await;
    assert_eq!(
        Partitioned::partition_key(&msg),
        Some(b"tenant-a".as_slice())
    );
    msg.ack().await.expect("ack");

    drop(stream);
    broker.shutdown().await.expect("shutdown");
}

#[tokio::test(flavor = "multi_thread", worker_threads = 2)]
async fn nack_after_redelivers_through_the_delay_queue() {
    let Some(url) = amqp_url() else { return };
    let broker = LapinBroker::new(url.clone()).declare_topology(true);
    Broker::connect(&broker).await.expect("connect");

    let queue = unique("delayed");
    let def = transient_queue(&queue).delay(Delay::dlx_ttl());
    let mut subscriber = broker.subscribe(def).await.expect("subscribe");

    broker
        .publisher()
        .publish(OutgoingMessage::new(&queue, b"later"))
        .await
        .expect("publish");

    let mut stream = Box::pin(subscriber.stream());
    let first = next(&mut stream).await;
    assert_eq!(first.payload(), b"later");
    // Native delay: park it in the waiting queue for ~300ms, then dead-letter back here.
    first
        .nack_after(Duration::from_millis(300))
        .await
        .expect("nack_after");

    // It must not return before the TTL fires.
    let early = tokio::time::timeout(Duration::from_millis(100), stream.next()).await;
    assert!(
        early.is_err(),
        "the delayed message must not return before its TTL"
    );

    // It must return once the TTL fires (waiting queue -> DLX -> origin), redelivered.
    let second = next(&mut stream).await;
    assert_eq!(second.payload(), b"later");
    second.ack().await.expect("ack");

    drop(stream);
    drop(subscriber);
    broker.shutdown().await.expect("shutdown");

    // The waiting queue is durable, so remove it explicitly (the origin was exclusive/transient).
    let cleanup = lapin::Connection::connect(&url, lapin::ConnectionProperties::default())
        .await
        .expect("cleanup connect");
    let channel = cleanup.create_channel().await.expect("cleanup channel");
    channel
        .queue_delete(
            format!("{queue}.retry").as_str().into(),
            lapin::options::QueueDeleteOptions::default(),
        )
        .await
        .expect("cleanup queue delete");
    cleanup
        .close(200, "OK".into())
        .await
        .expect("cleanup close");
}

// Keyed worker lanes, driven through the full runtime dispatch path against a live broker: this is
// the behavioural counterpart to `partition_key_round_trips_through_the_header`, which only checks
// the header decode. It proves the routing guarantee end to end: deliveries that share a partition
// key stay on one lane (ordered, never concurrent), while distinct keys spread across lanes and run
// in parallel.
const KEYED_LANES_QUEUE: &str = "ruststream-it.keyed-lanes";
const KEYED_TENANTS: usize = 8;
const KEYED_PER_TENANT: usize = 3;
const KEYED_EXPECTED: usize = KEYED_TENANTS * KEYED_PER_TENANT;

/// Records, per partition key, what the lanes actually did so the test can assert the routing
/// contract after the app drains.
#[derive(Clone)]
struct Lanes(Arc<LanesInner>);

struct LanesInner {
    /// The ids seen for each key, in handler order: must match the publish order for that key.
    order: Mutex<HashMap<String, Vec<u64>>>,
    /// The distinct lane fingerprints (task ids) a key was handled on: must stay at one.
    workers: Mutex<HashMap<String, HashSet<String>>>,
    /// Keys currently inside the handler, to catch same-key concurrency.
    active: Mutex<HashSet<String>>,
    /// A same-key overlap ever observed (must be zero).
    violations: AtomicUsize,
    /// The peak number of distinct keys in flight at once (must exceed one: real parallelism).
    max_active: AtomicUsize,
    processed: AtomicUsize,
    done: Notify,
}

impl Lanes {
    fn new() -> Self {
        Self(Arc::new(LanesInner {
            order: Mutex::new(HashMap::new()),
            workers: Mutex::new(HashMap::new()),
            active: Mutex::new(HashSet::new()),
            violations: AtomicUsize::new(0),
            max_active: AtomicUsize::new(0),
            processed: AtomicUsize::new(0),
            done: Notify::new(),
        }))
    }

    fn enter(&self, tenant: &str, id: u64) {
        let inner = &self.0;
        // The handler is awaited inline in its lane's task, so the task id is a stable per-lane
        // fingerprint: a key that always hashes to the same lane must always report the same id.
        let worker = tokio::task::try_id().map_or_else(|| "?".to_owned(), |id| id.to_string());
        inner
            .workers
            .lock()
            .expect("workers lock")
            .entry(tenant.to_owned())
            .or_default()
            .insert(worker);
        inner
            .order
            .lock()
            .expect("order lock")
            .entry(tenant.to_owned())
            .or_default()
            .push(id);
        let mut active = inner.active.lock().expect("active lock");
        if !active.insert(tenant.to_owned()) {
            inner.violations.fetch_add(1, Ordering::Relaxed);
        }
        inner.max_active.fetch_max(active.len(), Ordering::Relaxed);
    }

    fn leave(&self, tenant: &str) {
        let inner = &self.0;
        inner.active.lock().expect("active lock").remove(tenant);
        if inner.processed.fetch_add(1, Ordering::Relaxed) + 1 == KEYED_EXPECTED {
            inner.done.notify_one();
        }
    }
}

#[derive(Deserialize)]
struct KeyedOrder {
    id: u64,
    tenant: String,
}

#[derive(FromRef)]
struct KeyedState {
    lanes: Lanes,
}

#[subscriber(RabbitQueue::new(KEYED_LANES_QUEUE), workers(4, by_key))]
async fn keyed_handler(order: &KeyedOrder, State(lanes): State<Lanes>) -> HandlerResult {
    lanes.enter(&order.tenant, order.id);
    // Widen the window so an erroneous same-key overlap would actually collide in `active`.
    tokio::time::sleep(Duration::from_millis(25)).await;
    lanes.leave(&order.tenant);
    HandlerResult::Ack
}

/// Declares the keyed-lanes queue durable and empty, deleting any leftover from an aborted run so
/// the pre-queued deliveries survive until the app consumes them. The consumer then subscribes
/// without declaring.
async fn declare_empty_keyed_queue(url: &str) {
    let setup = lapin::Connection::connect(url, lapin::ConnectionProperties::default())
        .await
        .expect("setup connect");
    let channel = setup.create_channel().await.expect("setup channel");
    let _ = channel
        .queue_delete(
            KEYED_LANES_QUEUE.into(),
            lapin::options::QueueDeleteOptions::default(),
        )
        .await;
    channel
        .queue_declare(
            KEYED_LANES_QUEUE.into(),
            lapin::options::QueueDeclareOptions {
                durable: true,
                ..Default::default()
            },
            lapin::types::FieldTable::default(),
        )
        .await
        .expect("setup declare");
    setup.close(200, "OK".into()).await.expect("setup close");
}

/// Pre-queues every delivery round-robin, so each key's ids ascend while keys interleave. Publishes
/// through the broker so the partition-key header is written exactly as the consumer reads it.
async fn prequeue_keyed_deliveries(url: &str) {
    let producer = LapinBroker::new(url.to_owned());
    Broker::connect(&producer).await.expect("producer connect");
    let publisher = producer.publisher();
    for round in 0..KEYED_PER_TENANT {
        for tenant in 0..KEYED_TENANTS {
            let id = (round * KEYED_TENANTS + tenant) as u64;
            let tenant = format!("t{tenant}");
            let mut headers = Headers::new();
            headers.insert(PARTITION_KEY_HEADER, tenant.clone());
            let body = format!("{{\"id\":{id},\"tenant\":\"{tenant}\"}}");
            publisher
                .publish(
                    OutgoingMessage::new(KEYED_LANES_QUEUE, body.as_bytes()).with_headers(headers),
                )
                .await
                .expect("publish");
        }
    }
    producer.shutdown().await.expect("producer shutdown");
}

/// Sync so the lock guards never straddle an await point: asserts the full routing contract.
fn assert_keyed_routing(inner: &LanesInner) {
    assert_eq!(
        inner.processed.load(Ordering::Relaxed),
        KEYED_EXPECTED,
        "every published delivery was handled"
    );
    assert_eq!(
        inner.violations.load(Ordering::Relaxed),
        0,
        "a partition key must never be inside the handler on two lanes at once"
    );

    // Snapshot the maps and release the guards at once, so no lock is held across the asserts.
    let order = inner.order.lock().expect("order lock").clone();
    let workers = inner.workers.lock().expect("workers lock").clone();
    let mut all_lanes: HashSet<String> = HashSet::new();
    for t in 0..KEYED_TENANTS {
        let tenant = format!("t{t}");
        let seen = order
            .get(&tenant)
            .unwrap_or_else(|| panic!("{tenant} was handled"));
        let expected: Vec<u64> = (0..KEYED_PER_TENANT)
            .map(|round| (round * KEYED_TENANTS + t) as u64)
            .collect();
        assert_eq!(
            seen, &expected,
            "deliveries for {tenant} must arrive in publish order"
        );
        let lanes_for_key = workers.get(&tenant).expect("worker set");
        assert_eq!(
            lanes_for_key.len(),
            1,
            "every delivery for {tenant} must land on the same lane"
        );
        all_lanes.extend(lanes_for_key.iter().cloned());
    }
    assert!(
        all_lanes.len() > 1,
        "distinct keys must be pinned across several lanes, not funnelled into one"
    );
    assert!(
        inner.max_active.load(Ordering::Relaxed) > 1,
        "distinct keys must be handled in parallel"
    );
}

async fn delete_keyed_queue(url: &str) {
    let cleanup = lapin::Connection::connect(url, lapin::ConnectionProperties::default())
        .await
        .expect("cleanup connect");
    let channel = cleanup.create_channel().await.expect("cleanup channel");
    channel
        .queue_delete(
            KEYED_LANES_QUEUE.into(),
            lapin::options::QueueDeleteOptions::default(),
        )
        .await
        .expect("cleanup queue delete");
    cleanup
        .close(200, "OK".into())
        .await
        .expect("cleanup close");
}

#[tokio::test(flavor = "multi_thread", worker_threads = 4)]
async fn keyed_lanes_pin_each_partition_to_one_ordered_worker() {
    let Some(url) = amqp_url() else { return };

    declare_empty_keyed_queue(&url).await;
    prequeue_keyed_deliveries(&url).await;

    let lanes = Lanes::new();
    let state_lanes = lanes.clone();
    let signal = Arc::clone(&lanes.0);
    let broker = LapinBroker::new(url.clone()).declare_topology(false);
    let app = RustStream::new(AppInfo::new("keyed-lanes", "0.1.0"))
        .on_startup(move |()| {
            let lanes = state_lanes;
            async move { Ok::<_, Infallible>(KeyedState { lanes }) }
        })
        .with_broker(broker, |b| {
            b.include(keyed_handler);
        });

    // The app shuts itself down once every delivery has settled, bounded so a broken routing that
    // never reaches the count fails the test instead of hanging.
    let app_task = tokio::spawn(app.run_until(async move { signal.done.notified().await }));
    tokio::time::timeout(Duration::from_secs(20), app_task)
        .await
        .expect("app reached the expected count and shut down in time")
        .expect("app task did not panic")
        .expect("run_until succeeded");

    assert_keyed_routing(&lanes.0);
    delete_keyed_queue(&url).await;
}

#[tokio::test(flavor = "multi_thread", worker_threads = 2)]
async fn subscribe_fails_without_declaration_when_queue_is_missing() {
    let Some(url) = amqp_url() else { return };
    // No declare_topology: the framework must not create infrastructure on its own.
    let broker = LapinBroker::new(url).declare_topology(false);
    Broker::connect(&broker).await.expect("connect");

    let queue = unique("missing");
    let result = broker.subscribe(RabbitQueue::new(&queue)).await;
    assert!(
        result.is_err(),
        "consuming a nonexistent queue must fail, not create it"
    );

    broker.shutdown().await.expect("shutdown");
}

const CTX_DI_QUEUE: &str = "ruststream-tests-ctx-di";

#[derive(Debug, Deserialize)]
struct CtxDiOrder {
    seq: u64,
}

#[derive(Clone)]
struct CtxDiProbe {
    expected: usize,
    seen: Arc<Mutex<Vec<(String, bool, u64)>>>,
    done: Arc<Notify>,
}

#[derive(FromRef)]
struct CtxDiApp {
    probe: CtxDiProbe,
}

#[subscriber(RabbitQueue::new(CTX_DI_QUEUE))]
async fn ctx_di(
    order: &CtxDiOrder,
    Ctx(routing_key): Ctx<keys::RoutingKey>,
    Ctx(redelivered): Ctx<keys::Redelivered>,
    Ctx(tag): Ctx<keys::DeliveryTag>,
    State(probe): State<CtxDiProbe>,
) -> HandlerResult {
    {
        let mut seen = probe.seen.lock().expect("seen mutex poisoned");
        assert_eq!(order.seq, seen.len() as u64, "prequeued order preserved");
        seen.push((routing_key, redelivered, tag));
        if seen.len() < probe.expected {
            return HandlerResult::Ack;
        }
    }
    probe.done.notify_waiters();
    HandlerResult::Ack
}

#[tokio::test(flavor = "multi_thread", worker_threads = 2)]
async fn ctx_extractors_inject_delivery_fields() {
    const COUNT: usize = 3;

    let Some(url) = amqp_url() else { return };

    // Declare the queue up front and prequeue the deliveries, so the app consumes a known set.
    let setup = lapin::Connection::connect(&url, lapin::ConnectionProperties::default())
        .await
        .expect("setup connect");
    let channel = setup.create_channel().await.expect("setup channel");
    let _ = channel
        .queue_delete(
            CTX_DI_QUEUE.into(),
            lapin::options::QueueDeleteOptions::default(),
        )
        .await;
    channel
        .queue_declare(
            CTX_DI_QUEUE.into(),
            lapin::options::QueueDeclareOptions {
                durable: true,
                ..Default::default()
            },
            lapin::types::FieldTable::default(),
        )
        .await
        .expect("setup queue declare");
    for seq in 0..COUNT {
        let payload = format!(r#"{{"seq":{seq}}}"#);
        channel
            .basic_publish(
                "".into(),
                CTX_DI_QUEUE.into(),
                lapin::options::BasicPublishOptions::default(),
                payload.as_bytes(),
                lapin::BasicProperties::default(),
            )
            .await
            .expect("setup publish")
            .await
            .expect("setup confirm");
    }
    setup.close(200, "OK".into()).await.expect("setup close");

    let probe = CtxDiProbe {
        expected: COUNT,
        seen: Arc::new(Mutex::new(Vec::new())),
        done: Arc::new(Notify::new()),
    };
    let app_probe = probe.clone();
    let done = Arc::clone(&probe.done);
    let broker = LapinBroker::new(url.clone()).declare_topology(false);
    let app = RustStream::new(AppInfo::new("ctx-di", "0.1.0"))
        .on_startup(move |()| {
            let probe = app_probe;
            async move { Ok::<_, Infallible>(CtxDiApp { probe }) }
        })
        .with_broker(broker, |b| {
            b.include(ctx_di);
        });

    let app_task = tokio::spawn(app.run_until(async move { done.notified().await }));
    tokio::time::timeout(Duration::from_secs(20), app_task)
        .await
        .expect("app consumed the prequeued deliveries in time")
        .expect("app task did not panic")
        .expect("run_until succeeded");

    let seen = probe.seen.lock().expect("seen mutex poisoned").clone();
    assert_eq!(seen.len(), COUNT);
    for (index, (routing_key, redelivered, tag)) in seen.iter().enumerate() {
        assert_eq!(
            routing_key, CTX_DI_QUEUE,
            "the routing key must be the queue name on the default exchange",
        );
        assert!(
            !redelivered,
            "fresh deliveries must not be flagged redelivered"
        );
        assert_eq!(
            *tag,
            index as u64 + 1,
            "delivery tags must be channel-local and increasing",
        );
    }
}