ref: 75044c199f02b3aa6690d5f8e1884d6971a49246
parent: 5995eaaa08a233ca763ebe6fe81d606dc9239dc2
author: Bjørn Erik Pedersen <[email protected]>
date: Sun Feb 7 07:34:43 EST 2016
Add menu sort tests
--- a/hugolib/menu.go
+++ b/hugolib/menu.go
@@ -152,8 +152,9 @@
// Less is part of sort.Interface. It is implemented by calling the "by" closure in the sorter.
func (ms *MenuSorter) Less(i, j int) bool { return ms.by(ms.menu[i], ms.menu[j]) }-func (m Menu) Sort() {+func (m Menu) Sort() Menu {MenuEntryBy(defaultMenuEntrySort).Sort(m)
+ return m
}
func (m Menu) Limit(n int) Menu {--- a/hugolib/menu_test.go
+++ b/hugolib/menu_test.go
@@ -497,6 +497,32 @@
assert.Equal(t, m, m.Limit(5))
}
+func TestMenuSortByN(t *testing.T) {+
+ for i, this := range []struct {+ sortFunc func(p Menu) Menu
+ assertFunc func(p Menu) bool
+ }{+ {(Menu).Sort, func(p Menu) bool { return p[0].Weight == 1 && p[1].Name == "nx" && p[2].Identifier == "ib" }},+ {(Menu).ByWeight, func(p Menu) bool { return p[0].Weight == 1 && p[1].Name == "nx" && p[2].Identifier == "ib" }},+ {(Menu).ByName, func(p Menu) bool { return p[0].Name == "na" }},+ {(Menu).Reverse, func(p Menu) bool { return p[0].Identifier == "ib" && p[len(p)-1].Identifier == "ia" }},+ } {+ menu := Menu{&MenuEntry{Weight: 3, Name: "nb", Identifier: "ia"},+ &MenuEntry{Weight: 1, Name: "na", Identifier: "ic"},+ &MenuEntry{Weight: 1, Name: "nx", Identifier: "ic"},+ &MenuEntry{Weight: 2, Name: "nb", Identifier: "ix"},+ &MenuEntry{Weight: 2, Name: "nb", Identifier: "ib"}}+
+ sorted := this.sortFunc(menu)
+
+ if !this.assertFunc(sorted) {+ t.Errorf("[%d] sort error", i)+ }
+ }
+
+}
+
func TestHomeNodeMenu(t *testing.T) {viper.Reset()
defer viper.Reset()