Struct GapAwarePieceSelector 

pub struct GapAwarePieceSelector { /* private fields */ }

BEP-19 piece selection strategy.

Modifies “rarest first” to create gaps that HTTP/FTP can fill efficiently.

Implementations

impl GapAwarePieceSelector

pub fn new(peer_count: usize) -> Self

Creates a new gap-aware piece selector.

pub fn set_peer_count(&mut self, count: usize)

Updates the peer count.

pub fn select_piece( &self, piece_availability: &[usize], our_pieces: &[bool], peer_pieces: &[bool], ) -> Option<u32>

Selects a piece using BEP-19 gap-aware strategy.

Priority logic:

1. If piece_rarity < (cur_rarest - X), select it
2. Else if piece_rarity <= (cur_rarest + X) AND gap > cur_gap, select it

Arguments:

• piece_availability: For each piece, how many peers have it
• our_pieces: Which pieces we already have
• peer_pieces: Which pieces the current peer has

Returns: Selected piece index, or None if no suitable piece found

pub fn select_gap_filling_piece( &self, our_pieces: &[bool], peer_pieces: &[bool], ) -> Option<u32>

Selects a piece for gap-filling mode (used when > 50% complete).

Finds the piece with the smallest gap to a completed section.

pub fn should_use_gap_filling(&self, our_pieces: &[bool]) -> bool

Returns true if we should use gap-filling mode.

Gap-filling is activated when completion > 50%.

Trait Implementations

impl Clone for GapAwarePieceSelector

fn clone(&self) -> GapAwarePieceSelector

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for GapAwarePieceSelector

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.