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

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

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

[dependencies]
tikv-jemallocator = { version = "0.6", optional = true }

[dev-dependencies]
criterion = { version = "0.5", features = ["html_reports"] }
rand = "0.8"
intervaltree = "0.2"  # For comparison benchmarks
proptest = "1.4"

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


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

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

[lints.rust]
unsafe_code = "warn"

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