5 use Test::More tests => 53;
7 use t::common qw( new_fh );
11 my ($fh, $filename) = new_fh();
12 my $db = DBM::Deep->new(
20 $db->{key1} = "value1";
21 is( $db->get("key1"), "value1", "get() works with hash assignment" );
22 is( $db->fetch("key1"), "value1", "... fetch() works with hash assignment" );
23 is( $db->{key1}, "value1", "... and hash-access also works" );
25 $db->put("key2", undef);
26 is( $db->get("key2"), undef, "get() works with put()" );
27 is( $db->fetch("key2"), undef, "... fetch() works with put()" );
28 is( $db->{key2}, undef, "... and hash-access also works" );
30 $db->store( "0", "value3" );
31 is( $db->get("0"), "value3", "get() works with store()" );
32 is( $db->fetch("0"), "value3", "... fetch() works with put()" );
33 is( $db->{0}, 'value3', "... and hash-access also works" );
35 # Verify that the keyval pairs are still correct.
36 is( $db->{key1}, "value1", "Key1 is still correct" );
37 is( $db->{key2}, undef, "Key2 is still correct" );
38 is( $db->{0}, 'value3', "Key3 is still correct" );
40 ok( $db->exists("key1"), "exists() function works" );
41 ok( exists $db->{key2}, "exists() works against tied hash" );
43 ok( !exists $db->{key4}, "exists() function works for keys that aren't there" );
44 is( $db->{key4}, undef, "Autovivified key4" );
45 ok( exists $db->{key4}, "Autovivified key4 now exists" );
48 ok( !exists $db->{key4}, "And key4 doesn't exists anymore" );
50 # Keys will be done via an iterator that keeps a breadcrumb trail of the last
51 # key it provided. There will also be an "edit revision number" on the
52 # reference so that resetting the iterator can be done.
54 # Q: How do we make sure that the iterator is unique? Is it supposed to be?
59 is( scalar keys %$db, 3, "keys() works against tied hash" );
65 while ( my ($key, $value) = each %$db ) {
66 $temphash->{$key} = $value;
69 is( $temphash->{key1}, 'value1', "First key copied successfully using tied interface" );
70 is( $temphash->{key2}, undef, "Second key copied successfully" );
71 is( $temphash->{0}, 'value3', "Third key copied successfully" );
74 my $key = $db->first_key();
75 while (defined $key) {
76 $temphash->{$key} = $db->get($key);
77 $key = $db->next_key($key);
80 is( $temphash->{key1}, 'value1', "First key copied successfully using OO interface" );
81 is( $temphash->{key2}, undef, "Second key copied successfully" );
82 is( $temphash->{0}, 'value3', "Third key copied successfully" );
87 is( delete $db->{key2}, undef, "delete through tied inteface works" );
88 is( $db->delete("key1"), 'value1', "delete through OO inteface works" );
89 is( $db->{0}, 'value3', "The other key is still there" );
90 ok( !exists $db->{key1}, "key1 doesn't exist" );
91 ok( !exists $db->{key2}, "key2 doesn't exist" );
93 is( scalar keys %$db, 1, "After deleting two keys, 1 remains" );
98 ok( $db->clear(), "clear() returns true" );
100 is( scalar keys %$db, 0, "After clear(), everything is removed" );
105 $db->put("key1", "value1");
106 is( $db->get("key1"), "value1", "Assignment still works" );
108 $db->put("key1", "value2");
109 is( $db->get("key1"), "value2", "... and replacement works" );
111 $db->put("key1", "value222222222222222222222222");
112 is( $db->get("key1"), "value222222222222222222222222", "We set a value before closing the file" );
115 # Make sure DB still works after closing / opening
118 open $fh, '+<', $filename;
119 $db = DBM::Deep->new(
123 is( $db->get("key1"), "value222222222222222222222222", "The value we set is still there after closure" );
126 # Make sure keys are still fetchable after replacing values
127 # with smaller ones (bug found by John Cardenas, DBM::Deep 0.93)
130 $db->put("key1", "long value here");
131 $db->put("key2", "longer value here");
133 $db->put("key1", "short value");
134 $db->put("key2", "shorter v");
136 my $first_key = $db->first_key();
137 my $next_key = $db->next_key($first_key);
140 (($first_key eq "key1") || ($first_key eq "key2")) &&
141 (($next_key eq "key1") || ($next_key eq "key2")) &&
142 ($first_key ne $next_key)
143 ,"keys() still works if you replace long values with shorter ones"
146 # Make sure we do not trigger a deep recursion warning [RT #53575]
149 local $SIG{__WARN__} = sub { $w = shift };
150 my ($fh, $filename) = new_fh();
151 my $db = DBM::Deep->new( file => $filename, fh => $fh, );
160 }, 'deep recursion in hash assignment' or diag $@;
161 is $w, undef, 'no warnings with deep recursion in hash assignment';
164 # Test autovivification
165 $db->{unknown}{bar} = 1;
166 ok( $db->{unknown}, 'Autovivified hash exists' );
167 cmp_ok( $db->{unknown}{bar}, '==', 1, 'And the value stored is there' );
172 } qr/Cannot use an undefined hash key/, "FETCH fails on an undefined key";
176 } qr/Cannot use an undefined hash key/, "FETCH fails on an undefined key";
180 } qr/Cannot use an undefined hash key/, "STORE fails on an undefined key";
183 $db->store(undef, undef);
184 } qr/Cannot use an undefined hash key/, "STORE fails on an undefined key";
188 } qr/Cannot use an undefined hash key/, "DELETE fails on an undefined key";
192 } qr/Cannot use an undefined hash key/, "DELETE fails on an undefined key";
196 } qr/Cannot use an undefined hash key/, "EXISTS fails on an undefined key";
200 } qr/Cannot use an undefined hash key/, "EXISTS fails on an undefined key";
203 # RT# 50541 (reported by Peter Scott)
204 # clear() leaves one key unless there's only one
205 my ($fh, $filename) = new_fh();
206 my $db = DBM::Deep->new(
212 $db->{critical} = { };
215 cmp_ok( scalar(keys( %$db )), '==', 3, "Have 3 keys" );
219 cmp_ok( scalar(keys( %$db )), '==', 0, "clear clears everything" );