hugo/compare/compare_strings_test.go

// Copyright 2019 The Hugo Authors. All rights reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

package compare

import (
	"sort"
	"strings"
	"testing"

	qt "github.com/frankban/quicktest"
)

func TestCompare(t *testing.T) {
	c := qt.New(t)
	for _, test := range []struct {
		a string
		b string
	}{
		{"a", "a"},
		{"A", "a"},
		{"Ab", "Ac"},
		{"az", "Za"},
		{"C", "D"},
		{"B", "a"},
		{"C", ""},
		{"", ""},
		{"αβδC", "ΑΒΔD"},
		{"αβδC", "ΑΒΔ"},
		{"αβδ", "ΑΒΔD"},
		{"αβδ", "ΑΒΔ"},
		{"β", "δ"},
		{"好", strings.ToLower("好")},
	} {

		expect := strings.Compare(strings.ToLower(test.a), strings.ToLower(test.b))
		got := compareFold(test.a, test.b)

		c.Assert(got, qt.Equals, expect)

	}
}

func TestLexicographicSort(t *testing.T) {
	c := qt.New(t)

	s := []string{"b", "Bz", "ba", "A", "Ba", "ba"}

	sort.Slice(s, func(i, j int) bool {
		return LessStrings(s[i], s[j])
	})

	c.Assert(s, qt.DeepEquals, []string{"A", "b", "Ba", "ba", "ba", "Bz"})
}

func BenchmarkStringSort(b *testing.B) {
	prototype := []string{"b", "Bz", "zz", "ba", "αβδ αβδ αβδ", "A", "Ba", "ba", "nnnnasdfnnn", "AAgæåz", "αβδC"}
	b.Run("LessStrings", func(b *testing.B) {
		ss := make([][]string, b.N)
		for i := 0; i < b.N; i++ {
			ss[i] = make([]string, len(prototype))
			copy(ss[i], prototype)
		}
		b.ResetTimer()
		for i := 0; i < b.N; i++ {
			sss := ss[i]
			sort.Slice(sss, func(i, j int) bool {
				return LessStrings(sss[i], sss[j])
			})
		}
	})

}