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

[public-inbox.git] / t / thread-cycle.t

diff --git a/t/thread-cycle.t b/t/thread-cycle.t
index 0e1ecfe261507efa5e1697d999e393c3ff050176..16ceee71f25e0c1bc46f0450729a22e625a96ae7 100644 (file)
--- a/t/thread-cycle.t
+++ b/t/thread-cycle.t
@@ -3,7 +3,6 @@
 use strict;
 use warnings;
 use Test::More;
-use_ok('PublicInbox::SearchMsg');
 use_ok('PublicInbox::SearchThread');
 use Email::Simple;
 my $mt = eval {
@@ -70,22 +69,14 @@ SKIP: {
        is($check, $st, 'Mail::Thread output matches');
 }
 
-@msgs = map { bless $_, 'PublicInbox::SearchMsg' } (
-       { mid => 'a@b' },
-       { mid => 'b@c', references => '<a@b> <b@c>' },
-       { mid => 'd@e', references => '<d@e>' },
-);
-
-is(thread_to_s(\@msgs), "a\@b\n b\@c\nd\@e\n", 'ok with self-references');
-
 done_testing();
 
 sub thread_to_s {
-       my $th = PublicInbox::SearchThread->new(shift);
-       $th->thread;
-       $th->order(sub { [ sort { $a->{id} cmp $b->{id} } @{$_[0]} ] });
+       my ($msgs) = @_;
+       my $rootset = PublicInbox::SearchThread::thread($msgs, sub {
+               [ sort { $a->{id} cmp $b->{id} } @{$_[0]} ] });
        my $st = '';
-       my @q = map { (0, $_) } @{$th->{rootset}};
+       my @q = map { (0, $_) } @$rootset;
        while (@q) {
                my $level = shift @q;
                my $node = shift @q or next;