Struct TopKHeap 

struct TopKHeap<VAL: ValueType> {
    desc: bool,
    len: usize,
    capacity: usize,
    heap: Vec<Option<HeapItem<VAL>>>,
}

A custom heap implementation that allows several things that couldn’t be achieved with collections::BinaryHeap:

1. It allows values to be updated at arbitrary positions (when group values change)
2. It can be either a min or max heap
3. It can use our HeapItem type & Comparable trait
4. It is specialized to grow to a certain limit, then always replace without grow & shrink

Fields

desc: bool

len: usize

capacity: usize

heap: Vec<Option<HeapItem<VAL>>>

Implementations

impl<VAL: ValueType> TopKHeap<VAL>

pub fn new(limit: usize, desc: bool) -> Self

pub fn worst_val(&self) -> Option<&VAL>

pub fn worst_map_idx(&self) -> usize

pub fn is_full(&self) -> bool

pub fn len(&self) -> usize

pub fn append_or_replace( &mut self, new_val: VAL, map_idx: usize, map: &mut Vec<(usize, usize)>, )

fn append( &mut self, new_val: VAL, map_idx: usize, mapper: &mut Vec<(usize, usize)>, )

fn pop(&mut self, map: &mut Vec<(usize, usize)>) -> Option<HeapItem<VAL>>

pub fn drain(&mut self) -> (Vec<VAL>, Vec<usize>)

fn replace_root( &mut self, new_val: VAL, map_idx: usize, mapper: &mut Vec<(usize, usize)>, )

pub fn replace_if_better( &mut self, heap_idx: usize, new_val: VAL, mapper: &mut Vec<(usize, usize)>, )

pub fn renumber(&mut self, heap_to_map: &[(usize, usize)])

fn heapify_up(&mut self, idx: usize, mapper: &mut Vec<(usize, usize)>)

fn swap(&mut self, a_idx: usize, b_idx: usize, mapper: &mut Vec<(usize, usize)>)

fn heapify_down(&mut self, node_idx: usize, mapper: &mut Vec<(usize, usize)>)

fn _tree_print( &self, idx: usize, prefix: String, is_tail: bool, output: &mut String, )

Trait Implementations

impl<VAL: ValueType> Display for TopKHeap<VAL>

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

Formats the value using the given formatter.