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 253 254 255 256
|
# frozen_string_literal: true
module Arel # :nodoc: all
module Predications
def not_eq(other)
Nodes::NotEqual.new self, quoted_node(other)
end
def not_eq_any(others)
grouping_any :not_eq, others
end
def not_eq_all(others)
grouping_all :not_eq, others
end
def eq(other)
Nodes::Equality.new self, quoted_node(other)
end
def is_not_distinct_from(other)
Nodes::IsNotDistinctFrom.new self, quoted_node(other)
end
def is_distinct_from(other)
Nodes::IsDistinctFrom.new self, quoted_node(other)
end
def eq_any(others)
grouping_any :eq, others
end
def eq_all(others)
grouping_all :eq, quoted_array(others)
end
def between(other)
if unboundable?(other.begin) == 1 || unboundable?(other.end) == -1
self.in([])
elsif open_ended?(other.begin)
if open_ended?(other.end)
not_in([])
elsif other.exclude_end?
lt(other.end)
else
lteq(other.end)
end
elsif open_ended?(other.end)
gteq(other.begin)
elsif other.exclude_end?
gteq(other.begin).and(lt(other.end))
else
left = quoted_node(other.begin)
right = quoted_node(other.end)
Nodes::Between.new(self, left.and(right))
end
end
def in(other)
case other
when Arel::SelectManager
Arel::Nodes::In.new(self, other.ast)
when Range
if $VERBOSE
warn <<-eowarn
Passing a range to `#in` is deprecated. Call `#between`, instead.
eowarn
end
between(other)
when Enumerable
Nodes::In.new self, quoted_array(other)
else
Nodes::In.new self, quoted_node(other)
end
end
def in_any(others)
grouping_any :in, others
end
def in_all(others)
grouping_all :in, others
end
def not_between(other)
if unboundable?(other.begin) == 1 || unboundable?(other.end) == -1
not_in([])
elsif open_ended?(other.begin)
if open_ended?(other.end)
self.in([])
elsif other.exclude_end?
gteq(other.end)
else
gt(other.end)
end
elsif open_ended?(other.end)
lt(other.begin)
else
left = lt(other.begin)
right = if other.exclude_end?
gteq(other.end)
else
gt(other.end)
end
left.or(right)
end
end
def not_in(other)
case other
when Arel::SelectManager
Arel::Nodes::NotIn.new(self, other.ast)
when Range
if $VERBOSE
warn <<-eowarn
Passing a range to `#not_in` is deprecated. Call `#not_between`, instead.
eowarn
end
not_between(other)
when Enumerable
Nodes::NotIn.new self, quoted_array(other)
else
Nodes::NotIn.new self, quoted_node(other)
end
end
def not_in_any(others)
grouping_any :not_in, others
end
def not_in_all(others)
grouping_all :not_in, others
end
def matches(other, escape = nil, case_sensitive = false)
Nodes::Matches.new self, quoted_node(other), escape, case_sensitive
end
def matches_regexp(other, case_sensitive = true)
Nodes::Regexp.new self, quoted_node(other), case_sensitive
end
def matches_any(others, escape = nil, case_sensitive = false)
grouping_any :matches, others, escape, case_sensitive
end
def matches_all(others, escape = nil, case_sensitive = false)
grouping_all :matches, others, escape, case_sensitive
end
def does_not_match(other, escape = nil, case_sensitive = false)
Nodes::DoesNotMatch.new self, quoted_node(other), escape, case_sensitive
end
def does_not_match_regexp(other, case_sensitive = true)
Nodes::NotRegexp.new self, quoted_node(other), case_sensitive
end
def does_not_match_any(others, escape = nil)
grouping_any :does_not_match, others, escape
end
def does_not_match_all(others, escape = nil)
grouping_all :does_not_match, others, escape
end
def gteq(right)
Nodes::GreaterThanOrEqual.new self, quoted_node(right)
end
def gteq_any(others)
grouping_any :gteq, others
end
def gteq_all(others)
grouping_all :gteq, others
end
def gt(right)
Nodes::GreaterThan.new self, quoted_node(right)
end
def gt_any(others)
grouping_any :gt, others
end
def gt_all(others)
grouping_all :gt, others
end
def lt(right)
Nodes::LessThan.new self, quoted_node(right)
end
def lt_any(others)
grouping_any :lt, others
end
def lt_all(others)
grouping_all :lt, others
end
def lteq(right)
Nodes::LessThanOrEqual.new self, quoted_node(right)
end
def lteq_any(others)
grouping_any :lteq, others
end
def lteq_all(others)
grouping_all :lteq, others
end
def when(right)
Nodes::Case.new(self).when quoted_node(right)
end
def concat(other)
Nodes::Concat.new self, other
end
private
def grouping_any(method_id, others, *extras)
nodes = others.map { |expr| send(method_id, expr, *extras) }
Nodes::Grouping.new nodes.inject { |memo, node|
Nodes::Or.new(memo, node)
}
end
def grouping_all(method_id, others, *extras)
nodes = others.map { |expr| send(method_id, expr, *extras) }
Nodes::Grouping.new Nodes::And.new(nodes)
end
def quoted_node(other)
Nodes.build_quoted(other, self)
end
def quoted_array(others)
others.map { |v| quoted_node(v) }
end
def infinity?(value)
value.respond_to?(:infinite?) && value.infinite?
end
def unboundable?(value)
value.respond_to?(:unboundable?) && value.unboundable?
end
def open_ended?(value)
value.nil? || infinity?(value) || unboundable?(value)
end
end
end
|