tilesort 0.2.0

A sorting algorithm optimized for datasets with pre-sorted contiguous blocks (tiles)
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
69
70
71
72
73
74
75
76
77
78

[[bench]]
name = "pathological_benchmark"
path = "benches/pathological_benchmark.rs"

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

[dependencies.log]
version = "0.4.28"

[dependencies.pyo3]
optional = true
version = "0.25.1"

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

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

[dev-dependencies.test-log]
version = "0.2.14"

[[example]]
name = "overlap_example"
path = "examples/overlap_example.rs"

[[example]]
name = "profile_direct"
path = "examples/profile_direct.rs"

[[example]]
name = "profile_realistic"
path = "examples/profile_realistic.rs"

[[example]]
name = "test_key_function"
path = "examples/test_key_function.rs"

[[example]]
name = "test_realistic"
path = "examples/test_realistic.rs"

[features]
default = []
python = ["pyo3"]

[lib]
crate-type = ["cdylib", "rlib"]
name = "tilesort"
path = "src/lib.rs"

[package]
authors = ["Evan Williams <evanjpw@gmail.com>"]
autobenches = false
autobins = false
autoexamples = false
autolib = false
autotests = false
build = false
categories = ["algorithms"]
description = "A sorting algorithm optimized for datasets with pre-sorted contiguous blocks (tiles)"
edition = "2021"
homepage = "https://github.com/evanjpw/tilesort"
keywords = ["sorting", "algorithm", "optimization", "performance"]
license = "MIT OR Apache-2.0"
name = "tilesort"
readme = "README.md"
repository = "https://github.com/evanjpw/tilesort"
rust-version = "1.71.1"
version = "0.2.0"

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