From 82c9671f79c4673b0253db54533e6910f96a92a1 Mon Sep 17 00:00:00 2001 From: Junegunn Choi Date: Sun, 6 Jul 2025 22:02:12 +0900 Subject: Fix selection lost on revision bump --- src/merger_test.go | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) (limited to 'src/merger_test.go') diff --git a/src/merger_test.go b/src/merger_test.go index a6b28f6e..85e4795d 100644 --- a/src/merger_test.go +++ b/src/merger_test.go @@ -58,7 +58,7 @@ func TestMergerUnsorted(t *testing.T) { cnt := len(items) // Not sorted: same order - mg := NewMerger(nil, lists, false, false, revision{}, 0) + mg := NewMerger(nil, lists, false, false, revision{}, 0, 0) assert(t, cnt == mg.Length(), "Invalid Length") for i := 0; i < cnt; i++ { assert(t, items[i] == mg.Get(i), "Invalid Get") @@ -70,7 +70,7 @@ func TestMergerSorted(t *testing.T) { cnt := len(items) // Sorted sorted order - mg := NewMerger(nil, lists, true, false, revision{}, 0) + mg := NewMerger(nil, lists, true, false, revision{}, 0, 0) assert(t, cnt == mg.Length(), "Invalid Length") sort.Sort(ByRelevance(items)) for i := 0; i < cnt; i++ { @@ -80,7 +80,7 @@ func TestMergerSorted(t *testing.T) { } // Inverse order - mg2 := NewMerger(nil, lists, true, false, revision{}, 0) + mg2 := NewMerger(nil, lists, true, false, revision{}, 0, 0) for i := cnt - 1; i >= 0; i-- { if items[i] != mg2.Get(i) { t.Error("Not sorted", items[i], mg2.Get(i)) -- cgit v1.2.3