-
-
Notifications
You must be signed in to change notification settings - Fork 5.5k
/
sorting.jl
217 lines (188 loc) · 6.33 KB
/
sorting.jl
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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
@test sort([2,3,1]) == [1,2,3]
@test sort([2,3,1], rev=true) == [3,2,1]
@test sortperm([2,3,1]) == [3,1,2]
@test !issorted([2,3,1])
@test issorted([1,2,3])
@test reverse([2,3,1]) == [1,3,2]
@test select([3,6,30,1,9],3) == 6
@test select([3,6,30,1,9],3:4) == [6,9]
@test sum(randperm(6)) == 21
@test nthperm([0,1,2],3) == [1,0,2]
@test searchsortedfirst([1, 1, 2, 2, 3, 3], 0) == 1
@test searchsortedfirst([1, 1, 2, 2, 3, 3], 1) == 1
@test searchsortedfirst([1, 1, 2, 2, 3, 3], 2) == 3
@test searchsortedfirst([1, 1, 2, 2, 3, 3], 4) == 7
@test searchsortedfirst([1.0, 1, 2, 2, 3, 3], 2.5) == 5
@test searchsortedlast([1, 1, 2, 2, 3, 3], 0) == 0
@test searchsortedlast([1, 1, 2, 2, 3, 3], 1) == 2
@test searchsortedlast([1, 1, 2, 2, 3, 3], 2) == 4
@test searchsortedlast([1, 1, 2, 2, 3, 3], 4) == 6
@test searchsortedlast([1.0, 1, 2, 2, 3, 3], 2.5) == 4
@test searchsorted([1, 1, 2, 2, 3, 3], 0) == 1:0
@test searchsorted([1, 1, 2, 2, 3, 3], 1) == 1:2
@test searchsorted([1, 1, 2, 2, 3, 3], 2) == 3:4
@test searchsorted([1, 1, 2, 2, 3, 3], 4) == 7:6
@test searchsorted([1.0, 1, 2, 2, 3, 3], 2.5) == 5:4
rg = 49:57; rgv = [rg]
rg_r = 57:-1:49; rgv_r = [rg_r]
for i = 47:59
@test searchsortedfirst(rg, i) == searchsortedfirst(rgv, i)
@test searchsortedlast(rg, i) == searchsortedlast(rgv, i)
@test searchsortedfirst(rg_r, i, rev=true) ==
searchsortedfirst(rgv_r, i, rev=true)
@test searchsortedlast(rg_r, i, rev=true) ==
searchsortedlast(rgv_r, i, rev=true)
end
rg = 1:2:17; rgv = [rg]
rg_r = 17:-2:1; rgv_r = [rg_r]
for i = -1:19
@test searchsortedfirst(rg, i) == searchsortedfirst(rgv, i)
@test searchsortedlast(rg, i) == searchsortedlast(rgv, i)
@test searchsortedfirst(rg_r, i, rev=true) ==
searchsortedfirst(rgv_r, i, rev=true)
@test searchsortedlast(rg_r, i, rev=true) ==
searchsortedlast(rgv_r, i, rev=true)
end
rg = -3:0.5:2; rgv = [rg]
rg_r = 2:-0.5:-3; rgv_r = [rg_r]
for i = -5:.5:4
@test searchsortedfirst(rg, i) == searchsortedfirst(rgv, i)
@test searchsortedlast(rg, i) == searchsortedlast(rgv, i)
@test searchsortedfirst(rg_r, i, rev=true) ==
searchsortedfirst(rgv_r, i, rev=true)
@test searchsortedlast(rg_r, i, rev=true) ==
searchsortedlast(rgv_r, i, rev=true)
end
rg = 3+0*(1:5); rgv = [rg]
rg_r = rg; rgv_r = [rg_r]
for i = 2:4
@test searchsortedfirst(rg, i) == searchsortedfirst(rgv, i)
@test searchsortedlast(rg, i) == searchsortedlast(rgv, i)
@test searchsortedfirst(rg_r, i, rev=true) ==
searchsortedfirst(rgv_r, i, rev=true)
@test searchsortedlast(rg_r, i, rev=true) ==
searchsortedlast(rgv_r, i, rev=true)
end
rg = 0.0:0.01:1.0
for i = 2:101
@test searchsortedfirst(rg, rg[i]) == i
@test searchsortedfirst(rg, prevfloat(rg[i])) == i
@test searchsortedfirst(rg, nextfloat(rg[i])) == i+1
@test searchsortedlast(rg, rg[i]) == i
@test searchsortedlast(rg, prevfloat(rg[i])) == i-1
@test searchsortedlast(rg, nextfloat(rg[i])) == i
end
rg_r = reverse(rg)
for i = 1:100
@test searchsortedfirst(rg_r, rg_r[i], rev=true) == i
@test searchsortedfirst(rg_r, prevfloat(rg_r[i]), rev=true) == i+1
@test searchsortedfirst(rg_r, nextfloat(rg_r[i]), rev=true) == i
@test searchsortedlast(rg_r, rg_r[i], rev=true) == i
@test searchsortedlast(rg_r, prevfloat(rg_r[i]), rev=true) == i
@test searchsortedlast(rg_r, nextfloat(rg_r[i]), rev=true) == i-1
end
a = rand(1:10000, 1000)
for alg in [InsertionSort, MergeSort, TimSort]
b = sort(a, alg=alg)
@test issorted(b)
ix = sortperm(a, alg=alg)
b = a[ix]
@test issorted(b)
@test a[ix] == b
b = sort(a, alg=alg, rev=true)
@test issorted(b, rev=true)
ix = sortperm(a, alg=alg, rev=true)
b = a[ix]
@test issorted(b, rev=true)
@test a[ix] == b
b = sort(a, alg=alg, by=x->1/x)
@test issorted(b, by=x->1/x)
ix = sortperm(a, alg=alg, by=x->1/x)
b = a[ix]
@test issorted(b, by=x->1/x)
@test a[ix] == b
c = copy(a)
permute!(c, ix)
@test c == b
ipermute!(c, ix)
@test c == a
c = sort(a, alg=alg, lt=(>))
@test b == c
c = sort(a, alg=alg, by=x->1/x)
@test b == c
end
b = sort(a, alg=QuickSort)
@test issorted(b)
b = sort(a, alg=QuickSort, rev=true)
@test issorted(b, rev=true)
b = sort(a, alg=QuickSort, by=x->1/x)
@test issorted(b, by=x->1/x)
@test select([3,6,30,1,9], 2, rev=true) == 9
@test select([3,6,30,1,9], 2, by=x->1/x) == 9
## more advanced sorting tests ##
randnans(n) = reinterpret(Float64,[rand(Uint64)|0x7ff8000000000000 for i=1:n])
function randn_with_nans(n,p)
v = randn(n)
x = find(rand(n).<p)
v[x] = randnans(length(x))
return v
end
srand(0xdeadbeef)
for n in [0:10, 100, 1000]
r = 1:10
v = rand(1:10,n)
h = hist(v,r)
for ord in [Sort.Forward, Sort.Reverse]
# insersion sort as a reference
pi = sortperm(v, alg=InsertionSort, order=ord)
@test isperm(pi)
s = v[pi]
@test issorted(s, order=ord)
@test hist(s,r) == h
@test all(issorted,[pi[s.==i] for i in r])
si = copy(v)
permute!(si, pi)
@test si == s
ipermute!(si, pi)
@test si == v
# mergesort
pm = sortperm(v, alg=MergeSort, order=ord)
@test pi == pm
sm = copy(v)
permute!(sm, pm)
@test sm == s
ipermute!(sm, pm)
@test sm == v
# timsort
pt = sortperm(v, alg=TimSort, order=ord)
@test pi == pt
st = copy(v)
permute!(st, pt)
@test st == s
ipermute!(st, pt)
@test st == v
# quicksort (unstable)
pq = sortperm(v, alg=QuickSort, order=ord)
@test isperm(pi)
@test v[pq] == s
sq = copy(v)
permute!(sq, pq)
@test sq == s
ipermute!(sq, pq)
@test sq == v
end
v = randn_with_nans(n,0.1)
for ord in [Sort.Forward, Sort.Reverse],
alg in [InsertionSort, QuickSort, MergeSort, TimSort]
# test float sorting with NaNs
s = sort(v, alg=alg, order=ord)
@test issorted(s, order=ord)
@test reinterpret(Uint64,v[isnan(v)]) == reinterpret(Uint64,s[isnan(s)])
# test float permutation with NaNs
p = sortperm(v, alg=alg, order=ord)
@test isperm(p)
vp = v[p]
@test isequal(vp,s)
@test reinterpret(Uint64,vp) == reinterpret(Uint64,s)
end
end