asupersync 0.3.4

Spec-first, cancel-correct, capability-secure async runtime for 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
//! ATP Swarm Piece Tracker - Tracks piece availability and download progress.
//!
//! Manages the state of which pieces are available from which peers,
//! tracks download progress, and coordinates piece requests.

use super::{PeerId, PieceId, SwarmError, SwarmResult, swarm_time_now};
use crate::atp::mailbox::MailboxTransferId;
use crate::types::Time;
use serde::{Deserialize, Serialize};
use std::collections::{BTreeMap, BTreeSet, HashMap, HashSet};

/// Tracks piece availability and download state across transfers.
#[derive(Debug)]
pub struct PieceTracker {
    /// Per-transfer piece maps
    transfer_maps: HashMap<MailboxTransferId, TransferPieceMap>,

    /// Global piece availability across all peers
    global_availability: HashMap<PieceId, HashSet<PeerId>>,
}

/// Piece availability and progress for a single transfer.
#[derive(Debug, Clone)]
struct TransferPieceMap {
    /// Total number of pieces in transfer
    total_pieces: u64,

    /// Pieces and their current status
    piece_status: HashMap<PieceId, PieceStatus>,

    /// Pieces available from each peer
    peer_pieces: HashMap<PeerId, BTreeSet<PieceId>>,

    /// Redundancy count for each piece
    redundancy: HashMap<PieceId, u32>,
}

/// Map of piece availability across the swarm.
#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct PieceMap {
    /// Total number of pieces
    pub total_pieces: u64,

    /// Size of each piece in bytes
    pub piece_size: u32,

    /// Pieces available from each peer
    pub peer_availability: HashMap<PeerId, BTreeSet<PieceId>>,

    /// Content hash for verification
    pub content_hash: String,

    /// Creation timestamp
    pub created_at: Time,
}

/// Status of an individual piece.
#[derive(Debug, Clone, Default, PartialEq, Serialize, Deserialize)]
pub enum PieceStatus {
    /// Piece is needed and not yet requested
    #[default]
    Needed,

    /// Piece has been requested from a peer
    Requested {
        /// Time when request was sent
        requested_at: Time,
        /// Peer from which piece was requested
        peer_id: PeerId,
    },

    /// Piece is currently being downloaded
    Downloading {
        /// Download start time
        started_at: Time,
        /// Peer providing the piece
        peer_id: PeerId,
        /// Progress percentage (0.0 to 1.0)
        progress: f64,
    },

    /// Piece download completed successfully
    Completed {
        /// Completion time
        completed_at: Time,
        /// Peer that provided the piece
        peer_id: PeerId,
    },

    /// Piece download failed
    Failed {
        /// Failure time
        failed_at: Time,
        /// Peer that failed to provide piece
        peer_id: PeerId,
        /// Failure reason
        reason: String,
    },

    /// Piece is being verified
    Verifying {
        /// Verification start time
        started_at: Time,
        /// Peer that provided the piece
        peer_id: PeerId,
    },
}

/// Statistics about piece distribution and redundancy.
#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct PieceDistributionStats {
    /// Total unique pieces tracked
    pub total_unique_pieces: u64,

    /// Average redundancy factor
    pub avg_redundancy: f64,

    /// Minimum redundancy (rarest piece)
    pub min_redundancy: u32,

    /// Maximum redundancy
    pub max_redundancy: u32,

    /// Pieces with only one peer (rarest)
    pub rarest_pieces: Vec<PieceId>,

    /// Distribution of redundancy levels
    pub redundancy_distribution: BTreeMap<u32, u32>,
}

impl PieceMap {
    /// Create a new piece map.
    pub fn new(total_pieces: u64, piece_size: u32, content_hash: String) -> Self {
        Self {
            total_pieces,
            piece_size,
            peer_availability: HashMap::new(),
            content_hash,
            created_at: swarm_time_now(),
        }
    }

    /// Add piece availability for a peer.
    pub fn add_peer_pieces(&mut self, peer_id: PeerId, pieces: BTreeSet<PieceId>) {
        self.peer_availability.insert(peer_id, pieces);
    }

    /// Get all peers that have a specific piece.
    pub fn get_peers_for_piece(&self, piece_id: &PieceId) -> Vec<PeerId> {
        self.peer_availability
            .iter()
            .filter_map(|(peer_id, pieces): (&PeerId, &BTreeSet<PieceId>)| {
                if pieces.contains(piece_id) {
                    Some(peer_id.clone())
                } else {
                    None
                }
            })
            .collect()
    }

    /// Calculate redundancy for a piece.
    pub fn get_piece_redundancy(&self, piece_id: &PieceId) -> u32 {
        self.peer_availability
            .values()
            .filter(|pieces: &&BTreeSet<PieceId>| pieces.contains(piece_id))
            .count() as u32
    }

    /// Get statistics about piece distribution.
    pub fn get_distribution_stats(&self) -> PieceDistributionStats {
        let mut redundancy_counts = HashMap::new();

        // Calculate redundancy for each piece
        for piece_id in 0..self.total_pieces {
            let piece_id = PieceId::new(piece_id);
            let redundancy = self.get_piece_redundancy(&piece_id);
            redundancy_counts.insert(piece_id, redundancy);
        }

        let redundancy_values: Vec<u32> = redundancy_counts.values().copied().collect();
        let avg_redundancy = if redundancy_values.is_empty() {
            0.0
        } else {
            redundancy_values.iter().sum::<u32>() as f64 / redundancy_values.len() as f64
        };

        let min_redundancy = redundancy_values.iter().min().copied().unwrap_or(0);
        let max_redundancy = redundancy_values.iter().max().copied().unwrap_or(0);

        // Find rarest pieces
        let rarest_pieces: Vec<PieceId> = redundancy_counts
            .iter()
            .filter(|&(_, &redundancy)| redundancy == min_redundancy)
            .map(|(piece_id, _)| *piece_id)
            .collect();

        // Build redundancy distribution
        let mut redundancy_distribution = BTreeMap::new();
        for &redundancy in &redundancy_values {
            *redundancy_distribution.entry(redundancy).or_insert(0) += 1;
        }

        PieceDistributionStats {
            total_unique_pieces: self.total_pieces,
            avg_redundancy,
            min_redundancy,
            max_redundancy,
            rarest_pieces,
            redundancy_distribution,
        }
    }
}

impl PieceTracker {
    /// Create a new piece tracker.
    pub fn new() -> Self {
        Self {
            transfer_maps: HashMap::new(),
            global_availability: HashMap::new(),
        }
    }

    /// Initialize tracking for a new transfer.
    pub fn initialize_transfer(
        &mut self,
        transfer_id: &MailboxTransferId,
        piece_map: &PieceMap,
    ) -> SwarmResult<()> {
        // Create piece status map
        let mut piece_status = HashMap::new();
        for piece_id in 0..piece_map.total_pieces {
            piece_status.insert(PieceId::new(piece_id), PieceStatus::Needed);
        }

        // Build redundancy map
        let mut redundancy = HashMap::new();
        for piece_id in 0..piece_map.total_pieces {
            let piece_id = PieceId::new(piece_id);
            redundancy.insert(piece_id, piece_map.get_piece_redundancy(&piece_id));
        }

        let transfer_map = TransferPieceMap {
            total_pieces: piece_map.total_pieces,
            piece_status,
            peer_pieces: piece_map.peer_availability.clone(),
            redundancy,
        };

        self.transfer_maps.insert(*transfer_id, transfer_map);

        // Update global availability
        for (peer_id, pieces) in &piece_map.peer_availability {
            for piece_id in pieces {
                self.global_availability
                    .entry(*piece_id)
                    .or_default()
                    .insert(peer_id.clone());
            }
        }

        Ok(())
    }

    /// Get pieces that still need to be downloaded for a transfer.
    pub fn get_needed_pieces(&self, transfer_id: &MailboxTransferId) -> SwarmResult<Vec<PieceId>> {
        let transfer_map =
            self.transfer_maps
                .get(transfer_id)
                .ok_or(SwarmError::TransferNotFound {
                    transfer_id: *transfer_id,
                })?;

        let needed_pieces: Vec<PieceId> = transfer_map
            .piece_status
            .iter()
            .filter_map(|(piece_id, status)| match status {
                PieceStatus::Needed | PieceStatus::Failed { .. } => Some(*piece_id),
                _ => None,
            })
            .collect();

        Ok(needed_pieces)
    }

    /// Get pieces sorted by rarity (rarest first).
    pub fn get_pieces_by_rarity(
        &self,
        transfer_id: &MailboxTransferId,
    ) -> SwarmResult<Vec<PieceId>> {
        let transfer_map =
            self.transfer_maps
                .get(transfer_id)
                .ok_or(SwarmError::TransferNotFound {
                    transfer_id: *transfer_id,
                })?;

        let needed_pieces = self.get_needed_pieces(transfer_id)?;

        let mut rarity_sorted: Vec<(PieceId, u32)> = needed_pieces
            .into_iter()
            .map(|piece_id| {
                let redundancy = transfer_map.redundancy.get(&piece_id).copied().unwrap_or(0);
                (piece_id, redundancy)
            })
            .collect();

        // Sort by redundancy (ascending - rarest first)
        rarity_sorted.sort_by_key(|(_, redundancy)| *redundancy);

        Ok(rarity_sorted
            .into_iter()
            .map(|(piece_id, _)| piece_id)
            .collect())
    }

    /// Mark a piece as requested.
    pub fn mark_piece_requested(
        &mut self,
        transfer_id: &MailboxTransferId,
        piece_id: PieceId,
        peer_id: PeerId,
    ) -> SwarmResult<()> {
        let transfer_map =
            self.transfer_maps
                .get_mut(transfer_id)
                .ok_or(SwarmError::TransferNotFound {
                    transfer_id: *transfer_id,
                })?;

        transfer_map.piece_status.insert(
            piece_id,
            PieceStatus::Requested {
                requested_at: swarm_time_now(),
                peer_id,
            },
        );

        Ok(())
    }

    /// Mark a piece as downloading.
    pub fn mark_piece_downloading(
        &mut self,
        transfer_id: &MailboxTransferId,
        piece_id: PieceId,
        peer_id: PeerId,
    ) -> SwarmResult<()> {
        let transfer_map =
            self.transfer_maps
                .get_mut(transfer_id)
                .ok_or(SwarmError::TransferNotFound {
                    transfer_id: *transfer_id,
                })?;

        transfer_map.piece_status.insert(
            piece_id,
            PieceStatus::Downloading {
                started_at: swarm_time_now(),
                peer_id,
                progress: 0.0,
            },
        );

        Ok(())
    }

    /// Update download progress for a piece.
    pub fn update_piece_progress(
        &mut self,
        transfer_id: &MailboxTransferId,
        piece_id: PieceId,
        progress: f64,
    ) -> SwarmResult<()> {
        let transfer_map =
            self.transfer_maps
                .get_mut(transfer_id)
                .ok_or(SwarmError::TransferNotFound {
                    transfer_id: *transfer_id,
                })?;

        if let Some(PieceStatus::Downloading {
            started_at,
            peer_id,
            ..
        }) = transfer_map.piece_status.get(&piece_id)
        {
            transfer_map.piece_status.insert(
                piece_id,
                PieceStatus::Downloading {
                    started_at: *started_at,
                    peer_id: peer_id.clone(),
                    progress: progress.clamp(0.0, 1.0),
                },
            );
        }

        Ok(())
    }

    /// Mark a piece as completed.
    pub fn mark_piece_completed(
        &mut self,
        transfer_id: &MailboxTransferId,
        piece_id: PieceId,
    ) -> SwarmResult<()> {
        let transfer_map =
            self.transfer_maps
                .get_mut(transfer_id)
                .ok_or(SwarmError::TransferNotFound {
                    transfer_id: *transfer_id,
                })?;

        // Get peer ID from current status
        let peer_id = match transfer_map.piece_status.get(&piece_id) {
            Some(
                PieceStatus::Requested { peer_id, .. }
                | PieceStatus::Downloading { peer_id, .. }
                | PieceStatus::Verifying { peer_id, .. },
            ) => peer_id.clone(),
            _ => {
                return Err(SwarmError::InvalidPieceState {
                    piece_id,
                    current_state: "not requested, downloading, or verifying".to_string(),
                });
            }
        };

        transfer_map.piece_status.insert(
            piece_id,
            PieceStatus::Completed {
                completed_at: swarm_time_now(),
                peer_id,
            },
        );

        Ok(())
    }

    /// Mark a piece as failed.
    pub fn mark_piece_failed(
        &mut self,
        transfer_id: &MailboxTransferId,
        piece_id: PieceId,
        reason: String,
    ) -> SwarmResult<()> {
        let transfer_map =
            self.transfer_maps
                .get_mut(transfer_id)
                .ok_or(SwarmError::TransferNotFound {
                    transfer_id: *transfer_id,
                })?;

        // Get peer ID from current status
        let peer_id = match transfer_map.piece_status.get(&piece_id) {
            Some(
                PieceStatus::Downloading { peer_id, .. }
                | PieceStatus::Verifying { peer_id, .. }
                | PieceStatus::Requested { peer_id, .. },
            ) => peer_id.clone(),
            _ => PeerId::new("unknown"),
        };

        transfer_map.piece_status.insert(
            piece_id,
            PieceStatus::Failed {
                failed_at: swarm_time_now(),
                peer_id,
                reason,
            },
        );

        Ok(())
    }

    /// Get status of a specific piece.
    pub fn get_piece_status(
        &self,
        transfer_id: &MailboxTransferId,
        piece_id: &PieceId,
    ) -> SwarmResult<PieceStatus> {
        let transfer_map =
            self.transfer_maps
                .get(transfer_id)
                .ok_or(SwarmError::TransferNotFound {
                    transfer_id: *transfer_id,
                })?;

        transfer_map
            .piece_status
            .get(piece_id)
            .cloned()
            .ok_or(SwarmError::PieceNotFound {
                piece_id: *piece_id,
            })
    }

    /// Get transfer progress statistics.
    pub fn get_transfer_progress(
        &self,
        transfer_id: &MailboxTransferId,
    ) -> SwarmResult<TransferProgress> {
        let transfer_map =
            self.transfer_maps
                .get(transfer_id)
                .ok_or(SwarmError::TransferNotFound {
                    transfer_id: *transfer_id,
                })?;

        let mut progress = TransferProgress::default();
        progress.total_pieces = transfer_map.total_pieces;

        for status in transfer_map.piece_status.values() {
            match status {
                PieceStatus::Needed => progress.needed += 1,
                PieceStatus::Requested { .. } => progress.requested += 1,
                PieceStatus::Downloading { .. } => progress.downloading += 1,
                PieceStatus::Completed { .. } => progress.completed += 1,
                PieceStatus::Failed { .. } => progress.failed += 1,
                PieceStatus::Verifying { .. } => progress.verifying += 1,
            }
        }

        progress.completion_percentage = if progress.total_pieces > 0 {
            (progress.completed as f64 / progress.total_pieces as f64) * 100.0
        } else {
            0.0
        };

        Ok(progress)
    }

    /// Clean up completed transfers.
    pub fn cleanup_transfer(&mut self, transfer_id: &MailboxTransferId) {
        if let Some(transfer_map) = self.transfer_maps.remove(transfer_id) {
            let mut empty_piece_entries = Vec::new();

            for pieces in transfer_map.peer_pieces.values() {
                for piece_id in pieces {
                    if let Some(peer_set) = self.global_availability.get_mut(piece_id) {
                        for peer_id in transfer_map.peer_pieces.keys() {
                            peer_set.remove(peer_id);
                        }
                        if peer_set.is_empty() {
                            empty_piece_entries.push(*piece_id);
                        }
                    }
                }
            }

            for piece_id in empty_piece_entries {
                self.global_availability.remove(&piece_id);
            }
        }
    }

    /// Return the tracked redundancy for a piece in a transfer.
    pub fn get_piece_redundancy(
        &self,
        transfer_id: &MailboxTransferId,
        piece_id: &PieceId,
    ) -> SwarmResult<u32> {
        let transfer_map =
            self.transfer_maps
                .get(transfer_id)
                .ok_or(SwarmError::TransferNotFound {
                    transfer_id: *transfer_id,
                })?;

        transfer_map
            .redundancy
            .get(piece_id)
            .copied()
            .ok_or(SwarmError::PieceNotFound {
                piece_id: *piece_id,
            })
    }

    /// Get pieces available from a specific peer.
    pub fn get_peer_pieces(
        &self,
        transfer_id: &MailboxTransferId,
        peer_id: &PeerId,
    ) -> SwarmResult<BTreeSet<PieceId>> {
        let transfer_map =
            self.transfer_maps
                .get(transfer_id)
                .ok_or(SwarmError::TransferNotFound {
                    transfer_id: *transfer_id,
                })?;

        Ok(transfer_map
            .peer_pieces
            .get(peer_id)
            .cloned()
            .unwrap_or_default())
    }
}

/// Progress statistics for a transfer.
#[derive(Debug, Clone, Default, Serialize, Deserialize)]
pub struct TransferProgress {
    /// Total number of pieces
    pub total_pieces: u64,

    /// Pieces still needed
    pub needed: u64,

    /// Pieces requested but not yet downloading
    pub requested: u64,

    /// Pieces currently downloading
    pub downloading: u64,

    /// Pieces being verified
    pub verifying: u64,

    /// Pieces completed successfully
    pub completed: u64,

    /// Pieces that failed
    pub failed: u64,

    /// Overall completion percentage
    pub completion_percentage: f64,
}

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

    fn create_test_piece_map() -> PieceMap {
        let mut piece_map = PieceMap::new(10, 1024, "test-hash".to_string());

        let peer1 = PeerId::new("peer1");
        let peer2 = PeerId::new("peer2");

        piece_map.add_peer_pieces(peer1, (0..5).map(PieceId::new).collect());
        piece_map.add_peer_pieces(peer2, (3..10).map(PieceId::new).collect());

        piece_map
    }

    #[test]
    fn test_piece_tracker_creation() {
        let tracker = PieceTracker::new();
        assert_eq!(tracker.transfer_maps.len(), 0);
        assert_eq!(tracker.global_availability.len(), 0);
    }

    #[test]
    fn test_initialize_transfer() {
        let mut tracker = PieceTracker::new();
        let piece_map = create_test_piece_map();
        let transfer_id = MailboxTransferId::new();

        let result = tracker.initialize_transfer(&transfer_id, &piece_map);
        assert!(result.is_ok());
        assert!(tracker.transfer_maps.contains_key(&transfer_id));
    }

    #[test]
    fn test_get_needed_pieces() {
        let mut tracker = PieceTracker::new();
        let piece_map = create_test_piece_map();
        let transfer_id = MailboxTransferId::new();

        tracker
            .initialize_transfer(&transfer_id, &piece_map)
            .unwrap();
        let needed = tracker.get_needed_pieces(&transfer_id).unwrap();

        assert_eq!(needed.len(), 10); // All pieces initially needed
    }

    #[test]
    fn test_piece_status_transitions() {
        let mut tracker = PieceTracker::new();
        let piece_map = create_test_piece_map();
        let transfer_id = MailboxTransferId::new();
        let piece_id = PieceId::new(0);
        let peer_id = PeerId::new("peer1");

        tracker
            .initialize_transfer(&transfer_id, &piece_map)
            .unwrap();

        // Test requested -> downloading -> completed
        tracker
            .mark_piece_requested(&transfer_id, piece_id, peer_id.clone())
            .unwrap();
        let status = tracker.get_piece_status(&transfer_id, &piece_id).unwrap();
        assert!(matches!(status, PieceStatus::Requested { .. }));

        tracker
            .mark_piece_downloading(&transfer_id, piece_id, peer_id.clone())
            .unwrap();
        let status = tracker.get_piece_status(&transfer_id, &piece_id).unwrap();
        assert!(matches!(status, PieceStatus::Downloading { .. }));

        tracker
            .mark_piece_completed(&transfer_id, piece_id)
            .unwrap();
        let status = tracker.get_piece_status(&transfer_id, &piece_id).unwrap();
        assert!(matches!(status, PieceStatus::Completed { .. }));
    }

    #[test]
    fn test_transfer_progress() {
        let mut tracker = PieceTracker::new();
        let piece_map = create_test_piece_map();
        let transfer_id = MailboxTransferId::new();

        tracker
            .initialize_transfer(&transfer_id, &piece_map)
            .unwrap();

        // Complete one piece
        let piece_id = PieceId::new(0);
        let peer_id = PeerId::new("peer1");
        tracker
            .mark_piece_downloading(&transfer_id, piece_id, peer_id)
            .unwrap();
        tracker
            .mark_piece_completed(&transfer_id, piece_id)
            .unwrap();

        let progress = tracker.get_transfer_progress(&transfer_id).unwrap();
        assert_eq!(progress.total_pieces, 10);
        assert_eq!(progress.completed, 1);
        assert_eq!(progress.needed, 9);
        assert_eq!(progress.completion_percentage, 10.0);
    }

    #[test]
    fn test_piece_map_redundancy() {
        let piece_map = create_test_piece_map();

        // Piece 0: only on peer1 (redundancy 1)
        assert_eq!(piece_map.get_piece_redundancy(&PieceId::new(0)), 1);

        // Piece 4: on both peers (redundancy 2)
        assert_eq!(piece_map.get_piece_redundancy(&PieceId::new(4)), 2);

        // Piece 8: only on peer2 (redundancy 1)
        assert_eq!(piece_map.get_piece_redundancy(&PieceId::new(8)), 1);

        let stats = piece_map.get_distribution_stats();
        assert_eq!(stats.min_redundancy, 1);
        assert_eq!(stats.max_redundancy, 2);
    }

    #[test]
    fn test_pieces_by_rarity() {
        let mut tracker = PieceTracker::new();
        let piece_map = create_test_piece_map();
        let transfer_id = MailboxTransferId::new();

        tracker
            .initialize_transfer(&transfer_id, &piece_map)
            .unwrap();
        let by_rarity = tracker.get_pieces_by_rarity(&transfer_id).unwrap();

        // Should be sorted with rarest pieces (redundancy 1) first
        assert_eq!(by_rarity.len(), 10);
    }
}

// Additional error types needed for piece tracker
impl SwarmError {
    pub fn transfer_not_found(transfer_id: MailboxTransferId) -> Self {
        SwarmError::TransferNotFound { transfer_id }
    }

    pub fn piece_not_found(piece_id: PieceId) -> Self {
        SwarmError::PieceNotFound { piece_id }
    }

    pub fn invalid_piece_state(piece_id: PieceId, current_state: String) -> Self {
        SwarmError::InvalidPieceState {
            piece_id,
            current_state,
        }
    }
}

// Add missing error variants to the main SwarmError enum in mod.rs
use thiserror::Error;

#[derive(Debug, Error)]
pub enum PieceTrackerError {
    #[error("Transfer not found: {transfer_id}")]
    TransferNotFound { transfer_id: MailboxTransferId },

    #[error("Piece not found: {piece_id:?}")]
    PieceNotFound { piece_id: PieceId },

    #[error("Invalid piece state for {piece_id:?}: {current_state}")]
    InvalidPieceState {
        piece_id: PieceId,
        current_state: String,
    },
}