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
|
use File::Spec;
require "test.pl";
sub unidump {
join " ", map { sprintf "%04X", $_ } unpack "U*", $_[0];
}
sub casetest {
my ($base, $spec, $func) = @_;
my $file = File::Spec->catfile(File::Spec->catdir(File::Spec->updir,
"lib", "unicore", "To"),
"$base.pl");
my $simple = do $file;
my %simple;
for my $i (split(/\n/, $simple)) {
my ($k, $v) = split(' ', $i);
$simple{$k} = $v;
}
my %seen;
for my $i (sort keys %simple) {
$seen{hex $i}++;
}
print "# ", scalar keys %simple, " simple mappings\n";
my $both;
for my $i (sort keys %$spec) {
if (++$seen{hex $i} == 2) {
warn "$base: $i seen twice\n";
$both++;
}
}
print "# ", scalar keys %$spec, " special mappings\n";
exit(1) if $both;
my %none;
for my $i (map { ord } split //,
"\e !\"#\$%&'()+,-./0123456789:;<=>?\@[\\]^_{|}~\b") {
next if pack("U0U", $i) =~ /\w/;
$none{$i}++ unless $seen{$i};
}
print "# ", scalar keys %none, " noncase mappings\n";
my $tests =
(scalar keys %simple) +
(scalar keys %$spec) +
(scalar keys %none);
print "1..$tests\n";
my $test = 1;
for my $i (sort { hex $a <=> hex $b } keys %simple) {
my $w = $simple{$i};
my $c = pack "U0U", hex $i;
my $d = $func->($c);
my $e = unidump($d);
print $d eq pack("U0U", hex $simple{$i}) ?
"ok $test # $i -> $w\n" : "not ok $test # $i -> $e ($w)\n";
$test++;
}
for my $i (sort { hex $a <=> hex $b } keys %$spec) {
my $w = unidump($spec->{$i});
my $c = pack "U0U", hex $i;
my $d = $func->($c);
my $e = unidump($d);
if (ord "A" == 193) { # EBCDIC
# We need to a little bit of remapping.
#
# For example, in titlecase (ucfirst) mapping
# of U+0149 the Unicode mapping is U+02BC U+004E.
# The 4E is N, which in EBCDIC is 2B--
# and the ucfirst() does that right.
# The problem is that our reference
# data is in Unicode code points.
#
# The Right Way here would be to use, say,
# Encode, to remap the less-than 0x100 code points,
# but let's try to be Encode-independent here.
#
# These are the titlecase exceptions:
#
# Unicode Unicode+EBCDIC
#
# 0149 -> 02BC 004E (02BC 002B)
# 01F0 -> 004A 030C (00A2 030C)
# 1E96 -> 0048 0331 (00E7 0331)
# 1E97 -> 0054 0308 (00E8 0308)
# 1E98 -> 0057 030A (00EF 030A)
# 1E99 -> 0059 030A (00DF 030A)
# 1E9A -> 0041 02BE (00A0 02BE)
#
# The uppercase exceptions are identical.
#
# The lowercase has one more:
#
# Unicode Unicode+EBCDIC
#
# 0130 -> 0069 0307 (00D1 0307)
#
if ($i =~ /^(0130|0149|01F0|1E96|1E97|1E98|1E99|1E9A)$/) {
$e =~ s/004E/002B/; # N
$e =~ s/004A/00A2/; # J
$e =~ s/0048/00E7/; # H
$e =~ s/0054/00E8/; # T
$e =~ s/0057/00EF/; # W
$e =~ s/0059/00DF/; # Y
$e =~ s/0041/00A0/; # A
$e =~ s/0069/00D1/; # i
}
# We have to map the output, not the input, because
# pack/unpack U has been EBCDICified, too, it would
# just undo our remapping.
}
print $w eq $e ?
"ok $test # $i -> $w\n" : "not ok $test # $i -> $e ($w)\n";
$test++;
}
for my $i (sort { $a <=> $b } keys %none) {
my $w = $i = sprintf "%04X", $i;
my $c = pack "U0U", hex $i;
my $d = $func->($c);
my $e = unidump($d);
print $d eq $c ?
"ok $test # $i -> $w\n" : "not ok $test # $i -> $e ($w)\n";
$test++;
}
}
1;
|
