gis-tools 1.13.1

A collection of geospatial tools primarily designed for WGS84, Web Mercator, and S2.
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

/// Splitter value
pub const SPLITTER: f64 = 134217729.0;
/// Result error bound
pub const RESULTERRBOUND: f64 = (3.0 + 8.0 * f64::EPSILON) * f64::EPSILON;
/// CCW error bound A
pub const CCWERRBOUND_A: f64 = (3.0 + 16.0 * f64::EPSILON) * f64::EPSILON;
/// CCW error bound B
pub const CCWERRBOUND_B: f64 = (2.0 + 12.0 * f64::EPSILON) * f64::EPSILON;
/// CCW error bound C
pub const CCWERRBOUND_C: f64 = (9.0 + 64.0 * f64::EPSILON) * f64::EPSILON * f64::EPSILON;

/// ast_expansion_sum_zeroelim routine from oritinal code
pub fn pred_sum(elen: usize, e: &[f64], flen: usize, f: &[f64], h: &mut [f64]) -> usize {
    let mut q: f64;
    let mut qnew: f64;
    let mut hh: f64;
    let mut bvirt: f64;
    let mut enow = e[0];
    let mut fnow = f[0];
    let mut eindex = 0;
    let mut findex = 0;
    if (fnow > enow) == (fnow > -enow) {
        q = enow;
        eindex += 1;
        enow = e.get(eindex).copied().unwrap_or(0.);
    } else {
        q = fnow;
        findex += 1;
        fnow = f.get(findex).copied().unwrap_or(0.);
    }
    let mut hindex = 0;
    if eindex < elen && findex < flen {
        if (fnow > enow) == (fnow > -enow) {
            qnew = enow + q;
            hh = q - (qnew - enow);
            eindex += 1;
            // enow = e[eindex];
            enow = e.get(eindex).copied().unwrap_or(0.);
        } else {
            qnew = fnow + q;
            hh = q - (qnew - fnow);
            findex += 1;
            // fnow = f[findex];
            fnow = f.get(findex).copied().unwrap_or(0.);
        }
        q = qnew;
        if hh != 0. {
            h[hindex] = hh;
            hindex += 1;
        }
        while eindex < elen && findex < flen {
            if (fnow > enow) == (fnow > -enow) {
                qnew = q + enow;
                bvirt = qnew - q;
                hh = q - (qnew - bvirt) + (enow - bvirt);
                eindex += 1;
                enow = e.get(eindex).copied().unwrap_or(0.);
            } else {
                qnew = q + fnow;
                bvirt = qnew - q;
                hh = q - (qnew - bvirt) + (fnow - bvirt);
                findex += 1;
                // fnow = f[findex];
                fnow = f.get(findex).copied().unwrap_or(0.);
            }
            q = qnew;
            if hh != 0. {
                h[hindex] = hh;
                hindex += 1;
            }
        }
    }
    while eindex < elen {
        qnew = q + enow;
        bvirt = qnew - q;
        hh = q - (qnew - bvirt) + (enow - bvirt);
        eindex += 1;
        // enow = e[eindex];
        enow = e.get(eindex).copied().unwrap_or(0.);
        q = qnew;
        if hh != 0. {
            h[hindex] = hh;
            hindex += 1;
        }
    }
    while findex < flen {
        qnew = q + fnow;
        bvirt = qnew - q;
        hh = q - (qnew - bvirt) + (fnow - bvirt);
        findex += 1;
        // fnow = f[findex];
        fnow = f.get(findex).copied().unwrap_or(0.);
        q = qnew;
        if hh != 0. {
            h[hindex] = hh;
            hindex += 1;
        }
    }
    if q != 0. || hindex == 0 {
        h[hindex] = q;
        hindex += 1;
    }
    hindex
}

// /// Predicate sum of three points
// #[allow(clippy::too_many_arguments)]
// pub fn pred_sum_three(
//     alen: usize,
//     a: &[f64],
//     blen: usize,
//     b: &[f64],
//     clen: usize,
//     c: &[f64],
//     tmp: &mut [f64],
//     out: &mut [f64],
// ) -> usize {
//     pred_sum(pred_sum(alen, a, blen, b, tmp), tmp, clen, c, out)
// }

// /// scale_expansion_zeroelim routine from oritinal code
// pub fn scale(elen: usize, e: &[f64], b: f64, h: &mut [f64]) -> usize {
//     let mut q: f64;
//     let mut sum: f64;
//     let mut hh: f64;
//     let mut product1: f64;
//     let mut product0: f64;
//     let mut bvirt: f64;
//     let mut c: f64;
//     let mut ahi: f64;
//     let mut alo: f64;

//     c = SPLITTER * b;
//     let bhi = c - (c - b);
//     let blo = b - bhi;
//     let mut enow = e[0];
//     q = enow * b;
//     c = SPLITTER * enow;
//     ahi = c - (c - enow);
//     alo = enow - ahi;
//     hh = alo * blo - (q - ahi * bhi - alo * bhi - ahi * blo);
//     let mut hindex = 0;
//     if hh != 0. {
//         h[hindex] = hh;
//         hindex += 1;
//     }

//     for item in e.iter().take(elen).skip(1) {
//         enow = *item;
//         product1 = enow * b;
//         c = SPLITTER * enow;
//         ahi = c - (c - enow);
//         alo = enow - ahi;
//         product0 = alo * blo - (product1 - ahi * bhi - alo * bhi - ahi * blo);
//         sum = q + product0;
//         bvirt = sum - q;
//         hh = q - (sum - bvirt) + (product0 - bvirt);
//         if hh != 0. {
//             h[hindex] = hh;
//             hindex += 1;
//         }
//         q = product1 + sum;
//         hh = sum - (q - product1);
//         if hh != 0. {
//             h[hindex] = hh;
//             hindex += 1;
//         }
//     }
//     if q != 0. || hindex == 0 {
//         h[hindex] = q;
//         hindex += 1;
//     }

//     hindex
// }

/// estimation of expansion sum
pub fn estimate(elen: usize, e: &[f64]) -> f64 {
    e.iter().take(elen).skip(1).sum()
}