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
|
#!./perl
BEGIN {
chdir 't' if -d 't';
require './test.pl';
set_up_inc('../lib');
}
plan tests => 59;
$h{'abc'} = 'ABC';
$h{'def'} = 'DEF';
$h{'jkl','mno'} = "JKL\034MNO";
$h{'a',2,3,4,5} = join("\034",'A',2,3,4,5);
$h{'a'} = 'A';
$h{'b'} = 'B';
$h{'c'} = 'C';
$h{'d'} = 'D';
$h{'e'} = 'E';
$h{'f'} = 'F';
$h{'g'} = 'G';
$h{'h'} = 'H';
$h{'i'} = 'I';
$h{'j'} = 'J';
$h{'k'} = 'K';
$h{'l'} = 'L';
$h{'m'} = 'M';
$h{'n'} = 'N';
$h{'o'} = 'O';
$h{'p'} = 'P';
$h{'q'} = 'Q';
$h{'r'} = 'R';
$h{'s'} = 'S';
$h{'t'} = 'T';
$h{'u'} = 'U';
$h{'v'} = 'V';
$h{'w'} = 'W';
$h{'x'} = 'X';
$h{'y'} = 'Y';
$h{'z'} = 'Z';
@keys = keys %h;
@values = values %h;
is ($#keys, 29, "keys");
is ($#values, 29, "values");
$i = 0; # stop -w complaints
while (($key,$value) = each(%h)) {
if ($key eq $keys[$i] && $value eq $values[$i]
&& (('a' lt 'A' && $key lt $value) || $key gt $value)) {
$key =~ y/a-z/A-Z/;
$i++ if $key eq $value;
}
}
is ($i, 30, "each count");
@keys = ('blurfl', keys(%h), 'dyick');
is ($#keys, 31, "added a key");
SKIP: {
skip "no Hash::Util on miniperl", 4, if is_miniperl;
require Hash::Util;
sub Hash::Util::num_buckets (\%);
$size = Hash::Util::num_buckets(%h);
keys %h = $size * 5;
$newsize = Hash::Util::num_buckets(%h);
is ($newsize, $size * 8, "resize");
keys %h = 1;
$size = Hash::Util::num_buckets(%h);
is ($size, $newsize, "same size");
%h = (1,1);
$size = Hash::Util::num_buckets(%h);
is ($size, $newsize, "still same size");
undef %h;
%h = (1,1);
$size = Hash::Util::num_buckets(%h);
is ($size, 8, "size 8");
}
# test scalar each
%hash = 1..20;
$total = 0;
$total += $key while $key = each %hash;
is ($total, 100, "test scalar each");
for (1..3) { @foo = each %hash }
keys %hash;
$total = 0;
$total += $key while $key = each %hash;
is ($total, 100, "test scalar keys resets iterator");
for (1..3) { @foo = each %hash }
$total = 0;
$total += $key while $key = each %hash;
isnt ($total, 100, "test iterator of each is being maintained");
for (1..3) { @foo = each %hash }
values %hash;
$total = 0;
$total += $key while $key = each %hash;
is ($total, 100, "test values keys resets iterator");
SKIP: {
skip "no Hash::Util on miniperl", 3, if is_miniperl;
require Hash::Util;
sub Hash::Util::num_buckets (\%);
$size = Hash::Util::num_buckets(%hash);
keys(%hash) = $size / 2;
is ($size, Hash::Util::num_buckets(%hash),
"assign to keys does not shrink hash bucket array");
keys(%hash) = $size + 100;
isnt ($size, Hash::Util::num_buckets(%hash),
"assignment to keys of a number not large enough does not change size");
is (keys(%hash), 10, "keys (%hash)");
}
@tests = (&next_test, &next_test, &next_test);
{
package Obj;
sub DESTROY { print "ok $::tests[1] # DESTROY called\n"; }
{
my $h = { A => bless [], __PACKAGE__ };
while (my($k,$v) = each %$h) {
print "ok $::tests[0]\n" if $k eq 'A' and ref($v) eq 'Obj';
}
}
print "ok $::tests[2]\n";
}
# Check for Unicode hash keys.
%u = ("\x{12}", "f", "\x{123}", "fo", "\x{1234}", "foo");
$u{"\x{12345}"} = "bar";
@u{"\x{10FFFD}"} = "zap";
my %u2;
foreach (keys %u) {
is (length(), 1, "Check length of " . _qq $_);
$u2{$_} = $u{$_};
}
ok (eq_hash(\%u, \%u2), "copied unicode hash keys correctly?");
$a = "\xe3\x81\x82"; $A = "\x{3042}";
%b = ( $a => "non-utf8");
%u = ( $A => "utf8");
is (exists $b{$A}, '', "utf8 key in bytes hash");
is (exists $u{$a}, '', "bytes key in utf8 hash");
print "# $b{$_}\n" for keys %b; # Used to core dump before change #8056.
pass ("if we got here change 8056 worked");
print "# $u{$_}\n" for keys %u; # Used to core dump before change #8056.
pass ("change 8056 is thanks to Inaba Hiroto");
# on EBCDIC chars are mapped differently so pick something that needs encoding
# there too.
$d = pack("U*", 0xe3, 0x81, 0xAF);
{ use bytes; $ol = bytes::length($d) }
cmp_ok ($ol, '>', 3, "check encoding on EBCDIC");
%u = ($d => "downgrade");
for (keys %u) {
is (length, 3, "check length");
is ($_, pack("U*", 0xe3, 0x81, 0xAF), "check value");
}
{
{ use bytes; is (bytes::length($d), $ol) }
}
{
my %u;
my $u0 = pack("U0U", 0x00FF);
my $b0 = "\xC3\xBF"; # 0xCB 0xBF is U+00FF in UTF-8
my $u1 = pack("U0U", 0x0100);
my $b1 = "\xC4\x80"; # 0xC4 0x80 is U+0100 in UTF-8
$u{$u0} = 1;
$u{$b0} = 2;
$u{$u1} = 3;
$u{$b1} = 4;
is(scalar keys %u, 4, "four different Unicode keys");
is($u{$u0}, 1, "U+00FF -> 1");
is($u{$b0}, 2, "U+00C3 U+00BF -> 2");
is($u{$u1}, 3, "U+0100 -> 3 ");
is($u{$b1}, 4, "U+00C4 U+0080 -> 4");
}
# test for syntax errors
for my $k (qw(each keys values)) {
eval $k;
like($@, qr/^Not enough arguments for $k/, "$k demands argument");
}
{
my %foo=(1..10);
my ($k,$v);
my $count=keys %foo;
my ($k1,$v1)=each(%foo);
my $yes = 0;
if (%foo) { $yes++ }
my ($k2,$v2)=each(%foo);
my $rest=0;
while (each(%foo)) {$rest++};
is($yes,1,"if(%foo) was true - my");
isnt($k1,$k2,"if(%foo) didnt mess with each (key) - my");
isnt($v1,$v2,"if(%foo) didnt mess with each (value) - my");
is($rest,3,"Got the expected number of keys - my");
my $hsv=1 && %foo;
is($hsv,$count,"Got the count of keys from %foo in scalar assignment context - my");
my @arr=%foo&&%foo;
is(@arr,10,"Got expected number of elements in list context - my");
}
{
our %foo=(1..10);
my ($k,$v);
my $count=keys %foo;
my ($k1,$v1)=each(%foo);
my $yes = 0;
if (%foo) { $yes++ }
my ($k2,$v2)=each(%foo);
my $rest=0;
while (each(%foo)) {$rest++};
is($yes,1,"if(%foo) was true - our");
isnt($k1,$k2,"if(%foo) didnt mess with each (key) - our");
isnt($v1,$v2,"if(%foo) didnt mess with each (value) - our");
is($rest,3,"Got the expected number of keys - our");
my $hsv=1 && %foo;
is($hsv,$count,"Got the count of keys from %foo in scalar assignment context - our");
my @arr=%foo&&%foo;
is(@arr,10,"Got expected number of elements in list context - our");
}
{
# make sure a deleted active iterator gets freed timely, even if the
# hash is otherwise empty
package Single;
my $c = 0;
sub DESTROY { $c++ };
{
my %h = ("a" => bless []);
my ($k,$v) = each %h;
delete $h{$k};
::is($c, 0, "single key not yet freed");
}
::is($c, 1, "single key now freed");
}
{
# Make sure each() does not leave the iterator in an inconsistent state
# (RITER set to >= 0, with EITER null) if the active iterator is
# deleted, leaving the hash apparently empty.
my %h;
$h{1} = 2;
each %h;
delete $h{1};
each %h;
$h{1}=2;
is join ("-", each %h), '1-2',
'each on apparently empty hash does not leave RITER set';
}
{
my $warned= 0;
local $SIG{__WARN__}= sub {
/\QUse of each() on hash after insertion without resetting hash iterator results in undefined behavior\E/
and $warned++ for @_;
};
my %h= map { $_ => $_ } "A".."F";
while (my ($k, $v)= each %h) {
$h{"$k$k"}= $v;
}
ok($warned,"each() after insert produces warnings");
no warnings 'internal';
$warned= 0;
%h= map { $_ => $_ } "A".."F";
while (my ($k, $v)= each %h) {
$h{"$k$k"}= $v;
}
ok(!$warned, "no warnings 'internal' silences each() after insert warnings");
}
use feature 'refaliasing';
no warnings 'experimental::refaliasing';
$a = 7;
\$h2{f} = \$a;
($a, $b) = (each %h2);
is "$a $b", "f 7", 'each in list assignment';
$a = 7;
($a, $b) = (3, values %h2);
is "$a $b", "3 7", 'values in list assignment';
|