orx-priority-queue 1.4.0

Priority queue traits and high performance d-ary heap implementations.
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
33
34
35
36
37

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

[dependencies.priority-queue]
optional = true
version = "2.0"

[dev-dependencies.criterion]
features = ["html_reports"]
version = "0.5"

[dev-dependencies.itertools]
version = "0.11"

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

[dev-dependencies.rand_chacha]
version = "0.3"

[features]
default = ["std"]
impl_priority_queue = ["priority-queue"]
std = []

[package]
authors = ["orxfun <orx.ugur.arikan@gmail.com>"]
categories = ["algorithms", "data-structures", "mathematics", "no-std"]
description = "Priority queue traits and high performance d-ary heap implementations."
edition = "2021"
keywords = ["priority", "queue", "heap", "dary", "binary"]
license = "MIT"
name = "orx-priority-queue"
readme = "README.md"
repository = "https://github.com/orxfun/orx-priority-queue/"
version = "1.4.0"