From 93bbb3032d1e7550dbabb2d450999cd434c60509 Mon Sep 17 00:00:00 2001 From: Junegunn Choi Date: Tue, 4 Jun 2024 15:48:38 +0900 Subject: Add --tail=NUM to limit the number of items to keep in memory --- src/merger_test.go | 15 ++++++++------- 1 file changed, 8 insertions(+), 7 deletions(-) (limited to 'src/merger_test.go') diff --git a/src/merger_test.go b/src/merger_test.go index 5fd1576f..a6b28f6e 100644 --- a/src/merger_test.go +++ b/src/merger_test.go @@ -23,10 +23,11 @@ func randResult() Result { } func TestEmptyMerger(t *testing.T) { - assert(t, EmptyMerger(0).Length() == 0, "Not empty") - assert(t, EmptyMerger(0).count == 0, "Invalid count") - assert(t, len(EmptyMerger(0).lists) == 0, "Invalid lists") - assert(t, len(EmptyMerger(0).merged) == 0, "Invalid merged list") + r := revision{} + assert(t, EmptyMerger(r).Length() == 0, "Not empty") + assert(t, EmptyMerger(r).count == 0, "Invalid count") + assert(t, len(EmptyMerger(r).lists) == 0, "Invalid lists") + assert(t, len(EmptyMerger(r).merged) == 0, "Invalid merged list") } func buildLists(partiallySorted bool) ([][]Result, []Result) { @@ -57,7 +58,7 @@ func TestMergerUnsorted(t *testing.T) { cnt := len(items) // Not sorted: same order - mg := NewMerger(nil, lists, false, false, 0) + mg := NewMerger(nil, lists, false, false, revision{}, 0) assert(t, cnt == mg.Length(), "Invalid Length") for i := 0; i < cnt; i++ { assert(t, items[i] == mg.Get(i), "Invalid Get") @@ -69,7 +70,7 @@ func TestMergerSorted(t *testing.T) { cnt := len(items) // Sorted sorted order - mg := NewMerger(nil, lists, true, false, 0) + mg := NewMerger(nil, lists, true, false, revision{}, 0) assert(t, cnt == mg.Length(), "Invalid Length") sort.Sort(ByRelevance(items)) for i := 0; i < cnt; i++ { @@ -79,7 +80,7 @@ func TestMergerSorted(t *testing.T) { } // Inverse order - mg2 := NewMerger(nil, lists, true, false, 0) + mg2 := NewMerger(nil, lists, true, false, revision{}, 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