priq 0.2.0

Array implementation of the min/max heap
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32

[[bench]]
harness = false
name = "bench_priq"

[dependencies.rand]
version = "0.8.4"

[dev-dependencies.bencher]
version = "0.1.5"

[lib]
bench = false
crate-type = ["lib"]
doctest = true
name = "priq"
path = "src/priq.rs"
test = true

[package]
authors = ["Beka M. <bexx.modd@gmail.com>"]
categories = ["data-structures"]
description = "Array implementation of the min/max heap"
documentation = "https://docs.rs/priq"
edition = "2021"
exclude = ["benches/bench_bheap.rs"]
homepage = "https://github.com/bexxmodd/priq"
keywords = ["priority", "queue", "data-structure"]
license = "MIT"
name = "priq"
readme = "README.md"
resolver = "2"
version = "0.2.0"