searchview: show full (&x=t) messages in ascending chronlogical order

[public-inbox.git] / t / msgmap.t

diff --git a/t/msgmap.t b/t/msgmap.t
index a34fd712ce3c7db90095f3e781af32175514a25d..5c28e54df7542b7031081e5a37cecfa803a68c05 100644 (file)
--- a/t/msgmap.t
+++ b/t/msgmap.t
@@ -5,13 +5,20 @@ use warnings;
 use Test::More;
 use File::Temp qw/tempdir/;
 
+foreach my $mod (qw(DBD::SQLite)) {
+       eval "require $mod";
+       plan skip_all => "$mod missing for nntpd.t" if $@;
+}
+
 use_ok 'PublicInbox::Msgmap';
-my $tmpdir = tempdir(CLEANUP => 1);
+my $tmpdir = tempdir('pi-msgmap-XXXXXX', TMPDIR => 1, CLEANUP => 1);
 my $d = PublicInbox::Msgmap->new($tmpdir, 1);
 
 my %mid2num;
 my %num2mid;
 my @mids = qw(a@b c@d e@f g@h aa@bb aa@cc);
+is_deeply([$d->minmax], [undef,undef], "empty min max on new DB");
+
 foreach my $mid (@mids) {
        my $n = $d->mid_insert($mid);
        ok($n, "mid $mid inserted");
@@ -23,6 +30,7 @@ $@ = undef;
 eval { $d->mid_insert('a@b') };
 ok($@, 'error raised when attempting duplicate message ID');
 
+
 foreach my $n (keys %num2mid) {
        is($d->mid_for($n), $num2mid{$n}, "num:$n maps correctly");
 }
@@ -47,7 +55,14 @@ is($d->mid_delete('a@b') + 0, 0, 'delete again returns zero');
 is(undef, $d->num_for('a@b'), 'num_for fails on deleted msg');
 $d = undef;
 
-# idempotent
-ok(PublicInbox::Msgmap->new($tmpdir, 1), 'idempotent DB creation');
+ok($d = PublicInbox::Msgmap->new($tmpdir, 1), 'idempotent DB creation');
+my ($min, $max) = $d->minmax;
+ok($min > 0, "article min OK");
+ok($max > 0 && $max < 10, "article max OK");
+ok($min < $max, "article counts OK");
+
+my $orig = $d->mid_insert('spam@1');
+$d->mid_delete('spam@1');
+is($d->mid_insert('spam@2'), 1 + $orig, "last number not recycled");
 
 done_testing();