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
|
#!/usr/bin/env perl
use strict;
use warnings;
use 5.010;
use File::Slurp qw(read_file write_file);
use JSON;
use XML::LibXML;
my $json_str = read_file('stations.json');
my $stations = JSON->new->utf8->decode($json_str);
@{$stations} = sort { $a->{name} cmp $b->{name} } @{$stations};
my $xml_str = read_file('stations.xml');
my $tree = XML::LibXML->load_xml( string => $xml_str );
for my $station ( $tree->findnodes('//station') ) {
my $name = $station->getAttribute('name');
my $eva = $station->getAttribute('eva');
my $ds100 = $station->getAttribute('ds100');
my $found = 0;
for my $j_station ( @{$stations} ) {
my $j_name = $j_station->{name};
my $j_ds100 = $j_station->{ds100};
my $j_eva = $j_station->{eva};
if ( $name eq $j_name or $eva == $j_eva ) {
$found = 1;
}
if ( $j_ds100 eq $ds100 and $j_name ne $name ) {
printf( "%8s has been renamed: %30s -> %30s\n",
$ds100, $j_name, $name );
#$j_station->{name} = $name;
last;
}
elsif ( $j_eva == $eva and $j_name ne $name ) {
printf( "%d mismatch: (%s -> %s), (%s -> %s)\n",
$eva, $j_name, $name, $j_ds100, $ds100 );
last;
}
elsif ( $j_name eq $name and $j_ds100 ne $ds100 ) {
printf( "%30s has been recoded: %8s -> %8s\n",
$name, $j_ds100, $ds100 );
last;
}
elsif ( $j_name eq $name and $j_eva != $eva ) {
printf( "%30s has been recoded: %d -> %d\n", $name, $j_eva, $eva );
last;
}
}
if ( not $found
and not( $ds100 =~ m{ ^ [OPXZ] }x or $name =~ m{ ^ Bahnhof, }x ) )
{
#say "missing $eva $ds100 \"$name\"";
}
}
my $json_out = JSON->new->utf8->canonical->pretty->encode($stations);
write_file( 'stations.json', $json_out );
|
