priority_container 0.1.0

Datastructure to find n biggest/smallest items within a large set
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
[[bench]]
harness = false
name = "bench"

[dependencies]
[dev-dependencies.criterion]
version = "0.3.5"

[dev-dependencies.rand]
version = "0.8.5"

[package]
description = "Datastructure to find n biggest/smallest items within a large set"
edition = "2021"
license-file = "./LICENSE"
name = "priority_container"
resolver = "2"
version = "0.1.0"