Class: Properb::Generators::ArrayGenerator
Instance Method Summary
collapse
#map, #or, #reject, #select, #sized, #to_properb_generator
Constructor Details
#initialize(generator, length: 0) ⇒ ArrayGenerator
4
5
6
7
|
# File 'lib/properb/generators/array_generator.rb', line 4
def initialize(generator, length: 0...)
@generator = generator
@length = length
end
|
Instance Method Details
#generate_value(random, size) ⇒ Object
9
10
11
12
13
14
15
16
17
18
19
20
21
|
# File 'lib/properb/generators/array_generator.rb', line 9
def generate_value(random, size)
if @length.is_a?(Range)
length = random.random_number(@length.min..(@length.end || (@length.min + size)))
min_length = @length.min
else
length = min_length = @length
end
values = (0...length).map { @generator.generate_value(random, size) }
ShrinkTree.new(
values.map(&:value),
shrink(values, min_length)
)
end
|
#shrink(values, min_length) ⇒ Object
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
|
# File 'lib/properb/generators/array_generator.rb', line 23
def shrink(values, min_length)
Enumerator.new do |out|
cutoff = (values.length / 2).ceil
if cutoff > min_length
out << ShrinkTree.new(
values[cutoff..].map(&:value),
shrink(values[cutoff..], min_length)
)
out << ShrinkTree.new(
values[...-cutoff].map(&:value),
shrink(values[...-cutoff], min_length)
)
end
if values.length > min_length
(0...values.length).each do |i|
new_values = values[0...i] + values[i + 1...]
out << ShrinkTree.new(
new_values.map(&:value),
shrink(new_values, min_length)
)
end
end
(0...values.length).each do |i|
values[i].children.each do |value|
new_values = values[0...i] + [value] + values[i + 1...]
out << ShrinkTree.new(
new_values.map(&:value),
shrink(new_values, min_length)
)
end
end
(0...values.length).each do |i| values[i].children.each do |first_value|
new_values = values[0...i] + [first_value] + values[i + 1...]
(0...values.length).each do |j|
new_values[j].children.each do |second_value|
newer_values = new_values[0...j] + [second_value] + new_values[j + 1...]
out << ShrinkTree.new(
newer_values.map(&:value),
shrink(newer_values, min_length)
)
end
end
end
end
end
end
|