diff options
| author | Junegunn Choi <junegunn.c@gmail.com> | 2025-07-06 22:02:12 +0900 |
|---|---|---|
| committer | Junegunn Choi <junegunn.c@gmail.com> | 2025-07-06 22:02:12 +0900 |
| commit | 82c9671f79c4673b0253db54533e6910f96a92a1 (patch) | |
| tree | fac736ee0d72a8007db35662ddbaf6be3b6e259a /src/merger_test.go | |
| parent | d364a1122e23149a6fb2e060fe5f7a0dbb752b20 (diff) | |
| download | fzf-82c9671f79c4673b0253db54533e6910f96a92a1.tar.gz | |
Fix selection lost on revision bump
Diffstat (limited to 'src/merger_test.go')
| -rw-r--r-- | src/merger_test.go | 6 |
1 files changed, 3 insertions, 3 deletions
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)) |