pie_core 0.2.13

A high-performance, index-based data structure toolkit. Provides an arena allocator (ElemPool) used to build a cache-friendly PieList (doubly-linked list) and FibHeap (priority queue).
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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64

[workspace]
members = [
    ".",
    "tools/bench-table",
    "examples/dijkstra"]
resolver = "2"

[package]
name = "pie_core"
version = "0.2.13"
edition = "2024"
license = "MPL-2.0"
authors = ["Stefan Lindblad <stefan.lindblad@linux.com>"]
description = """
A high-performance, index-based data structure toolkit. Provides an arena
allocator (ElemPool) used to build a cache-friendly PieList
(doubly-linked list) and FibHeap (priority queue).
"""
readme = "README.md"
repository = "https://github.com/Fairglow/pie_core"
documentation = "https://docs.rs/pie_core"
keywords = [
    "arena",
    "list",
    "heap",
    "priority-queue",
    "data-structures"
]
categories = [
    "data-structures",
    "algorithms",
    "memory-management"
]

[dependencies]
# Used for the Dijkstra feature
hashbrown = { version = "0.16", optional = true }
petgraph = { version = "0.8", optional = true }
# Used for the serde feature
serde = { version = "1.0", features = ["derive"], optional = true }

[features]
default = ["std"]
std = []
petgraph = ["dep:petgraph", "dep:hashbrown"]
serde = ["dep:serde"]
bench-nightly = []

[dev-dependencies]
criterion = "0.8"
fibonacci_heap = "0.9"
index_list = "0.3"
petgraph = "0.8"
priority-queue = "2.7"
rand = "0.10"
serde_json = "1.0"

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

[profile.release]
codegen-units = 1
lto = true