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 package Boustrophedon; # A class with overloaded "".
28 sub new { my ($c, $s) = @_; bless \$s, $c }
29 use overload '""' => sub { ${$_[0]} . reverse ${$_[0]} };
31 my $ox = Boustrophedon->new("foobar");
33 # Test standard hash functionality, by performing the same operations
34 # on a tied hash and on a normal hash, and checking that the results
35 # are the same. This does of course assume that Perl hashes are not
38 my @tests = standard_hash_tests();
40 my @ordinary_results = runtests(\@tests, undef);
41 foreach my $class ('Tie::RefHash', 'Tie::RefHash::Nestable') {
42 my @tied_results = runtests(\@tests, $class);
45 die if @ordinary_results != @tied_results;
46 foreach my $i (0 .. $#ordinary_results) {
47 my ($or, $ow, $oe) = @{$ordinary_results[$i]};
48 my ($tr, $tw, $te) = @{$tied_results[$i]};
52 $ok = 0 if (defined($or) != defined($tr)) or ($or ne $tr);
53 $ok = 0 if (defined($ow) != defined($tw)) or ($ow ne $tw);
54 $ok = 0 if (defined($oe) != defined($te)) or ($oe ne $te);
58 "failed for $class: $tests[$i]\n",
59 "ordinary hash gave:\n",
60 defined $or ? "\tresult: $or\n" : "\tundef result\n",
61 defined $ow ? "\twarning: $ow\n" : "\tno warning\n",
62 defined $oe ? "\texception: $oe\n" : "\tno exception\n",
63 "tied $class hash gave:\n",
64 defined $tr ? "\tresult: $tr\n" : "\tundef result\n",
65 defined $tw ? "\twarning: $tw\n" : "\tno warning\n",
66 defined $te ? "\texception: $te\n" : "\tno exception\n",
74 # Now test Tie::RefHash's special powers
76 $h = eval { tie %h, 'Tie::RefHash' };
79 test(ref($h) eq 'Tie::RefHash');
80 test(defined(tied(%h)) and tied(%h) =~ /^Tie::RefHash/);
82 test($h{$ref} eq 'cholet');
83 test(exists $h{$ref});
85 test(ref((keys %h)[0]) eq 'ARRAY');
86 test((keys %h)[0] eq $ref);
87 test((values %h) == 1);
88 test((values %h)[0] eq 'cholet');
90 while (my ($k, $v) = each %h) {
92 test(ref($k) eq 'ARRAY');
98 test(not defined $h{$ref});
99 test(not exists($h{$ref}));
100 test((keys %h) == 0);
101 test((values %h) == 0);
102 $h{$ox} = "bellow"; # overloaded ""
103 test(exists $h{$ox});
104 test($h{$ox} eq "bellow");
105 test(not exists $h{"foobarraboof"});
109 # And now Tie::RefHash::Nestable's differences from Tie::RefHash.
110 $h = eval { tie %h, 'Tie::RefHash::Nestable' };
113 test(ref($h) eq 'Tie::RefHash::Nestable');
114 test(defined(tied(%h)) and tied(%h) =~ /^Tie::RefHash::Nestable/);
115 $h{$ref}->{$ref1} = 'bungo';
116 test($h{$ref}->{$ref1} eq 'bungo');
118 # Test that the nested hash is also tied (for current implementation)
119 test(defined(tied(%{$h{$ref}}))
120 and tied(%{$h{$ref}}) =~ /^Tie::RefHash::Nestable=/ );
122 test((keys %h) == 1);
123 test((keys %h)[0] eq $ref);
124 test((keys %{$h{$ref}}) == 1);
125 test((keys %{$h{$ref}})[0] eq $ref1);
128 die "expected to run $numtests tests, but ran ", $currtest - 1
129 if $currtest - 1 != $numtests;
138 # Print 'ok X' if true, 'not ok X' if false
139 # Uses global $currtest.
143 print 'not ' if not $t;
144 print 'ok ', $currtest++, "\n";
148 # Wrapper for Data::Dumper to 'dump' a scalar as an EXPR string.
152 $d =~ s/^\$VAR1 =\s*//;
158 # Crudely dump a hash into a canonical string representation (because
159 # hash keys can appear in any order, Data::Dumper may give different
160 # strings for the same hash).
165 foreach (sort keys %$h) {
166 $r = dumped($_) . ' => ' . dumped($h->{$_}) . "\n";
171 # Run the tests and give results.
173 # Parameters: reference to list of tests to run
174 # name of class to use for tied hash, or undef if not tied
176 # Returns: list of [R, W, E] tuples, one for each test.
177 # R is the return value from running the test, W any warnings it gave,
178 # and E any exception raised with 'die'. E and W will be tidied up a
179 # little to remove irrelevant details like line numbers :-)
181 # Will also run a few of its own 'ok N' tests.
184 my ($tests, $class) = @_;
188 if (defined $class) {
189 $h = eval { tie %h, $class };
192 test(ref($h) eq $class);
193 test(defined(tied(%h)) and tied(%h) =~ /^\Q$class\E/);
197 my ($result, $warning, $exception);
198 local $SIG{__WARN__} = sub { $warning .= $_[0] };
199 $result = scalar(eval $_);
202 die "$@:$_" unless defined $class;
206 foreach ($warning, $exception) {
208 s/ at .+ line \d+\.$//mg;
209 s/ at .+ line \d+, at .*//mg;
210 s/ at .+ line \d+, near .*//mg;
211 s/(uninitialized value)( within)? [\$@%].*? in /$1 in /g;
214 my (@warnings, %seen);
215 foreach (split /\n/, $warning) {
216 push @warnings, $_ unless $seen{$_}++;
218 $warning = join("\n", @warnings);
220 push @r, [ $result, $warning, $exception ];
227 # Things that should work just the same for an ordinary hash and a
230 # Each test is a code string to be eval'd, it should do something with
231 # %h and give a scalar return value. The global $ref and $ref1 may
234 # One thing we don't test is that the ordering from 'keys', 'values'
235 # and 'each' is the same. You can't reasonably expect that.
237 sub standard_hash_tests {
240 # Library of standard tests on keys, values and each
241 my $STD_TESTS = <<'END'
242 join $;, sort keys %h;
243 join $;, sort values %h;
244 { my ($v, %tmp); $tmp{$v}++ while (defined($v = each %h)); dumph(\%tmp) }
245 { my ($k, $v, %tmp); $tmp{"$k$;$v"}++ while (($k, $v) = each %h); dumph(\%tmp) }
249 # Tests on the existence of the element 'foo'
250 my $FOO_TESTS = <<'END'
257 # Test storing and deleting 'foo'
258 push @r, split /\n/, <<"END"
273 # Test storing and removing under ordinary keys
274 my @things = ('boink', 0, 1, '', undef);
275 foreach my $key (map { dumped($_) } @things) {
276 foreach my $value ((map { dumped($_) } @things), '$ref') {
277 push @r, split /\n/, <<"END"
295 @slicetests = split /\n/, <<'END'
298 @h{'e'} = ('f', 'g');
300 @h{'j', 'k'} = ('l');
301 @h{'m', 'n'} = ('o', 'p');
302 @h{'q', 'r'} = ('s', 't', 'u');
305 my @aaa = @slicetests;
306 foreach (@slicetests) {
308 push @r, split(/\n/, $STD_TESTS);
312 push @r, '%h = ();', split(/\n/, $STD_TESTS);