-
Notifications
You must be signed in to change notification settings - Fork 98
/
solutions.rb
319 lines (300 loc) · 10 KB
/
solutions.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
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
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
module RDF; class Query
##
# An RDF basic graph pattern (BGP) query solution sequence.
#
# @example Filtering solutions using a hash
# solutions.filter(author: RDF::URI("http://ar.to/#self"))
# solutions.filter(author: "Gregg Kellogg")
# solutions.filter(author: [RDF::URI("http://ar.to/#self"), "Gregg Kellogg"])
# solutions.filter(updated: RDF::Literal(Date.today))
#
# @example Filtering solutions using a block
# solutions.filter { |solution| solution.author.literal? }
# solutions.filter { |solution| solution.title.to_s =~ /^SPARQL/ }
# solutions.filter { |solution| solution.price < 30.5 }
# solutions.filter { |solution| solution.bound?(:date) }
# solutions.filter { |solution| solution.age.datatype == RDF::XSD.integer }
# solutions.filter { |solution| solution.name.language == :es }
#
# @example Reordering solutions based on a variable or proc
# solutions.order_by(:updated)
# solutions.order_by(:updated, :created)
# solutions.order_by(:updated, lambda {|a, b| b <=> a})
#
# @example Selecting/Projecting particular variables only
# solutions.select(:title)
# solutions.select(:title, :description)
# solutions.project(:title)
#
# @example Eliminating duplicate solutions
# solutions.distinct
#
# @example Limiting the number of solutions
# solutions.offset(20).limit(10)
#
# @example Counting the number of matching solutions
# solutions.count
# solutions.count { |solution| solution.price < 30.5 }
#
# @example Iterating over all found solutions
# solutions.each { |solution| puts solution.inspect }
#
# @since 0.3.0
class Solutions < Array
alias_method :each_solution, :each
##
# Returns the number of matching query solutions.
#
# @overload count
# @return [Integer]
#
# @overload count { |solution| ... }
# @yield [solution]
# @yieldparam [RDF::Query::Solution] solution
# @yieldreturn [Boolean]
# @return [Integer]
#
# @return [Integer]
def count(&block)
super
end
##
# Returns an array of the distinct variable names used in this solution
# sequence.
#
# @return [Array<Symbol>]
def variable_names
@variable_names ||= begin
variables = self.inject({}) do |result, solution|
solution.each_name do |name|
result[name] ||= true
end
result
end
variables.keys
end
end
##
# Sets variable names used in these solutions. If not set, the default is determined by the variables used in each solution.
#
# @param [Array<Symbol, RDF::Query::Variable>] vars
# @return [Array<Symbol>]
def variable_names=(vars)
@variable_names = vars.map(&:to_sym)
end
##
# @overload variable?
# Returns `false`.
#
# @return [Boolean]
# @overload variable?(variables)
# Returns `true` if this solution sequence contains bindings for any of
# the given `variables`.
#
# @param [Array<Symbol, #to_sym>] variables
# @return [Boolean]
# @see RDF::Query::Solution#variable?
# @see RDF::Query#execute
def variable?(*args)
case args.length
when 0 then false
when 1
self.any? { |solution| solution.variables?(args.first) }
else raise ArgumentError("wrong number of arguments (given #{args.length}, expected 0 or 1)")
end
end
alias_method :variables?, :variable?
alias_method :have_variables?, :variable?
alias_method :has_variables?, :have_variables?
##
# Returns hash of bindings from each solution. Each bound variable will have
# an array of bound values representing those from each solution, where a given
# solution will have just a single value for each bound variable
# @return [Hash{Symbol => Array<RDF::Term>}]
def bindings
bindings = {}
each do |solution|
solution.each do |key, value|
bindings[key] ||= []
bindings[key] << value
end
end
bindings
end
##
# Duplicates each solution.
# @return [RDF::Query::Solutions]
def dup
RDF::Query::Solutions.new(self.compact.map(&:dup))
end
##
# Merge solutions in `other` into a new solutions instance. Each solution in `other` is merged into those solutions in `self` that are compatible.
#
# @param [RDF::Query::Solutions] other
# @return [RDF::Query::Solutions]
def merge(other)
other ||= RDF::Query::Solutions()
return other if self.empty?
return self if other.empty?
RDF::Query::Solutions(self.map do |s1|
other.map { |s2| s2.merge(s1) if s2.compatible?(s1) }
end.flatten.compact)
end
##
# Filters this solution sequence by the given `criteria`.
#
# @param [Hash{Symbol => Object}] criteria
# @yield [solution]
# @yieldparam [RDF::Query::Solution] solution
# @yieldreturn [Boolean]
# @return [self]
def filter(criteria = {})
@variable_names = nil
if block_given?
self.reject! do |solution|
!yield(solution.is_a?(Solution) ? solution : Solution.new(solution))
end
else
self.reject! do |solution|
solution = solution.is_a?(Solution) ? solution : Solution.new(solution)
results = criteria.map do |name, value|
case value
when Array then value.any? {|v| solution[name] == v}
when Regexp then solution[name].to_s.match(value)
else solution[name] == value
end
end
!results.all?
end
end
self
end
alias_method :filter!, :filter
##
# Difference between solution sets, from SPARQL 1.1.
#
# The `minus` operation on solutions returns those solutions which either have no compatible solution in `other`, or the solution domains are disjoint.
#
# @param [RDF::Query::Solutions] other
# @return [RDF::Query::Solutions] a new solution set
# @see http://www.w3.org/TR/2013/REC-sparql11-query-20130321/#defn_algMinus
def minus(other)
self.dup.filter! do |soln|
!other.any? {|soln2| soln.compatible?(soln2) && !soln.disjoint?(soln2)}
end
end
##
# Reorders this solution sequence by the given `variables`.
#
# Variables may be symbols or {Query::Variable} instances.
# A variable may also be a Procedure/Lambda, compatible with `::Enumerable#sort`.
# This takes two arguments (solutions) and returns -1, 0, or 1 equivalently to <=>.
#
# If called with a block, variables are ignored, and the block is invoked with
# pairs of solutions. The block is expected to return -1, 0, or 1 equivalently to <=>.
#
# @param [Array<Proc, Query::Variable, Symbol, #to_sym>] variables
# @yield [solution]
# @yieldparam [RDF::Query::Solution] q
# @yieldparam [RDF::Query::Solution] b
# @yieldreturn [Integer] -1, 0, or 1 depending on value of comparator
# @return [self]
def order(*variables)
if variables.empty? && !block_given?
raise ArgumentError, "wrong number of arguments (0 for 1)"
else
self.sort! do |a, b|
if block_given?
yield((a.is_a?(Solution) ? a : Solution.new(a)), (b.is_a?(Solution) ? b : Solution.new(b)))
else
# Try each variable until a difference is found.
variables.inject(nil) do |memo, v|
memo || begin
comp = v.is_a?(Proc) ? v.call(a, b) : (v = v.to_sym; a[v] <=> b[v])
comp == 0 ? false : comp
end
end || 0
end
end
end
self
end
alias_method :order_by, :order
##
# Restricts this solution sequence to the given `variables` only.
#
# @param [Array<Symbol, #to_sym>] variables
# @return [self]
def project(*variables)
if variables.empty?
raise ArgumentError, "wrong number of arguments (0 for 1)"
else
variables.map!(&:to_sym)
self.each do |solution|
solution.bindings.delete_if { |k, v| !variables.include?(k.to_sym) }
end
end
# Make sure variable_names are ordered by projected variables
projected_vars, vars = variables.map(&:to_sym), variable_names
vars = variable_names
# Maintain projected order, and add any non-projected variables
@variable_names = (projected_vars & vars) + (vars - projected_vars)
self
end
alias_method :select, :project
##
# Ensures that the solutions in this solution sequence are unique.
#
# @return [self]
def distinct
self.uniq!
self
end
alias_method :distinct!, :distinct
alias_method :reduced, :distinct
alias_method :reduced!, :distinct
##
# Limits this solution sequence to bindings starting from the `start`
# offset in the overall solution sequence.
#
# @param [Integer, #to_i] start
# zero or a positive or negative integer
# @return [self]
def offset(start)
case start = start.to_i
when 0 then nil
else self.slice!(0...start)
end
self
end
alias_method :offset!, :offset
##
# Limits the number of solutions in this solution sequence to a maximum
# of `length`.
#
# @param [Integer, #to_i] length
# zero or a positive integer
# @return [self]
# @raise [ArgumentError] if `length` is negative
def limit(length)
length = length.to_i
raise ArgumentError, "expected zero or a positive integer, got #{length}" if length < 0
case length
when 0 then self.clear
else self.slice!(length..-1) if length < self.size
end
self
end
alias_method :limit!, :limit
##
# Equivalence of solution
def eql?(other)
super && (!other.respond_to?(:variable_names) || variable_names.eql?(other.variable_names))
end
##
# Equals of solution
def ==(other)
super && (!other.respond_to?(:variable_names) || variable_names.eql?(other.variable_names))
end
end # Solutions
end; end # RDF::Query