realizar 0.8.5

Pure Rust ML inference engine built from scratch - model serving for GGUF and safetensors
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

    // ========================================================================
    // Deadline Tests
    // ========================================================================

    #[test]
    fn test_deadline_default() {
        let deadline = Deadline::default();
        assert_eq!(deadline.target_latency_ms, 1000);
        assert!(deadline.hard_deadline_ms.is_none());
        assert!((deadline.sla_target - 0.99).abs() < 0.001);
    }

    #[test]
    fn test_deadline_with_target() {
        let deadline = Deadline::with_target(500);
        assert_eq!(deadline.target_latency_ms, 500);
        assert!(deadline.hard_deadline_ms.is_none());
    }

    #[test]
    fn test_deadline_strict() {
        let deadline = Deadline::strict(200, 1000);
        assert_eq!(deadline.target_latency_ms, 200);
        assert_eq!(deadline.hard_deadline_ms, Some(1000));
        assert!((deadline.sla_target - 1.0).abs() < 0.001);
    }

    // ========================================================================
    // DynamicPriorityConfig Tests
    // ========================================================================

    #[test]
    fn test_dynamic_priority_config_default() {
        let config = DynamicPriorityConfig::default();
        assert!(config.enable_age_promotion);
        assert_eq!(config.promotion_interval_ms, 5000);
        assert_eq!(config.max_promoted_priority, Priority::High);
        assert!(config.enable_deadline_scheduling);
        assert!((config.urgency_factor - 2.0).abs() < 0.001);
        assert_eq!(config.min_tokens_per_request, 1);
        assert!(config.enable_fair_share);
    }

    #[test]
    fn test_dynamic_priority_config_with_budgets() {
        let budgets = [0.1, 0.2, 0.3, 0.4];
        let config = DynamicPriorityConfig::with_budgets(budgets);
        assert_eq!(config.priority_budgets, budgets);
    }

    #[test]
    fn test_dynamic_priority_config_no_promotion() {
        let config = DynamicPriorityConfig::default().no_promotion();
        assert!(!config.enable_age_promotion);
    }

    #[test]
    fn test_dynamic_priority_config_with_promotion_interval() {
        let config = DynamicPriorityConfig::default().with_promotion_interval(10000);
        assert_eq!(config.promotion_interval_ms, 10000);
    }

    // ========================================================================
    // BatchConfig Tests
    // ========================================================================

    #[test]
    fn test_batch_config_default() {
        let config = BatchConfig::default();
        assert_eq!(config.max_ubatch_tokens, 512);
        assert_eq!(config.max_sbatch_sequences, 8);
        assert!(config.prefer_pure_decode);
        assert_eq!(config.max_context_length, 2048);
        assert!(config.dynamic_batching);
    }

    #[test]
    fn test_batch_config_with_max_tokens() {
        let config = BatchConfig::default().with_max_tokens(1024);
        assert_eq!(config.max_ubatch_tokens, 1024);
    }

    #[test]
    fn test_batch_config_with_max_sequences() {
        let config = BatchConfig::default().with_max_sequences(16);
        assert_eq!(config.max_sbatch_sequences, 16);
    }

    // ========================================================================
    // DynamicRequest Tests
    // ========================================================================

    #[test]
    fn test_dynamic_request_new() {
        let request = DynamicRequest::new(42, vec![1, 2, 3], 10);
        assert_eq!(request.request_id, 42);
        assert_eq!(request.input_ids, vec![1, 2, 3]);
        assert_eq!(request.max_tokens, 10);
        assert_eq!(request.original_priority, Priority::Normal);
        assert_eq!(request.effective_priority, Priority::Normal);
        assert!(request.deadline.is_none());
        assert_eq!(request.promotions, 0);
        assert_eq!(request.state, SequenceState::Waiting);
        assert!(request.generated_tokens.is_empty());
        assert!(request.seq_id.is_none());
        assert!(request.ttft_ms.is_none());
    }

    #[test]
    fn test_dynamic_request_with_priority() {
        let request = DynamicRequest::new(1, vec![1], 5).with_priority(Priority::Critical);
        assert_eq!(request.original_priority, Priority::Critical);
        assert_eq!(request.effective_priority, Priority::Critical);
    }

    #[test]
    fn test_dynamic_request_with_deadline() {
        let request = DynamicRequest::new(1, vec![1], 5).with_deadline(Deadline::with_target(500));
        assert!(request.deadline.is_some());
        assert_eq!(request.deadline.as_ref().unwrap().target_latency_ms, 500);
    }

    #[test]
    fn test_dynamic_request_wait_time() {
        let request = DynamicRequest::new(1, vec![1], 5);
        // Wait time should be very small (just created)
        assert!(request.wait_time_ms() < 100);
    }

    #[test]
    fn test_dynamic_request_is_urgent_false() {
        let request =
            DynamicRequest::new(1, vec![1], 5).with_deadline(Deadline::with_target(10000));
        // Fresh request is not urgent
        assert!(!request.is_urgent());
    }

    #[test]
    fn test_dynamic_request_is_urgent_no_deadline() {
        let request = DynamicRequest::new(1, vec![1], 5);
        // No deadline means never urgent
        assert!(!request.is_urgent());
    }

    #[test]
    fn test_dynamic_request_is_expired_no_hard_deadline() {
        let request = DynamicRequest::new(1, vec![1], 5).with_deadline(Deadline::with_target(500));
        // No hard deadline, so never expired
        assert!(!request.is_expired());
    }

    #[test]
    fn test_dynamic_request_urgency_score_no_deadline() {
        let request = DynamicRequest::new(1, vec![1], 5);
        assert!((request.urgency_score() - 0.0).abs() < 0.001);
    }

    #[test]
    fn test_dynamic_request_urgency_score_zero_target() {
        let deadline = Deadline {
            target_latency_ms: 0,
            hard_deadline_ms: None,
            sla_target: 0.99,
        };
        let request = DynamicRequest::new(1, vec![1], 5).with_deadline(deadline);
        assert!((request.urgency_score() - 0.0).abs() < 0.001);
    }

    #[test]
    fn test_dynamic_request_remaining_tokens() {
        let mut request = DynamicRequest::new(1, vec![1, 2, 3], 10);
        assert_eq!(request.remaining_tokens(), 10);
        request.generated_tokens = vec![4, 5, 6];
        assert_eq!(request.remaining_tokens(), 7);
    }

    #[test]
    fn test_dynamic_request_remaining_tokens_overflow() {
        let mut request = DynamicRequest::new(1, vec![1], 5);
        request.generated_tokens = vec![1, 2, 3, 4, 5, 6, 7]; // More than max
        assert_eq!(request.remaining_tokens(), 0); // saturating_sub protects
    }

    #[test]
    fn test_dynamic_request_total_tokens() {
        let mut request = DynamicRequest::new(1, vec![1, 2, 3], 10);
        request.generated_tokens = vec![4, 5];
        assert_eq!(request.total_tokens(), 5);
    }

    // ========================================================================
    // DynamicSchedulerStats Tests
    // ========================================================================

    #[test]
    fn test_dynamic_scheduler_stats_default() {
        let stats = DynamicSchedulerStats::default();
        assert_eq!(stats.total_requests, 0);
        assert_eq!(stats.completed_requests, 0);
        assert_eq!(stats.sla_met, 0);
        assert_eq!(stats.sla_missed, 0);
        assert_eq!(stats.dropped_requests, 0);
        assert_eq!(stats.promotions, 0);
        assert!((stats.avg_ttft_ms - 0.0).abs() < 0.001);
        assert!((stats.p99_ttft_ms - 0.0).abs() < 0.001);
        assert_eq!(stats.tokens_by_priority, [0, 0, 0, 0]);
        assert_eq!(stats.queue_depth_by_priority, [0, 0, 0, 0]);
    }

    // ========================================================================
    // DynamicPriorityScheduler Full Coverage Tests
    // ========================================================================

    #[test]
    fn test_dynamic_scheduler_with_config() {
        let config = DynamicPriorityConfig::default().no_promotion();
        let scheduler = DynamicPriorityScheduler::with_config(1024, config);
        assert!(!scheduler.config().enable_age_promotion);
    }

    #[test]
    fn test_dynamic_scheduler_add_request_with_deadline() {
        let mut scheduler = DynamicPriorityScheduler::new(1024);
        let id = scheduler.add_request(
            vec![1, 2, 3],
            10,
            Priority::High,
            Some(Deadline::strict(100, 500)),
        );
        assert_eq!(id, 0);
        let request = scheduler.get_request(id).unwrap();
        assert_eq!(request.original_priority, Priority::High);
        assert!(request.deadline.is_some());
    }

    #[test]
    fn test_dynamic_scheduler_queue_depth() {
        let mut scheduler = DynamicPriorityScheduler::new(1024);
        scheduler.add_request(vec![1], 5, Priority::Low, None);
        scheduler.add_request(vec![2], 5, Priority::Normal, None);
        scheduler.add_request(vec![3], 5, Priority::High, None);
        scheduler.add_request(vec![4], 5, Priority::Critical, None);

        assert_eq!(scheduler.queue_depth(Priority::Low), 1);
        assert_eq!(scheduler.queue_depth(Priority::Normal), 1);
        assert_eq!(scheduler.queue_depth(Priority::High), 1);
        assert_eq!(scheduler.queue_depth(Priority::Critical), 1);
    }

    #[test]
    fn test_dynamic_scheduler_stats_accessor() {
        let scheduler = DynamicPriorityScheduler::new(1024);
        let stats = scheduler.stats();
        assert_eq!(stats.total_requests, 0);
    }

    #[test]
    fn test_dynamic_scheduler_sla_compliance_empty() {
        let scheduler = DynamicPriorityScheduler::new(1024);
        // No requests = 100% compliance
        assert!((scheduler.sla_compliance_rate() - 1.0).abs() < 0.001);
    }

    #[test]
    fn test_dynamic_scheduler_schedule_with_fair_share() {
        let config = DynamicPriorityConfig::default();
        let mut scheduler = DynamicPriorityScheduler::with_config(100, config);

        // Add requests at different priorities
        scheduler.add_request(vec![1], 5, Priority::Low, None);
        scheduler.add_request(vec![2], 5, Priority::Normal, None);
        scheduler.add_request(vec![3], 5, Priority::High, None);

        let scheduled = scheduler.schedule(3);
        // Higher priority should be scheduled first
        assert!(!scheduled.is_empty());
    }

    #[test]
    fn test_dynamic_scheduler_schedule_critical_first() {
        let mut scheduler = DynamicPriorityScheduler::new(1024);

        // Add low priority first
        scheduler.add_request(vec![1], 5, Priority::Low, None);
        // Then critical
        scheduler.add_request(vec![2], 5, Priority::Critical, None);

        let scheduled = scheduler.schedule(1);
        assert_eq!(scheduled.len(), 1);
        // Critical should be scheduled first
        let (id, _tokens) = scheduled[0];
        let request = scheduler.get_request(id).unwrap();
        assert_eq!(request.original_priority, Priority::Critical);
    }

    #[test]
    fn test_dynamic_scheduler_complete_with_sla_met() {
        let mut scheduler = DynamicPriorityScheduler::new(1024);

        // Add request with long target latency (will definitely be met)
        let id = scheduler.add_request(
            vec![1],
            5,
            Priority::Normal,
            Some(Deadline::with_target(60000)),
        );
        scheduler.schedule(1);

        scheduler.complete_request(id);
        assert_eq!(scheduler.stats().sla_met, 1);
        assert_eq!(scheduler.stats().sla_missed, 0);
    }

    #[test]
    fn test_dynamic_scheduler_promote_disabled() {
        let config = DynamicPriorityConfig::default().no_promotion();
        let mut scheduler = DynamicPriorityScheduler::with_config(1024, config);

        scheduler.add_request(vec![1], 5, Priority::Low, None);

        // Promotion is disabled, so this should be a no-op
        scheduler.promote_aged_requests();

        assert_eq!(scheduler.stats().promotions, 0);
    }

    #[test]
    fn test_dynamic_scheduler_schedule_no_slots() {
        let mut scheduler = DynamicPriorityScheduler::new(1024);
        scheduler.add_request(vec![1], 5, Priority::Normal, None);

        // Schedule with 0 available slots
        let scheduled = scheduler.schedule(0);
        assert!(scheduled.is_empty());
    }

    #[test]
    fn test_dynamic_scheduler_schedule_no_budget() {
        let mut scheduler =
            DynamicPriorityScheduler::with_config(0, DynamicPriorityConfig::default());
        scheduler.add_request(vec![1], 5, Priority::Normal, None);

        // Zero budget
        let scheduled = scheduler.schedule(10);
        // With 0 budget and min_tokens_per_request=1, nothing should be scheduled
        assert!(scheduled.is_empty());
    }

    // ========================================================================
    // SequenceBatchEntry Tests
    // ========================================================================

    #[test]
    fn test_sequence_batch_entry_new() {
        let entry = SequenceBatchEntry::new(0, 1, 100);
        assert_eq!(entry.seq_idx, 0);
        assert_eq!(entry.slot_id, 1);
        assert_eq!(entry.request_id, 100);
        assert_eq!(entry.position, 0);
        assert!(entry.tokens.is_empty());
        assert!(entry.is_prefill);
    }

    #[test]
    fn test_sequence_batch_entry_with_tokens() {
        let entry = SequenceBatchEntry::new(0, 1, 100).with_tokens(vec![1, 2, 3]);
        assert_eq!(entry.tokens, vec![1, 2, 3]);
    }

    #[test]
    fn test_sequence_batch_entry_at_position() {
        let entry = SequenceBatchEntry::new(0, 1, 100).at_position(42);
        assert_eq!(entry.position, 42);
    }

    #[test]
    fn test_sequence_batch_entry_decoding() {
        let entry = SequenceBatchEntry::new(0, 1, 100).decoding();
        assert!(!entry.is_prefill);
    }

    #[test]
    fn test_sequence_batch_entry_builder_chain() {
        let entry = SequenceBatchEntry::new(0, 1, 100)
            .with_tokens(vec![10, 20])
            .at_position(5)
            .decoding();
        assert_eq!(entry.tokens, vec![10, 20]);
        assert_eq!(entry.position, 5);
        assert!(!entry.is_prefill);
    }

    // ========================================================================
    // SequenceBatch Tests
    // ========================================================================

    #[test]
    fn test_sequence_batch_full() {
        let mut batch = SequenceBatch::new(2);
        assert!(!batch.is_full());

        batch.add_sequence(SequenceBatchEntry::new(0, 0, 1));
        assert!(!batch.is_full());

        batch.add_sequence(SequenceBatchEntry::new(1, 1, 2));
        assert!(batch.is_full());
    }

    #[test]
    fn test_sequence_batch_add_when_full() {
        let mut batch = SequenceBatch::new(1);
        assert!(batch.add_sequence(SequenceBatchEntry::new(0, 0, 1)));
        assert!(!batch.add_sequence(SequenceBatchEntry::new(1, 1, 2)));
    }

    #[test]
    fn test_sequence_batch_remove_nonexistent() {
        let mut batch = SequenceBatch::new(8);
        batch.add_sequence(SequenceBatchEntry::new(5, 0, 1));
        assert!(batch.remove_sequence(999).is_none());
    }

    #[test]
    fn test_sequence_batch_utilization() {
        let mut batch = SequenceBatch::new(4);
        assert!((batch.utilization - 0.0).abs() < 0.001);

        batch.add_sequence(SequenceBatchEntry::new(0, 0, 1));
        assert!((batch.utilization - 0.25).abs() < 0.001);

        batch.add_sequence(SequenceBatchEntry::new(1, 1, 2));
        assert!((batch.utilization - 0.5).abs() < 0.001);
    }

    #[test]
    fn test_sequence_batch_utilization_zero_max() {
        let batch = SequenceBatch::new(0);
        assert!((batch.utilization - 0.0).abs() < 0.001);
    }