Struct TopKHashTable 

struct TopKHashTable<ID: KeyType> {
    map: RawTable<HashTableItem<ID>>,
    limit: usize,
}

A custom wrapper around hashbrown::RawTable that:

1. limits the number of entries to the top K
2. Allocates a capacity greater than top K to maintain a low-fill factor and prevent resizing
3. Tracks indexes to allow corresponding heap to refer to entries by index vs hash
4. Catches resize events to allow the corresponding heap to update it’s indexes

Fields

map: RawTable<HashTableItem<ID>>

limit: usize

Implementations

impl<ID: KeyType> TopKHashTable<ID>

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

pub fn find(&self, hash: u64, eq: impl FnMut(&ID) -> bool) -> Option<usize>

pub unsafe fn heap_idx_at(&self, map_idx: usize) -> usize

pub unsafe fn remove_if_full(&mut self, replace_idx: usize) -> usize

unsafe fn update_heap_idx(&mut self, mapper: &[(usize, usize)])

pub fn insert( &mut self, hash: u64, id: ID, heap_idx: usize, mapper: &mut Vec<(usize, usize)>, ) -> usize

pub fn len(&self) -> usize

pub unsafe fn take_all(&mut self, idxs: Vec<usize>) -> Vec<ID>