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
|
module Arel
module Predicates
class Predicate < Struct.new(:children)
def or(other_predicate)
Or.new(self, other_predicate)
end
def and(other_predicate)
And.new(self, other_predicate)
end
def complement
Not.new(self)
end
def not
self.complement
end
def == other
super || (self.class === other && children == other.children)
end
end
class Polyadic < Predicate
alias :predicates :children
def initialize(*predicates)
super(predicates)
end
# Build a Polyadic predicate based on:
# * <tt>operator</tt> - The Predicate subclass that defines the type of operation
# (LessThan, Equality, etc)
# * <tt>operand1</tt> - The left-hand operand (normally an Arel::Attribute)
# * <tt>additional_operands</tt> - All possible right-hand operands
def self.build(operator, operand1, *additional_operands)
new(
*additional_operands.uniq.inject([]) do |predicates, operand|
predicates << operator.new(operand1, operand)
end
)
end
def bind(relation)
self.class.new(
*predicates.map {|p| p.find_correlate_in(relation)}
)
end
end
class Any < Polyadic
def complement
All.new(*predicates.map {|p| p.complement})
end
end
class All < Polyadic
def complement
Any.new(*predicates.map {|p| p.complement})
end
end
class Unary < Predicate
alias :operand :children
def bind(relation)
self.class.new(operand.find_correlate_in(relation))
end
end
class Not < Unary
def complement
operand
end
end
class Binary < Predicate
alias :operand1 :children
attr_reader :operand2
def initialize left, right
super(left)
@operand2 = right
end
def ==(other)
super && @operand2 == other.operand2
end
def bind(relation)
self.class.new(operand1.find_correlate_in(relation), operand2.find_correlate_in(relation))
end
end
class CompoundPredicate < Binary; end
class And < CompoundPredicate
def complement
Or.new(operand1.complement, operand2.complement)
end
end
class Or < CompoundPredicate
def complement
And.new(operand1.complement, operand2.complement)
end
end
class Equality < Binary
def ==(other)
self.class === other and
((operand1 == other.operand1 and operand2 == other.operand2) or
(operand1 == other.operand2 and operand2 == other.operand1))
end
def complement
Inequality.new(operand1, operand2)
end
end
class Inequality < Equality
def complement
Equality.new(operand1, operand2)
end
end
class GreaterThanOrEqualTo < Binary
def complement
LessThan.new(operand1, operand2)
end
end
class GreaterThan < Binary
def complement
LessThanOrEqualTo.new(operand1, operand2)
end
end
class LessThanOrEqualTo < Binary
def complement
GreaterThan.new(operand1, operand2)
end
end
class LessThan < Binary
def complement
GreaterThanOrEqualTo.new(operand1, operand2)
end
end
class Match < Binary
def complement
NotMatch.new(operand1, operand2)
end
end
class NotMatch < Binary
def complement
Match.new(operand1, operand2)
end
end
class In < Binary
def complement
NotIn.new(operand1, operand2)
end
end
class NotIn < Binary
def complement
In.new(operand1, operand2)
end
end
end
end
|