#items #data-structures #find #set #within #amount #biggest-smallest

priority_container

Datastructure to find n biggest/smallest items within a large set

2 releases

0.1.1 Jun 13, 2022
0.1.0 Jun 6, 2022

#1955 in Algorithms

43 downloads per month
Used in word_vec-rs

Custom license

28KB
748 lines

PrioContainer

Rust library to find a fixed amount of biggest/smallest items within a set of Items as efficient as possible

No runtime deps