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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44

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

[dependencies]
[dev-dependencies.criterion]
features = ["html_reports"]
version = "0.4"
[lints.clippy.all]
level = "deny"
priority = -1

[lints.clippy.module_name_repetitions]
level = "allow"
priority = 1

[lints.clippy.non_canonical_partial_ord_impl]
level = "allow"
priority = 1

[lints.clippy.nursery]
level = "deny"
priority = -1

[lints.clippy.pedantic]
level = "deny"
priority = -1

[lints.clippy.should_implement_trait]
level = "allow"
priority = 1

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