graph_safe_compare 0.1.1

Equivalence predicate that can handle cyclic, shared, and very-deep graphs.
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
65
66
67
68

[[example]]
crate-type = ["lib"]
name = "derived_eq"
test = true

[[test]]
name = "borrow_pair"
required-features = ["std"]

[[test]]
name = "diff_edge"
required-features = ["std"]

[[test]]
name = "diff_index"
required-features = ["std"]

[[test]]
name = "dyn_pair"
required-features = ["std"]

[[test]]
name = "rc_pair"
required-features = ["std"]

[[test]]
name = "lazy"
required-features = ["std"]
[dependencies.cfg-if]
version = "1"

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

[dependencies.oorandom]
optional = true
version = "11"

[dependencies.wyhash]
optional = true
version = "0.5"

[dev-dependencies]

[features]
alloc = []
default = ["std", "wyrng"]
std = ["alloc"]
wyrng = ["wyhash"]

[package]
authors = ["Derick Eddington"]
categories = ["algorithms", "no-std"]
description = "Equivalence predicate that can handle cyclic, shared, and very-deep graphs."
edition = "2021"
keywords = ["graphs", "cyclic", "equivalence", "comparison", "no_std"]
license = "Unlicense"
name = "graph_safe_compare"
readme = "README.md"
repository = "https://github.com/DerickEddington/graph_safe_compare"
resolver = "2"
rust-version = "1.57"
version = "0.1.1"
[profile.bench-max-optim]
codegen-units = 1
inherits = "bench"
lto = true