trie-rs 0.4.2

Memory efficient trie (prefix tree) and map library based on LOUDS
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

[[bench]]
harness = false
name = "bench"
[dependencies.louds-rs]
version = "0.7"

[dependencies.mem_dbg]
optional = true
version = "0.1.4"

[dependencies.serde]
features = ["derive"]
optional = true
version = "1.0"
[dev-dependencies.criterion]
version = "0.2"

[dev-dependencies.lazy_static]
version = "1.3"

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

[dev-dependencies.version-sync]
version = "0.9"

[features]
mem_dbg = ["louds-rs/mem_dbg", "dep:mem_dbg"]
rayon = ["louds-rs/rayon"]
serde = ["louds-rs/serde", "dep:serde"]

[package]
authors = ["Sho Nakatani <lay.sakura@gmail.com>", "Shane Celis <shane.celis@gmail.com>"]
categories = ["compression", "data-structures"]
description = "Memory efficient trie (prefix tree) and map library based on LOUDS"
edition = "2021"
homepage = "https://github.com/laysakura/trie-rs"
keywords = ["trie", "louds", "succinct"]
license = "MIT OR Apache-2.0"
name = "trie-rs"
readme = "README.md"
repository = "https://github.com/laysakura/trie-rs"
version = "0.4.2"