3 # Basic test suite for Tie::RefHash and Tie::RefHash::Nestable.
5 # The testing is in two parts: first, run lots of tests on both a tied
6 # hash and an ordinary un-tied hash, and check they give the same
7 # answer. Then there are tests for those cases where the tied hashes
8 # should behave differently to normal hashes, that is, when using
23 print "1..$numtests\n";
25 my $ref = []; my $ref1 = [];
27 # Test standard hash functionality, by performing the same operations
28 # on a tied hash and on a normal hash, and checking that the results
29 # are the same. This does of course assume that Perl hashes are not
32 my @tests = standard_hash_tests();
33 my @ordinary_results = runtests(\@tests, undef);
34 foreach my $class ('Tie::RefHash', 'Tie::RefHash::Nestable') {
35 my @tied_results = runtests(\@tests, $class);
38 die if @ordinary_results != @tied_results;
39 foreach my $i (0 .. $#ordinary_results) {
40 my ($or, $ow, $oe) = @{$ordinary_results[$i]};
41 my ($tr, $tw, $te) = @{$tied_results[$i]};
45 $ok = 0 if (defined($or) != defined($tr)) or ($or ne $tr);
46 $ok = 0 if (defined($ow) != defined($tw)) or ($ow ne $tw);
47 $ok = 0 if (defined($oe) != defined($te)) or ($oe ne $te);
51 "failed for $class: $tests[$i]\n",
52 "ordinary hash gave:\n",
53 defined $or ? "\tresult: $or\n" : "\tundef result\n",
54 defined $ow ? "\twarning: $ow\n" : "\tno warning\n",
55 defined $oe ? "\texception: $oe\n" : "\tno exception\n",
56 "tied $class hash gave:\n",
57 defined $tr ? "\tresult: $tr\n" : "\tundef result\n",
58 defined $tw ? "\twarning: $tw\n" : "\tno warning\n",
59 defined $te ? "\texception: $te\n" : "\tno exception\n",
67 # Now test Tie::RefHash's special powers
69 eval { $h = tie %h, 'Tie::RefHash' };
72 test(ref($h) eq 'Tie::RefHash');
73 test(defined(tied(%h)) and tied(%h) =~ /^Tie::RefHash/);
75 test($h{$ref} eq 'cholet');
76 test(exists $h{$ref});
78 test(ref((keys %h)[0]) eq 'ARRAY');
79 test((keys %h)[0] eq $ref);
80 test((values %h) == 1);
81 test((values %h)[0] eq 'cholet');
83 while (my ($k, $v) = each %h) {
85 test(ref($k) eq 'ARRAY');
91 test(not defined $h{$ref});
92 test(not exists($h{$ref}));
94 test((values %h) == 0);
98 # And now Tie::RefHash::Nestable's differences from Tie::RefHash.
99 eval { $h = tie %h, 'Tie::RefHash::Nestable' };
102 test(ref($h) eq 'Tie::RefHash::Nestable');
103 test(defined(tied(%h)) and tied(%h) =~ /^Tie::RefHash::Nestable/);
104 $h{$ref}->{$ref1} = 'bungo';
105 test($h{$ref}->{$ref1} eq 'bungo');
107 # Test that the nested hash is also tied (for current implementation)
108 test(defined(tied(%{$h{$ref}}))
109 and tied(%{$h{$ref}}) =~ /^Tie::RefHash::Nestable=/ );
111 test((keys %h) == 1);
112 test((keys %h)[0] eq $ref);
113 test((keys %{$h{$ref}}) == 1);
114 test((keys %{$h{$ref}})[0] eq $ref1);
116 die "expected to run $numtests tests, but ran ", $currtest - 1
117 if $currtest - 1 != $numtests;
121 # Print 'ok X' if true, 'not ok X' if false
122 # Uses global $currtest.
126 print 'not ' if not $t;
127 print 'ok ', $currtest++, "\n";
131 # Wrapper for Data::Dumper to 'dump' a scalar as an EXPR string.
135 $d =~ s/^\$VAR1 =\s*//;
141 # Crudely dump a hash into a canonical string representation (because
142 # hash keys can appear in any order, Data::Dumper may give different
143 # strings for the same hash).
148 foreach (sort keys %$h) {
149 $r = dumped($_) . ' => ' . dumped($h->{$_}) . "\n";
154 # Run the tests and give results.
156 # Parameters: reference to list of tests to run
157 # name of class to use for tied hash, or undef if not tied
159 # Returns: list of [R, W, E] tuples, one for each test.
160 # R is the return value from running the test, W any warnings it gave,
161 # and E any exception raised with 'die'. E and W will be tidied up a
162 # little to remove irrelevant details like line numbers :-)
164 # Will also run a few of its own 'ok N' tests.
167 my ($tests, $class) = @_;
171 if (defined $class) {
172 eval { $h = tie %h, $class };
175 test(ref($h) eq $class);
176 test(defined(tied(%h)) and tied(%h) =~ /^\Q$class\E/);
180 my ($result, $warning, $exception);
181 local $SIG{__WARN__} = sub { $warning .= $_[0] };
182 $result = scalar(eval $_);
183 $exception = $@ if $@;
185 foreach ($warning, $exception) {
187 s/ at .+ line \d+\.$//mg;
188 s/ at .+ line \d+, at .*//mg;
189 s/ at .+ line \d+, near .*//mg;
192 my (@warnings, %seen);
193 foreach (split /\n/, $warning) {
194 push @warnings, $_ unless $seen{$_}++;
196 $warning = join("\n", @warnings);
198 push @r, [ $result, $warning, $exception ];
205 # Things that should work just the same for an ordinary hash and a
208 # Each test is a code string to be eval'd, it should do something with
209 # %h and give a scalar return value. The global $ref and $ref1 may
212 # One thing we don't test is that the ordering from 'keys', 'values'
213 # and 'each' is the same. You can't reasonably expect that.
215 sub standard_hash_tests {
218 # Library of standard tests on keys, values and each
219 my $STD_TESTS = <<'END'
220 join $;, sort keys %h;
221 join $;, sort values %h;
222 { my ($v, %tmp); %tmp{$v}++ while (defined($v = each %h)); dumph(\%tmp) }
223 { my ($k, $v, %tmp); $tmp{"$k$;$v"}++ while (($k, $v) = each %h); dumph(\%t
228 # Tests on the existence of the element 'foo'
229 my $FOO_TESTS = <<'END'
236 # Test storing and deleting 'foo'
237 push @r, split /\n/, <<"END"
252 # Test storing and removing under ordinary keys
253 my @things = ('boink', 0, 1, '', undef);
254 foreach my $key (map { dumped($_) } @things) {
255 foreach my $value ((map { dumped($_) } @things), '$ref') {
256 push @r, split /\n/, <<"END"
274 @slicetests = split /\n/, <<'END'
279 @h{'e'} = ('f', 'g');
281 @h{'j', 'k'} = ('l');
282 @h{'m', 'n'} = ('o', 'p');
283 @h{'q', 'r'} = ('s', 't', 'u');
286 my @aaa = @slicetests;
287 foreach (@slicetests) {
289 push @r, split(/\n/, $STD_TESTS);
293 push @r, 'clear %h', split(/\n/, $STD_TESTS);