Struct Sorter 

pub struct Sorter { /* private fields */ }

Sort entries using one of the supported content discovery rankings.

Implementations

impl Sorter

pub const fn new(config: SortConfig) -> Self

pub fn filter_seeders(&self, entries: Vec<SortEntry>) -> Vec<SortEntry>

Filter entries by seeders before sorting.

pub fn enrich_peers( &self, entries: &mut [SortEntry], peer_map: &HashMap<String, usize>, )

Populate entry.peers from a path→count map.

pub fn enrich_niche(&self, entries: &mut [SortEntry])

Compute entry.niche from entry.peers using config.niche as ideal count. Formula: 1.0 / (1.0 + |peers - ideal|)

pub fn enrich_frequency( &self, entries: &mut [SortEntry], freq_map: &HashMap<String, u64>, )

Populate entry.frequency from a path→access-count map.

pub fn sort<'a>(&'a self, entries: &'a mut [SortEntry]) -> SortResult<'a>

Sort entries by multiple criteria.

Returns an iterator that yields paths until limit_size is reached.

Trait Implementations

impl Clone for Sorter

fn clone(&self) -> Sorter

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Sorter

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

Formats the value using the given formatter.