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
|
# Interact with count
has_unbounded_range = ((RUBY_VERSION.split(".").map(&:to_i) <=> [2,7,0]) >= 0)
source($drc_test_source, "TOP")
target($drc_test_target)
l1 = input(1, 0)
l2 = input(2, 0)
l1.output(1, 0)
l2.output(2, 0)
def split_vs_normal(r, f1, f2, *args)
d1 = r.send(f1, *args)[0].data
d2 = r.send(f2, *args).data
d1.to_s == d2.to_s || raise("#{f1.to_s} vs. #{f2.to_s} check failed: #{d1.to_s} != #{d2.to_s}")
end
def splitn_vs_normal(r, f1, f2, *args)
d1 = r.send(f1, *args)[1].data
d2 = r.send(f2, *args).data
d1.to_s == d2.to_s || raise("#{f1.to_s} vs. #{f2.to_s} check failed: #{d1.to_s} != #{d2.to_s}")
end
l1.interacting(l2, 1).output(100, 0)
l1.interacting(l2, 2).output(101, 0)
l1.interacting(l2, 1..2).output(102, 0)
if has_unbounded_range
l1.interacting(l2, eval("2..")).output(103, 0)
else
l1.interacting(l2, 2..10000).output(103, 0)
end
l1.interacting(l2, 1, 2).output(104, 0)
split_vs_normal(l1, :split_interacting, :interacting, l2, 1)
split_vs_normal(l1, :split_interacting, :interacting, l2, 2)
split_vs_normal(l1, :split_interacting, :interacting, l2, 1..2)
split_vs_normal(l1, :split_interacting, :interacting, l2, 1, 2)
l1.overlapping(l2, 1).output(110, 0)
l1.overlapping(l2, 2).output(111, 0)
l1.overlapping(l2, 1..2).output(112, 0)
if has_unbounded_range
l1.overlapping(l2, eval("2..")).output(113, 0)
else
l1.overlapping(l2, 2..10000).output(113, 0)
end
l1.overlapping(l2, 1, 2).output(114, 0)
split_vs_normal(l1, :split_overlapping, :overlapping, l2, 1)
split_vs_normal(l1, :split_overlapping, :overlapping, l2, 2)
split_vs_normal(l1, :split_overlapping, :overlapping, l2, 1..2)
split_vs_normal(l1, :split_overlapping, :overlapping, l2, 1, 2)
l = l1.dup
l.select_interacting(l2, 1)
l.output(200, 0)
l = l1.dup
l.select_interacting(l2, 2)
l.output(201, 0)
l = l1.dup
l.select_interacting(l2, 1..2)
l.output(202, 0)
l = l1.dup
if has_unbounded_range
l.select_interacting(l2, eval("2.."))
else
l.select_interacting(l2, 2..10000)
end
l.output(203, 0)
l = l1.dup
l.select_interacting(l2, 1, 2)
l.output(204, 0)
l = l1.dup
l.select_overlapping(l2, 1)
l.output(210, 0)
l = l1.dup
l.select_overlapping(l2, 2)
l.output(211, 0)
l = l1.dup
l.select_overlapping(l2, 1..2)
l.output(212, 0)
l = l1.dup
if has_unbounded_range
l.select_overlapping(l2, eval("2.."))
else
l.select_overlapping(l2, 2..10000)
end
l.output(213, 0)
l = l1.dup
l.select_overlapping(l2, 1, 2)
l.output(214, 0)
l1.not_interacting(l2, 1).output(300, 0)
l1.not_interacting(l2, 2).output(301, 0)
l1.not_interacting(l2, 1..2).output(302, 0)
if has_unbounded_range
l1.not_interacting(l2, eval("2..")).output(303, 0)
else
l1.not_interacting(l2, 2..10000).output(303, 0)
end
l1.not_interacting(l2, 1, 2).output(304, 0)
splitn_vs_normal(l1, :split_interacting, :not_interacting, l2, 1)
splitn_vs_normal(l1, :split_interacting, :not_interacting, l2, 2)
splitn_vs_normal(l1, :split_interacting, :not_interacting, l2, 1..2)
splitn_vs_normal(l1, :split_interacting, :not_interacting, l2, 1, 2)
l1.not_overlapping(l2, 1).output(310, 0)
l1.not_overlapping(l2, 2).output(311, 0)
l1.not_overlapping(l2, 1..2).output(312, 0)
if has_unbounded_range
l1.not_overlapping(l2, eval("2..")).output(313, 0)
else
l1.not_overlapping(l2, 2..10000).output(313, 0)
end
l1.not_overlapping(l2, 1, 2).output(314, 0)
splitn_vs_normal(l1, :split_overlapping, :not_overlapping, l2, 1)
splitn_vs_normal(l1, :split_overlapping, :not_overlapping, l2, 2)
splitn_vs_normal(l1, :split_overlapping, :not_overlapping, l2, 1..2)
splitn_vs_normal(l1, :split_overlapping, :not_overlapping, l2, 1, 2)
l = l1.dup
l.select_not_interacting(l2, 1)
l.output(400, 0)
l = l1.dup
l.select_not_interacting(l2, 2)
l.output(401, 0)
l = l1.dup
l.select_not_interacting(l2, 1..2)
l.output(402, 0)
l = l1.dup
if has_unbounded_range
l.select_not_interacting(l2, eval("2.."))
else
l.select_not_interacting(l2, 2..10000)
end
l.output(403, 0)
l = l1.dup
l.select_not_interacting(l2, 1, 2)
l.output(404, 0)
l = l1.dup
l.select_not_overlapping(l2, 1)
l.output(410, 0)
l = l1.dup
l.select_not_overlapping(l2, 2)
l.output(411, 0)
l = l1.dup
l.select_not_overlapping(l2, 1..2)
l.output(412, 0)
l = l1.dup
if has_unbounded_range
l.select_not_overlapping(l2, eval("2.."))
else
l.select_not_overlapping(l2, 2..10000)
end
l.output(413, 0)
l = l1.dup
l.select_not_overlapping(l2, 1, 2)
l.output(414, 0)
|