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
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
|
require_relative '../../spec_helper'
require_relative 'fixtures/classes'
describe "Array#sort" do
it "returns a new array sorted based on comparing elements with <=>" do
a = [1, -2, 3, 9, 1, 5, -5, 1000, -5, 2, -10, 14, 6, 23, 0]
a.sort.should == [-10, -5, -5, -2, 0, 1, 1, 2, 3, 5, 6, 9, 14, 23, 1000]
end
it "does not affect the original Array" do
a = [3, 1, 2]
a.sort.should == [1, 2, 3]
a.should == [3, 1, 2]
a = [0, 15, 2, 3, 4, 6, 14, 5, 7, 12, 8, 9, 1, 10, 11, 13]
b = a.sort
a.should == [0, 15, 2, 3, 4, 6, 14, 5, 7, 12, 8, 9, 1, 10, 11, 13]
b.should == (0..15).to_a
end
it "sorts already-sorted Arrays" do
(0..15).to_a.sort.should == (0..15).to_a
end
it "sorts reverse-sorted Arrays" do
(0..15).to_a.reverse.sort.should == (0..15).to_a
end
it "sorts Arrays that consist entirely of equal elements" do
a = [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
a.sort.should == a
b = Array.new(15).map { ArraySpecs::SortSame.new }
b.sort.should == b
end
it "sorts Arrays that consist mostly of equal elements" do
a = [1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
a.sort.should == [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
end
it "does not return self even if the array would be already sorted" do
a = [1, 2, 3]
sorted = a.sort
sorted.should == a
sorted.should_not equal(a)
end
it "properly handles recursive arrays" do
empty = ArraySpecs.empty_recursive_array
empty.sort.should == empty
array = [[]]; array << array
array.sort.should == [[], array]
end
it "uses #<=> of elements in order to sort" do
a = ArraySpecs::MockForCompared.new
b = ArraySpecs::MockForCompared.new
c = ArraySpecs::MockForCompared.new
ArraySpecs::MockForCompared.should_not.compared?
[a, b, c].sort.should == [c, b, a]
ArraySpecs::MockForCompared.should.compared?
end
it "does not deal with exceptions raised by unimplemented or incorrect #<=>" do
o = Object.new
-> {
[o, 1].sort
}.should raise_error(ArgumentError)
end
it "may take a block which is used to determine the order of objects a and b described as -1, 0 or +1" do
a = [5, 1, 4, 3, 2]
a.sort.should == [1, 2, 3, 4, 5]
a.sort {|x, y| y <=> x}.should == [5, 4, 3, 2, 1]
end
it "raises an error when a given block returns nil" do
-> { [1, 2].sort {} }.should raise_error(ArgumentError)
end
it "does not call #<=> on contained objects when invoked with a block" do
a = Array.new(25)
(0...25).each {|i| a[i] = ArraySpecs::UFOSceptic.new }
a.sort { -1 }.should be_an_instance_of(Array)
end
it "does not call #<=> on elements when invoked with a block even if Array is large (Rubinius #412)" do
a = Array.new(1500)
(0...1500).each {|i| a[i] = ArraySpecs::UFOSceptic.new }
a.sort { -1 }.should be_an_instance_of(Array)
end
it "completes when supplied a block that always returns the same result" do
a = [2, 3, 5, 1, 4]
a.sort { 1 }.should be_an_instance_of(Array)
a.sort { 0 }.should be_an_instance_of(Array)
a.sort { -1 }.should be_an_instance_of(Array)
end
it "does not freezes self during being sorted" do
a = [1, 2, 3]
a.sort { |x,y| a.should_not.frozen?; x <=> y }
end
it "returns the specified value when it would break in the given block" do
[1, 2, 3].sort{ break :a }.should == :a
end
it "uses the sign of Integer block results as the sort result" do
a = [1, 2, 5, 10, 7, -4, 12]
begin
class Integer
alias old_spaceship <=>
def <=>(other)
raise
end
end
a.sort {|n, m| (n - m) * (2 ** 200)}.should == [-4, 1, 2, 5, 7, 10, 12]
ensure
class Integer
alias <=> old_spaceship
end
end
end
it "compares values returned by block with 0" do
a = [1, 2, 5, 10, 7, -4, 12]
a.sort { |n, m| n - m }.should == [-4, 1, 2, 5, 7, 10, 12]
a.sort { |n, m|
ArraySpecs::ComparableWithInteger.new(n-m)
}.should == [-4, 1, 2, 5, 7, 10, 12]
-> {
a.sort { |n, m| (n - m).to_s }
}.should raise_error(ArgumentError)
end
it "sorts an array that has a value shifted off without a block" do
a = Array.new(20, 1)
a.shift
a[0] = 2
a.sort.last.should == 2
end
it "sorts an array that has a value shifted off with a block" do
a = Array.new(20, 1)
a.shift
a[0] = 2
a.sort {|x, y| x <=> y }.last.should == 2
end
it "raises an error if objects can't be compared" do
a=[ArraySpecs::Uncomparable.new, ArraySpecs::Uncomparable.new]
-> {a.sort}.should raise_error(ArgumentError)
end
# From a strange Rubinius bug
it "handles a large array that has been pruned" do
pruned = ArraySpecs::LargeArray.dup.delete_if { |n| n !~ /^test./ }
pruned.sort.should == ArraySpecs::LargeTestArraySorted
end
it "does not return subclass instance on Array subclasses" do
ary = ArraySpecs::MyArray[1, 2, 3]
ary.sort.should be_an_instance_of(Array)
end
end
describe "Array#sort!" do
it "sorts array in place using <=>" do
a = [1, -2, 3, 9, 1, 5, -5, 1000, -5, 2, -10, 14, 6, 23, 0]
a.sort!
a.should == [-10, -5, -5, -2, 0, 1, 1, 2, 3, 5, 6, 9, 14, 23, 1000]
end
it "sorts array in place using block value if a block given" do
a = [0, 15, 2, 3, 4, 6, 14, 5, 7, 12, 8, 9, 1, 10, 11, 13]
a.sort! { |x, y| y <=> x }.should == (0..15).to_a.reverse
end
it "returns self if the order of elements changed" do
a = [6, 7, 2, 3, 7]
a.sort!.should equal(a)
a.should == [2, 3, 6, 7, 7]
end
it "returns self even if makes no modification" do
a = [1, 2, 3, 4, 5]
a.sort!.should equal(a)
a.should == [1, 2, 3, 4, 5]
end
it "properly handles recursive arrays" do
empty = ArraySpecs.empty_recursive_array
empty.sort!.should == empty
array = [[]]; array << array
array.sort!.should == array
end
it "uses #<=> of elements in order to sort" do
a = ArraySpecs::MockForCompared.new
b = ArraySpecs::MockForCompared.new
c = ArraySpecs::MockForCompared.new
ArraySpecs::MockForCompared.should_not.compared?
[a, b, c].sort!.should == [c, b, a]
ArraySpecs::MockForCompared.should.compared?
end
it "does not call #<=> on contained objects when invoked with a block" do
a = Array.new(25)
(0...25).each {|i| a[i] = ArraySpecs::UFOSceptic.new }
a.sort! { -1 }.should be_an_instance_of(Array)
end
it "does not call #<=> on elements when invoked with a block even if Array is large (Rubinius #412)" do
a = Array.new(1500)
(0...1500).each {|i| a[i] = ArraySpecs::UFOSceptic.new }
a.sort! { -1 }.should be_an_instance_of(Array)
end
it "completes when supplied a block that always returns the same result" do
a = [2, 3, 5, 1, 4]
a.sort!{ 1 }.should be_an_instance_of(Array)
a.sort!{ 0 }.should be_an_instance_of(Array)
a.sort!{ -1 }.should be_an_instance_of(Array)
end
it "raises a FrozenError on a frozen array" do
-> { ArraySpecs.frozen_array.sort! }.should raise_error(FrozenError)
end
it "returns the specified value when it would break in the given block" do
[1, 2, 3].sort{ break :a }.should == :a
end
it "makes some modification even if finished sorting when it would break in the given block" do
partially_sorted = (1..5).map{|i|
ary = [5, 4, 3, 2, 1]
ary.sort!{|x,y| break if x==i; x<=>y}
ary
}
partially_sorted.any?{|ary| ary != [1, 2, 3, 4, 5]}.should be_true
end
end
|