s2rst 0.3.2

A Rust port of Google's S2 spherical geometry library — points, regions, shapes, and a hierarchical cell index on the sphere.
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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210

// SPDX-License-Identifier: Apache-2.0
// SPDX-FileCopyrightText: 2026 Torgeir Børresen <tb@starkad.no>
// Part of a Rust port of Google's S2 Geometry library. The upstream
// implementations — C++ (google/s2geometry), Go (golang/geo), and Java
// (google/s2-geometry-library-java) — are licensed under the Apache License,
// Version 2.0, and are Copyright Google Inc. See LICENSE.

#![allow(missing_docs, clippy::exit, reason = "benchmarks")]
use iai_callgrind::{library_benchmark, library_benchmark_group, main};
use std::hint::black_box;

use s2rst::s1::Angle;
use s2rst::s2::Region;
use s2rst::s2::{LatLng, Loop, Point};

#[inline(never)]
fn make_loop(center: Point, radius_deg: f64, n: usize) -> Loop {
    Loop::make_regular(center, Angle::from_degrees(radius_deg), n)
}

fn center1() -> Point {
    LatLng::from_degrees(0.0, 0.0).to_point()
}
fn center2() -> Point {
    LatLng::from_degrees(0.5, 0.0).to_point()
}

// ─── Loop vs Loop containment (C++: BM_ContainsContains) ───────────────

#[library_benchmark]
fn loop_contains_nested_64v() -> bool {
    let outer = make_loop(center1(), 2.0, 64);
    let inner = make_loop(center1(), 1.0, 64);
    black_box(outer.contains_loop(&inner))
}

#[library_benchmark]
fn loop_contains_nested_256v() -> bool {
    let outer = make_loop(center1(), 2.0, 256);
    let inner = make_loop(center1(), 1.0, 256);
    black_box(outer.contains_loop(&inner))
}

// ─── Loop vs Loop disjoint (C++: BM_ContainsDisjoint) ──────────────────

#[library_benchmark]
fn loop_contains_disjoint_64v() -> bool {
    let a = make_loop(center1(), 1.0, 64);
    let b = make_loop(LatLng::from_degrees(10.0, 10.0).to_point(), 1.0, 64);
    black_box(a.contains_loop(&b))
}

// ─── Loop vs Loop intersects (C++: BM_IntersectsContains) ──────────────

#[library_benchmark]
fn loop_intersects_nested_64v() -> bool {
    let outer = make_loop(center1(), 2.0, 64);
    let inner = make_loop(center1(), 1.0, 64);
    black_box(outer.intersects_loop(&inner))
}

#[library_benchmark]
fn loop_intersects_crossing_64v() -> bool {
    let a = make_loop(center1(), 1.0, 64);
    let b = make_loop(center2(), 1.0, 64);
    black_box(a.intersects_loop(&b))
}

#[library_benchmark]
fn loop_intersects_disjoint_64v() -> bool {
    let a = make_loop(center1(), 1.0, 64);
    let b = make_loop(LatLng::from_degrees(10.0, 10.0).to_point(), 1.0, 64);
    black_box(a.intersects_loop(&b))
}

// ─── Loop area/centroid (C++: BM_GetArea) ──────────────────────────────

#[library_benchmark]
fn loop_get_area_64v() -> f64 {
    let loop_ = make_loop(center1(), 1.0, 64);
    black_box(loop_.area())
}

#[library_benchmark]
fn loop_get_area_256v() -> f64 {
    let loop_ = make_loop(center1(), 1.0, 256);
    black_box(loop_.area())
}

#[library_benchmark]
fn loop_get_area_1024v() -> f64 {
    let loop_ = make_loop(center1(), 1.0, 1024);
    black_box(loop_.area())
}

// ─── Loop contains point (C++: BM_ContainsPoint) ──────────────────────

#[library_benchmark]
fn loop_contains_point_64v() -> bool {
    let loop_ = make_loop(center1(), 1.0, 64);
    let pt = LatLng::from_degrees(0.5, 0.0).to_point();
    black_box(loop_.contains_point(&pt))
}

#[library_benchmark]
fn loop_contains_point_256v() -> bool {
    let loop_ = make_loop(center1(), 1.0, 256);
    let pt = LatLng::from_degrees(0.5, 0.0).to_point();
    black_box(loop_.contains_point(&pt))
}

// ─── Loop construction (C++: BM_Constructor) ───────────────────────────

#[library_benchmark]
fn loop_constructor_64v() -> Loop {
    black_box(make_loop(center1(), 1.0, 64))
}

#[library_benchmark]
fn loop_constructor_256v() -> Loop {
    black_box(make_loop(center1(), 1.0, 256))
}

#[library_benchmark]
fn loop_constructor_1024v() -> Loop {
    black_box(make_loop(center1(), 1.0, 1024))
}

// ─── Loop validate (C++: BM_IsValid) ──────────────────────────────────

#[library_benchmark]
fn loop_validate_64v() -> Result<(), String> {
    let loop_ = make_loop(center1(), 1.0, 64);
    black_box(loop_.validate())
}

#[library_benchmark]
fn loop_validate_256v() -> Result<(), String> {
    let loop_ = make_loop(center1(), 1.0, 256);
    black_box(loop_.validate())
}

// ─── Loop compare_boundary (C++: BM_CompareBoundary*) ─────────────────

#[library_benchmark]
fn loop_compare_boundary_contains_64v() -> i32 {
    let outer = make_loop(center1(), 2.0, 64);
    let inner = make_loop(center1(), 1.0, 64);
    black_box(outer.compare_boundary(&inner))
}

#[library_benchmark]
fn loop_compare_boundary_crosses_64v() -> i32 {
    let a = make_loop(center1(), 1.0, 64);
    let b = make_loop(center2(), 1.0, 64);
    black_box(a.compare_boundary(&b))
}

#[library_benchmark]
fn loop_compare_boundary_disjoint_64v() -> i32 {
    let a = make_loop(center1(), 1.0, 64);
    let b = make_loop(LatLng::from_degrees(10.0, 10.0).to_point(), 1.0, 64);
    black_box(a.compare_boundary(&b))
}

// ─── Loop contains_nested (C++: BM_ContainsNested) ────────────────────

#[library_benchmark]
fn loop_contains_nested_boundary_64v() -> bool {
    let outer = make_loop(center1(), 2.0, 64);
    let inner = make_loop(center1(), 1.0, 64);
    black_box(outer.contains_nested(&inner))
}

// ─── Loop intersects crosses (C++: BM_IntersectsCrosses) ──────────────

#[library_benchmark]
fn loop_intersects_crosses_64v() -> bool {
    let a = make_loop(center1(), 1.0, 64);
    let b = make_loop(center2(), 1.0, 64);
    black_box(a.intersects_loop(&b))
}

library_benchmark_group!(
    name = loop_operations_benchmarks;
    benchmarks =
        loop_contains_nested_64v,
        loop_contains_nested_256v,
        loop_contains_disjoint_64v,
        loop_intersects_nested_64v,
        loop_intersects_crossing_64v,
        loop_intersects_disjoint_64v,
        loop_get_area_64v,
        loop_get_area_256v,
        loop_get_area_1024v,
        loop_contains_point_64v,
        loop_contains_point_256v,
        loop_constructor_64v,
        loop_constructor_256v,
        loop_constructor_1024v,
        loop_validate_64v,
        loop_validate_256v,
        loop_compare_boundary_contains_64v,
        loop_compare_boundary_crosses_64v,
        loop_compare_boundary_disjoint_64v,
        loop_contains_nested_boundary_64v,
        loop_intersects_crosses_64v
);

main!(library_benchmark_groups = loop_operations_benchmarks);