3 # $Id: canonical.t,v 1.0 2000/09/01 19:40:41 ram Exp $
5 # Copyright (c) 1995-2000, Raphael Manfredi
7 # You may redistribute only under the same terms as Perl 5, as specified
8 # in the README file that comes with the distribution.
10 # $Log: canonical.t,v $
11 # Revision 1.0 2000/09/01 19:40:41 ram
12 # Baseline for first official release.
19 require Config; import Config;
20 if ($Config{'extensions'} !~ /\bStorable\b/) {
21 print "1..0 # Skip: Storable was not built\n";
27 use Storable qw(freeze thaw dclone);
28 use vars qw($debugging $verbose);
33 my($testno, $ok) = @_;
34 print "not " unless $ok;
39 # Uncomment the folowing line to get a dump of the constructed data structure
40 # (you may want to reduce the size of the hashes too)
47 # Use MD5 if its available to make random string keys
49 eval { require "MD5.pm" };
52 # Use Data::Dumper if debugging and it is available to create an ASCII dump
55 eval { require "Data/Dumper.pm" };
59 @fixed_strings = ("January", "February", "March", "April", "May", "June",
60 "July", "August", "September", "October", "November", "December" );
62 # Build some arbitrarily complex data structure starting with a top level hash
63 # (deeper levels contain scalars, references to hashes or references to arrays);
65 for (my $i = 0; $i < $hashsize; $i++) {
66 my($k) = int(rand(1_000_000));
67 $k = MD5->hexhash($k) if $gotmd5 and int(rand(2));
68 $a1{$k} = { key => "$k", value => $i };
70 # A third of the elements are references to further hashes
74 my($hash2size) = int(rand($maxhash2size));
75 while ($hash2size--) {
76 my($k2) = $k . $i . int(rand(100));
77 $hash2->{$k2} = $fixed_strings[rand(int(@fixed_strings))];
79 $a1{$k}->{value} = $hash2;
82 # A further third are references to arrays
84 elsif (int(rand(2))) {
86 my($arraysize) = int(rand($maxarraysize));
87 while ($arraysize--) {
88 push(@$arr_ref, $fixed_strings[rand(int(@fixed_strings))]);
90 $a1{$k}->{value} = $arr_ref;
95 print STDERR Data::Dumper::Dumper(\%a1) if ($verbose and $gotdd);
98 # Copy the hash, element by element in order of the keys
100 foreach $k (sort keys %a1) {
101 $a2{$k} = { key => "$k", value => $a1{$k}->{value} };
104 # Deep clone the hash
108 # In canonical mode the frozen representation of each of the hashes
109 # should be identical
111 $Storable::canonical = 1;
117 ok 1, (length($x1) > $hashsize); # sanity check
118 ok 2, length($x1) == length($x2); # idem
122 # In normal mode it is exceedingly unlikely that the frozen
123 # representaions of all the hashes will be the same (normally the hash
124 # elements are frozen in the order they are stored internally,
125 # i.e. pseudo-randomly).
127 $Storable::canonical = 0;
134 # Two out of three the same may be a coincidence, all three the same
135 # is much, much more unlikely. Still it could happen, so this test
136 # may report a false negative.
138 ok 5, ($x1 ne $x2) || ($x1 ne $x3);
141 # Ensure refs to "undef" values are properly shared
142 # Same test as in t/dclone.t to ensure the "canonical" code is also correct
145 push @{$$hash{''}}, \$$hash{a};
146 ok 6, $$hash{''}[0] == \$$hash{a};
148 my $cloned = dclone(dclone($hash));
149 ok 7, $$cloned{''}[0] == \$$cloned{a};
151 $$cloned{a} = "blah";
152 ok 8, $$cloned{''}[0] == \$$cloned{a};