BerkeleyDB
view release on metacpan or search on metacpan
t/examples.t.T view on Meta::CPAN
$h{"tomato"} = "red" ;
# Check for existence of a key
print "Banana Exists\n\n" if $h{"banana"} ;
# Delete a key/value pair.
delete $h{"apple"} ;
# print the contents of the file
while (($k, $v) = each %h)
{ print "$k -> $v\n" }
untie %h ;
## END simpleHash
unlink $filename ;
}
#print "[" . docat($redirect) . "]" ;
is(docat_del($redirect), <<'EOM') ;
Banana Exists
orange -> orange
tomato -> red
banana -> yellow
EOM
}
{
my $redirect = "xyzt" ;
{
my $redirectObj = new Redirect $redirect ;
## BEGIN simpleHash2
use strict ;
use BerkeleyDB ;
my $filename = "fruit" ;
unlink $filename ;
my $db = new BerkeleyDB::Hash
-Filename => $filename,
-Flags => DB_CREATE
or die "Cannot open file $filename: $! $BerkeleyDB::Error\n" ;
# Add a few key/value pairs to the file
$db->db_put("apple", "red") ;
$db->db_put("orange", "orange") ;
$db->db_put("banana", "yellow") ;
$db->db_put("tomato", "red") ;
# Check for existence of a key
print "Banana Exists\n\n" if $db->db_get("banana", $v) == 0;
# Delete a key/value pair.
$db->db_del("apple") ;
# print the contents of the file
my ($k, $v) = ("", "") ;
my $cursor = $db->db_cursor() ;
while ($cursor->c_get($k, $v, DB_NEXT) == 0)
{ print "$k -> $v\n" }
undef $cursor ;
undef $db ;
## END simpleHash2
unlink $filename ;
}
#print "[" . docat($redirect) . "]" ;
is(docat_del($redirect), <<'EOM') ;
Banana Exists
orange -> orange
tomato -> red
banana -> yellow
EOM
}
{
my $redirect = "xyzt" ;
{
my $redirectObj = new Redirect $redirect ;
## BEGIN btreeSimple
use strict ;
use BerkeleyDB ;
my $filename = "tree" ;
unlink $filename ;
my %h ;
tie %h, 'BerkeleyDB::Btree',
-Filename => $filename,
-Flags => DB_CREATE
or die "Cannot open $filename: $! $BerkeleyDB::Error\n" ;
# Add a key/value pair to the file
$h{'Wall'} = 'Larry' ;
$h{'Smith'} = 'John' ;
$h{'mouse'} = 'mickey' ;
$h{'duck'} = 'donald' ;
# Delete
delete $h{"duck"} ;
# Cycle through the keys printing them in order.
# Note it is not necessary to sort the keys as
# the btree will have kept them in order automatically.
foreach (keys %h)
{ print "$_\n" }
untie %h ;
## END btreeSimple
unlink $filename ;
}
#print "[" . docat($redirect) . "]\n" ;
is(docat_del($redirect), <<'EOM') ;
Smith
Wall
mouse
EOM
( run in 0.764 second using v1.01-cache-2.11-cpan-39bf76dae61 )