1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
|
// Copyright 2016 Canonical Ltd.
// Licensed under the LGPLv3, see LICENCE file for details.
package utils_test
import (
"math/rand"
gc "gopkg.in/check.v1"
"github.com/juju/testing"
"github.com/juju/utils"
)
type naturalSortSuite struct {
testing.IsolationSuite
}
var _ = gc.Suite(&naturalSortSuite{})
func (s *naturalSortSuite) TestEmpty(c *gc.C) {
checkCorrectSort(c, []string{})
}
func (s *naturalSortSuite) TestAlpha(c *gc.C) {
checkCorrectSort(c, []string{"abc", "bac", "cba"})
}
func (s *naturalSortSuite) TestNumVsString(c *gc.C) {
checkCorrectSort(c, []string{"1", "a"})
}
func (s *naturalSortSuite) TestStringVsStringNum(c *gc.C) {
checkCorrectSort(c, []string{"a", "a1"})
}
func (s *naturalSortSuite) TestCommonPrefix(c *gc.C) {
checkCorrectSort(c, []string{"a1", "a1a", "a1b", "a2b", "a2c"})
}
func (s *naturalSortSuite) TestDifferentNumberLengths(c *gc.C) {
checkCorrectSort(c, []string{"a1a", "a2", "a22a", "a333", "a333a", "a333b"})
}
func (s *naturalSortSuite) TestZeroPadding(c *gc.C) {
checkCorrectSort(c, []string{"a1", "a002", "a3"})
}
func (s *naturalSortSuite) TestMixed(c *gc.C) {
checkCorrectSort(c, []string{"1a", "a1", "a1/1", "a10", "a100"})
}
func (s *naturalSortSuite) TestSeveralNumericParts(c *gc.C) {
checkCorrectSort(c, []string{
"x",
"x1",
"x1-g0",
"x1-g1",
"x1-g2",
"x1-g10",
"x2",
"x2-g0",
"x2-g2",
"x11-g0",
"x11-g0-0",
"x11-g0-1",
"x11-g0-10",
"x11-g0-11",
"x11-g0-20",
"x11-g0-100",
"x11-g10-1",
"x11-g10-10",
"xx1",
"xx10",
})
}
func (s *naturalSortSuite) TestUnitNameLike(c *gc.C) {
checkCorrectSort(c, []string{"a1/1", "a1/2", "a1/7", "a1/11", "a1/100"})
}
func (s *naturalSortSuite) TestMachineIdLike(c *gc.C) {
checkCorrectSort(c, []string{
"1",
"1/lxc/0",
"1/lxc/1",
"1/lxc/2",
"1/lxc/10",
"1/lxd/0",
"1/lxd/1",
"1/lxd/10",
"2",
"11",
"11/lxc/6",
"11/lxc/60",
"20",
"21",
})
}
func (s *naturalSortSuite) TestIPs(c *gc.C) {
checkCorrectSort(c, []string{
"1.1.10.122",
"001.001.010.123",
"001.002.010.123",
"100.001.010.123",
"100.1.10.124",
"100.2.10.124",
})
}
func checkCorrectSort(c *gc.C, expected []string) {
checkSort(c, expected, reverse)
for i := 0; i < 5; i++ {
checkSort(c, expected, shuffle)
}
}
func checkSort(c *gc.C, expected []string, xform func([]string)) {
input := copyStrSlice(expected)
xform(input)
origInput := copyStrSlice(input)
utils.SortStringsNaturally(input)
c.Check(input, gc.DeepEquals, expected, gc.Commentf("input was: %#v", origInput))
}
func copyStrSlice(in []string) []string {
out := make([]string, len(in))
copy(out, in)
return out
}
func shuffle(a []string) {
// See https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle#Modern_method
for i := len(a) - 1; i >= 1; i-- {
j := rand.Intn(i + 1)
a[i], a[j] = a[j], a[i]
}
}
func reverse(a []string) {
size := len(a)
for i := 0; i < size/2; i++ {
j := size - i - 1
a[i], a[j] = a[j], a[i]
}
}
|
