queue-queue 0.1.1

A priority queue implementation based on Rust's BinaryHeap
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

[package]
name = "queue-queue"
version = "0.1.1"
edition = "2021"
license = "MIT"
authors = ["Julia Naomi <jnboeira@outlook.com>"]
keywords = ["priority-queue", "queue"]
categories = ["data-strucutures"]
repository = "https://github.com/naomijub/queue-queue"
homepage = "https://github.com/naomijub/queue-queue"
description = "A priority queue implementation based on Rust's BinaryHeap"

[dependencies]

[dev-dependencies]
criterion = { version = "0.4", features = ["html_reports"] }

[lints.clippy]
nursery = { level = "deny", priority = -1 }
all = { level = "deny", priority = -1 }
pedantic = { level = "deny", priority = -1 }

should_implement_trait = { level = "allow", priority = 1 }
non_canonical_partial_ord_impl = { level = "allow", priority = 1 }
module_name_repetitions = { level = "allow", priority = 1 }

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