aria2-core 0.3.8

aria2-rust core download engine: multi-protocol segmented downloads, rate limiting, configuration, session persistence, and BitTorrent seeding
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
//! Tests for SegmentMan.

use super::peer_stat::PeerStat;
use super::segment_man_impl::SegmentMan;

use crate::segment::UnknownLengthPieceStorage;
use crate::segment::piece_storage::DefaultPieceStorage;

/// Helper: create a SegmentMan with a DefaultPieceStorage.
fn create_segment_man(piece_length: u64, total_length: u64) -> SegmentMan {
    let mut man = SegmentMan::new(piece_length, total_length);
    let storage = DefaultPieceStorage::new(piece_length, total_length);
    man.set_piece_storage(Box::new(storage));
    man
}

// ── Construction ────────────────────────────────────────────────────

#[test]
fn test_new_initializes_ignore_bitfield() {
    let man = SegmentMan::new(1024 * 1024, 10 * 1024 * 1024);
    // All segments should be ignored by default (filter enabled, all bits set)
    assert!(man.all_segments_ignored());
    assert_eq!(man.total_length(), 10 * 1024 * 1024);
}

#[test]
fn test_init_clears_state() {
    let mut man = create_segment_man(1024, 4096);
    man.register_peer_stat(PeerStat::new(1, "host".to_string(), "http".to_string()));
    man.init();
    assert!(man.peer_stats().is_empty());
    assert!(man.used_segment_entries.is_empty());
}

// ── Segment checkout ────────────────────────────────────────────────

#[test]
fn test_get_segment_returns_pieced_segment() {
    let mut man = create_segment_man(1024 * 1024, 10 * 1024 * 1024);
    // Recognize a range so pieces are selectable
    man.recognize_segment_for(0, 10 * 1024 * 1024);

    let segment = man.get_segment(1, 0);
    assert!(segment.is_some());

    let seg = segment.unwrap();
    assert_eq!(seg.index(), 0);
    assert_eq!(seg.length(), 1024 * 1024);
    assert_eq!(seg.position(), 0);
    assert!(!seg.is_complete());
}

#[test]
fn test_get_segment_returns_none_when_all_done() {
    let mut man = create_segment_man(1024, 4096);
    man.recognize_segment_for(0, 4096);

    // Checkout and complete all 4 pieces
    for _ in 0..4 {
        let seg = man.get_segment(1, 0).unwrap();
        man.complete_segment(1, &seg);
    }

    // No more segments available
    assert!(man.get_segment(1, 0).is_none());
}

#[test]
fn test_get_segment_with_index() {
    let mut man = create_segment_man(1024, 4096);
    man.recognize_segment_for(0, 4096);

    let seg = man.get_segment_with_index(1, 2);
    assert!(seg.is_some());
    assert_eq!(seg.unwrap().index(), 2);
}

#[test]
fn test_get_segment_with_index_out_of_range() {
    let man = create_segment_man(1024, 4096);
    let mut man = man;
    man.recognize_segment_for(0, 4096);

    assert!(man.get_segment_with_index(1, 10).is_none());
}

// ── Segment cancellation ────────────────────────────────────────────

#[test]
fn test_cancel_segment_by_cuid() {
    let mut man = create_segment_man(1024, 4096);
    man.recognize_segment_for(0, 4096);

    // Checkout two segments for CUID 1
    // With Default (sparse) stream selector:
    // - First: piece 0 (range [0,4), start=0)
    // - Second: piece 2 (range [1,4), adjusted to midpoint because piece 0 is in-use)
    let seg1 = man.get_segment(1, 0).unwrap();
    let seg2 = man.get_segment(1, 0).unwrap();
    assert_eq!(seg1.index(), 0);
    assert_eq!(seg2.index(), 2); // sparse midpoint

    // Cancel all segments for CUID 1
    man.cancel_segment(1);

    // The pieces should be available again
    let seg3 = man.get_segment(2, 0).unwrap();
    assert_eq!(seg3.index(), 0); // Piece 0 was released
}

#[test]
fn test_cancel_segment_by_segment() {
    let mut man = create_segment_man(1024, 4096);
    man.recognize_segment_for(0, 4096);

    let seg = man.get_segment(1, 0).unwrap();
    assert_eq!(seg.index(), 0);

    // Cancel the specific segment
    man.cancel_segment_by_segment(1, &seg);

    // Piece should be available again
    let seg2 = man.get_segment(2, 0).unwrap();
    assert_eq!(seg2.index(), 0);
}

#[test]
fn test_cancel_segment_by_index() {
    let mut man = create_segment_man(1024, 4096);
    man.recognize_segment_for(0, 4096);

    let seg = man.get_segment(1, 0).unwrap();
    assert_eq!(seg.index(), 0);

    // Cancel by piece index
    let cancelled = man.cancel_segment_by_index(0);
    assert!(cancelled);

    // Piece should be available again
    let seg2 = man.get_segment(2, 0).unwrap();
    assert_eq!(seg2.index(), 0);

    // Since we just checked out piece 0 for CUID 2,
    // cancel_segment_by_index(0) should succeed again
    let cancelled2 = man.cancel_segment_by_index(0);
    assert!(cancelled2);

    // No more entries for piece 0 — should return false
    let cancelled3 = man.cancel_segment_by_index(0);
    assert!(!cancelled3);
}

#[test]
fn test_cancel_all_segments() {
    let mut man = create_segment_man(1024, 4096);
    man.recognize_segment_for(0, 4096);

    let _seg1 = man.get_segment(1, 0).unwrap();
    let _seg2 = man.get_segment(1, 0).unwrap();

    assert_eq!(man.used_segment_entries.len(), 2);
    man.cancel_all_segments();
    assert!(man.used_segment_entries.is_empty());
}

// ── Segment completion ──────────────────────────────────────────────

#[test]
fn test_complete_segment() {
    let mut man = create_segment_man(1024, 4096);
    man.recognize_segment_for(0, 4096);

    let seg = man.get_segment(1, 0).unwrap();
    let result = man.complete_segment(1, &seg);
    assert!(result);
    assert!(man.has_segment(0));
    assert!(man.used_segment_entries.is_empty());
}

#[test]
fn test_complete_segment_rejects_wrong_cuid_without_mutating_storage() {
    let mut man = create_segment_man(1024, 4096);
    man.recognize_segment_for(0, 4096);

    let seg = man.get_segment(1, 0).unwrap();
    assert!(!man.complete_segment(2, &seg));
    assert!(!man.has_segment(seg.index()));
    assert_eq!(man.get_in_flight_segment_indices(1), vec![seg.index()]);

    assert!(man.complete_segment(1, &seg));
    assert!(man.has_segment(seg.index()));
}

// ── Download progress ───────────────────────────────────────────────

#[test]
fn test_download_finished() {
    let mut man = create_segment_man(1024, 4096);
    man.recognize_segment_for(0, 4096);

    assert!(!man.download_finished());

    for i in 0..4 {
        let seg = man.get_segment(1, 0).unwrap();
        assert_eq!(seg.index(), i);
        man.complete_segment(1, &seg);
    }

    assert!(man.download_finished());
}

#[test]
fn test_download_length() {
    let mut man = create_segment_man(1024, 4096);
    man.recognize_segment_for(0, 4096);

    assert_eq!(man.download_length(), 0);

    let seg = man.get_segment(1, 0).unwrap();
    man.complete_segment(1, &seg);

    assert_eq!(man.download_length(), 1024);
}

// ── Peer statistics ─────────────────────────────────────────────────

#[test]
fn test_register_and_get_peer_stat() {
    let mut man = create_segment_man(1024, 4096);
    let stat = PeerStat::new(42, "example.com".to_string(), "http".to_string());
    man.register_peer_stat(stat);

    let found = man.get_peer_stat(42);
    assert!(found.is_some());
    assert_eq!(found.unwrap().hostname, "example.com");

    assert!(man.get_peer_stat(99).is_none());
}

#[test]
fn test_update_fastest_peer_stat() {
    let mut man = create_segment_man(1024, 4096);

    let mut stat1 = PeerStat::new(1, "host".to_string(), "http".to_string());
    stat1.avg_download_speed = 1000;
    stat1.session_download_length = 5000;
    man.update_fastest_peer_stat(&stat1);

    let mut stat2 = PeerStat::new(2, "host".to_string(), "http".to_string());
    stat2.avg_download_speed = 2000;
    stat2.session_download_length = 3000;
    man.update_fastest_peer_stat(&stat2);

    // stat2 is faster, so it should replace stat1
    // but session_download_length should be accumulated
    let fastest = &man.fastest_peer_stats()[0];
    assert_eq!(fastest.avg_download_speed, 2000);
    assert_eq!(fastest.session_download_length, 8000); // 5000 + 3000
}

// ── Ignore bitfield ─────────────────────────────────────────────────

#[test]
fn test_ignore_and_recognize_segments() {
    let mut man = create_segment_man(1024, 4096);
    // By default all segments are ignored
    assert!(man.all_segments_ignored());

    // Recognize a range
    man.recognize_segment_for(0, 2048);
    assert!(!man.all_segments_ignored());

    // Ignore it again
    man.ignore_segment_for(0, 2048);
    assert!(man.all_segments_ignored());
}

#[test]
fn test_get_segment_respects_ignore_bitfield() {
    let mut man = create_segment_man(1024, 4096);
    // By default all segments are ignored — get_segment should return None
    assert!(man.get_segment(1, 0).is_none());

    // Recognize one piece
    man.recognize_segment_for(0, 1024);
    let seg = man.get_segment(1, 0);
    assert!(seg.is_some());
    assert_eq!(seg.unwrap().index(), 0);
}

// ── Written length memo ─────────────────────────────────────────────

#[test]
fn test_erase_segment_written_length_memo() {
    let mut man = create_segment_man(1024, 4096);
    man.recognize_segment_for(0, 4096);

    let seg = man.get_segment(1, 0).unwrap();
    man.cancel_segment_by_segment(1, &seg);
    assert_eq!(man.segment_written_length_memo.len(), 1);

    man.erase_segment_written_length_memo();
    assert!(man.segment_written_length_memo.is_empty());
}

// ── Count free pieces ───────────────────────────────────────────────

#[test]
fn test_count_free_piece_from() {
    let mut man = create_segment_man(1024, 4096);
    man.recognize_segment_for(0, 4096);

    assert_eq!(man.count_free_piece_from(0), 4);

    let _seg = man.get_segment(1, 0).unwrap();
    // Piece 0 is in-use but not completed
    assert_eq!(man.count_free_piece_from(0), 0);
}

// ── In-flight segment indices ───────────────────────────────────────

#[test]
fn test_get_in_flight_segment_indices() {
    let mut man = create_segment_man(1024, 4096);
    man.recognize_segment_for(0, 4096);

    // With Default (sparse) stream selector:
    // - First: piece 0
    // - Second: piece 2 (midpoint because piece 0 is in-use)
    // - Third for CUID 2: piece 1 or 3 (depends on remaining ranges)
    let _seg1 = man.get_segment(1, 0).unwrap();
    let _seg2 = man.get_segment(1, 0).unwrap();
    let _seg3 = man.get_segment(2, 0).unwrap();

    let cuid1_indices = man.get_in_flight_segment_indices(1);
    // CUID 1 got pieces 0 and 2
    assert_eq!(cuid1_indices, vec![0, 2]);

    let cuid2_indices = man.get_in_flight_segment_indices(2);
    // CUID 2 got the next available piece
    assert!(!cuid2_indices.is_empty());
}

// ── Full download lifecycle ─────────────────────────────────────────

#[test]
fn test_full_download_lifecycle() {
    let mut man = create_segment_man(1024 * 1024, 5 * 1024 * 1024);
    man.recognize_segment_for(0, 5 * 1024 * 1024);

    // Simulate downloading all 5 pieces.
    // Order depends on the stream piece selector strategy.
    // Sparse selector may not return pieces in sequential order.
    let mut downloaded_indices = Vec::new();
    for _ in 0..5 {
        let mut seg = man.get_segment(1, 0).unwrap();
        downloaded_indices.push(seg.index());
        assert!(!seg.is_complete());

        // Simulate writing data
        seg.update_written_length(1024 * 1024);
        assert!(seg.is_complete());

        // Complete the segment
        let result = man.complete_segment(1, &seg);
        assert!(result);
    }

    // All 5 distinct pieces should have been downloaded
    assert_eq!(downloaded_indices.len(), 5);
    downloaded_indices.sort();
    assert_eq!(downloaded_indices, vec![0, 1, 2, 3, 4]);

    assert!(man.download_finished());
    assert_eq!(man.download_length(), 5 * 1024 * 1024);
}

// ── complete_segment advertises piece ──────────────────────────────────

#[test]
fn test_complete_segment_advertises_piece() {
    let mut man = create_segment_man(1024, 4096);
    man.recognize_segment_for(0, 4096);

    // Complete a segment — should advertise the piece
    let seg = man.get_segment(1, 0).unwrap();
    let piece_index = seg.index();
    let result = man.complete_segment(1, &seg);
    assert!(result);
    assert!(man.has_segment(piece_index));

    // Verify advertisement via PieceStorage delegation
    // get_advertised_piece_indexes should return the completed piece
    let (indexes, _) = man
        .piece_storage
        .as_ref()
        .unwrap()
        .get_advertised_piece_indexes(999, 0);
    assert!(indexes.contains(&piece_index));
}

#[test]
fn test_complete_segment_advertises_multiple_pieces() {
    let mut man = create_segment_man(1024, 4096);
    man.recognize_segment_for(0, 4096);

    // Complete all 4 pieces
    let mut completed = Vec::new();
    for _ in 0..4 {
        let seg = man.get_segment(1, 0).unwrap();
        completed.push(seg.index());
        man.complete_segment(1, &seg);
    }

    // All 4 pieces should be advertised
    let (indexes, _) = man
        .piece_storage
        .as_ref()
        .unwrap()
        .get_advertised_piece_indexes(999, 0);
    assert_eq!(indexes.len(), 4);
    for idx in &completed {
        assert!(indexes.contains(idx));
    }
}

#[test]
fn test_rejected_piece_completion_keeps_tracking_entry() {
    let mut man = SegmentMan::new(1024 * 1024, 0);
    man.set_piece_storage(Box::new(UnknownLengthPieceStorage::new(1024 * 1024)));

    let mut old_piece = man
        .piece_storage
        .as_mut()
        .unwrap()
        .get_missing_piece(0, &[], 0, 1)
        .unwrap();
    old_piece.set_length(1000);
    old_piece.reconfigure(1000);
    let old_segment = man.checkout_segment(1, Some(old_piece)).unwrap();
    man.cancel_segment_by_segment(1, &old_segment);
    let mut current_piece = man
        .piece_storage
        .as_mut()
        .unwrap()
        .get_missing_piece(0, &[], 0, 2)
        .unwrap();
    current_piece.set_length(1000);
    current_piece.reconfigure(1000);
    let current_segment = man.checkout_segment(2, Some(current_piece)).unwrap();

    assert!(!man.complete_segment(1, &old_segment));
    assert_eq!(man.get_in_flight_segment_indices(2), vec![0]);
    assert!(!man.download_finished());

    assert!(man.complete_segment(2, &current_segment));
    assert!(man.download_finished());
}

#[test]
fn test_cancel_segment_rejects_stale_checkout_without_clearing_current_piece() {
    let mut man = SegmentMan::new(1024 * 1024, 0);
    man.set_piece_storage(Box::new(UnknownLengthPieceStorage::new(1024 * 1024)));

    let mut old_piece = man
        .piece_storage
        .as_mut()
        .unwrap()
        .get_missing_piece(0, &[], 0, 1)
        .unwrap();
    old_piece.set_length(1000);
    old_piece.reconfigure(1000);
    let old_segment = man.checkout_segment(1, Some(old_piece)).unwrap();
    man.cancel_segment_by_segment(1, &old_segment);

    let mut current_piece = man
        .piece_storage
        .as_mut()
        .unwrap()
        .get_missing_piece(0, &[], 0, 1)
        .unwrap();
    current_piece.set_length(1000);
    current_piece.reconfigure(1000);
    let current_segment = man.checkout_segment(1, Some(current_piece)).unwrap();

    man.cancel_segment_by_segment(1, &old_segment);
    assert_eq!(man.get_in_flight_segment_indices(1), vec![0]);
    assert!(man.piece_storage.as_ref().unwrap().is_piece_used(0));

    man.cancel_segment_by_segment(1, &current_segment);
    assert!(man.get_in_flight_segment_indices(1).is_empty());
}

// ── get_segments_for_file_entry ────────────────────────────────────────

#[test]
fn test_get_segments_for_file_entry_basic() {
    // 8 pieces of 1024 bytes each = 8192 total
    let mut man = create_segment_man(1024, 8192);
    man.recognize_segment_for(0, 8192);

    // File entry covers pieces 2-4 (offset=2048, length=3072)
    let segments = man.get_segments_for_file_entry(1, 0, 2048, 3072, 3);
    assert!(!segments.is_empty());
    // All returned segments should have position_to_write within [2048, 5120)
    for seg in &segments {
        let pos = seg.position_to_write();
        assert!(pos >= 2048, "segment pos {} should be >= 2048", pos);
        assert!(pos < 5120, "segment pos {} should be < 5120", pos);
    }
}

#[test]
fn test_get_segments_for_file_entry_max_segments() {
    let mut man = create_segment_man(1024, 8192);
    man.recognize_segment_for(0, 8192);

    // Request only 1 segment for a file that covers pieces 0-3
    let segments = man.get_segments_for_file_entry(1, 0, 0, 4096, 1);
    assert_eq!(segments.len(), 1);
}

#[test]
fn test_get_segments_for_file_entry_zero_max() {
    let mut man = create_segment_man(1024, 8192);
    man.recognize_segment_for(0, 8192);

    // max_segments=0 should return empty
    let segments = man.get_segments_for_file_entry(1, 0, 0, 4096, 0);
    assert!(segments.is_empty());
}

#[test]
fn test_get_segments_for_file_entry_zero_length() {
    let mut man = create_segment_man(1024, 8192);
    man.recognize_segment_for(0, 8192);

    // file_length=0 should return empty
    let segments = man.get_segments_for_file_entry(1, 0, 0, 0, 5);
    assert!(segments.is_empty());
}

#[test]
fn test_get_segments_for_file_entry_respects_ignore() {
    let mut man = create_segment_man(1024, 8192);
    // By default all segments are ignored
    let segments = man.get_segments_for_file_entry(1, 0, 0, 4096, 3);
    assert!(segments.is_empty());
}

#[test]
fn test_get_segments_for_file_entry_multi_file() {
    // Simulate a multi-file torrent:
    // Total = 8192 bytes, piece_length = 1024, 8 pieces
    // File A: offset=0, length=3072 (pieces 0-2)
    // File B: offset=3072, length=5120 (pieces 3-7)
    let mut man = create_segment_man(1024, 8192);
    man.recognize_segment_for(0, 8192);

    // Get segments for File B (offset=3072, length=5120)
    let segments_b = man.get_segments_for_file_entry(1, 0, 3072, 5120, 5);
    // All segments should fall within File B's range [3072, 8192)
    for seg in &segments_b {
        let pos = seg.position_to_write();
        assert!(pos >= 3072, "segment pos {} should be >= 3072", pos);
        assert!(pos < 8192, "segment pos {} should be < 8192", pos);
    }

    // Get segments for File A (offset=0, length=3072)
    let segments_a = man.get_segments_for_file_entry(2, 0, 0, 3072, 3);
    for seg in &segments_a {
        let pos = seg.position_to_write();
        // pos is u64, always >= 0
        assert!(pos < 3072, "segment pos {} should be < 3072", pos);
    }
}

// ── Have advertisement (BT-specific) ──────────────────────────────────

#[cfg(feature = "bittorrent")]
#[test]
fn test_advertise_piece_delegation() {
    let mut man = create_segment_man(1024, 4096);
    man.recognize_segment_for(0, 4096);

    // Advertise piece 0 by CUID 1
    man.advertise_piece(1, 0);

    // Query from another CUID — should see piece 0
    let (indexes, new_last) = man.get_advertised_piece_indexes(2, 0);
    assert!(indexes.contains(&0));
    assert!(new_last > 0);
}

#[cfg(feature = "bittorrent")]
#[test]
fn test_get_advertised_piece_indexes_no_cuid_filter() {
    // C++ does NOT filter by myCuid despite the header documentation.
    // The C++ implementation (DefaultPieceStorage.cc line 731-733) only
    // checks haveIndex > lastHaveIndex and ignores myCuid.
    let mut man = create_segment_man(1024, 4096);
    man.recognize_segment_for(0, 4096);

    // CUID 1 completes piece 0
    man.advertise_piece(1, 0);

    // CUID 1 querying SHOULD see its own advertisement (matches C++)
    let (indexes, _) = man.get_advertised_piece_indexes(1, 0);
    assert!(indexes.contains(&0));

    // CUID 2 querying should also see piece 0
    let (indexes2, _) = man.get_advertised_piece_indexes(2, 0);
    assert!(indexes2.contains(&0));
}

#[cfg(feature = "bittorrent")]
#[test]
fn test_get_advertised_piece_indexes_since_last() {
    let mut man = create_segment_man(1024, 4096);
    man.recognize_segment_for(0, 4096);

    // Advertise pieces 0 and 1
    man.advertise_piece(1, 0);
    man.advertise_piece(1, 1);

    // Get all indexes
    let (indexes, new_last) = man.get_advertised_piece_indexes(2, 0);
    assert_eq!(indexes.len(), 2);

    // Now advertise piece 2
    man.advertise_piece(1, 2);

    // Only new entries since new_last should appear
    let (indexes2, _) = man.get_advertised_piece_indexes(2, new_last);
    assert!(indexes2.contains(&2));
    assert!(!indexes2.contains(&0));
    assert!(!indexes2.contains(&1));
}

#[cfg(feature = "bittorrent")]
#[test]
fn test_remove_advertised_piece() {
    let mut man = create_segment_man(1024, 4096);
    man.recognize_segment_for(0, 4096);

    // Advertise a piece
    man.advertise_piece(1, 0);

    // Verify it's there
    let (indexes, _) = man.get_advertised_piece_indexes(2, 0);
    assert!(indexes.contains(&0));

    // Remove all entries with registered_time <= far future (effectively all)
    let far_future_ms = u64::MAX;
    man.remove_advertised_piece(far_future_ms);

    // Should be empty now
    let (indexes2, _) = man.get_advertised_piece_indexes(2, 0);
    assert!(indexes2.is_empty());
}