geodesy 0.15.0

A platform for experiments with geodetic transformations and data flow
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
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
use crate::Error;
use std::collections::BTreeMap;

/// Convenience methods for lexical analysis of operator definitions.
/// - For splitting a pipeline into steps
/// - For splitting a step into parameters (i.e. key=value-pairs)
/// - For syntactical normalization by desugaring and elimination of non-significant whitespace
/// - For checking whether a given operator is singular or a pipeline
/// - For checking whether a key is a macro name ("resource name"), and
/// - For accessing the name of a given operator.
pub trait Tokenize {
    /// Remove inline and block comments
    fn remove_comments(&self) -> String;
    /// Rotate prefix modifiers (inv, omit_fwd, omit_inv) to the end of parameter list
    fn handle_prefix_modifiers(&self) -> String;

    /// Split a pipeline definition into steps
    fn split_into_steps(&self) -> Vec<String>;

    /// Split a step/an operation into parameters. Give special treatment
    /// to names and flags:
    /// ```txt
    /// 'foo bar=baz bonk=blue flag' -> ('name=foo', 'bar=baz', 'bonk=blue', 'flag=true')
    /// ```
    fn split_into_parameters(&self) -> BTreeMap<String, String>;

    /// Helper function for 'split_into_steps' and 'split_into_parameters':
    /// Glue syntactical elements together, and separate from each other
    /// by a single space:
    ///
    /// 1. Glue key-value pairs together by omitting whitespace around '=':
    ///    ```txt
    ///    key1= value1            key2    =value2  ->  key1=value1 key2=value2
    ///    ```
    /// 2. Trim whitespace on both sides of the macro sigil ':' and leave only
    ///    one space to the left of the dereference sigil '$':
    ///    ```txt
    ///    foo: bar $ baz -> foo:bar $baz
    ///    ```
    /// 3. Trim whitespace around sequence separators ',' and '|':
    ///    ```txt
    ///     foo | bar baz=bonk   ,    bonk  ->  foo|bar baz=bonk,bonk
    ///    ```
    /// 4. Desugar the one-way sequence separators '<' and '>':
    ///    ```txt
    ///     foo > bar < baz  ->  foo|omit_inv bar|omit_fwd baz
    ///    ```
    fn normalize(&self) -> String;

    fn is_pipeline(&self) -> bool;
    fn is_resource_name(&self) -> bool;
    fn operator_name(&self) -> String;
}

/// Tokenize implementation for string-like objects
impl<T> Tokenize for T
where
    T: AsRef<str>,
{
    fn remove_comments(&self) -> String {
        // Impose some line ending sanity
        let all = self
            .as_ref()
            .trim()
            .replace("\r\n", "\n") // The fenestration company
            .replace('\r', "\n") // The fruit company
            .replace("\n:", "\n") // Line continuation markers
            .to_string();
        // Remove comments
        let mut trimmed = String::new();
        for line in all.lines() {
            let line = line.trim();
            if line.is_empty() {
                continue;
            }

            // Remove comments - both inline and separate lines ("block comments")
            let line: Vec<&str> = line.trim().split('#').collect();
            // Full line comment - just skip
            if line[0].starts_with('#') {
                continue;
            }

            // Inline comment, or no comment at all: Collect everything before `#`
            trimmed += " ";
            trimmed += line[0].trim();
        }
        trimmed
    }

    fn handle_prefix_modifiers(&self) -> String {
        if self.is_pipeline() {
            return self.as_ref().to_string();
        }

        let mut elements: Vec<_> = self.as_ref().split_whitespace().collect();
        if elements.is_empty() {
            return "".to_string();
        }

        // Rotate all desugared modifiers to the end of the list
        let modifiers = ["inv", "omit_fwd", "omit_inv"];
        while modifiers.contains(&elements[0]) {
            elements.rotate_left(1);
        }
        elements.join(" ")
    }

    fn split_into_steps(&self) -> Vec<String> {
        self.remove_comments()
            .normalize()
            // split into steps
            .split('|')
            // remove empty steps
            .filter(|x| !x.trim().is_empty())
            // rotate modifiers and convert &str to String
            .map(|x| x.handle_prefix_modifiers())
            // and turn into Vec<String>
            .collect()
    }

    fn split_into_parameters(&self) -> BTreeMap<String, String> {
        // Remove non-significant whitespace, then split by significant
        let step = self.as_ref().normalize().handle_prefix_modifiers();
        let elements: Vec<_> = step.split_whitespace().collect();
        let mut params = BTreeMap::new();
        if step.is_pipeline() {
            params.insert(String::from("_name"), step);
            return params;
        }

        for element in elements {
            // Split a key=value-pair into key and value parts
            let mut parts: Vec<&str> = element.trim().split('=').collect();
            // Add a boolean true part, to make sure we have a value, even for flags
            // (flags are booleans that are true when specified, false when not)
            parts.push("true");
            assert!(parts.len() > 1);

            // If the first arg is a key-without-value, it is the name of the operator
            if params.is_empty() && parts.len() == 2 {
                params.insert(String::from("_name"), String::from(parts[0]));
                continue;
            }

            params.insert(String::from(parts[0]), String::from(parts[1]));
        }

        params
    }

    fn normalize(&self) -> String {
        // Tweak everything into canonical form
        self.as_ref()
            .trim()
            .trim_matches(':')
            .replace("\n:", "\n")
            .split_whitespace()
            .collect::<Vec<_>>()
            .join(" ")
            .replace("= ", "=")
            .replace(": ", ":")
            .replace(", ", ",")
            .replace("| ", "|")
            .replace("> ", ">")
            .replace("< ", "<")
            .replace(" =", "=")
            .replace(" :", ":")
            .replace(" ,", ",")
            .replace(" |", "|")
            .replace(" >", ">")
            .replace(" <", "<")
            .replace('>', "|omit_inv ")
            .replace('<', "|omit_fwd ")
            .replace("₀=", "_0=")
            .replace("₁=", "_1=")
            .replace("₂=", "_2=")
            .replace("₃=", "_3=")
            .replace("₄=", "_4=")
            .replace("₅=", "_5=")
            .replace("₆=", "_6=")
            .replace("₇=", "_7=")
            .replace("₈=", "_8=")
            .replace("₉=", "_9=")
            .replace("$ ", "$") // But keep " $" as is!
            .split_whitespace()
            .collect::<Vec<_>>()
            .join(" ")
    }

    fn is_pipeline(&self) -> bool {
        self.as_ref().contains('|') || self.as_ref().contains('<') || self.as_ref().contains('>')
    }

    fn is_resource_name(&self) -> bool {
        self.operator_name().contains(':')
    }

    fn operator_name(&self) -> String {
        if self.is_pipeline() {
            return "".to_string();
        }
        self.split_into_parameters()
            .get("_name")
            .unwrap_or(&"".to_string())
            .to_string()
    }
}

/// Translate a PROJ string into Rust Geodesy format. Since PROJ is syntactically
/// unrestrictive, we do not try to detect any syntax errors: If the input
/// is so cursed as to be intranslatable, this will become clear when trying to
/// instantiate the result as a Geodesy operator. We do, however, check for and
/// report on two *semantically* refusable cases: First, that PROJ does not support
/// nested pipelines (the nesting must be done indirectly through an init-file),
/// second that Rust Geodesy does not support init-files. Hence no support for
/// any kind of nesting here.
///
/// ## Known differences between PROJ and Rust Geodesy definitions:
///
/// ## Ellipsoid definitions
/// - Geodesy only supports a limited set of builtin ellipsoids OR or definition
///   via semi-major and reverse-flattening parameters  `ellps=a,rf`.
/// - PROJ has [richer ellipsoid](https://proj.org/en/9.3/usage/ellipsoids.html#ellipsoid-size-parameters)
///   support which *parse_proj* provides partial support for.
/// - Specifically if an ellipsoid is defined via `a` and `rf` parameters, *parse_proj*
///   will redefine them as `ellps=a,rf` and remove the `a` and `rf` parameters.
/// - All other cases supported by PROJ are NOT handled by *parse_proj* and will
///   fail when instantiating the operator.
///
/// ## Scaling via `k` parameter
/// - PROJ still supports the deprecated `k` parameter. Most output from `projinfo` will
///   have the scaling defined as `k` instead of `k_0`.
/// - *parse_proj* will replace `k` with `k_0` whenever it is encountered.
///
pub fn parse_proj(definition: &str) -> Result<String, Error> {
    // If it doesn't look like a PROJ string, we return it unchanged
    if definition.contains('|') | !definition.contains("proj") {
        return Ok(definition.to_string());
    }
    // Impose some line ending sanity and remove the PROJ '+' prefix
    let all = definition
        .replace("\r\n", "\n")
        .replace('\r', "\n")
        .replace(" +", " ")
        .replace("\n+", " ")
        .trim()
        .trim_start_matches('+')
        .to_string();

    // Collect the PROJ string
    let mut trimmed = String::new();
    for line in all.lines() {
        let line = line.trim();

        // Remove block comments
        let line: Vec<&str> = line.trim().split('#').collect();
        // Full line (block) comment - just skip
        if line[0].starts_with('#') {
            continue;
        }

        // Inline comment, or no comment at all: Collect everything before `#`
        trimmed += " ";
        trimmed += line[0].trim();
    }

    // Now split the text into steps. First make sure we do not match
    //"step" as part of a word (stairSTEPping,  poSTEPileptic, STEPwise,
    // quickSTEP), by making it possible to only search for " step "
    trimmed = " ".to_string() + &trimmed.normalize() + " ";

    // Remove empty steps and other non-significant whitespace
    let steps: Vec<String> = trimmed
        // split into steps
        .split(" step ")
        // remove empty steps
        .filter(|x| !x.trim().trim_start_matches("step ").is_empty())
        // remove spurious 'step step' noise and convert &str to String
        .map(|x| x.trim().trim_start_matches("step ").to_string())
        // turn into Vec<String>
        .collect();

    // For accumulating the pipeline steps converted to geodesy syntax
    let mut geodesy_steps = Vec::new();

    // Geodesy does not support pipeline globals, so we must explicitly
    // insert them in the beginning of the argument list of each step
    let mut pipeline_globals = "".to_string();
    let mut pipeline_is_inverted = false;

    for (step_index, step) in steps.iter().enumerate() {
        let mut elements: Vec<_> = step.split_whitespace().map(|x| x.to_string()).collect();

        // Move the "proj=..." element to the front of the collection, stripped for "proj="
        // and handle the pipeline globals, if any
        for (i, element) in elements.iter().enumerate() {
            // Mutating the Vec we are iterating over may seem dangerous but is
            // OK as we break out of the loop immediately after the mutation
            if element.starts_with("init=") {
                return Err(Error::Unsupported(
                    "parse_proj does not support PROJ init clauses: ".to_string() + step,
                ));
            }

            if element.starts_with("proj=") {
                elements.swap(i, 0);
                elements[0] = elements[0][5..].to_string();

                // In the proj=pipeline case, just collect the globals, without
                // introducing a new step into geodesy_steps
                if elements[0] == "pipeline" {
                    if step_index != 0 {
                        return Err(Error::Unsupported(
                            "PROJ does not support nested pipelines: ".to_string() + &trimmed,
                        ));
                    }
                    elements.remove(0);

                    // The case of 'inv' in globals must be handled separately, since it indicates
                    // the inversion of the entire pipeline, not just an inversion of each step
                    if elements.contains(&"inv".to_string()) {
                        pipeline_is_inverted = true;
                    }

                    // Remove all cases of 'inv' from the global arguments
                    let pipeline_globals_elements: Vec<String> = elements
                        .join(" ")
                        .trim()
                        .to_string()
                        .split_whitespace()
                        .filter(|x| x.trim() != "inv")
                        .map(|x| x.trim().to_string())
                        .collect();
                    pipeline_globals = pipeline_globals_elements.join(" ").trim().to_string();
                    elements.clear();
                }
                break;
            }
        }

        tidy_proj(&mut elements)?;

        // Skip empty steps, insert pipeline globals, handle step and pipeline
        // inversions, and handle directional omissions (omit_fwd, omit_inv)
        let mut geodesy_step = elements.join(" ").trim().to_string();
        if !geodesy_step.is_empty() {
            if !pipeline_globals.is_empty() {
                elements.insert(1, pipeline_globals.clone());
            }

            let step_is_inverted = elements.contains(&"inv".to_string());
            elements = elements
                .iter()
                .filter(|x| x.as_str() != "inv")
                .map(|x| match x.as_str() {
                    "omit_fwd" => "omit_inv",
                    "omit_inv" => "omit_fwd",
                    _ => x,
                })
                .map(|x| x.to_string())
                .collect();

            if step_is_inverted != pipeline_is_inverted {
                elements.insert(1, "inv".to_string());
            }

            geodesy_step = elements.join(" ").trim().to_string();
            if pipeline_is_inverted {
                geodesy_steps.insert(0, geodesy_step);
            } else {
                geodesy_steps.push(geodesy_step);
            }
        }
    }
    Ok(geodesy_steps.join(" | ").trim().to_string())
}

// Address some known incompatibilities between PROJ and Rust Geodesy
// - Ellipsoid definitions
// - Scaling via the deprecated `k` parameter
fn tidy_proj(elements: &mut Vec<String>) -> Result<(), Error> {
    // Geodesy only supports ellipsoid definitions as named builtins or ellps=a,rf
    // PROJ has richer support which we try navigate here
    // First we find the indices of ellps, a and rf elements
    let mut ellps_def: [Option<usize>; 3] = [None; 3];
    for (i, element) in elements.iter().enumerate() {
        if element.starts_with("ellps=") {
            ellps_def[0] = Some(i);
        }
        if element.starts_with("a=") {
            ellps_def[1] = Some(i);
        }
        if element.starts_with("rf=") {
            ellps_def[2] = Some(i);
        }
    }

    // Then if there there is an `a` AND and an `rf` element but NOT an `ellps` element
    // we compose them into the `ellps=a,rf` format.
    // Anything else we ignore, this means that if `ellps` is defined we do nothing
    // and if an ellps is defined but is also modified with `a` or `rf`
    // elements we ignore it and rely on operator instantiation to fail due to unknown elements
    // A complete solution would need to include `a` and `rf` keys in the gamut of all operators so that
    // the Ellipsoid struct can build the required ellipsoid.
    if let [None, Some(a_idx), Some(rf_idx)] = ellps_def {
        let a = elements[a_idx][2..].to_string();
        let rf = elements[rf_idx][3..].to_string();
        elements.push(format!("ellps={a},{rf}").to_string());

        // Remove the a and rf elements from the vector
        if a_idx > rf_idx {
            elements.remove(a_idx);
            elements.remove(rf_idx);
        } else {
            elements.remove(rf_idx);
            elements.remove(a_idx);
        }
    }

    // `projinfo`  still produces strings with scaling defined as `k` instead of `k_0`
    // We replace `k` with `k_0` wherever it is encountered.
    for (i, element) in elements.iter().enumerate() {
        if let Some(stripped) = element.strip_prefix("k=") {
            elements[i] = "k_0=".to_string() + stripped;
            // There should be at most one scaling so it's safe to break here
            break;
        }
    }

    Ok(())
}

// ----- T E S T S ------------------------------------------------------------------

#[cfg(test)]
mod tests {
    use super::*;
    use crate::prelude::*;

    // Test the fundamental tokenization functionality
    #[test]
    fn token() -> Result<(), Error> {
        // Whitespace normalization
        assert_eq!("foo bar $ baz = bonk".normalize(), "foo bar $baz=bonk");
        assert_eq!(
            "foo |  bar baz  =  bonk, bonk , bonk x₁=42  y₁ = 7".normalize(),
            "foo|bar baz=bonk,bonk,bonk x_1=42 y_1=7"
        );

        // Whitespace agnostic desugaring of '<', '>' into '|omit_fwd', '|omit_inv'
        assert_eq!(
            "  : foo>bar <baz  =  bonk,\n: bonk , bonk<zap".normalize(),
            "foo|omit_inv bar|omit_fwd baz=bonk,bonk,bonk|omit_fwd zap"
        );

        // Splitting a pipeline into steps (and handle prefix modifiers)
        let all = "foo>bar |baz  bonk=bonk, bonk , bonk x₁=42 <zap".split_into_steps();
        assert_eq!(all.len(), 4);
        assert_eq!(all[0], "foo");
        assert_eq!(all[1], "bar omit_inv");
        assert_eq!(all[2], "baz bonk=bonk,bonk,bonk x_1=42");
        assert_eq!(all[3], "zap omit_fwd");

        // Parameter splitting
        let args = "foo bar baz=bonk".split_into_parameters();
        assert_eq!(args["_name"], "foo");
        assert_eq!(args["bar"], "true");
        assert_eq!(args["baz"], "bonk");
        assert_eq!("foo bar baz=bonk".operator_name(), "foo");
        assert_eq!("inv foo bar baz=bonk".operator_name(), "foo");

        // Detection of pipelines and resources
        assert!("foo | bar".is_pipeline());
        assert!("foo > bar".is_pipeline());
        assert!("foo < bar".is_pipeline());
        assert!("foo:bar".is_resource_name());

        // Proper handling of subscripts
        let args = "foo x₁=42".split_into_parameters();
        assert_eq!(args["_name"], "foo");
        assert_eq!(args["x_1"], "42");

        // ... and the operator name
        assert_eq!("foo bar baz=  $bonk".operator_name(), "foo");
        Ok(())
    }

    // The PROJ language provides ample opportunity to explore pathological cases
    #[test]
    fn proj() -> Result<(), Error> {
        // Some trivial, but strangely formatted cases
        assert_eq!(
            parse_proj("+a   =   1 +proj =foo    b= 2  ")?,
            "foo a=1 b=2"
        );
        assert_eq!(
            parse_proj("+a   =   1 +proj =foo    +   b= 2  ")?,
            "foo a=1 b=2"
        );

        // An invalid PROJ string, that parses into an empty pipeline
        assert_eq!(parse_proj("      proj=")?, "");

        // A pipeline with a single step and a global argument
        assert_eq!(
            parse_proj("proj=pipeline +foo=bar +step proj=utm zone=32")?,
            "utm foo=bar zone=32"
        );

        // A pipeline with 3 steps and 2 global arguments
        assert_eq!(
            parse_proj(
                "proj=pipeline +foo = bar ellps=GRS80 step proj=cart step proj=helmert s=3 step proj=cart ellps=intl"
            )?,
            "cart foo=bar ellps=GRS80 | helmert foo=bar ellps=GRS80 s=3 | cart foo=bar ellps=GRS80 ellps=intl"
        );

        // Although PROJ would choke on this, we accept steps without an initial proj=pipeline
        assert_eq!(
            parse_proj("proj=utm zone=32 step proj=utm inv zone=32")?,
            "utm zone=32 | utm inv zone=32"
        );

        // Check for accidental matching of 'step' - even for a hypothetical 'proj=step arg...'
        // and for args called 'step' (which, however, cannot be flags - must come with a value
        // to be recognized as a key=value pair)
        assert_eq!(
            parse_proj(
                "  +step proj = step step=quickstep step step proj=utm inv zone=32 step proj=stepwise step proj=quickstep"
            )?,
            "step step=quickstep | utm inv zone=32 | stepwise | quickstep"
        );

        // Invert the entire pipeline, turning "zone 32-to-zone 33" into "zone 33-to-zone 32"
        // Also throw a few additional spanners in the works, in the form of some ugly, but
        // PROJ-accepted, syntactical abominations
        assert_eq!(
            parse_proj(
                "inv ellps=intl proj=pipeline ugly=syntax +step inv proj=utm zone=32 step proj=utm zone=33"
            )?,
            "utm inv ellps=intl ugly=syntax zone=33 | utm ellps=intl ugly=syntax zone=32"
        );

        // Check for the proper inversion of directional omissions
        assert_eq!(
            parse_proj(
                "proj=pipeline inv   +step   omit_fwd inv proj=utm zone=32   step   omit_inv proj=utm zone=33"
            )?,
            "utm inv omit_fwd zone=33 | utm omit_inv zone=32"
        );

        // Nested pipelines are not supported...

        // Nested pipelines in PROJ requires an `init=` indirection
        assert!(matches!(
            parse_proj("proj=pipeline step proj=pipeline"),
            Err(Error::Unsupported(_))
        ));
        // ...but `init` is not supported by Rust Geodesy, since that
        // would require a full implementation of PROJ's resolution
        // system - which would be counter to RG's raison d'etre
        assert!(matches!(
            parse_proj("pipeline step init=another_pipeline step proj=noop"),
            Err(Error::Unsupported(_))
        ));

        // Room here for testing of additional pathological cases...

        // Now check the sanity of the 'pipeline globals' handling
        let mut ctx = Minimal::default();

        // Check that we get the correct argument value when inserting pipeline globals
        // *at the top of the argument list*. Here: x=1 masquerades as the global value,
        // while x=2 is the step local one, which overwrites the global
        let op = ctx.op("helmert x=1 x=2")?;
        let mut operands = crate::test_data::coor2d();
        assert_eq!(2, ctx.apply(op, Fwd, &mut operands)?);
        assert_eq!(operands[0][0], 57.0);
        assert_eq!(operands[1][0], 61.0);

        Ok(())
    }

    #[test]
    fn tidy_proj() -> Result<(), Error> {
        // Ellipsoid defined with `a` and `rf` parameters instead of ellps
        assert_eq!(
            parse_proj(
                "+proj=pipeline +step +inv +proj=tmerc +a=6378249.145 +rf=293.465 +step +proj=step2"
            )?,
            "tmerc inv ellps=6378249.145,293.465 | step2"
        );

        // Ellipsoid is defined with a builtin
        assert_eq!(parse_proj("+proj=tmerc +ellps=GRS80")?, "tmerc ellps=GRS80");

        // Ellipsoid is defined with a builtin but is modified by `a` or `rf`
        // Note we don't remove `a` here even though this modification is not supported in RG
        // it's expected to fail in the operator instantiation
        assert_eq!(
            parse_proj("+proj=tmerc +ellps=GRS80 +a=1")?,
            "tmerc ellps=GRS80 a=1"
        );

        // Replace occurrences of `k=` with `k_0=`
        assert_eq!(parse_proj("+proj=tmerc +k=1.5")?, "tmerc k_0=1.5");

        Ok(())
    }
}