summaryrefslogtreecommitdiffstats
path: root/src/merger_test.go
diff options
context:
space:
mode:
authorJunegunn Choi <junegunn.c@gmail.com>2015-01-10 14:24:12 +0900
committerJunegunn Choi <junegunn.c@gmail.com>2015-01-10 14:24:12 +0900
commit6e86fee588bdcd769501ab671fa21a8e8e2de828 (patch)
treee492b23eb7dbd339d8dee44214f1603df3f0defc /src/merger_test.go
parent2d9b38b93eb16b341e91ec5d8eaaa9898f1d68f6 (diff)
Change Merger implementation on --no-sort
Diffstat (limited to 'src/merger_test.go')
-rw-r--r--src/merger_test.go5
1 files changed, 4 insertions, 1 deletions
diff --git a/src/merger_test.go b/src/merger_test.go
index 19941b17..32a1228a 100644
--- a/src/merger_test.go
+++ b/src/merger_test.go
@@ -19,6 +19,9 @@ func randItem() *Item {
func TestEmptyMerger(t *testing.T) {
assert(t, EmptyMerger.Length() == 0, "Not empty")
+ assert(t, EmptyMerger.count == 0, "Invalid count")
+ assert(t, len(EmptyMerger.lists) == 0, "Invalid lists")
+ assert(t, len(EmptyMerger.merged) == 0, "Invalid merged list")
}
func buildLists(partiallySorted bool) ([][]*Item, []*Item) {
@@ -72,7 +75,7 @@ func TestMergerSorted(t *testing.T) {
// Inverse order
mg2 := NewMerger(lists, true)
- for i := cnt - 1; i >= cnt; i-- {
+ for i := cnt - 1; i >= 0; i-- {
if items[i] != mg2.Get(i) {
t.Error("Not sorted", items[i], mg2.Get(i))
}