func BenchmarkStringLess(b *testing.B) {
set := testSet(300)
b.ResetTimer()
for i := 0; i < b.N; i++ {
for j := range set[0] {
k := (j + 1) % len(set[0])
_ = handysort.StringLess(set[0][j], set[0][k])
}
}
}
func TestNaturalLess(t *testing.T) {
testset := []struct {
s1, s2 string
less bool
}{
{"0", "00", true},
{"00", "0", false},
{"aa", "ab", true},
{"ab", "abc", true},
{"abc", "ad", true},
{"ab1", "ab2", true},
{"ab1c", "ab1c", false},
{"ab12", "abc", true},
{"ab2a", "ab10", true},
{"a0001", "a0000001", true},
{"a10", "abcdefgh2", true},
{"аб2аб", "аб10аб", true},
{"2аб", "3аб", true},
//
{"a1b", "a01b", true},
{"a01b", "a1b", false},
{"ab01b", "ab010b", true},
{"ab010b", "ab01b", false},
{"a01b001", "a001b01", true},
{"a001b01", "a01b001", false},
{"a1", "a1x", true},
{"1ax", "1b", true},
{"1b", "1ax", false},
//
{"082", "83", true},
//
{"083a", "9a", false},
{"9a", "083a", true},
}
for _, v := range testset {
if res := NaturalLess(v.s1, v.s2); res != v.less {
t.Errorf("Compared %#q to %#q: expected %v, got %v",
v.s1, v.s2, v.less, res)
}
if res := handysort.StringLess(v.s1, v.s2); res != v.less {
t.Logf("handysort: Compared %#q to %#q: expected %v, got %v",
v.s1, v.s2, v.less, res)
}
}
}
func TestEquivalenceToXlabStringLess(t *testing.T) {
t.Skip("Skipping equivalence test due to bug in handysort")
if !*testEquivalence {
t.Skip("Skipping exhaustive test with -short")
}
set := testSet(300)
for _, list := range set[:1] {
list = list[:100]
for _, lhs := range list {
for _, rhs := range list {
nl := NaturalLess(lhs, rhs)
sl := handysort.StringLess(lhs, rhs)
if nl != sl {
t.Errorf("difference to handysort: %v vs %v for %#q < %#q", nl, sl, lhs, rhs)
}
}
}
}
}