prefix-trie 0.2.2

Prefix trie datastructure (both a set and a map) that provides exact and longest-prefix matches.
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

[[bench]]
harness = false
name = "benchmark"
[dependencies.ipnet]
version = "2.6.0"

[dependencies.num-traits]
version = "0.2.15"

[dependencies.serde]
optional = true
version = "1"

[dependencies.take_mut]
version = "0.2.2"
[dev-dependencies.criterion]
version = "0.4.0"

[dev-dependencies.generic-tests]
version = "0.1.2"

[dev-dependencies.paste]
version = "1.0.10"

[dev-dependencies.pretty_assertions]
version = "1.3.0"

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

[features]
serde = ["dep:serde"]

[package]
categories = ["network-programming"]
description = "Prefix trie datastructure (both a set and a map) that provides exact and longest-prefix matches."
documentation = "https://docs.rs/prefix-trie"
edition = "2021"
homepage = "https://github.com/tiborschneider/prefix-trie"
keywords = ["IP", "prefix", "trie", "collection"]
license = "MIT OR Apache-2.0"
name = "prefix-trie"
readme = "Readme.md"
repository = "https://github.com/tiborschneider/prefix-trie"
version = "0.2.2"