utiles-core 0.7.3

Map tile utilities aka utiles
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

#![cfg(test)]
#![allow(clippy::unwrap_used)]
#![deny(clippy::similar_names)]

use crate::*;
use std::collections::HashSet;

#[test]
fn zoom_or_zooms() {
    let z = as_zooms(1.into());
    assert_eq!(z, vec![1]);
    let z = as_zooms(vec![1, 2, 3].into());
    assert_eq!(z, vec![1, 2, 3]);
}

#[test]
fn tiles_generator() {
    let bounds = (-105.0, 39.99, -104.99, 40.0);
    let tiles = tiles(bounds, vec![14].into());
    let expect = vec![Tile::new(3413, 6202, 14), Tile::new(3413, 6203, 14)];
    assert_eq!(tiles.collect::<Vec<Tile>>(), expect);
}

#[test]
fn tiles_single_zoom() {
    let bounds = (-105.0, 39.99, -104.99, 40.0);
    let tiles = tiles(bounds, 14.into());
    let expect = vec![Tile::new(3413, 6202, 14), Tile::new(3413, 6203, 14)];
    assert_eq!(tiles.collect::<Vec<Tile>>(), expect);

    let num_tiles = tiles_count(bounds, 14.into()).unwrap();
    assert_eq!(num_tiles, 2);
}

#[test]
fn tiles_anti_meridian() {
    let bounds = (175.0, 5.0, -175.0, 10.0);
    let mut tiles: Vec<Tile> = tiles(bounds, 2.into()).collect();
    tiles.sort();
    let mut expected = vec![Tile::new(3, 1, 2), Tile::new(0, 1, 2)];
    expected.sort();
    assert_eq!(tiles, expected);
}

#[test]
fn tile_is_valid() {
    let valid_tiles = vec![
        Tile::new(0, 0, 0),
        Tile::new(0, 0, 1),
        Tile::new(1, 1, 1),
        Tile::new(243, 166, 9),
    ];

    for tile in valid_tiles {
        assert!(tile.valid(), "{tile:?} is not valid");
    }
}

#[test]
fn tile_is_invalid() {
    let invalid_tiles = vec![
        Tile::new(0, 1, 0),
        Tile::new(1, 0, 0),
        Tile::new(1, 1, 0),
        Tile::new(1, 234, 1),
    ];

    for tile in invalid_tiles {
        assert!(!tile.valid(), "{tile:?} is valid");
    }
}

#[test]
fn test_macro() {
    let tile = utile!(0, 0, 0);
    assert_eq!(tile, Tile::new(0, 0, 0));
}

#[test]
fn test_simplify() {
    let targets = vec![
        utile!(487, 332, 10),
        utile!(486, 332, 10),
        utile!(487, 333, 10),
        utile!(973, 667, 11),
        utile!(973, 666, 11),
        utile!(972, 666, 11),
        utile!(1944, 1334, 12),
    ];

    let mut children = vec![];
    for t in &targets {
        children.extend(t.children(Some(12)));
    }
    let tset = children.into_iter().collect::<HashSet<Tile>>();
    let simplified = simplify(&tset, None);
    for target in targets {
        assert!(simplified.contains(&target));
    }
}
#[test]
fn test_simplify_minzoom() {
    let targets = vec![
        utile!(487, 332, 10),
        utile!(486, 332, 10),
        utile!(487, 333, 10),
        utile!(973, 667, 11),
        utile!(973, 666, 11),
        utile!(972, 666, 11),
        utile!(1944, 1334, 12),
    ];

    let mut children = vec![];
    for t in &targets {
        children.extend(t.children(Some(12)));
    }
    let tset = children.into_iter().collect::<HashSet<Tile>>();
    let simplified = simplify(&tset, Some(11));
    for target in targets {
        if target.z == 10 {
            for child in target.children1() {
                assert!(simplified.contains(&child));
            }
        } else {
            assert!(simplified.contains(&target));
        }
    }
}
#[test]
fn test_simplify_v1_minzoom() {
    let targets = vec![
        utile!(487, 332, 10),
        utile!(486, 332, 10),
        utile!(487, 333, 10),
        utile!(973, 667, 11),
        utile!(973, 666, 11),
        utile!(972, 666, 11),
        utile!(1944, 1334, 12),
    ];

    let mut children = vec![];
    for t in &targets {
        children.extend(t.children(Some(12)));
    }
    let tset = children.into_iter().collect::<HashSet<Tile>>();
    let simplified = simplify_v1(&tset, Some(11));
    for target in targets {
        if target.z == 10 {
            for child in target.children1() {
                assert!(simplified.contains(&child));
            }
        } else {
            assert!(simplified.contains(&target));
        }
    }
}

#[test]
fn test_simplify_removal() {
    let tiles = vec![
        utile!(1298, 3129, 13),
        utile!(649, 1564, 12),
        utile!(650, 1564, 12),
    ];
    let tset = tiles.into_iter().collect::<HashSet<Tile>>();
    let simplified = simplify(&tset, None);
    assert!(!simplified.contains(&utile!(1298, 3129, 13)));
    assert!(simplified.contains(&utile!(650, 1564, 12)));
    assert!(simplified.contains(&utile!(649, 1564, 12)));
}