-
Notifications
You must be signed in to change notification settings - Fork 774
/
PJ_pipeline.c
623 lines (491 loc) · 21.1 KB
/
PJ_pipeline.c
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
612
613
614
615
616
617
618
619
620
621
622
623
/*******************************************************************************
Transformation pipeline manager
Thomas Knudsen, 2016-05-20/2016-11-20
********************************************************************************
Geodetic transformations are typically organized in a number of
steps. For example, a datum shift could be carried out through
these steps:
1. Convert (latitude, longitude, ellipsoidal height) to
3D geocentric cartesian coordinates (X, Y, Z)
2. Transform the (X, Y, Z) coordinates to the new datum, using a
7 parameter Helmert transformation.
3. Convert (X, Y, Z) back to (latitude, longitude, ellipsoidal height)
If the height system used is orthometric, rather than ellipsoidal,
another step is needed at each end of the process:
1. Add the local geoid undulation (N) to the orthometric height
to obtain the ellipsoidal (i.e. geometric) height.
2. Convert (latitude, longitude, ellipsoidal height) to
3D geocentric cartesian coordinates (X, Y, Z)
3. Transform the (X, Y, Z) coordinates to the new datum, using a
7 parameter Helmert transformation.
4. Convert (X, Y, Z) back to (latitude, longitude, ellipsoidal height)
5. Subtract the local geoid undulation (N) from the ellipsoidal height
to obtain the orthometric height.
Additional steps can be added for e.g. change of vertical datum, so the
list can grow fairly long. None of the steps are, however, particularly
complex, and data flow is strictly from top to bottom.
Hence, in principle, the first example above could be implemented using
Unix pipelines:
cat my_coordinates | geographic_to_xyz | helmert | xyz_to_geographic > my_transformed_coordinates
in the grand tradition of Software Tools [1].
The proj pipeline driver implements a similar concept: Stringing together
a number of steps, feeding the output of one step to the input of the next.
It is a very powerful concept, that increases the range of relevance of the
proj.4 system substantially. It is, however, not a particularly intrusive
addition to the code base: The implementation is by and large completed by
adding an extra projection called "pipeline" (i.e. this file), which
handles all business.
Syntactically, the pipeline system introduces the "+step" keyword (which
indicates the start of each transformation step), the "+omit_fwd" and
"+omit_inv" keywords (which indicate that a given transformation step
should be omitted when the pipeline is executed in forward, resp. inverse
direction), and reintroduces the +inv keyword (indicating that a given
transformation step should run in reverse, i.e. forward, when the pipeline
is executed in inverse direction, and vice versa).
Hence, the first transformation example above, can be implemented as:
+proj=pipeline +step proj=cart +step proj=helmert <ARGS> +step proj=cart +inv
Where <ARGS> indicate the Helmert arguments: 3 translations (+x=..., +y=...,
+z=...), 3 rotations (+rx=..., +ry=..., +rz=...) and a scale factor (+s=...).
Following geodetic conventions, the rotations are given in Milliarcseconds,
and the scale factor is given as parts-per-million.
[1] B. W. Kernighan & P. J. Plauger: Software tools. Addison-Wesley, 1976, 338 pp.
********************************************************************************
Thomas Knudsen, thokn@sdfe.dk, 2016-05-20
********************************************************************************
* Copyright (c) 2016, Thomas Knudsen / SDFE
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
*
********************************************************************************/
#define PJ_LIB__
#include "proj_internal.h"
#include <projects.h>
#include <assert.h>
#include <stddef.h>
#include <errno.h>
PROJ_HEAD(pipeline, "Transformation pipeline manager");
/* Projection specific elements for the PJ object */
#define PIPELINE_STACK_SIZE 100
struct pj_opaque {
int reversible;
int steps;
int depth;
int verbose;
int *reverse_step;
int *omit_forward;
int *omit_inverse;
char **argv;
char **current_argv;
PJ_OBS stack[PIPELINE_STACK_SIZE];
PJ **pipeline;
};
static PJ_OBS pipeline_forward_obs (PJ_OBS, PJ *P);
static PJ_OBS pipeline_reverse_obs (PJ_OBS, PJ *P);
static XYZ pipeline_forward_3d (LPZ lpz, PJ *P);
static LPZ pipeline_reverse_3d (XYZ xyz, PJ *P);
static XY pipeline_forward (LP lpz, PJ *P);
static LP pipeline_reverse (XY xyz, PJ *P);
/********************************************************************
ISOMORPHIC TRANSFORMATIONS
*********************************************************************
In this context, an isomorphic transformation is a proj PJ
object returning the same kind of coordinates that it
receives, i.e. a transformation from angular to angular or
linear to linear coordinates.
The degrees-to-radians operation is an example of the former,
while the latter is typical for most of the datum shift
operations used in geodesy, e.g. the Helmert 7-parameter shift.
Isomorphic transformations trips up the pj_inv/pj_fwd
functions, which try to check input sanity and scale output to
internal proj units, under the assumption that if input is of
angular type, then output must be of linear (or vice versa).
Hence, to avoid having pj_inv/pj_fwd stomping on output (or
choking on input), we need a way to tell them that they should
accept whatever is being handed to them.
The P->left and P->right elements indicate isomorphism.
For classic proj style projections, they both have the
value PJ_IO_UNITS_CLASSIC (default initialization), indicating
that the forward driver expects angular input coordinates, and
provides linear output coordinates.
Newer projections may set P->left and P->right to either
PJ_IO_UNITS_METERS, PJ_IO_UNITS_RADIANS or PJ_IO_UNITS_ANY,
to indicate their I/O style.
For the forward driver, left indicates input coordinate
type, while right indicates output coordinate type.
For the inverse driver, left indicates output coordinate
type, while right indicates input coordinate type.
*********************************************************************/
static PJ_OBS pipeline_forward_obs (PJ_OBS point, PJ *P) {
int i, first_step, last_step;
first_step = 1;
last_step = P->opaque->steps + 1;
for (i = first_step; i != last_step; i++) {
proj_log_trace (P, "In[%2.2d]: %20.15g %20.15g %20.15g - %20.20s",
i-first_step, point.coo.xyz.x, point.coo.xyz.y, point.coo.xyz.z,
P->opaque->pipeline[i]->descr
);
if (P->opaque->omit_forward[i])
continue;
if (P->opaque->reverse_step[i])
point = proj_trans_obs (P->opaque->pipeline[i], PJ_INV, point);
else
point = proj_trans_obs (P->opaque->pipeline[i], PJ_FWD, point);
if (P->opaque->depth < PIPELINE_STACK_SIZE)
P->opaque->stack[P->opaque->depth++] = point;
}
proj_log_trace (P, "Out[ ]: %20.15g %20.15g %20.15g", point.coo.xyz.x, point.coo.xyz.y, point.coo.xyz.z);
P->opaque->depth = 0; /* Clear the stack */
return point;
}
static PJ_OBS pipeline_reverse_obs (PJ_OBS point, PJ *P) {
int i, first_step, last_step;
first_step = P->opaque->steps;
last_step = 0;
for (i = first_step; i != last_step; i--) {
proj_log_trace (P, "In[%2.2d]: %20.15g %20.15g %20.15g - %.4f %.4f",
i - 1, point.coo.xyz.x, point.coo.xyz.y, point.coo.xyz.z,
P->opaque->pipeline[i]->a, P->opaque->pipeline[i]->rf
);
if (P->opaque->omit_inverse[i])
continue;
if (P->opaque->reverse_step[i])
point = proj_trans_obs (P->opaque->pipeline[i], PJ_FWD, point);
else
point = proj_trans_obs (P->opaque->pipeline[i], PJ_INV, point);
if (P->opaque->depth < PIPELINE_STACK_SIZE)
P->opaque->stack[P->opaque->depth++] = point;
}
proj_log_trace (P, "Out[ ]: %20.15g %20.15g %20.15g", point.coo.xyz.x, point.coo.xyz.y, point.coo.xyz.z);
P->opaque->depth = 0; /* Clear the stack */
return point;
}
/* Delegate the work to pipeline_forward_obs() */
static XYZ pipeline_forward_3d (LPZ lpz, PJ *P) {
PJ_OBS point = proj_obs_null;
point.coo.lpz = lpz;
point = pipeline_forward_obs (point, P);
return point.coo.xyz;
}
/* Delegate the work to pipeline_reverse_obs() */
static LPZ pipeline_reverse_3d (XYZ xyz, PJ *P) {
PJ_OBS point = proj_obs_null;
point.coo.xyz = xyz;
point = pipeline_reverse_obs (point, P);
return point.coo.lpz;
}
static XY pipeline_forward (LP lp, PJ *P) {
PJ_OBS point = proj_obs_null;
point.coo.lp = lp;
point = pipeline_forward_obs (point, P);
return point.coo.xy;
}
static LP pipeline_reverse (XY xy, PJ *P) {
PJ_OBS point = proj_obs_null;
point.coo.xy = xy;
point = pipeline_reverse_obs (point, P);
return point.coo.lp;
}
static void *destructor (PJ *P, int errlev) {
int i;
if (0==P)
return 0;
if (0==P->opaque)
return pj_default_destructor (P, errlev);
/* Deallocate each pipeine step, then pipeline array */
if (0!=P->opaque->pipeline)
for (i = 0; i < P->opaque->steps; i++)
if (0!=P->opaque->pipeline[i+1])
P->opaque->pipeline[i+1]->destructor (P->opaque->pipeline[i+1], errlev);
pj_dealloc (P->opaque->pipeline);
pj_dealloc (P->opaque->reverse_step);
pj_dealloc (P->opaque->omit_forward);
pj_dealloc (P->opaque->omit_inverse);
pj_dealloc (P->opaque->argv);
pj_dealloc (P->opaque->current_argv);
return pj_default_destructor(P, errlev);
}
static PJ *pj_create_pipeline (PJ *P, size_t steps) {
/* Room for the pipeline: An array of PJ * with room for sentinels at both ends */
P->opaque->pipeline = pj_calloc (steps + 2, sizeof(PJ *));
if (0==P->opaque->pipeline)
return 0;
P->opaque->steps = (int)steps;
P->opaque->reverse_step = pj_calloc (steps + 2, sizeof(int));
if (0==P->opaque->reverse_step)
return 0;
P->opaque->omit_forward = pj_calloc (steps + 2, sizeof(int));
if (0==P->opaque->omit_forward)
return 0;
P->opaque->omit_inverse = pj_calloc (steps + 2, sizeof(int));
if (0==P->opaque->omit_inverse)
return 0;
return P;
}
/* count the number of args in pipeline definition */
static size_t argc_params (paralist *params) {
size_t argc = 0;
for (; params != 0; params = params->next)
argc++;
return ++argc; /* one extra for the sentinel */
}
/* Sentinel for argument list */
static char argv_sentinel[] = "step";
/* turn paralist into argc/argv style argument list */
static char **argv_params (paralist *params, size_t argc) {
char **argv;
size_t i = 0;
argv = pj_calloc (argc, sizeof (char *));
if (0==argv)
return 0;
for (; params != 0; params = params->next)
argv[i++] = params->param;
argv[i++] = argv_sentinel;
return argv;
}
PJ *PROJECTION(pipeline) {
int i, nsteps = 0, argc;
int i_pipeline = -1, i_first_step = -1, i_current_step;
char **argv, **current_argv;
P->fwdobs = pipeline_forward_obs;
P->invobs = pipeline_reverse_obs;
P->fwd3d = pipeline_forward_3d;
P->inv3d = pipeline_reverse_3d;
P->fwd = pipeline_forward;
P->inv = pipeline_reverse;
P->destructor = destructor;
P->opaque = pj_calloc (1, sizeof(struct pj_opaque));
if (0==P->opaque)
return pj_default_destructor(P, ENOMEM);
argc = (int)argc_params (P->params);
P->opaque->argv = argv = argv_params (P->params, argc);
if (0==argv)
return destructor (P, ENOMEM);
P->opaque->current_argv = current_argv = pj_calloc (argc, sizeof (char *));
if (0==current_argv)
return destructor (P, ENOMEM);
/* Do some syntactical sanity checking */
for (i = 0; i < argc; i++) {
if (0==strcmp ("step", argv[i])) {
if (-1==i_pipeline) {
proj_log_error (P, "Pipeline: +step before +proj=pipeline");
return destructor (P, PJD_ERR_MALFORMED_PIPELINE);
}
if (0==nsteps)
i_first_step = i;
nsteps++;
continue;
}
if (0==strcmp ("proj=pipeline", argv[i])) {
if (-1 != i_pipeline) {
proj_log_error (P, "Pipeline: Nesting invalid");
return destructor (P, PJD_ERR_MALFORMED_PIPELINE); /* ERROR: nested pipelines */
}
i_pipeline = i;
}
}
nsteps--; /* Last instance of +step is just a sentinel */
P->opaque->steps = nsteps;
if (-1==i_pipeline)
return destructor (P, PJD_ERR_MALFORMED_PIPELINE); /* ERROR: no pipeline def */
if (0==nsteps)
return destructor (P, PJD_ERR_MALFORMED_PIPELINE); /* ERROR: no pipeline def */
/* Make room for the pipeline and execution indicators */
if (0==pj_create_pipeline (P, nsteps))
return destructor (P, ENOMEM);
/* Now loop over all steps, building a new set of arguments for each init */
for (i_current_step = i_first_step, i = 0; i < nsteps; i++) {
int j;
int current_argc = 0;
PJ *next_step = 0;
/* Build a set of setup args for the current step */
proj_log_trace (P, "Pipeline: Building arg list for step no. %d", i);
/* First add the step specific args */
for (j = i_current_step + 1; 0 != strcmp ("step", argv[j]); j++)
current_argv[current_argc++] = argv[j];
i_current_step = j;
/* Then add the global args */
for (j = i_pipeline + 1; 0 != strcmp ("step", argv[j]); j++)
current_argv[current_argc++] = argv[j];
/* Finally handle non-symmetric steps and inverted steps */
for (j = 0; j < current_argc; j++) {
if (0==strcmp("omit_inv", current_argv[j])) {
P->opaque->omit_inverse[i+1] = 1;
P->opaque->omit_forward[i+1] = 0;
}
if (0==strcmp("omit_fwd", current_argv[j])) {
P->opaque->omit_inverse[i+1] = 0;
P->opaque->omit_forward[i+1] = 1;
}
if (0==strcmp("inv", current_argv[j]))
P->opaque->reverse_step[i+1] = 1;
}
proj_log_trace (P, "Pipeline: init - %s, %d", current_argv[0], current_argc);
for (j = 1; j < current_argc; j++)
proj_log_trace (P, " %s", current_argv[j]);
next_step = pj_init (current_argc, current_argv);
proj_log_trace (P, "Pipeline: Step %d at %p", i, next_step);
if (0==next_step) {
proj_log_error (P, "Pipeline: Bad step definition: %s", current_argv[0]);
return destructor (P, PJD_ERR_MALFORMED_PIPELINE); /* ERROR: bad pipeline def */
}
P->opaque->pipeline[i+1] = next_step;
proj_log_trace (P, "Pipeline: step done");
}
proj_log_trace (P, "Pipeline: %d steps built. Determining i/o characteristics", nsteps);
/* Determine forward input (= reverse output) data type */
/* First locate the first forward-active pipeline step */
for (i = 0; i < nsteps; i++)
if (0==P->opaque->omit_forward[i+1])
break;
if (i==nsteps) {
proj_log_error (P, "Pipeline: No forward steps");
return destructor (P, PJD_ERR_MALFORMED_PIPELINE);
}
if (P->opaque->reverse_step[i + 1])
P->left = P->opaque->pipeline[i + 1]->right;
else
P->left = P->opaque->pipeline[i + 1]->left;
if (P->left==PJ_IO_UNITS_CLASSIC) {
if (P->opaque->reverse_step[i + 1])
P->left = PJ_IO_UNITS_METERS;
else
P->left = PJ_IO_UNITS_RADIANS;
}
/* Now, correspondingly determine forward output (= reverse input) data type */
/* First locate the last reverse-active pipeline step */
for (i = nsteps - 1; i >= 0; i--)
if (0==P->opaque->omit_inverse[i+1])
break;
if (i==-1) {
proj_log_error (P, "Pipeline: No reverse steps");
return destructor (P, PJD_ERR_MALFORMED_PIPELINE);
}
if (P->opaque->reverse_step[i + 1])
P->right = P->opaque->pipeline[i + 1]->left;
else
P->right = P->opaque->pipeline[i + 1]->right;
if (P->right==PJ_IO_UNITS_CLASSIC) {
if (P->opaque->reverse_step[i + 1])
P->right = PJ_IO_UNITS_RADIANS;
else
P->right = PJ_IO_UNITS_METERS;
}
proj_log_trace (P, "Pipeline: Units - left: [%s], right: [%s]\n",
P->left ==PJ_IO_UNITS_RADIANS? "angular": "linear",
P->right==PJ_IO_UNITS_RADIANS? "angular": "linear");
return P;
}
#ifndef PJ_SELFTEST
/* selftest stub */
int pj_pipeline_selftest (void) {return 0;}
#else
int pj_pipeline_selftest (void) {
PJ *P;
PJ_OBS a, b;
XY cph_utm32 = {691875.63214, 6098907.82501};
double dist;
/* forward-reverse geo->utm->geo */
P = proj_create (PJ_DEFAULT_CTX, "+proj=pipeline +zone=32 +step +proj=utm +ellps=GRS80 +step +proj=utm +ellps=GRS80 +inv");
if (0==P)
return 1000;
/* zero initialize everything, then set (longitude, latitude, height) to (12, 55, 0) */
a = b = proj_obs_null;
a.coo.lpz.lam = PJ_TORAD(12);
a.coo.lpz.phi = PJ_TORAD(55);
a.coo.lpz.z = 0;
/* Forward projection */
b = proj_trans_obs (P, PJ_FWD, a);
if (proj_lp_dist (P, a.coo.lp, b.coo.lp) > 1e-4)
return 1001;
/* Inverse projection (still same result: pipeline is symmetrical) */
a = proj_trans_obs (P, PJ_INV, b);
if (proj_lp_dist (P, a.coo.lp, b.coo.lp) > 1e-4)
return 1002;
proj_destroy (P);
/* And now the back-to-back situation utm->geo->utm */
P = proj_create (PJ_DEFAULT_CTX, "+proj=pipeline +zone=32 +step +proj=utm +ellps=GRS80 +inv +step +proj=utm +ellps=GRS80");
if (0==P)
return 2000;
/* zero initialize everything, then set (easting, northing) to utm(12, 55) */
a = b = proj_obs_null;
a.coo.xy = cph_utm32;
/* Forward projection */
b = proj_trans_obs (P, PJ_FWD, a);
if (proj_xy_dist (a.coo.xy, b.coo.xy) > 1e-4)
return 2001;
/* Inverse projection */
a = proj_trans_obs (P, PJ_INV, b);
if (proj_xy_dist (a.coo.xy, b.coo.xy) > 1e-4)
return 2001;
if (proj_xyz_dist (a.coo.xyz, b.coo.xyz) > 1e-4)
return 2002;
proj_destroy (P);
/* Finally testing a corner case: A rather pointless one-step pipeline geo->utm */
P = proj_create (PJ_DEFAULT_CTX, "+proj=pipeline +zone=32 +step +proj=utm +ellps=GRS80 ");
if (0==P)
return 3000;
a = b = proj_obs_null;
a.coo.lpz.lam = PJ_TORAD(12);
a.coo.lpz.phi = PJ_TORAD(55);
/* Forward projection */
b = proj_trans_obs (P, PJ_FWD, a);
if (proj_xy_dist (cph_utm32, b.coo.xy) > 1e-4)
return 3001;
/* Inverse projection */
b = proj_trans_obs (P, PJ_INV, b);
if (proj_lp_dist (P, a.coo.lp, b.coo.lp) > 1e-4)
return 3002;
/* Since we use pj_lp_dist to determine success above, we should also test that it works */
/* Geodesic distance between two points with angular 2D coordinates */
a.coo.lp.lam = PJ_TORAD(12);
a.coo.lp.phi = PJ_TORAD(60);
b.coo.lp.lam = PJ_TORAD(12);
b.coo.lp.phi = PJ_TORAD(61);
dist = proj_lp_dist (P, a.coo.lp, b.coo.lp);
if (fabs (111420.727870234 - dist) > 1e-4)
return 4001;
a.coo.lp.lam = PJ_TORAD(12);
a.coo.lp.phi = PJ_TORAD(0.);
b.coo.lp.lam = PJ_TORAD(12);
b.coo.lp.phi = PJ_TORAD(1.);
dist = proj_lp_dist (P, a.coo.lp, b.coo.lp);
if (fabs (110574.388554153 - dist) > 1e-4)
return 4002;
proj_destroy (P);
/* test a pipeline with several +init steps */
P = proj_create(
0,
"+proj=pipeline "
"+step +init=epsg:25832 +inv "
"+step +init=epsg:25833 "
"+step +init=epsg:25833 +inv "
"+step +init=epsg:25832 "
);
if (0==P)
return 5000;
a.coo.xy.x = 700000.0;
a.coo.xy.y = 6000000.0;
b = proj_trans_obs(P, PJ_FWD, a);
dist = proj_xy_dist(a.coo.xy, b.coo.xy);
if (dist > 1e-7)
return 5001;
proj_destroy (P);
return 0;
}
#endif