-
Notifications
You must be signed in to change notification settings - Fork 0
/
reverse_range_spec.rb
217 lines (180 loc) · 5.95 KB
/
reverse_range_spec.rb
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
$LOAD_PATH.unshift File.dirname(__FILE__) + "/../lib"
require "quix/reverse_range"
require "spec/autorun"
if RUBY_VERSION < "1.8.7"
require 'enumerator'
class Integer
def pred
self - 1
end
end
end
ReverseRange = Quix::ReverseRange
######################################################################
# common
######################################################################
def check_expression(&block)
statement = block.call
eval(
statement.
sub("==", ".should==").
sub("!=", ".should_not=="),
block.binding)
end
def equation(statement)
unless match = statement.match(%r!\A\s*(.*?)\s*==\s*(.*?)\s*\Z!)
raise
end
it "#{match[1]} #=> #{match[2]}" do |t|
check_expression { statement }
end
end
def it_has_invariant(inv)
it "has invariant #{inv}" do |t|
r = @range
check_expression { inv }
end
end
######################################################################
# description
######################################################################
describe "Synopsis" do
equation "(3..7).to_a == [3, 4, 5, 6, 7]"
equation "(7..3).to_a == []"
equation "reversible(3..7).to_a == [3, 4, 5, 6, 7]"
equation "reversible(7..3).to_a == [7, 6, 5, 4, 3]"
end
describe "A forward-pointing Range (3..7) with r.exclude_end? == false" do
before :all do
@range = 3..7
end
it_has_invariant "reversible(r) == r"
it_has_invariant "reversible(r).object_id == r.object_id"
end
describe "A backward-pointing Range (7..3) with r.exclude_end? == false" do
before :all do
@range = 7..3
end
it_has_invariant "reversible(r) == ReverseRange.new(r.begin, r.end)"
end
describe "A forward-pointing Range (3...7) with r.exclude_end? == true" do
before :all do
@range = 3...7
end
it "is accepted by reversible()" do
lambda { reversible(@range) }.should_not raise_error
end
end
describe "A backward-pointing Range (7...3) with r.exclude_end? == true" do
before :all do
@range = 7...3
end
it "is rejected by reversible()" do
lambda { reversible(@range) }.should raise_error(ArgumentError)
end
end
describe "ReverseRange" do
before :all do
@range = ReverseRange.new(7, 3)
end
describe "instances are normally created with reversible()" do
equation "reversible(7..3) == ReverseRange.new(7, 3)"
end
describe "behaves similarly to Range" do
equation "reversible(7..3).inspect == '#<ReverseRange 7..3>'"
equation "reversible(7..3).first == 7"
equation "reversible(7..3).last == 3"
equation "reversible(7..3).include?(9) == false"
equation "reversible(7..3).member?(4) == true"
equation "reversible(7..3).include?(4) == true"
equation "(7..3).include?(4) == false"
it "has the same case/when semantics as Range" do
inside = lambda { |i|
@range === i
}
outside = lambda { |i|
!(@range === i)
}
@range.begin.downto(@range.end, &inside)
100.downto(@range.begin + 1, &outside)
0.upto(@range.end - 1, &outside)
end
end
describe "can also be passed to reversible()" do
equation "ReverseRange.new(3, 7).to_a == []"
equation "reversible(ReverseRange.new(3, 7)).to_a == [3, 4, 5, 6, 7]"
equation "reversible(ReverseRange.new(3, 7)).is_a?(Range) == true"
equation "reversible(ReverseRange.new(7, 3)).is_a?(ReverseRange) == true"
end
describe "#step(n)" do
it "argument n must be negative" do
lambda { @range.step(-4) { } }.should_not raise_error
lambda { @range.step(0) { } }.should raise_error(ArgumentError)
lambda { @range.step(4) { } }.should raise_error(ArgumentError)
end
equation "reversible(7..3).to_enum(:step, -1).to_a == [7, 6, 5, 4, 3]"
equation "reversible(7..3).to_enum(:step, -2).to_a == [7, 5, 3]"
equation "reversible(7..3).to_enum(:step, -3).to_a == [7, 4]"
equation "reversible(7..3).to_enum(:step, -4).to_a == [7, 3]"
equation "reversible(7..3).to_enum(:step, -5).to_a == [7]"
equation "reversible(7..3).to_enum(:step, -99).to_a == [7]"
describe "with simple one-character String#pred" do
before(:each) do
String.class_eval {
def pred
if RUBY_VERSION < "1.9.0"
self[0].pred.chr
else
self[0].ord.pred.chr
end
end
}
end
after(:each) do
String.class_eval {
remove_method :pred
}
end
equation "reversible('t'..'p').to_enum(:step, -1).to_a == %w[t s r q p]"
equation "reversible('t'..'p').to_enum(:step, -2).to_a == %w[t r p]"
equation "reversible('t'..'p').to_enum(:step, -3).to_a == %w[t q]"
equation "reversible('t'..'p').to_enum(:step, -4).to_a == %w[t p]"
equation "reversible('t'..'p').to_enum(:step, -5).to_a == %w[t]"
equation "reversible('t'..'p').to_enum(:step, -99).to_a == %w[t]"
end
end
describe "details" do
it_has_invariant "r == r"
it_has_invariant "r == ReverseRange.new(r.begin, r.end)"
it_has_invariant "r.eql?(r) == true"
it_has_invariant "r.eql?(ReverseRange.new(r.begin, r.end)) == true"
it_has_invariant "r.exclude_end? == false"
it_has_invariant "r.inspect == r.to_s"
it "calls #pred on elements" do
1.should == 1
end
it "leaves #pred definition to the user" do
lambda { reversible("z".."a").to_a }.
should raise_error(NoMethodError)
end
end
end
describe "reversible()" do
it "accepts Range object" do
lambda { reversible(3..7) }.should_not raise_error
end
it "accepts Range-quacking object" do
mock = Class.new {
def begin ; 2 ; end
def end ; 1 ; end
def exclude_end? ; false ; end
}.new
lambda { reversible(mock) }.should_not raise_error
end
it "fails if argument does not quack like Range" do
lambda { reversible(1) }.should raise_error
lambda { reversible(1, 2) }.should raise_error
lambda { reversible("foo") }.should raise_error
lambda { reversible(Object.new) }.should raise_error
end
end