qrusty 0.20.4

A trusty priority queue server built with Rust
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
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
// tests/memory_storage_tests.rs
// Verifies: SYS-0013

//! Unit tests for the in-memory storage backend.
//! Mirrors the core test cases from storage_tests.rs to ensure identical behavior.

use chrono::Utc;
use qrusty::api::StorageApi;
use qrusty::memory_storage::MemoryStorage;
use qrusty::message::{Message, Priority, PriorityOrdering, QueueConfig};
use qrusty::storage::RenameQueueError;

fn create_test_message(queue: &str, priority: u64, payload: &str) -> Message {
    Message {
        id: uuid::Uuid::new_v4().to_string(),
        queue: queue.to_string(),
        priority: Priority::Numeric(priority),
        payload: payload.to_string(),
        created_at: Utc::now(),
        locked_until: None,
        locked_by: None,
        retry_count: 0,
        max_retries: 3,
        payload_ref: None,
        payload_hash: None,
    }
}

fn init_tracing() {
    let _ = tracing_subscriber::fmt()
        .with_max_level(tracing::Level::DEBUG)
        .with_test_writer()
        .try_init();
}

#[tokio::test]
async fn test_memory_push_and_pop() {
    init_tracing();
    let storage = MemoryStorage::new();
    let msg = create_test_message("q1", 100, r#"{"hello":"world"}"#);
    let msg_id = msg.id.clone();

    let returned_id = storage.push(msg).await.unwrap();
    assert_eq!(returned_id, msg_id);

    let popped = storage.pop("q1", "consumer1", 30).await.unwrap();
    assert!(popped.is_some());

    let popped_msg = popped.unwrap();
    assert_eq!(popped_msg.id, msg_id);
    assert_eq!(popped_msg.retry_count, 1);
    assert!(popped_msg.locked_until.is_some());
    assert_eq!(popped_msg.locked_by, Some("consumer1".to_string()));
}

#[tokio::test]
async fn test_memory_priority_ordering_max_first() {
    init_tracing();
    let storage = MemoryStorage::new();
    storage
        .create_queue(
            "pq",
            QueueConfig {
                ordering: PriorityOrdering::MaxFirst,
                ..Default::default()
            },
        )
        .await;

    // Push in mixed order
    for (prio, payload) in [(50, "mid"), (100, "high"), (10, "low")] {
        storage
            .push(create_test_message("pq", prio, payload))
            .await
            .unwrap();
    }

    // Pop should come out highest first
    let m1 = storage.pop("pq", "c", 30).await.unwrap().unwrap();
    let m2 = storage.pop("pq", "c", 30).await.unwrap().unwrap();
    let m3 = storage.pop("pq", "c", 30).await.unwrap().unwrap();

    assert_eq!(m1.payload, "high");
    assert_eq!(m2.payload, "mid");
    assert_eq!(m3.payload, "low");
}

#[tokio::test]
async fn test_memory_priority_ordering_min_first() {
    init_tracing();
    let storage = MemoryStorage::new();
    storage
        .create_queue(
            "mq",
            QueueConfig {
                ordering: PriorityOrdering::MinFirst,
                ..Default::default()
            },
        )
        .await;

    for (prio, payload) in [(50, "mid"), (100, "high"), (10, "low")] {
        storage
            .push(create_test_message("mq", prio, payload))
            .await
            .unwrap();
    }

    let m1 = storage.pop("mq", "c", 30).await.unwrap().unwrap();
    let m2 = storage.pop("mq", "c", 30).await.unwrap().unwrap();
    let m3 = storage.pop("mq", "c", 30).await.unwrap().unwrap();

    assert_eq!(m1.payload, "low");
    assert_eq!(m2.payload, "mid");
    assert_eq!(m3.payload, "high");
}

#[tokio::test]
async fn test_memory_fifo_ordering() {
    init_tracing();
    let storage = MemoryStorage::new();
    storage
        .create_queue(
            "fq",
            QueueConfig {
                ordering: PriorityOrdering::Fifo,
                ..Default::default()
            },
        )
        .await;

    // Push three with different priorities — should come out in push order
    for i in 0..3 {
        let mut msg = create_test_message("fq", (2 - i) * 100, &format!("msg{}", i));
        // Ensure distinct timestamps
        msg.created_at = Utc::now() + chrono::Duration::milliseconds(i as i64 * 10);
        storage.push(msg).await.unwrap();
    }

    let m1 = storage.pop("fq", "c", 30).await.unwrap().unwrap();
    let m2 = storage.pop("fq", "c", 30).await.unwrap().unwrap();
    let m3 = storage.pop("fq", "c", 30).await.unwrap().unwrap();

    assert_eq!(m1.payload, "msg0");
    assert_eq!(m2.payload, "msg1");
    assert_eq!(m3.payload, "msg2");
}

#[tokio::test]
async fn test_memory_ack_removes() {
    init_tracing();
    let storage = MemoryStorage::new();
    let msg = create_test_message("q", 1, "data");
    let msg_id = msg.id.clone();

    storage.push(msg).await.unwrap();
    storage.pop("q", "c1", 30).await.unwrap().unwrap();

    let acked = storage.ack("q", &msg_id, "c1").await.unwrap();
    assert!(acked);

    // Queue should be empty
    let next = storage.pop("q", "c1", 30).await.unwrap();
    assert!(next.is_none());
}

#[tokio::test]
async fn test_memory_nack_unlocks() {
    init_tracing();
    let storage = MemoryStorage::new();
    let msg = create_test_message("q", 1, "data");
    let msg_id = msg.id.clone();

    storage.push(msg).await.unwrap();
    storage.pop("q", "c1", 30).await.unwrap().unwrap();

    let nacked = storage.nack("q", &msg_id, "c1").await.unwrap();
    assert!(nacked);

    // Message should be available again
    let recovered = storage.pop("q", "c2", 30).await.unwrap().unwrap();
    assert_eq!(recovered.id, msg_id);
    assert_eq!(recovered.retry_count, 2);
}

#[tokio::test]
async fn test_memory_nack_dead_letter() {
    init_tracing();
    let storage = MemoryStorage::new();
    let mut msg = create_test_message("q", 1, "data");
    msg.max_retries = 1;
    let msg_id = msg.id.clone();

    storage.push(msg).await.unwrap();
    storage.pop("q", "c1", 30).await.unwrap().unwrap();

    // retry_count is now 1, which equals max_retries -> DLQ
    let nacked = storage.nack("q", &msg_id, "c1").await.unwrap();
    assert!(nacked);

    // Queue should be empty (message moved to DLQ)
    let next = storage.pop("q", "c1", 30).await.unwrap();
    assert!(next.is_none());
}

#[tokio::test]
async fn test_memory_timeout_unlock() {
    init_tracing();
    let storage = MemoryStorage::new();
    let msg = create_test_message("q", 1, "data");
    let msg_id = msg.id.clone();

    storage.push(msg).await.unwrap();
    storage.pop("q", "c1", 1).await.unwrap().unwrap();

    // Wait for lock to expire
    tokio::time::sleep(tokio::time::Duration::from_secs(2)).await;

    let unlocked = storage.unlock_expired_messages().await.unwrap();
    assert_eq!(unlocked, 1);

    // Message should be available again
    let recovered = storage.pop("q", "c2", 30).await.unwrap().unwrap();
    assert_eq!(recovered.id, msg_id);
}

#[tokio::test]
async fn test_memory_duplicate_rejection() {
    init_tracing();
    let storage = MemoryStorage::new();
    storage
        .create_queue(
            "nodup",
            QueueConfig {
                ordering: PriorityOrdering::MaxFirst,
                allow_duplicates: false,
                ..Default::default()
            },
        )
        .await;

    let msg1 = create_test_message("nodup", 1, "same_payload");
    storage.push(msg1).await.unwrap();

    let msg2 = create_test_message("nodup", 2, "same_payload");
    let result = storage.push(msg2).await;
    assert!(result.is_err());
    assert!(result.unwrap_err().to_string().contains("Duplicate"));
}

#[tokio::test]
async fn test_memory_queue_stats() {
    init_tracing();
    let storage = MemoryStorage::new();

    // Push to two queues
    for i in 0..3 {
        storage
            .push(create_test_message("qa", i, &format!("a{}", i)))
            .await
            .unwrap();
    }
    for i in 0..2 {
        storage
            .push(create_test_message("qb", i, &format!("b{}", i)))
            .await
            .unwrap();
    }

    // Lock one from qa
    storage.pop("qa", "c1", 30).await.unwrap();

    let stats = storage.get_all_queue_stats().await.unwrap();
    assert_eq!(stats.len(), 2);

    let qa_stats = stats.iter().find(|s| s.name == "qa").unwrap();
    assert_eq!(qa_stats.available, 2);
    assert_eq!(qa_stats.locked, 1);
    assert_eq!(qa_stats.total, 3);

    let qb_stats = stats.iter().find(|s| s.name == "qb").unwrap();
    assert_eq!(qb_stats.total, 2);
}

#[tokio::test]
async fn test_memory_delete_queue() {
    init_tracing();
    let storage = MemoryStorage::new();

    storage
        .create_queue(
            "del_q",
            QueueConfig {
                ordering: PriorityOrdering::MaxFirst,
                ..Default::default()
            },
        )
        .await;
    storage
        .push(create_test_message("del_q", 1, "msg1"))
        .await
        .unwrap();
    storage
        .push(create_test_message("del_q", 2, "msg2"))
        .await
        .unwrap();

    assert!(storage.queue_exists("del_q").await.unwrap());

    let deleted = storage.delete_queue("del_q").await.unwrap();
    assert_eq!(deleted, 2);

    assert!(!storage.queue_exists("del_q").await.unwrap());
}

#[tokio::test]
async fn test_memory_purge_queue() {
    init_tracing();
    let storage = MemoryStorage::new();

    storage
        .create_queue(
            "purge_q",
            QueueConfig {
                ordering: PriorityOrdering::MaxFirst,
                ..Default::default()
            },
        )
        .await;
    storage
        .push(create_test_message("purge_q", 1, "msg1"))
        .await
        .unwrap();
    storage
        .push(create_test_message("purge_q", 2, "msg2"))
        .await
        .unwrap();

    let purged = storage.purge_queue("purge_q").await.unwrap();
    assert_eq!(purged, 2);

    // Queue should still exist but be empty
    assert!(storage.queue_exists("purge_q").await.unwrap());
    let stats = storage.get_queue_stats("purge_q").await.unwrap();
    assert_eq!(stats.total, 0);
}

#[tokio::test]
async fn test_memory_rename_queue() {
    init_tracing();
    let storage = MemoryStorage::new();

    storage
        .create_queue(
            "old_name",
            QueueConfig {
                ordering: PriorityOrdering::MinFirst,
                ..Default::default()
            },
        )
        .await;
    storage
        .push(create_test_message("old_name", 1, "msg1"))
        .await
        .unwrap();
    storage
        .push(create_test_message("old_name", 2, "msg2"))
        .await
        .unwrap();

    storage.rename_queue("old_name", "new_name").await.unwrap();

    assert!(!storage.queue_exists("old_name").await.unwrap());
    assert!(storage.queue_exists("new_name").await.unwrap());

    let stats = storage.get_queue_stats("new_name").await.unwrap();
    assert_eq!(stats.total, 2);
    assert_eq!(stats.config.ordering, PriorityOrdering::MinFirst);
}

#[tokio::test]
async fn test_memory_batch_ack() {
    init_tracing();
    let storage = MemoryStorage::new();

    let mut ids = Vec::new();
    for i in 0..3 {
        let msg = create_test_message("bq", i, &format!("msg{}", i));
        ids.push(msg.id.clone());
        storage.push(msg).await.unwrap();
    }

    // Pop all
    for _ in 0..3 {
        storage.pop("bq", "c1", 30).await.unwrap().unwrap();
    }

    let result = storage.batch_ack("bq", "c1", &ids).await.unwrap();
    assert_eq!(result.acked.len(), 3);
    assert!(result.not_found.is_empty());

    // Queue empty
    let stats = storage.get_queue_stats("bq").await.unwrap();
    assert_eq!(stats.total, 0);
}

#[tokio::test]
async fn test_memory_batch_nack() {
    init_tracing();
    let storage = MemoryStorage::new();

    let mut msg1 = create_test_message("bnq", 1, "retry_me");
    msg1.max_retries = 5;
    let id1 = msg1.id.clone();

    let mut msg2 = create_test_message("bnq", 2, "dlq_me");
    msg2.max_retries = 1;
    let id2 = msg2.id.clone();

    storage.push(msg1).await.unwrap();
    storage.push(msg2).await.unwrap();

    // Pop both
    storage.pop("bnq", "c1", 30).await.unwrap().unwrap();
    storage.pop("bnq", "c1", 30).await.unwrap().unwrap();

    let result = storage
        .batch_nack("bnq", "c1", &[id1.clone(), id2.clone()])
        .await
        .unwrap();

    assert_eq!(result.unlocked.len(), 1);
    assert!(result.unlocked.contains(&id1));
    assert_eq!(result.dead_lettered.len(), 1);
    assert!(result.dead_lettered.contains(&id2));
}

#[tokio::test]
async fn test_memory_list_queues() {
    init_tracing();
    let storage = MemoryStorage::new();

    storage
        .push(create_test_message("alpha", 1, "a"))
        .await
        .unwrap();
    storage
        .push(create_test_message("beta", 1, "b"))
        .await
        .unwrap();
    storage
        .push(create_test_message("gamma", 1, "c"))
        .await
        .unwrap();

    let queues = storage.list_queues().await.unwrap();
    assert_eq!(queues, vec!["alpha", "beta", "gamma"]);
}

#[tokio::test]
async fn test_memory_queue_exists() {
    init_tracing();
    let storage = MemoryStorage::new();

    assert!(!storage.queue_exists("missing").await.unwrap());

    storage
        .create_queue(
            "exists",
            QueueConfig {
                ordering: PriorityOrdering::MaxFirst,
                ..Default::default()
            },
        )
        .await;
    assert!(storage.queue_exists("exists").await.unwrap());

    storage.delete_queue("exists").await.unwrap();
    assert!(!storage.queue_exists("exists").await.unwrap());
}

#[tokio::test]
async fn test_memory_renew_lock() {
    init_tracing();
    let storage = MemoryStorage::new();
    let msg = create_test_message("rq", 1, "data");
    let msg_id = msg.id.clone();

    storage.push(msg).await.unwrap();
    let popped = storage.pop("rq", "c1", 5).await.unwrap().unwrap();
    let original_lock = popped.locked_until.unwrap();

    // Renew with a longer timeout
    let renewed = storage.renew("rq", &msg_id, "c1", 60).await.unwrap();
    assert!(renewed);

    // Verify the lock was extended
    let stats_msg = storage.pop("rq", "c1", 30).await.unwrap();
    // Can't pop because it's still locked by c1
    assert!(stats_msg.is_none());

    // Ack the original message
    let acked = storage.ack("rq", &msg_id, "c1").await.unwrap();
    assert!(acked);

    // Verify that renew returns false for wrong consumer
    let msg2 = create_test_message("rq", 1, "data2");
    let msg2_id = msg2.id.clone();
    storage.push(msg2).await.unwrap();
    storage.pop("rq", "c1", 30).await.unwrap();

    let not_renewed = storage
        .renew("rq", &msg2_id, "wrong_consumer", 60)
        .await
        .unwrap();
    assert!(!not_renewed);

    // Verify the lock was actually extended past the original
    let _ = original_lock; // used for conceptual check
}

// ---------------------------------------------------------------------------
// configure_queue: allow_duplicates toggling — covers memory_storage.rs L138-168
// ---------------------------------------------------------------------------

#[tokio::test]
async fn test_configure_queue_disable_duplicates_dedupes_messages() {
    init_tracing();
    let storage = MemoryStorage::new();

    // Start with allow_duplicates = true
    storage
        .create_queue(
            "dup_q",
            QueueConfig {
                allow_duplicates: true,
                ordering: PriorityOrdering::MaxFirst,
                ..Default::default()
            },
        )
        .await;

    // Push three messages with two duplicate payloads
    storage
        .push(create_test_message("dup_q", 1, "payload_a"))
        .await
        .unwrap();
    storage
        .push(create_test_message("dup_q", 2, "payload_a"))
        .await
        .unwrap();
    storage
        .push(create_test_message("dup_q", 3, "payload_b"))
        .await
        .unwrap();

    // Now disable duplicates — should dedupe payload_a down to one message
    storage
        .create_queue(
            "dup_q",
            QueueConfig {
                allow_duplicates: false,
                ordering: PriorityOrdering::MaxFirst,
                ..Default::default()
            },
        )
        .await;

    // Only two distinct payloads should remain (payload_a × 1, payload_b × 1)
    let stats = storage.get_queue_stats("dup_q").await.unwrap();
    assert_eq!(stats.total, 2, "dedup should leave exactly 2 messages");

    // A new push with payload_a must be rejected (payload set is active)
    let dup = create_test_message("dup_q", 5, "payload_a");
    assert!(
        storage.push(dup).await.is_err(),
        "duplicate payload must be rejected after disabling allow_duplicates"
    );
}

#[tokio::test]
async fn test_configure_queue_enable_duplicates_drops_payload_set() {
    init_tracing();
    let storage = MemoryStorage::new();

    // Start with allow_duplicates = false (default dedupe behaviour)
    storage
        .create_queue(
            "nd_q",
            QueueConfig {
                allow_duplicates: false,
                ordering: PriorityOrdering::MaxFirst,
                ..Default::default()
            },
        )
        .await;

    storage
        .push(create_test_message("nd_q", 1, "unique"))
        .await
        .unwrap();

    // Enable duplicates — payload set must be dropped
    storage
        .create_queue(
            "nd_q",
            QueueConfig {
                allow_duplicates: true,
                ordering: PriorityOrdering::MaxFirst,
                ..Default::default()
            },
        )
        .await;

    // Now the same payload can be pushed again
    let dup = create_test_message("nd_q", 2, "unique");
    assert!(
        storage.push(dup).await.is_ok(),
        "duplicate push must succeed after enabling allow_duplicates"
    );
}

// ---------------------------------------------------------------------------
// rename_queue edge cases — covers memory_storage.rs L242-263
// ---------------------------------------------------------------------------

#[tokio::test]
async fn test_memory_rename_queue_same_name_returns_ok() {
    init_tracing();
    let storage = MemoryStorage::new();
    storage
        .push(create_test_message("mem_same", 1, "x"))
        .await
        .unwrap();

    let result = storage.rename_queue("mem_same", "mem_same").await;
    assert!(
        result.is_ok(),
        "rename to same name must succeed: {result:?}"
    );
}

#[tokio::test]
async fn test_memory_rename_queue_not_found_returns_error() {
    init_tracing();
    let storage = MemoryStorage::new();

    let result = storage.rename_queue("ghost", "target").await;
    assert!(
        matches!(result, Err(RenameQueueError::NotFound)),
        "expected NotFound, got {result:?}"
    );
}

#[tokio::test]
async fn test_memory_rename_queue_already_exists_returns_error() {
    init_tracing();
    let storage = MemoryStorage::new();
    storage
        .push(create_test_message("mem_from", 1, "a"))
        .await
        .unwrap();
    storage
        .push(create_test_message("mem_to", 1, "b"))
        .await
        .unwrap();

    let result = storage.rename_queue("mem_from", "mem_to").await;
    assert!(
        matches!(result, Err(RenameQueueError::AlreadyExists)),
        "expected AlreadyExists, got {result:?}"
    );
}

#[tokio::test]
async fn test_memory_rename_queue_empty_name_returns_storage_error() {
    init_tracing();
    let storage = MemoryStorage::new();

    let r1 = storage.rename_queue("", "name").await;
    assert!(matches!(r1, Err(RenameQueueError::Storage(_))));

    let r2 = storage.rename_queue("name", "").await;
    assert!(matches!(r2, Err(RenameQueueError::Storage(_))));
}

// ---------------------------------------------------------------------------
// Text priority (lexicographic ordering) tests
// ---------------------------------------------------------------------------

use qrusty::message::PriorityKind;

fn create_text_msg(queue: &str, priority: &str, payload: &str) -> Message {
    Message {
        id: uuid::Uuid::new_v4().to_string(),
        queue: queue.to_string(),
        priority: Priority::Text(priority.to_string()),
        payload: payload.to_string(),
        created_at: Utc::now(),
        locked_until: None,
        locked_by: None,
        retry_count: 0,
        max_retries: 3,
        payload_ref: None,
        payload_hash: None,
    }
}

#[tokio::test]
async fn test_memory_text_priority_min_first() {
    let storage = MemoryStorage::new();
    let config = QueueConfig {
        ordering: PriorityOrdering::MinFirst,
        priority_kind: PriorityKind::Text,
        ..Default::default()
    };
    storage.create_queue("tmin", config).await;

    storage
        .push(create_text_msg("tmin", "charlie", "c"))
        .await
        .unwrap();
    storage
        .push(create_text_msg("tmin", "alpha", "a"))
        .await
        .unwrap();
    storage
        .push(create_text_msg("tmin", "bravo", "b"))
        .await
        .unwrap();

    let first = storage.pop("tmin", "c1", 30).await.unwrap().unwrap();
    assert_eq!(first.payload, "a");
    let second = storage.pop("tmin", "c2", 30).await.unwrap().unwrap();
    assert_eq!(second.payload, "b");
    let third = storage.pop("tmin", "c3", 30).await.unwrap().unwrap();
    assert_eq!(third.payload, "c");
}

#[tokio::test]
async fn test_memory_text_priority_max_first() {
    let storage = MemoryStorage::new();
    let config = QueueConfig {
        ordering: PriorityOrdering::MaxFirst,
        priority_kind: PriorityKind::Text,
        ..Default::default()
    };
    storage.create_queue("tmax", config).await;

    storage
        .push(create_text_msg("tmax", "alpha", "a"))
        .await
        .unwrap();
    storage
        .push(create_text_msg("tmax", "charlie", "c"))
        .await
        .unwrap();
    storage
        .push(create_text_msg("tmax", "bravo", "b"))
        .await
        .unwrap();

    let first = storage.pop("tmax", "c1", 30).await.unwrap().unwrap();
    assert_eq!(first.payload, "c");
    let second = storage.pop("tmax", "c2", 30).await.unwrap().unwrap();
    assert_eq!(second.payload, "b");
    let third = storage.pop("tmax", "c3", 30).await.unwrap().unwrap();
    assert_eq!(third.payload, "a");
}

#[tokio::test]
async fn test_memory_text_priority_kind_mismatch() {
    let storage = MemoryStorage::new();
    let config = QueueConfig {
        ordering: PriorityOrdering::MinFirst,
        priority_kind: PriorityKind::Text,
        ..Default::default()
    };
    storage.create_queue("tonly", config).await;

    // Numeric on text queue → error
    let msg = create_test_message("tonly", 42, "nope");
    assert!(storage.push(msg).await.is_err());

    // Text on numeric queue → error
    storage.create_queue("nonly", QueueConfig::default()).await;
    let msg = create_text_msg("nonly", "hi", "nope");
    assert!(storage.push(msg).await.is_err());
}

// Verifies: PER-0013
#[tokio::test]
async fn test_memory_delete_queue_removes_dlq_entries() {
    let storage = MemoryStorage::new();

    storage
        .create_queue("dlq_test", QueueConfig::default())
        .await;

    // Push message with max_retries=0 → nack → DLQ
    let mut msg = create_test_message("dlq_test", 100, "will_dlq");
    msg.max_retries = 0;
    let msg_id = msg.id.clone();
    storage.push(msg).await.unwrap();

    let consumed = storage.pop("dlq_test", "c1", 30).await.unwrap().unwrap();
    assert_eq!(consumed.id, msg_id);
    storage.nack("dlq_test", &msg_id, "c1").await.unwrap();

    // No live messages, but DLQ entry exists
    let stats = storage.get_queue_stats("dlq_test").await.unwrap();
    assert_eq!(stats.total, 0);

    // Delete the queue
    storage.delete_queue("dlq_test").await.unwrap();

    // queue_exists must return false
    assert!(!storage.queue_exists("dlq_test").await.unwrap());

    // Re-create must succeed
    storage
        .create_queue("dlq_test", QueueConfig::default())
        .await;
    assert!(storage.queue_exists("dlq_test").await.unwrap());
}

/// Verifies: SCH-0002
#[tokio::test]
async fn test_memory_text_priority_with_slash_min_first() {
    let storage = MemoryStorage::new();
    let config = QueueConfig {
        ordering: PriorityOrdering::MinFirst,
        priority_kind: PriorityKind::Text,
        ..Default::default()
    };
    storage.create_queue("slash_q", config).await;

    storage
        .push(create_text_msg("slash_q", "/usr/local/bin", "bin"))
        .await
        .unwrap();
    storage
        .push(create_text_msg("slash_q", "/usr/local/share", "share"))
        .await
        .unwrap();
    storage
        .push(create_text_msg("slash_q", "/etc/config", "etc"))
        .await
        .unwrap();

    // MinFirst: /etc < /usr/local/bin < /usr/local/share
    let m = storage.pop("slash_q", "c1", 30).await.unwrap().unwrap();
    assert_eq!(m.payload, "etc");
    assert_eq!(m.priority, Priority::Text("/etc/config".to_string()));
    storage.ack("slash_q", &m.id, "c1").await.unwrap();

    let m = storage.pop("slash_q", "c1", 30).await.unwrap().unwrap();
    assert_eq!(m.payload, "bin");
    assert_eq!(m.priority, Priority::Text("/usr/local/bin".to_string()));
    storage.ack("slash_q", &m.id, "c1").await.unwrap();

    let m = storage.pop("slash_q", "c1", 30).await.unwrap().unwrap();
    assert_eq!(m.payload, "share");
    assert_eq!(m.priority, Priority::Text("/usr/local/share".to_string()));
}

/// Verifies: SCH-0002
#[tokio::test]
async fn test_memory_text_priority_with_slash_max_first() {
    let storage = MemoryStorage::new();
    let config = QueueConfig {
        ordering: PriorityOrdering::MaxFirst,
        priority_kind: PriorityKind::Text,
        ..Default::default()
    };
    storage.create_queue("slash_max_q", config).await;

    storage
        .push(create_text_msg("slash_max_q", "/a/first", "first"))
        .await
        .unwrap();
    storage
        .push(create_text_msg("slash_max_q", "/z/last", "last"))
        .await
        .unwrap();

    // MaxFirst: /z > /a
    let m = storage.pop("slash_max_q", "c1", 30).await.unwrap().unwrap();
    assert_eq!(m.payload, "last");
    assert_eq!(m.priority, Priority::Text("/z/last".to_string()));
    storage.ack("slash_max_q", &m.id, "c1").await.unwrap();

    let m = storage.pop("slash_max_q", "c1", 30).await.unwrap().unwrap();
    assert_eq!(m.payload, "first");
    assert_eq!(m.priority, Priority::Text("/a/first".to_string()));
}

/// Verifies: SCH-0002
#[tokio::test]
async fn test_memory_text_priority_slash_stats_not_corrupted() {
    let storage = MemoryStorage::new();
    let config = QueueConfig {
        ordering: PriorityOrdering::MinFirst,
        priority_kind: PriorityKind::Text,
        ..Default::default()
    };
    storage.create_queue("stats_slash_q", config).await;

    storage
        .push(create_text_msg("stats_slash_q", "/a/b/c/d", "p1"))
        .await
        .unwrap();
    storage
        .push(create_text_msg("stats_slash_q", "simple", "p2"))
        .await
        .unwrap();

    let stats = storage.get_queue_stats("stats_slash_q").await.unwrap();
    assert_eq!(stats.total, 2);
    assert_eq!(stats.available, 2);

    let queues = storage.list_queues().await.unwrap();
    assert!(queues.contains(&"stats_slash_q".to_string()));
}

// ---------------------------------------------------------------------------
// force_unlock_queue tests (API-0014)
// ---------------------------------------------------------------------------

/// Verifies: API-0014 — force-unlock removes all locks on a queue (memory backend).
#[tokio::test]
async fn test_memory_force_unlock_queue() {
    let storage = MemoryStorage::new();

    storage
        .create_queue(
            "fu_mem",
            QueueConfig {
                ordering: PriorityOrdering::MaxFirst,
                ..Default::default()
            },
        )
        .await;

    // Push and lock 3 messages.
    for i in 0..3 {
        let msg = create_test_message("fu_mem", 10 + i, &format!("msg-{}", i));
        storage.push(msg).await.unwrap();
    }
    for _ in 0..3 {
        storage.pop("fu_mem", "consumer1", 300).await.unwrap();
    }

    let stats = storage.get_queue_stats("fu_mem").await.unwrap();
    assert_eq!(stats.locked, 3);

    // Force-unlock.
    let unlocked = storage.force_unlock_queue("fu_mem").await.unwrap();
    assert_eq!(unlocked, 3);

    // All messages should be poppable again.
    for _ in 0..3 {
        assert!(storage
            .pop("fu_mem", "consumer2", 300)
            .await
            .unwrap()
            .is_some());
    }
}

/// Verifies: API-0014 — force-unlock on empty queue returns 0 (memory backend).
#[tokio::test]
async fn test_memory_force_unlock_queue_empty() {
    let storage = MemoryStorage::new();
    let unlocked = storage.force_unlock_queue("nonexistent").await.unwrap();
    assert_eq!(unlocked, 0);
}