4 join " ", map { sprintf "%04X", $_ } unpack "U*", $_[0];
8 my ($already_run, $base, $spec, @funcs) = @_;
9 # For each provided function run it, and run a version with some extra
10 # characters afterwards. Use a recycling symbol, as it doesn't change case.
11 # $already_run is the number of extra tests the caller has run before this
13 my $ballast = chr (0x2672) x 3;
14 @funcs = map {my $f = $_;
16 sub {my $r = $f->($_[0] . $ballast); # Add it before
17 $r =~ s/$ballast\z//so # Remove it afterwards
18 or die "'$_[0]' to '$r' mangled";
19 $r; # Result with $ballast removed.
23 my $file = "../lib/unicore/To/$base.pl";
24 my $simple = do $file or die $@;
26 for my $i (split(/\n/, $simple)) {
27 my ($k, $v) = split(' ', $i);
29 # Add the simple mapping to the simples test list, except the input
30 # may include code points that the specials override, so don't add
31 # those to the test list. The specials keys are the code points,
32 # encoded in utf8,, but without the utf8 flag on, so pack with C0.
33 $simple{$k} = $v unless exists $spec->{pack("C0U", hex $k)};
37 for my $i (sort keys %simple) {
40 print "# ", scalar keys %simple, " simple mappings\n";
44 for my $i (sort keys %$spec) {
45 if (++$seen{$i} == 2) {
46 warn sprintf "$base: $i seen twice\n";
50 print "# ", scalar keys %$spec, " special mappings\n";
55 for my $i (map { ord } split //,
56 "\e !\"#\$%&'()+,-./0123456789:;<=>?\@[\\]^_{|}~\b") {
57 next if pack("U0U", $i) =~ /\w/;
58 $none{$i}++ unless $seen{$i};
60 print "# ", scalar keys %none, " noncase mappings\n";
64 ((scalar keys %simple) +
65 (scalar keys %$spec) +
66 (scalar keys %none)) * @funcs;
68 my $test = $already_run + 1;
70 for my $i (sort keys %simple) {
72 my $c = pack "U0U", hex $i;
73 foreach my $func (@funcs) {
76 print $d eq pack("U0U", hex $simple{$i}) ?
77 "ok $test # $i -> $w\n" : "not ok $test # $i -> $e ($w)\n";
82 for my $i (sort keys %$spec) {
83 my $w = unidump($spec->{$i});
84 if (ord('A') == 193 && $i eq "\x8A\x73") {
85 $w = '0178'; # It's a Latin small Y with diaeresis and not a Latin small letter sharp 's'.
87 my $u = unpack "C0U", $i;
88 my $h = sprintf "%04X", $u;
89 my $c = chr($u); $c .= chr(0x100); chop $c;
90 foreach my $func (@funcs) {
93 if (ord "A" == 193) { # EBCDIC
94 # We need to a little bit of remapping.
96 # For example, in titlecase (ucfirst) mapping
97 # of U+0149 the Unicode mapping is U+02BC U+004E.
98 # The 4E is N, which in EBCDIC is 2B--
99 # and the ucfirst() does that right.
100 # The problem is that our reference
101 # data is in Unicode code points.
103 # The Right Way here would be to use, say,
104 # Encode, to remap the less-than 0x100 code points,
105 # but let's try to be Encode-independent here.
107 # These are the titlecase exceptions:
109 # Unicode Unicode+EBCDIC
111 # 0149 -> 02BC 004E (02BC 002B)
112 # 01F0 -> 004A 030C (00A2 030C)
113 # 1E96 -> 0048 0331 (00E7 0331)
114 # 1E97 -> 0054 0308 (00E8 0308)
115 # 1E98 -> 0057 030A (00EF 030A)
116 # 1E99 -> 0059 030A (00DF 030A)
117 # 1E9A -> 0041 02BE (00A0 02BE)
119 # The uppercase exceptions are identical.
121 # The lowercase has one more:
123 # Unicode Unicode+EBCDIC
125 # 0130 -> 0069 0307 (00D1 0307)
127 if ($h =~ /^(0130|0149|01F0|1E96|1E97|1E98|1E99|1E9A)$/) {
128 $e =~ s/004E/002B/; # N
129 $e =~ s/004A/00A2/; # J
130 $e =~ s/0048/00E7/; # H
131 $e =~ s/0054/00E8/; # T
132 $e =~ s/0057/00EF/; # W
133 $e =~ s/0059/00DF/; # Y
134 $e =~ s/0041/00A0/; # A
135 $e =~ s/0069/00D1/; # i
137 # We have to map the output, not the input, because
138 # pack/unpack U has been EBCDICified, too, it would
139 # just undo our remapping.
142 "ok $test # $i -> $w\n" : "not ok $test # $h -> $e ($w)\n";
147 for my $i (sort { $a <=> $b } keys %none) {
148 my $w = $i = sprintf "%04X", $i;
149 my $c = pack "U0U", hex $i;
150 foreach my $func (@funcs) {
154 "ok $test # $i -> $w\n" : "not ok $test # $i -> $e ($w)\n";