simd-intervaltree 0.1.0

A SIMD-accelerated interval tree with zero-allocation queries
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

[[bench]]
harness = false
name = "query"
path = "benches/query.rs"

[dependencies.tikv-jemallocator]
optional = true
version = "0.6"

[dev-dependencies.criterion]
features = ["html_reports"]
version = "0.5"

[dev-dependencies.intervaltree]
version = "0.2"

[dev-dependencies.proptest]
version = "1.4"

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

[features]
default = ["std", "jemalloc"]
jemalloc = ["tikv-jemallocator"]
std = []

[lib]
name = "simd_intervaltree"
path = "src/lib.rs"

[lints.clippy]
all = "deny"
nursery = "warn"
pedantic = "warn"

[lints.rust]
unsafe_code = "warn"

[package]
authors = ["Benjamin Coverston <ben.coverston@gmail.com>"]
autobenches = false
autobins = false
autoexamples = false
autolib = false
autotests = false
build = false
categories = ["data-structures", "algorithms"]
description = "A SIMD-accelerated interval tree with zero-allocation queries"
edition = "2021"
keywords = ["interval", "tree", "simd", "range", "overlap"]
license = "MIT"
name = "simd-intervaltree"
readme = "README.md"
repository = "https://github.com/bcoverston/simd-intervaltree"
version = "0.1.0"

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

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

[[test]]
name = "proptest"
path = "tests/proptest.rs"