conproxy 0.2.1

Cache proxy server for heterogeneous RAG/vector search backends with cascade, scope, and MCP
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

#![allow(
    clippy::arithmetic_side_effects,
    clippy::indexing_slicing,
    clippy::unwrap_used,
    clippy::expect_used,
    clippy::panic
)]

use super::*;

#[test]
fn test_priority_ordering() {
    assert!(Priority::Critical > Priority::High);
    assert!(Priority::High > Priority::Normal);
    assert!(Priority::Normal > Priority::Low);
}

#[test]
fn test_priority_from_str() {
    assert_eq!(Priority::parse("low"), Priority::Low);
    assert_eq!(Priority::parse("normal"), Priority::Normal);
    assert_eq!(Priority::parse("high"), Priority::High);
    assert_eq!(Priority::parse("critical"), Priority::Critical);
    assert_eq!(Priority::parse("unknown"), Priority::Normal);
}

#[test]
fn test_priority_from_int() {
    assert_eq!(Priority::from_int(0), Priority::Low);
    assert_eq!(Priority::from_int(1), Priority::Normal);
    assert_eq!(Priority::from_int(2), Priority::High);
    assert_eq!(Priority::from_int(3), Priority::Critical);
    assert_eq!(Priority::from_int(99), Priority::Critical);
}

#[test]
fn test_queue_creation() {
    let queue: PriorityQueue<i32> = PriorityQueue::new(10);
    assert!(queue.is_empty());
    assert_eq!(queue.max_size(), 10);
}

#[test]
fn test_queue_push_pop() {
    let queue = PriorityQueue::new(10);

    queue.push(1, Priority::Normal);
    queue.push(2, Priority::High);
    queue.push(3, Priority::Low);

    // Should pop in priority order
    assert_eq!(queue.pop().unwrap().payload, 2); // High
    assert_eq!(queue.pop().unwrap().payload, 1); // Normal
    assert_eq!(queue.pop().unwrap().payload, 3); // Low
    assert!(queue.pop().is_none());
}

#[test]
fn test_queue_fifo_within_priority() {
    let queue = PriorityQueue::new(10);

    queue.push(1, Priority::Normal);
    queue.push(2, Priority::Normal);
    queue.push(3, Priority::Normal);

    // Should pop in FIFO order within same priority
    assert_eq!(queue.pop().unwrap().payload, 1);
    assert_eq!(queue.pop().unwrap().payload, 2);
    assert_eq!(queue.pop().unwrap().payload, 3);
}

#[test]
fn test_queue_full_rejection() {
    let queue = PriorityQueue::new(2);

    assert!(queue.push(1, Priority::High).is_none()); // Accepted
    assert!(queue.push(2, Priority::High).is_none()); // Accepted
    assert!(queue.push(3, Priority::Normal).is_some()); // Rejected (lower priority)
}

#[test]
fn test_queue_full_eviction() {
    let queue = PriorityQueue::new(2);

    queue.push(1, Priority::Low);
    queue.push(2, Priority::Normal);

    // Higher priority should evict lower
    assert!(queue.push(3, Priority::High).is_none()); // Accepted, evicts Low
    assert_eq!(queue.len(), 2);

    let first = queue.pop().unwrap();
    assert_eq!(first.payload, 3); // High priority
}

#[test]
fn test_queue_stats() {
    let queue = PriorityQueue::new(10);

    queue.push(1, Priority::Low);
    queue.push(2, Priority::Normal);
    queue.push(3, Priority::Normal);
    queue.push(4, Priority::High);

    let stats = queue.stats();
    assert_eq!(stats.total, 4);
    assert_eq!(stats.low_priority, 1);
    assert_eq!(stats.normal_priority, 2);
    assert_eq!(stats.high_priority, 1);
    assert_eq!(stats.critical_priority, 0);
}

#[test]
fn test_queue_clear() {
    let queue = PriorityQueue::new(10);

    queue.push(1, Priority::Normal);
    queue.push(2, Priority::Normal);

    assert_eq!(queue.len(), 2);
    queue.clear();
    assert!(queue.is_empty());
}

#[test]
fn test_prioritized_request_wait_time() {
    let req = PrioritizedRequest::new(42, Priority::Normal, 1);
    std::thread::sleep(std::time::Duration::from_millis(10));
    assert!(req.wait_time() >= std::time::Duration::from_millis(10));
}

#[test]
fn test_queue_utilization() {
    let queue = PriorityQueue::new(10);

    queue.push(1, Priority::Normal);
    queue.push(2, Priority::Normal);
    queue.push(3, Priority::Normal);
    queue.push(4, Priority::Normal);
    queue.push(5, Priority::Normal);

    let stats = queue.stats();
    assert!((stats.utilization() - 0.5).abs() < 0.01);
}

#[test]
fn test_unbounded_queue() {
    let queue: PriorityQueue<i32> = PriorityQueue::unbounded();
    assert_eq!(queue.max_size(), usize::MAX);

    // Should accept many items
    for i in 0..1000 {
        assert!(queue.push(i, Priority::Normal).is_none());
    }
    assert_eq!(queue.len(), 1000);
}