Struct PriorityMap 

pub struct PriorityMap {
    map: Box<dyn ArrowHashTable + Send>,
    heap: Box<dyn ArrowHeap + Send>,
    capacity: usize,
    mapper: Vec<(usize, usize)>,
}

A Map<K, V> / PriorityQueue combo that evicts the worst values after reaching capacity

Fields

map: Box<dyn ArrowHashTable + Send>

heap: Box<dyn ArrowHeap + Send>

capacity: usize

mapper: Vec<(usize, usize)>

Implementations

impl PriorityMap

pub fn new( key_type: DataType, val_type: DataType, capacity: usize, descending: bool, ) -> Result<Self>

pub fn set_batch(&mut self, ids: ArrayRef, vals: ArrayRef)

pub fn insert(&mut self, row_idx: usize) -> Result<()>

pub fn emit(&mut self) -> Result<Vec<ArrayRef>>

pub fn is_empty(&self) -> bool