[p5sagit/p5-mst-13.2.git] / t / lib / db-btree.t

#!./perl -w

BEGIN {
    @INC = '../lib';
    require Config; import Config;
    if ($Config{'extensions'} !~ /\bDB_File\b/) {
	print "1..0\n";
	exit 0;
    }
}

use DB_File; 
use Fcntl;

print "1..91\n";

sub ok
{
    my $no = shift ;
    my $result = shift ;
 
    print "not " unless $result ;
    print "ok $no\n" ;
}

$Dfile = "dbbtree.tmp";
unlink $Dfile;

umask(0);

# Check the interface to BTREEINFO

my $dbh = new DB_File::BTREEINFO ;
$^W = 0 ;
ok(1, $dbh->{flags} == undef) ;
ok(2, $dbh->{cachesize} == undef) ;
ok(3, $dbh->{psize} == undef) ;
ok(4, $dbh->{lorder} == undef) ;
ok(5, $dbh->{minkeypage} == undef) ;
ok(6, $dbh->{maxkeypage} == undef) ;
ok(7, $dbh->{compare} == undef) ;
ok(8, $dbh->{prefix} == undef) ;
$^W = 1 ;

$dbh->{flags} = 3000 ;
ok(9, $dbh->{flags} == 3000) ;

$dbh->{cachesize} = 9000 ;
ok(10, $dbh->{cachesize} == 9000);

$dbh->{psize} = 400 ;
ok(11, $dbh->{psize} == 400) ;

$dbh->{lorder} = 65 ;
ok(12, $dbh->{lorder} == 65) ;

$dbh->{minkeypage} = 123 ;
ok(13, $dbh->{minkeypage} == 123) ;

$dbh->{maxkeypage} = 1234 ;
ok(14, $dbh->{maxkeypage} == 1234 );

$dbh->{compare} = 1234 ;
ok(15, $dbh->{compare} == 1234) ;

$dbh->{prefix} = 1234 ;
ok(16, $dbh->{prefix} == 1234 );

# Check that an invalid entry is caught both for store & fetch
eval '$dbh->{fred} = 1234' ;
ok(17, $@ =~ /^DB_File::BTREEINFO::STORE - Unknown element 'fred' at/ ) ;
eval '$q = $dbh->{fred}' ;
ok(18, $@ =~ /^DB_File::BTREEINFO::FETCH - Unknown element 'fred' at/ ) ;

# Now check the interface to BTREE

ok(19, $X = tie(%h, 'DB_File',$Dfile, O_RDWR|O_CREAT, 0640, $DB_BTREE )) ;

($dev,$ino,$mode,$nlink,$uid,$gid,$rdev,$size,$atime,$mtime,$ctime,
   $blksize,$blocks) = stat($Dfile);
ok(20, ($mode & 0777) == 0640 );

while (($key,$value) = each(%h)) {
    $i++;
}
ok(21, !$i ) ;

$h{'goner1'} = 'snork';

$h{'abc'} = 'ABC';
ok(22, $h{'abc'} eq 'ABC' );
ok(23, ! defined $h{'jimmy'} ) ;
ok(24, ! exists $h{'jimmy'} ) ;
ok(25,  defined $h{'abc'} ) ;

$h{'def'} = 'DEF';
$h{'jkl','mno'} = "JKL\034MNO";
$h{'a',2,3,4,5} = join("\034",'A',2,3,4,5);
$h{'a'} = 'A';

#$h{'b'} = 'B';
$X->STORE('b', 'B') ;

$h{'c'} = 'C';

#$h{'d'} = 'D';
$X->put('d', 'D') ;

$h{'e'} = 'E';
$h{'f'} = 'F';
$h{'g'} = 'X';
$h{'h'} = 'H';
$h{'i'} = 'I';

$h{'goner2'} = 'snork';
delete $h{'goner2'};


# IMPORTANT - $X must be undefined before the untie otherwise the
#             underlying DB close routine will not get called.
undef $X ;
untie(%h);


# tie to the same file again
ok(26, $X = tie(%h,'DB_File',$Dfile, O_RDWR, 0640, $DB_BTREE)) ;

# Modify an entry from the previous tie
$h{'g'} = 'G';

$h{'j'} = 'J';
$h{'k'} = 'K';
$h{'l'} = 'L';
$h{'m'} = 'M';
$h{'n'} = 'N';
$h{'o'} = 'O';
$h{'p'} = 'P';
$h{'q'} = 'Q';
$h{'r'} = 'R';
$h{'s'} = 'S';
$h{'t'} = 'T';
$h{'u'} = 'U';
$h{'v'} = 'V';
$h{'w'} = 'W';
$h{'x'} = 'X';
$h{'y'} = 'Y';
$h{'z'} = 'Z';

$h{'goner3'} = 'snork';

delete $h{'goner1'};
$X->DELETE('goner3');

@keys = keys(%h);
@values = values(%h);

ok(27, $#keys == 29 && $#values == 29) ;

$i = 0 ;
while (($key,$value) = each(%h)) {
    if ($key eq $keys[$i] && $value eq $values[$i] && $key eq lc($value)) {
	$key =~ y/a-z/A-Z/;
	$i++ if $key eq $value;
    }
}

ok(28, $i == 30) ;

@keys = ('blurfl', keys(%h), 'dyick');
ok(29, $#keys == 31) ;

#Check that the keys can be retrieved in order
$ok = 1 ;
foreach (keys %h)
{
    ($ok = 0), last if defined $previous && $previous gt $_ ;
    $previous = $_ ;
}
ok(30, $ok ) ;

$h{'foo'} = '';
ok(31, $h{'foo'} eq '' ) ;

$h{''} = 'bar';
ok(32, $h{''} eq 'bar' );

# check cache overflow and numeric keys and contents
$ok = 1;
for ($i = 1; $i < 200; $i++) { $h{$i + 0} = $i + 0; }
for ($i = 1; $i < 200; $i++) { $ok = 0 unless $h{$i} == $i; }
ok(33, $ok);

($dev,$ino,$mode,$nlink,$uid,$gid,$rdev,$size,$atime,$mtime,$ctime,
   $blksize,$blocks) = stat($Dfile);
ok(34, $size > 0 );

@h{0..200} = 200..400;
@foo = @h{0..200};
ok(35, join(':',200..400) eq join(':',@foo) );

# Now check all the non-tie specific stuff


# Check R_NOOVERWRITE flag will make put fail when attempting to overwrite
# an existing record.
 
$status = $X->put( 'x', 'newvalue', R_NOOVERWRITE) ;
ok(36, $status == 1 );
 
# check that the value of the key 'x' has not been changed by the 
# previous test
ok(37, $h{'x'} eq 'X' );

# standard put
$status = $X->put('key', 'value') ;
ok(38, $status == 0 );

#check that previous put can be retrieved
$value = 0 ;
$status = $X->get('key', $value) ;
ok(39, $status == 0 );
ok(40, $value eq 'value' );

# Attempting to delete an existing key should work

$status = $X->del('q') ;
ok(41, $status == 0 );
$status = $X->del('') ;
ok(42, $status == 0 );

# Make sure that the key deleted, cannot be retrieved
$^W = 0 ;
ok(43, $h{'q'} eq undef) ;
ok(44, $h{''} eq undef) ;
$^W = 1 ;

undef $X ;
untie %h ;

ok(45, $X = tie(%h, 'DB_File',$Dfile, O_RDWR, 0640, $DB_BTREE ));

# Attempting to delete a non-existant key should fail

$status = $X->del('joe') ;
ok(46, $status == 1 );

# Check the get interface

# First a non-existing key
$status = $X->get('aaaa', $value) ;
ok(47, $status == 1 );

# Next an existing key
$status = $X->get('a', $value) ;
ok(48, $status == 0 );
ok(49, $value eq 'A' );

# seq
# ###

# use seq to find an approximate match
$key = 'ke' ;
$value = '' ;
$status = $X->seq($key, $value, R_CURSOR) ;
ok(50, $status == 0 );
ok(51, $key eq 'key' );
ok(52, $value eq 'value' );

# seq when the key does not match
$key = 'zzz' ;
$value = '' ;
$status = $X->seq($key, $value, R_CURSOR) ;
ok(53, $status == 1 );


# use seq to set the cursor, then delete the record @ the cursor.

$key = 'x' ;
$value = '' ;
$status = $X->seq($key, $value, R_CURSOR) ;
ok(54, $status == 0 );
ok(55, $key eq 'x' );
ok(56, $value eq 'X' );
$status = $X->del(0, R_CURSOR) ;
ok(57, $status == 0 );
$status = $X->get('x', $value) ;
ok(58, $status == 1 );

# ditto, but use put to replace the key/value pair.
$key = 'y' ;
$value = '' ;
$status = $X->seq($key, $value, R_CURSOR) ;
ok(59, $status == 0 );
ok(60, $key eq 'y' );
ok(61, $value eq 'Y' );

$key = "replace key" ;
$value = "replace value" ;
$status = $X->put($key, $value, R_CURSOR) ;
ok(62, $status == 0 );
ok(63, $key eq 'replace key' );
ok(64, $value eq 'replace value' );
$status = $X->get('y', $value) ;
ok(65, $status == 1 );

# use seq to walk forwards through a file 

$status = $X->seq($key, $value, R_FIRST) ;
ok(66, $status == 0 );
$previous = $key ;

$ok = 1 ;
while (($status = $X->seq($key, $value, R_NEXT)) == 0)
{
    ($ok = 0), last if ($previous cmp $key) == 1 ;
}

ok(67, $status == 1 );
ok(68, $ok == 1 );

# use seq to walk backwards through a file 
$status = $X->seq($key, $value, R_LAST) ;
ok(69, $status == 0 );
$previous = $key ;

$ok = 1 ;
while (($status = $X->seq($key, $value, R_PREV)) == 0)
{
    ($ok = 0), last if ($previous cmp $key) == -1 ;
    #print "key = [$key] value = [$value]\n" ;
}

ok(70, $status == 1 );
ok(71, $ok == 1 );


# check seq FIRST/LAST

# sync
# ####

$status = $X->sync ;
ok(72, $status == 0 );


# fd
# ##

$status = $X->fd ;
ok(73, $status != 0 );


undef $X ;
untie %h ;

unlink $Dfile;

# Now try an in memory file
ok(74, $Y = tie(%h, 'DB_File',undef, O_RDWR|O_CREAT, 0640, $DB_BTREE ));

# fd with an in memory file should return failure
$status = $Y->fd ;
ok(75, $status == -1 );


undef $Y ;
untie %h ;

# Duplicate keys
my $bt = new DB_File::BTREEINFO ;
$bt->{flags} = R_DUP ;
ok(76, $YY = tie(%hh, 'DB_File', $Dfile, O_RDWR|O_CREAT, 0640, $bt )) ;

$hh{'Wall'} = 'Larry' ;
$hh{'Wall'} = 'Stone' ; # Note the duplicate key
$hh{'Wall'} = 'Brick' ; # Note the duplicate key
$hh{'Wall'} = 'Brick' ; # Note the duplicate key and value
$hh{'Smith'} = 'John' ;
$hh{'mouse'} = 'mickey' ;

# first work in scalar context
ok(77, scalar $YY->get_dup('Unknown') == 0 );
ok(78, scalar $YY->get_dup('Smith') == 1 );
ok(79, scalar $YY->get_dup('Wall') == 4 );

# now in list context
my @unknown = $YY->get_dup('Unknown') ;
ok(80, "@unknown" eq "" );

my @smith = $YY->get_dup('Smith') ;
ok(81, "@smith" eq "John" );

{
my @wall = $YY->get_dup('Wall') ;
my %wall ;
@wall{@wall} = @wall ;
ok(82, (@wall == 4 && $wall{'Larry'} && $wall{'Stone'} && $wall{'Brick'}) );
}

# hash
my %unknown = $YY->get_dup('Unknown', 1) ;
ok(83, keys %unknown == 0 );

my %smith = $YY->get_dup('Smith', 1) ;
ok(84, keys %smith == 1 && $smith{'John'}) ;

my %wall = $YY->get_dup('Wall', 1) ;
ok(85, keys %wall == 3 && $wall{'Larry'} == 1 && $wall{'Stone'} == 1 
		&& $wall{'Brick'} == 2);

undef $YY ;
untie %hh ;
unlink $Dfile;


# test multiple callbacks
$Dfile1 = "btree1" ;
$Dfile2 = "btree2" ;
$Dfile3 = "btree3" ;
 
$dbh1 = TIEHASH DB_File::BTREEINFO ;
$dbh1->{compare} = sub { $_[0] <=> $_[1] } ;
 
$dbh2 = TIEHASH DB_File::BTREEINFO ;
$dbh2->{compare} = sub { $_[0] cmp $_[1] } ;
 
$dbh3 = TIEHASH DB_File::BTREEINFO ;
$dbh3->{compare} = sub { length $_[0] <=> length $_[1] } ;
 
 
tie(%h, 'DB_File',$Dfile1, O_RDWR|O_CREAT, 0640, $dbh1 ) ;
tie(%g, 'DB_File',$Dfile2, O_RDWR|O_CREAT, 0640, $dbh2 ) ;
tie(%k, 'DB_File',$Dfile3, O_RDWR|O_CREAT, 0640, $dbh3 ) ;
 
@Keys = qw( 0123 12 -1234 9 987654321 def  ) ;
$^W = 0 ;
@srt_1 = sort { $a <=> $b } @Keys ;
$^W = 1 ;
@srt_2 = sort { $a cmp $b } @Keys ;
@srt_3 = sort { length $a <=> length $b } @Keys ;
 
foreach (@Keys) {
    $^W = 0 ; $h{$_} = 1 ; $^W = 1 ;
    $g{$_} = 1 ;
    $k{$_} = 1 ;
}
 
sub ArrayCompare
{
    my($a, $b) = @_ ;
 
    return 0 if @$a != @$b ;
 
    foreach (1 .. length @$a)
    {
        return 0 unless $$a[$_] eq $$b[$_] ;
    }
 
    1 ;
}
 
ok(86, ArrayCompare (\@srt_1, [keys %h]) );
ok(87, ArrayCompare (\@srt_2, [keys %g]) );
ok(88, ArrayCompare (\@srt_3, [keys %k]) );

untie %h ;
untie %g ;
untie %k ;
unlink $Dfile1, $Dfile2, $Dfile3 ;

# clear
# #####

ok(89, tie(%h, 'DB_File', $Dfile1, O_RDWR|O_CREAT, 0640, $DB_BTREE ) );
foreach (1 .. 10)
  { $h{$_} = $_ * 100 }

# check that there are 10 elements in the hash
$i = 0 ;
while (($key,$value) = each(%h)) {
    $i++;
}
ok(90, $i == 10);

# now clear the hash
%h = () ;

# check it is empty
$i = 0 ;
while (($key,$value) = each(%h)) {
    $i++;
}
ok(91, $i == 0);

untie %h ;
unlink $Dfile1 ;

exit ;
Commit	Line	Data
f6b705ef	1	#!./perl -w
a0d0e21e	2
	3	BEGIN {
	4	@INC = '../lib';
	5	require Config; import Config;
	6	if ($Config{'extensions'} !~ /\bDB_File\b/) {
	7	print "1..0\n";
	8	exit 0;
	9	}
	10	}
	11
	12	use DB_File;
	13	use Fcntl;
	14
f6b705ef	15	print "1..91\n";
	16
	17	sub ok
	18	{
	19	my $no = shift ;
	20	my $result = shift ;
	21
	22	print "not " unless $result ;
	23	print "ok $no\n" ;
	24	}
a0d0e21e	25
55d68b4a	26	$Dfile = "dbbtree.tmp";
a0d0e21e	27	unlink $Dfile;
	28
	29	umask(0);
	30
	31	# Check the interface to BTREEINFO
	32
f6b705ef	33	my $dbh = new DB_File::BTREEINFO ;
	34	$^W = 0 ;
	35	ok(1, $dbh->{flags} == undef) ;
	36	ok(2, $dbh->{cachesize} == undef) ;
	37	ok(3, $dbh->{psize} == undef) ;
	38	ok(4, $dbh->{lorder} == undef) ;
	39	ok(5, $dbh->{minkeypage} == undef) ;
	40	ok(6, $dbh->{maxkeypage} == undef) ;
	41	ok(7, $dbh->{compare} == undef) ;
	42	ok(8, $dbh->{prefix} == undef) ;
	43	$^W = 1 ;
a0d0e21e	44
a0d0e21e	45	$dbh->{flags} = 3000 ;
f6b705ef	46	ok(9, $dbh->{flags} == 3000) ;
a0d0e21e	47
a0d0e21e	48	$dbh->{cachesize} = 9000 ;
f6b705ef	49	ok(10, $dbh->{cachesize} == 9000);
f6b705ef	50
a0d0e21e	51	$dbh->{psize} = 400 ;
f6b705ef	52	ok(11, $dbh->{psize} == 400) ;
a0d0e21e	53
a0d0e21e	54	$dbh->{lorder} = 65 ;
f6b705ef	55	ok(12, $dbh->{lorder} == 65) ;
a0d0e21e	56
a0d0e21e	57	$dbh->{minkeypage} = 123 ;
f6b705ef	58	ok(13, $dbh->{minkeypage} == 123) ;
a0d0e21e	59
a0d0e21e	60	$dbh->{maxkeypage} = 1234 ;
f6b705ef	61	ok(14, $dbh->{maxkeypage} == 1234 );
a0d0e21e	62
a0d0e21e	63	$dbh->{compare} = 1234 ;
f6b705ef	64	ok(15, $dbh->{compare} == 1234) ;
a0d0e21e	65
a0d0e21e	66	$dbh->{prefix} = 1234 ;
f6b705ef	67	ok(16, $dbh->{prefix} == 1234 );
a0d0e21e	68
	69	# Check that an invalid entry is caught both for store & fetch
	70	eval '$dbh->{fred} = 1234' ;
f6b705ef	71	ok(17, $@ =~ /^DB_File::BTREEINFO::STORE - Unknown element 'fred' at/ ) ;
a0d0e21e	72	eval '$q = $dbh->{fred}' ;
f6b705ef	73	ok(18, $@ =~ /^DB_File::BTREEINFO::FETCH - Unknown element 'fred' at/ ) ;
a0d0e21e	74
	75	# Now check the interface to BTREE
	76
f6b705ef	77	ok(19, $X = tie(%h, 'DB_File',$Dfile, O_RDWR\|O_CREAT, 0640, $DB_BTREE )) ;
a0d0e21e	78
	79	($dev,$ino,$mode,$nlink,$uid,$gid,$rdev,$size,$atime,$mtime,$ctime,
	80	$blksize,$blocks) = stat($Dfile);
f6b705ef	81	ok(20, ($mode & 0777) == 0640 );
a0d0e21e	82
	83	while (($key,$value) = each(%h)) {
	84	$i++;
	85	}
f6b705ef	86	ok(21, !$i ) ;
a0d0e21e	87
	88	$h{'goner1'} = 'snork';
	89
	90	$h{'abc'} = 'ABC';
f6b705ef	91	ok(22, $h{'abc'} eq 'ABC' );
	92	ok(23, ! defined $h{'jimmy'} ) ;
	93	ok(24, ! exists $h{'jimmy'} ) ;
	94	ok(25, defined $h{'abc'} ) ;
a0d0e21e	95
	96	$h{'def'} = 'DEF';
	97	$h{'jkl','mno'} = "JKL\034MNO";
	98	$h{'a',2,3,4,5} = join("\034",'A',2,3,4,5);
	99	$h{'a'} = 'A';
	100
	101	#$h{'b'} = 'B';
	102	$X->STORE('b', 'B') ;
	103
	104	$h{'c'} = 'C';
	105
	106	#$h{'d'} = 'D';
	107	$X->put('d', 'D') ;
	108
	109	$h{'e'} = 'E';
	110	$h{'f'} = 'F';
	111	$h{'g'} = 'X';
	112	$h{'h'} = 'H';
	113	$h{'i'} = 'I';
	114
	115	$h{'goner2'} = 'snork';
	116	delete $h{'goner2'};
	117
	118
	119	# IMPORTANT - $X must be undefined before the untie otherwise the
	120	# underlying DB close routine will not get called.
	121	undef $X ;
	122	untie(%h);
	123
	124
	125	# tie to the same file again
f6b705ef	126	ok(26, $X = tie(%h,'DB_File',$Dfile, O_RDWR, 0640, $DB_BTREE)) ;
a0d0e21e	127
	128	# Modify an entry from the previous tie
	129	$h{'g'} = 'G';
	130
	131	$h{'j'} = 'J';
	132	$h{'k'} = 'K';
	133	$h{'l'} = 'L';
	134	$h{'m'} = 'M';
	135	$h{'n'} = 'N';
	136	$h{'o'} = 'O';
	137	$h{'p'} = 'P';
	138	$h{'q'} = 'Q';
	139	$h{'r'} = 'R';
	140	$h{'s'} = 'S';
	141	$h{'t'} = 'T';
	142	$h{'u'} = 'U';
	143	$h{'v'} = 'V';
	144	$h{'w'} = 'W';
	145	$h{'x'} = 'X';
	146	$h{'y'} = 'Y';
	147	$h{'z'} = 'Z';
	148
	149	$h{'goner3'} = 'snork';
	150
	151	delete $h{'goner1'};
	152	$X->DELETE('goner3');
	153
	154	@keys = keys(%h);
	155	@values = values(%h);
	156
f6b705ef	157	ok(27, $#keys == 29 && $#values == 29) ;
a0d0e21e	158
f6b705ef	159	$i = 0 ;
a0d0e21e	160	while (($key,$value) = each(%h)) {
2f52a358	161	if ($key eq $keys[$i] && $value eq $values[$i] && $key eq lc($value)) {
a0d0e21e	162	$key =~ y/a-z/A-Z/;
	163	$i++ if $key eq $value;
	164	}
	165	}
	166
f6b705ef	167	ok(28, $i == 30) ;
a0d0e21e	168
55d68b4a	169	@keys = ('blurfl', keys(%h), 'dyick');
f6b705ef	170	ok(29, $#keys == 31) ;
a0d0e21e	171
	172	#Check that the keys can be retrieved in order
	173	$ok = 1 ;
	174	foreach (keys %h)
	175	{
	176	($ok = 0), last if defined $previous && $previous gt $_ ;
	177	$previous = $_ ;
	178	}
f6b705ef	179	ok(30, $ok ) ;
a0d0e21e	180
a0d0e21e	181	$h{'foo'} = '';
f6b705ef	182	ok(31, $h{'foo'} eq '' ) ;
a0d0e21e	183
a0d0e21e	184	$h{''} = 'bar';
f6b705ef	185	ok(32, $h{''} eq 'bar' );
a0d0e21e	186
	187	# check cache overflow and numeric keys and contents
	188	$ok = 1;
	189	for ($i = 1; $i < 200; $i++) { $h{$i + 0} = $i + 0; }
	190	for ($i = 1; $i < 200; $i++) { $ok = 0 unless $h{$i} == $i; }
f6b705ef	191	ok(33, $ok);
a0d0e21e	192
	193	($dev,$ino,$mode,$nlink,$uid,$gid,$rdev,$size,$atime,$mtime,$ctime,
	194	$blksize,$blocks) = stat($Dfile);
f6b705ef	195	ok(34, $size > 0 );
a0d0e21e	196
	197	@h{0..200} = 200..400;
	198	@foo = @h{0..200};
f6b705ef	199	ok(35, join(':',200..400) eq join(':',@foo) );
a0d0e21e	200
	201	# Now check all the non-tie specific stuff
	202
	203
	204	# Check R_NOOVERWRITE flag will make put fail when attempting to overwrite
	205	# an existing record.
	206
	207	$status = $X->put( 'x', 'newvalue', R_NOOVERWRITE) ;
f6b705ef	208	ok(36, $status == 1 );
a0d0e21e	209
	210	# check that the value of the key 'x' has not been changed by the
	211	# previous test
f6b705ef	212	ok(37, $h{'x'} eq 'X' );
a0d0e21e	213
	214	# standard put
	215	$status = $X->put('key', 'value') ;
f6b705ef	216	ok(38, $status == 0 );
a0d0e21e	217
a0d0e21e	218	#check that previous put can be retrieved
f6b705ef	219	$value = 0 ;
a0d0e21e	220	$status = $X->get('key', $value) ;
f6b705ef	221	ok(39, $status == 0 );
f6b705ef	222	ok(40, $value eq 'value' );
a0d0e21e	223
	224	# Attempting to delete an existing key should work
	225
	226	$status = $X->del('q') ;
f6b705ef	227	ok(41, $status == 0 );
a0d0e21e	228	$status = $X->del('') ;
f6b705ef	229	ok(42, $status == 0 );
a0d0e21e	230
a0d0e21e	231	# Make sure that the key deleted, cannot be retrieved
f6b705ef	232	$^W = 0 ;
	233	ok(43, $h{'q'} eq undef) ;
	234	ok(44, $h{''} eq undef) ;
	235	$^W = 1 ;
a0d0e21e	236
	237	undef $X ;
	238	untie %h ;
	239
f6b705ef	240	ok(45, $X = tie(%h, 'DB_File',$Dfile, O_RDWR, 0640, $DB_BTREE ));
a0d0e21e	241
	242	# Attempting to delete a non-existant key should fail
	243
	244	$status = $X->del('joe') ;
f6b705ef	245	ok(46, $status == 1 );
a0d0e21e	246
	247	# Check the get interface
	248
	249	# First a non-existing key
	250	$status = $X->get('aaaa', $value) ;
f6b705ef	251	ok(47, $status == 1 );
a0d0e21e	252
	253	# Next an existing key
	254	$status = $X->get('a', $value) ;
f6b705ef	255	ok(48, $status == 0 );
f6b705ef	256	ok(49, $value eq 'A' );
a0d0e21e	257
	258	# seq
	259	# ###
	260
	261	# use seq to find an approximate match
	262	$key = 'ke' ;
	263	$value = '' ;
	264	$status = $X->seq($key, $value, R_CURSOR) ;
f6b705ef	265	ok(50, $status == 0 );
	266	ok(51, $key eq 'key' );
	267	ok(52, $value eq 'value' );
a0d0e21e	268
	269	# seq when the key does not match
	270	$key = 'zzz' ;
	271	$value = '' ;
	272	$status = $X->seq($key, $value, R_CURSOR) ;
f6b705ef	273	ok(53, $status == 1 );
a0d0e21e	274
	275
	276	# use seq to set the cursor, then delete the record @ the cursor.
	277
	278	$key = 'x' ;
	279	$value = '' ;
	280	$status = $X->seq($key, $value, R_CURSOR) ;
f6b705ef	281	ok(54, $status == 0 );
	282	ok(55, $key eq 'x' );
	283	ok(56, $value eq 'X' );
a0d0e21e	284	$status = $X->del(0, R_CURSOR) ;
f6b705ef	285	ok(57, $status == 0 );
a0d0e21e	286	$status = $X->get('x', $value) ;
f6b705ef	287	ok(58, $status == 1 );
a0d0e21e	288
	289	# ditto, but use put to replace the key/value pair.
	290	$key = 'y' ;
	291	$value = '' ;
	292	$status = $X->seq($key, $value, R_CURSOR) ;
f6b705ef	293	ok(59, $status == 0 );
	294	ok(60, $key eq 'y' );
	295	ok(61, $value eq 'Y' );
a0d0e21e	296
	297	$key = "replace key" ;
	298	$value = "replace value" ;
	299	$status = $X->put($key, $value, R_CURSOR) ;
f6b705ef	300	ok(62, $status == 0 );
	301	ok(63, $key eq 'replace key' );
	302	ok(64, $value eq 'replace value' );
a0d0e21e	303	$status = $X->get('y', $value) ;
f6b705ef	304	ok(65, $status == 1 );
a0d0e21e	305
	306	# use seq to walk forwards through a file
	307
	308	$status = $X->seq($key, $value, R_FIRST) ;
f6b705ef	309	ok(66, $status == 0 );
a0d0e21e	310	$previous = $key ;
	311
	312	$ok = 1 ;
	313	while (($status = $X->seq($key, $value, R_NEXT)) == 0)
	314	{
	315	($ok = 0), last if ($previous cmp $key) == 1 ;
	316	}
	317
f6b705ef	318	ok(67, $status == 1 );
f6b705ef	319	ok(68, $ok == 1 );
a0d0e21e	320
	321	# use seq to walk backwards through a file
	322	$status = $X->seq($key, $value, R_LAST) ;
f6b705ef	323	ok(69, $status == 0 );
a0d0e21e	324	$previous = $key ;
	325
	326	$ok = 1 ;
	327	while (($status = $X->seq($key, $value, R_PREV)) == 0)
	328	{
	329	($ok = 0), last if ($previous cmp $key) == -1 ;
	330	#print "key = [$key] value = [$value]\n" ;
	331	}
	332
f6b705ef	333	ok(70, $status == 1 );
f6b705ef	334	ok(71, $ok == 1 );
a0d0e21e	335
	336
	337	# check seq FIRST/LAST
	338
	339	# sync
	340	# ####
	341
	342	$status = $X->sync ;
f6b705ef	343	ok(72, $status == 0 );
a0d0e21e	344
	345
	346	# fd
	347	# ##
	348
	349	$status = $X->fd ;
f6b705ef	350	ok(73, $status != 0 );
a0d0e21e	351
	352
	353	undef $X ;
	354	untie %h ;
	355
	356	unlink $Dfile;
	357
	358	# Now try an in memory file
f6b705ef	359	ok(74, $Y = tie(%h, 'DB_File',undef, O_RDWR\|O_CREAT, 0640, $DB_BTREE ));
a0d0e21e	360
	361	# fd with an in memory file should return failure
	362	$status = $Y->fd ;
f6b705ef	363	ok(75, $status == -1 );
a0d0e21e	364
55d68b4a	365
a0d0e21e	366	undef $Y ;
	367	untie %h ;
	368
55d68b4a	369	# Duplicate keys
	370	my $bt = new DB_File::BTREEINFO ;
	371	$bt->{flags} = R_DUP ;
f6b705ef	372	ok(76, $YY = tie(%hh, 'DB_File', $Dfile, O_RDWR\|O_CREAT, 0640, $bt )) ;
55d68b4a	373
	374	$hh{'Wall'} = 'Larry' ;
	375	$hh{'Wall'} = 'Stone' ; # Note the duplicate key
	376	$hh{'Wall'} = 'Brick' ; # Note the duplicate key
f6b705ef	377	$hh{'Wall'} = 'Brick' ; # Note the duplicate key and value
55d68b4a	378	$hh{'Smith'} = 'John' ;
	379	$hh{'mouse'} = 'mickey' ;
	380
	381	# first work in scalar context
f6b705ef	382	ok(77, scalar $YY->get_dup('Unknown') == 0 );
	383	ok(78, scalar $YY->get_dup('Smith') == 1 );
	384	ok(79, scalar $YY->get_dup('Wall') == 4 );
55d68b4a	385
	386	# now in list context
	387	my @unknown = $YY->get_dup('Unknown') ;
f6b705ef	388	ok(80, "@unknown" eq "" );
55d68b4a	389
55d68b4a	390	my @smith = $YY->get_dup('Smith') ;
f6b705ef	391	ok(81, "@smith" eq "John" );
55d68b4a	392
760ac839	393	{
f6b705ef	394	my @wall = $YY->get_dup('Wall') ;
	395	my %wall ;
	396	@wall{@wall} = @wall ;
	397	ok(82, (@wall == 4 && $wall{'Larry'} && $wall{'Stone'} && $wall{'Brick'}) );
760ac839	398	}
55d68b4a	399
	400	# hash
	401	my %unknown = $YY->get_dup('Unknown', 1) ;
f6b705ef	402	ok(83, keys %unknown == 0 );
55d68b4a	403
55d68b4a	404	my %smith = $YY->get_dup('Smith', 1) ;
f6b705ef	405	ok(84, keys %smith == 1 && $smith{'John'}) ;
55d68b4a	406
f6b705ef	407	my %wall = $YY->get_dup('Wall', 1) ;
	408	ok(85, keys %wall == 3 && $wall{'Larry'} == 1 && $wall{'Stone'} == 1
	409	&& $wall{'Brick'} == 2);
55d68b4a	410
	411	undef $YY ;
	412	untie %hh ;
	413	unlink $Dfile;
	414
	415
8e07c86e	416	# test multiple callbacks
	417	$Dfile1 = "btree1" ;
	418	$Dfile2 = "btree2" ;
	419	$Dfile3 = "btree3" ;
	420
	421	$dbh1 = TIEHASH DB_File::BTREEINFO ;
	422	$dbh1->{compare} = sub { $_[0] <=> $_[1] } ;
	423
	424	$dbh2 = TIEHASH DB_File::BTREEINFO ;
	425	$dbh2->{compare} = sub { $_[0] cmp $_[1] } ;
	426
	427	$dbh3 = TIEHASH DB_File::BTREEINFO ;
	428	$dbh3->{compare} = sub { length $_[0] <=> length $_[1] } ;
	429
	430
f6b705ef	431	tie(%h, 'DB_File',$Dfile1, O_RDWR\|O_CREAT, 0640, $dbh1 ) ;
	432	tie(%g, 'DB_File',$Dfile2, O_RDWR\|O_CREAT, 0640, $dbh2 ) ;
	433	tie(%k, 'DB_File',$Dfile3, O_RDWR\|O_CREAT, 0640, $dbh3 ) ;
8e07c86e	434
8e07c86e	435	@Keys = qw( 0123 12 -1234 9 987654321 def ) ;
f6b705ef	436	$^W = 0 ;
8e07c86e	437	@srt_1 = sort { $a <=> $b } @Keys ;
f6b705ef	438	$^W = 1 ;
8e07c86e	439	@srt_2 = sort { $a cmp $b } @Keys ;
	440	@srt_3 = sort { length $a <=> length $b } @Keys ;
	441
	442	foreach (@Keys) {
f6b705ef	443	$^W = 0 ; $h{$_} = 1 ; $^W = 1 ;
8e07c86e	444	$g{$_} = 1 ;
	445	$k{$_} = 1 ;
	446	}
	447
	448	sub ArrayCompare
	449	{
	450	my($a, $b) = @_ ;
	451
	452	return 0 if @$a != @$b ;
	453
	454	foreach (1 .. length @$a)
	455	{
	456	return 0 unless $$a[$_] eq $$b[$_] ;
	457	}
	458
	459	1 ;
	460	}
	461
f6b705ef	462	ok(86, ArrayCompare (\@srt_1, [keys %h]) );
	463	ok(87, ArrayCompare (\@srt_2, [keys %g]) );
	464	ok(88, ArrayCompare (\@srt_3, [keys %k]) );
8e07c86e	465
	466	untie %h ;
	467	untie %g ;
	468	untie %k ;
	469	unlink $Dfile1, $Dfile2, $Dfile3 ;
	470
f6b705ef	471	# clear
	472	# #####
	473
	474	ok(89, tie(%h, 'DB_File', $Dfile1, O_RDWR\|O_CREAT, 0640, $DB_BTREE ) );
	475	foreach (1 .. 10)
	476	{ $h{$_} = $_ * 100 }
	477
	478	# check that there are 10 elements in the hash
	479	$i = 0 ;
	480	while (($key,$value) = each(%h)) {
	481	$i++;
	482	}
	483	ok(90, $i == 10);
	484
	485	# now clear the hash
	486	%h = () ;
	487
	488	# check it is empty
	489	$i = 0 ;
	490	while (($key,$value) = each(%h)) {
	491	$i++;
	492	}
	493	ok(91, $i == 0);
	494
	495	untie %h ;
	496	unlink $Dfile1 ;
	497
a0d0e21e	498	exit ;