scatter-proxy 0.3.0

Async request scheduler for unreliable SOCKS5 proxies — multi-path race for maximum throughput
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
use std::collections::HashSet;
use std::collections::VecDeque;
use std::future::Future;
use std::pin::Pin;
use std::sync::atomic::{AtomicU64, Ordering};
use std::sync::Mutex;
use std::task::{Context, Poll};
use std::time::Duration;

use bytes::Bytes;
use http::{HeaderMap, StatusCode};
use tokio::sync::{oneshot, Notify, Semaphore};

use crate::error::ScatterProxyError;

/// Response from a successful proxied request.
#[derive(Debug)]
pub struct ScatterResponse {
    pub status: StatusCode,
    pub headers: HeaderMap,
    pub body: Bytes,
}

/// Handle returned to the caller when a task is submitted.
///
/// Implements `Future<Output = ScatterResponse>` — awaiting it blocks until
/// the scheduler delivers a successful response.  It will **never** resolve
/// to an error; the scheduler retries internally forever.
///
/// To add a caller-side deadline use [`TaskHandle::with_timeout`].
#[derive(Debug)]
pub struct TaskHandle {
    rx: oneshot::Receiver<ScatterResponse>,
}

impl TaskHandle {
    /// Await the result with a caller-side timeout.
    ///
    /// Returns `Ok(response)` if the task completes in time, or
    /// `Err(ScatterProxyError::Timeout)` if the deadline elapses.
    ///
    /// ```ignore
    /// let resp = handle.with_timeout(Duration::from_secs(30)).await?;
    /// ```
    pub async fn with_timeout(
        self,
        duration: Duration,
    ) -> Result<ScatterResponse, ScatterProxyError> {
        match tokio::time::timeout(duration, self).await {
            Ok(resp) => Ok(resp),
            Err(_) => Err(ScatterProxyError::Timeout { elapsed: duration }),
        }
    }
}

impl Future for TaskHandle {
    type Output = ScatterResponse;

    fn poll(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Self::Output> {
        match Pin::new(&mut self.rx).poll(cx) {
            Poll::Ready(Ok(resp)) => Poll::Ready(resp),
            Poll::Ready(Err(_)) => {
                // Channel closed without sending — should not happen in normal
                // operation.  Return a synthetic 502 so the caller never panics.
                Poll::Ready(ScatterResponse {
                    status: StatusCode::BAD_GATEWAY,
                    headers: HeaderMap::new(),
                    body: Bytes::from_static(
                        b"scatter-proxy: internal error - task channel closed",
                    ),
                })
            }
            Poll::Pending => Poll::Pending,
        }
    }
}

/// Internal task entry stored in the pool queue.
pub(crate) struct TaskEntry {
    #[allow(dead_code)]
    pub id: u64,
    pub request: reqwest::Request,
    pub host: String,
    /// How many scheduling rounds this task has been through (for logging).
    pub attempts: usize,
    /// Sender half — the scheduler sends the final `ScatterResponse` here.
    pub result_tx: Option<oneshot::Sender<ScatterResponse>>,
    /// Description of the last failure (for debug logging).
    pub last_error: String,
}

/// Thread-safe, bounded task pool with async back-pressure.
///
/// *   [`submit`](TaskPool::submit) — blocks until capacity is available.
/// *   [`try_submit`](TaskPool::try_submit) — returns immediately with `Err(PoolFull)` when full.
/// *   [`submit_timeout`](TaskPool::submit_timeout) — blocks up to a deadline.
pub struct TaskPool {
    queue: Mutex<VecDeque<TaskEntry>>,
    capacity: usize,
    /// Semaphore that tracks how many *task slots* are free.
    /// A permit is acquired on submit and released when the task permanently
    /// leaves the system (success delivered to the caller).
    capacity_sem: Semaphore,
    next_id: AtomicU64,
    /// Wakes the scheduler when new work is enqueued.
    notify: Notify,
    completed: AtomicU64,
    failed: AtomicU64,
}

impl TaskPool {
    /// Create a new task pool with the given maximum capacity.
    pub fn new(capacity: usize) -> Self {
        Self {
            queue: Mutex::new(VecDeque::new()),
            capacity,
            capacity_sem: Semaphore::new(capacity),
            next_id: AtomicU64::new(1),
            notify: Notify::new(),
            completed: AtomicU64::new(0),
            failed: AtomicU64::new(0),
        }
    }

    // ── submit variants ─────────────────────────────────────────────────

    /// Submit a request, **blocking** until the pool has capacity.
    ///
    /// Returns a [`TaskHandle`] whose `.await` blocks until a proxied response
    /// is obtained.
    pub async fn submit(&self, request: reqwest::Request) -> TaskHandle {
        // Wait for a free slot.
        let permit = self
            .capacity_sem
            .acquire()
            .await
            .expect("capacity semaphore closed");
        permit.forget(); // we manually add_permits in mark_completed

        self.enqueue(request)
    }

    /// Non-blocking submit.  Returns `Err(PoolFull)` when the pool is at capacity.
    pub fn try_submit(&self, request: reqwest::Request) -> Result<TaskHandle, ScatterProxyError> {
        let permit = self
            .capacity_sem
            .try_acquire()
            .map_err(|_| ScatterProxyError::PoolFull {
                capacity: self.capacity,
            })?;
        permit.forget();
        Ok(self.enqueue(request))
    }

    /// Submit with a caller-side timeout on the *submission* itself.
    ///
    /// Blocks up to `timeout` waiting for pool capacity.  Returns
    /// `Err(Timeout)` if the deadline elapses before a slot opens.
    pub async fn submit_timeout(
        &self,
        request: reqwest::Request,
        timeout: Duration,
    ) -> Result<TaskHandle, ScatterProxyError> {
        match tokio::time::timeout(timeout, self.submit(request)).await {
            Ok(handle) => Ok(handle),
            Err(_) => Err(ScatterProxyError::Timeout { elapsed: timeout }),
        }
    }

    // ── batch variants ──────────────────────────────────────────────────

    /// Submit a batch of requests, **blocking** until pool capacity is available
    /// for each one (sequentially).
    pub async fn submit_batch(&self, requests: Vec<reqwest::Request>) -> Vec<TaskHandle> {
        let mut handles = Vec::with_capacity(requests.len());
        for req in requests {
            handles.push(self.submit(req).await);
        }
        handles
    }

    /// Non-blocking atomic batch submit.  If there is not enough room for the
    /// **entire** batch, no tasks are added and `Err(PoolFull)` is returned.
    pub fn try_submit_batch(
        &self,
        requests: Vec<reqwest::Request>,
    ) -> Result<Vec<TaskHandle>, ScatterProxyError> {
        let count = requests.len();
        if count == 0 {
            return Ok(Vec::new());
        }

        // Try to acquire `count` permits at once.
        let permit = self
            .capacity_sem
            .try_acquire_many(count as u32)
            .map_err(|_| ScatterProxyError::PoolFull {
                capacity: self.capacity,
            })?;
        permit.forget();

        let mut handles = Vec::with_capacity(count);
        for req in requests {
            handles.push(self.enqueue(req));
        }
        Ok(handles)
    }

    // ── internal ────────────────────────────────────────────────────────

    /// Construct a `TaskEntry`, push it onto the queue, wake the scheduler,
    /// and return the handle.  Caller **must** have already acquired a
    /// capacity permit.
    fn enqueue(&self, request: reqwest::Request) -> TaskHandle {
        let host = request.url().host_str().unwrap_or("unknown").to_string();
        let (tx, rx) = oneshot::channel();
        let id = self.next_id.fetch_add(1, Ordering::Relaxed);

        let entry = TaskEntry {
            id,
            request,
            host,
            attempts: 0,
            result_tx: Some(tx),
            last_error: String::new(),
        };

        {
            let mut queue = self.queue.lock().unwrap();
            queue.push_back(entry);
        }

        self.notify.notify_one();
        TaskHandle { rx }
    }

    // ── scheduler helpers ───────────────────────────────────────────────

    /// Pick the next eligible task from the front of the queue.
    ///
    /// Tasks whose host appears in `skip_hosts` (e.g. circuit-broken hosts) are
    /// left in the queue.  Returns `None` when no eligible task is found.
    pub(crate) fn pick_next(&self, skip_hosts: &HashSet<String>) -> Option<TaskEntry> {
        let mut queue = self.queue.lock().unwrap();
        let len = queue.len();

        for i in 0..len {
            if let Some(entry) = queue.get(i) {
                if !skip_hosts.contains(&entry.host) {
                    return queue.remove(i);
                }
            }
        }

        None
    }

    /// Push a task back to the tail of the queue for retry.
    pub(crate) fn push_back(&self, entry: TaskEntry) {
        {
            let mut queue = self.queue.lock().unwrap();
            queue.push_back(entry);
        }
        self.notify.notify_one();
    }

    /// Number of tasks currently waiting in the queue.
    pub fn pending_count(&self) -> usize {
        let queue = self.queue.lock().unwrap();
        queue.len()
    }

    /// Total number of tasks that completed successfully.
    pub fn completed_count(&self) -> u64 {
        self.completed.load(Ordering::Relaxed)
    }

    /// Increment the completed counter **and** release one capacity-semaphore
    /// permit so that a blocked [`submit`](TaskPool::submit) can proceed.
    pub(crate) fn mark_completed(&self) {
        self.completed.fetch_add(1, Ordering::Relaxed);
        self.capacity_sem.add_permits(1);
    }

    /// Increment the failed counter and release one capacity-semaphore permit.
    /// Used for unrecoverable tasks (e.g. non-cloneable body).
    pub(crate) fn mark_failed(&self) {
        self.failed.fetch_add(1, Ordering::Relaxed);
        self.capacity_sem.add_permits(1);
    }

    /// Total number of tasks that failed unrecoverably.
    pub fn failed_count(&self) -> u64 {
        self.failed.load(Ordering::Relaxed)
    }

    /// Wait until a task becomes available (a task is submitted or pushed back).
    #[allow(dead_code)]
    pub(crate) async fn notified(&self) {
        self.notify.notified().await;
    }
}

// ─── Tests ───────────────────────────────────────────────────────────────────

#[cfg(test)]
mod tests {
    use super::*;

    /// Build a trivial GET request for testing.
    fn test_request() -> reqwest::Request {
        reqwest::Client::new()
            .get("http://example.com/test")
            .build()
            .unwrap()
    }

    // ── pool basics ─────────────────────────────────────────────────────

    #[test]
    fn new_pool_has_zero_pending() {
        let pool = TaskPool::new(10);
        assert_eq!(pool.pending_count(), 0);
        assert_eq!(pool.completed_count(), 0);
    }

    // ── try_submit ──────────────────────────────────────────────────────

    #[test]
    fn try_submit_increments_pending_count() {
        let pool = TaskPool::new(10);
        let _h1 = pool.try_submit(test_request()).unwrap();
        let _h2 = pool.try_submit(test_request()).unwrap();
        assert_eq!(pool.pending_count(), 2);
    }

    #[test]
    fn try_submit_returns_pool_full_when_at_capacity() {
        let pool = TaskPool::new(2);
        let _h1 = pool.try_submit(test_request()).unwrap();
        let _h2 = pool.try_submit(test_request()).unwrap();
        let result = pool.try_submit(test_request());
        assert!(result.is_err());
        match result.unwrap_err() {
            ScatterProxyError::PoolFull { capacity } => assert_eq!(capacity, 2),
            other => panic!("expected PoolFull, got {other:?}"),
        }
    }

    #[test]
    fn try_submit_assigns_incrementing_ids() {
        let pool = TaskPool::new(10);
        let _h1 = pool.try_submit(test_request()).unwrap();
        let _h2 = pool.try_submit(test_request()).unwrap();

        let skip = HashSet::new();
        let t1 = pool.pick_next(&skip).unwrap();
        let t2 = pool.pick_next(&skip).unwrap();
        assert!(t2.id > t1.id);
    }

    #[test]
    fn try_submit_extracts_host_from_url() {
        let pool = TaskPool::new(10);
        let _h = pool.try_submit(test_request()).unwrap();
        let skip = HashSet::new();
        let task = pool.pick_next(&skip).unwrap();
        assert_eq!(task.host, "example.com");
    }

    // ── try_submit_batch ────────────────────────────────────────────────

    #[test]
    fn try_submit_batch_adds_all_tasks() {
        let pool = TaskPool::new(10);
        let reqs = vec![test_request(), test_request(), test_request()];
        let handles = pool.try_submit_batch(reqs).unwrap();
        assert_eq!(handles.len(), 3);
        assert_eq!(pool.pending_count(), 3);
    }

    #[test]
    fn try_submit_batch_atomic_rejection_when_pool_full() {
        let pool = TaskPool::new(2);
        let reqs = vec![test_request(), test_request(), test_request()];
        let result = pool.try_submit_batch(reqs);
        assert!(result.is_err());
        assert_eq!(pool.pending_count(), 0);
    }

    #[test]
    fn try_submit_batch_empty_vec_is_ok() {
        let pool = TaskPool::new(10);
        let handles = pool.try_submit_batch(vec![]).unwrap();
        assert!(handles.is_empty());
    }

    // ── async submit ────────────────────────────────────────────────────

    #[tokio::test]
    async fn submit_blocks_then_proceeds_after_mark_completed() {
        let pool = std::sync::Arc::new(TaskPool::new(1));
        // Fill the pool.
        let _h1 = pool.try_submit(test_request()).unwrap();

        let pool2 = pool.clone();
        let join = tokio::spawn(async move {
            // This should block because the pool is full.
            let _handle = pool2.submit(test_request()).await;
        });

        // Give the spawned task a moment to park on the semaphore.
        tokio::time::sleep(Duration::from_millis(50)).await;
        assert_eq!(pool.pending_count(), 1); // only the first task

        // Free a slot.
        {
            let skip = HashSet::new();
            let _task = pool.pick_next(&skip).unwrap();
            pool.mark_completed();
        }

        // Now the spawned submit should unblock.
        join.await.unwrap();
        assert_eq!(pool.pending_count(), 1);
    }

    #[tokio::test]
    async fn submit_timeout_returns_err_on_expiry() {
        let pool = TaskPool::new(1);
        let _h1 = pool.try_submit(test_request()).unwrap();

        let result = pool
            .submit_timeout(test_request(), Duration::from_millis(50))
            .await;
        assert!(result.is_err());
        match result.unwrap_err() {
            ScatterProxyError::Timeout { elapsed } => {
                assert_eq!(elapsed, Duration::from_millis(50));
            }
            other => panic!("expected Timeout, got {other:?}"),
        }
    }

    #[tokio::test]
    async fn submit_batch_processes_all() {
        let pool = TaskPool::new(10);
        let reqs = vec![test_request(), test_request()];
        let handles = pool.submit_batch(reqs).await;
        assert_eq!(handles.len(), 2);
        assert_eq!(pool.pending_count(), 2);
    }

    // ── pick_next ───────────────────────────────────────────────────────

    #[test]
    fn pick_next_returns_fifo_order() {
        let pool = TaskPool::new(10);
        let _h1 = pool.try_submit(test_request()).unwrap();
        let _h2 = pool.try_submit(test_request()).unwrap();

        let skip = HashSet::new();
        let t1 = pool.pick_next(&skip).unwrap();
        let t2 = pool.pick_next(&skip).unwrap();
        assert!(t1.id < t2.id);
    }

    #[test]
    fn pick_next_skips_circuit_broken_hosts() {
        let pool = TaskPool::new(10);
        let _h1 = pool.try_submit(test_request()).unwrap(); // example.com

        let mut skip = HashSet::new();
        skip.insert("example.com".into());
        assert!(pool.pick_next(&skip).is_none());
    }

    #[test]
    fn pick_next_returns_none_when_all_hosts_skipped() {
        let pool = TaskPool::new(10);
        let _h1 = pool.try_submit(test_request()).unwrap();
        let _h2 = pool.try_submit(test_request()).unwrap();

        let mut skip = HashSet::new();
        skip.insert("example.com".into());
        assert!(pool.pick_next(&skip).is_none());
        assert_eq!(pool.pending_count(), 2);
    }

    #[test]
    fn pick_next_returns_none_when_empty() {
        let pool = TaskPool::new(10);
        let skip = HashSet::new();
        assert!(pool.pick_next(&skip).is_none());
    }

    #[test]
    fn pick_next_selects_first_non_skipped_preserves_order() {
        let pool = TaskPool::new(10);
        // Task 1: example.com
        let _h1 = pool.try_submit(test_request()).unwrap();
        // Task 2: other.com
        let req2 = reqwest::Client::new()
            .get("http://other.com/path")
            .build()
            .unwrap();
        let _h2 = pool.try_submit(req2).unwrap();
        // Task 3: example.com
        let _h3 = pool.try_submit(test_request()).unwrap();

        let mut skip = HashSet::new();
        skip.insert("example.com".into());

        let picked = pool.pick_next(&skip).unwrap();
        assert_eq!(picked.host, "other.com");
        assert_eq!(pool.pending_count(), 2);
    }

    // ── push_back ───────────────────────────────────────────────────────

    #[test]
    fn push_back_requeues_to_tail() {
        let pool = TaskPool::new(10);
        let _h1 = pool.try_submit(test_request()).unwrap();
        let _h2 = pool.try_submit(test_request()).unwrap();

        let skip = HashSet::new();
        let t1 = pool.pick_next(&skip).unwrap();
        let id1 = t1.id;
        pool.push_back(t1);

        // t1 should now be after t2.
        let t2 = pool.pick_next(&skip).unwrap();
        let re_t1 = pool.pick_next(&skip).unwrap();
        assert!(t2.id < id1 || re_t1.id == id1);
    }

    // ── mark_completed ──────────────────────────────────────────────────

    #[test]
    fn mark_completed_increments_counter() {
        let pool = TaskPool::new(10);
        pool.mark_completed();
        assert_eq!(pool.completed_count(), 1);
    }

    // ── TaskHandle ──────────────────────────────────────────────────────

    #[tokio::test]
    async fn task_handle_receives_success() {
        let pool = TaskPool::new(10);
        let handle = pool.try_submit(test_request()).unwrap();

        let skip = HashSet::new();
        let mut task = pool.pick_next(&skip).unwrap();
        if let Some(tx) = task.result_tx.take() {
            let _ = tx.send(ScatterResponse {
                status: StatusCode::OK,
                headers: HeaderMap::new(),
                body: Bytes::from_static(b"hello"),
            });
        }

        let resp = handle.await;
        assert_eq!(resp.status, StatusCode::OK);
        assert_eq!(resp.body.as_ref(), b"hello");
    }

    #[tokio::test]
    async fn task_handle_returns_502_when_sender_dropped() {
        let pool = TaskPool::new(10);
        let handle = pool.try_submit(test_request()).unwrap();

        // Pick and drop the task without sending a response.
        let skip = HashSet::new();
        let _task = pool.pick_next(&skip).unwrap();
        drop(_task);

        let resp = handle.await;
        assert_eq!(resp.status, StatusCode::BAD_GATEWAY);
    }

    #[tokio::test]
    async fn task_handle_with_timeout_ok() {
        let pool = TaskPool::new(10);
        let handle = pool.try_submit(test_request()).unwrap();

        let skip = HashSet::new();
        let mut task = pool.pick_next(&skip).unwrap();
        if let Some(tx) = task.result_tx.take() {
            let _ = tx.send(ScatterResponse {
                status: StatusCode::OK,
                headers: HeaderMap::new(),
                body: Bytes::from_static(b"ok"),
            });
        }

        let resp = handle.with_timeout(Duration::from_secs(5)).await.unwrap();
        assert_eq!(resp.status, StatusCode::OK);
    }

    #[tokio::test]
    async fn task_handle_with_timeout_expires() {
        let pool = TaskPool::new(10);
        let handle = pool.try_submit(test_request()).unwrap();

        let result = handle.with_timeout(Duration::from_millis(50)).await;
        assert!(result.is_err());
    }

    // ── notified ────────────────────────────────────────────────────────

    #[tokio::test]
    async fn notified_wakes_on_try_submit() {
        let pool = std::sync::Arc::new(TaskPool::new(10));
        let pool2 = pool.clone();

        let waiter = tokio::spawn(async move {
            pool2.notified().await;
            true
        });

        tokio::time::sleep(Duration::from_millis(20)).await;
        let _h = pool.try_submit(test_request()).unwrap();

        assert!(waiter.await.unwrap());
    }

    #[tokio::test]
    async fn notified_wakes_on_push_back() {
        let pool = std::sync::Arc::new(TaskPool::new(10));
        let _h = pool.try_submit(test_request()).unwrap();

        let skip = HashSet::new();
        let task = pool.pick_next(&skip).unwrap();

        let pool2 = pool.clone();
        let waiter = tokio::spawn(async move {
            pool2.notified().await;
            true
        });

        tokio::time::sleep(Duration::from_millis(20)).await;
        pool.push_back(task);

        assert!(waiter.await.unwrap());
    }

    // ── edge cases ──────────────────────────────────────────────────────

    #[test]
    fn pool_with_zero_capacity_rejects_everything() {
        let pool = TaskPool::new(0);
        let result = pool.try_submit(test_request());
        assert!(result.is_err());
    }

    #[test]
    fn pool_allows_try_submit_after_mark_completed_frees_space() {
        let pool = TaskPool::new(1);
        let _h1 = pool.try_submit(test_request()).unwrap();
        // Pool is full.
        assert!(pool.try_submit(test_request()).is_err());

        // Simulate task completion.
        let skip = HashSet::new();
        let _task = pool.pick_next(&skip).unwrap();
        pool.mark_completed();

        // Now there's room again.
        let _h2 = pool.try_submit(test_request()).unwrap();
    }

    #[test]
    fn task_entry_has_correct_defaults_on_try_submit() {
        let pool = TaskPool::new(10);
        let _h = pool.try_submit(test_request()).unwrap();

        let skip = HashSet::new();
        let task = pool.pick_next(&skip).unwrap();
        assert_eq!(task.attempts, 0);
        assert!(task.last_error.is_empty());
        assert!(task.result_tx.is_some());
    }

    #[test]
    fn scatter_response_debug() {
        let resp = ScatterResponse {
            status: StatusCode::OK,
            headers: HeaderMap::new(),
            body: Bytes::from_static(b"test"),
        };
        let dbg = format!("{resp:?}");
        assert!(dbg.contains("200"));
    }
}