Class: LD::Patch::Algebra::Constraint
- Inherits:
-
SPARQL::Algebra::Operator
- Object
- SPARQL::Algebra::Operator
- LD::Patch::Algebra::Constraint
- Includes:
- SPARQL::Algebra::Evaluatable, SPARQL::Algebra::Query
- Defined in:
- lib/ld/patch/algebra/constraint.rb
Overview
The LD Patch constraint
operator.
A constraint is a query operator which either ensures that there is a single input node (“!” operator) or finds a set of nodes for a given path
, optionally filtering those nodes with a particular predicate value.
Maps input terms to output terms using (path :p)
returning those input terms that have at least a single solution.
Maps input terms to output terms using (path :p)
and filters the input terms where the output term is 1
.
Returns the single term from the input terms if there is a single input term.
Constant Summary collapse
- NAME =
:constraint
Instance Method Summary collapse
-
#execute(queryable, options = {}) ⇒ RDF::Query::Solutions
If the first operand is :unique.
Instance Method Details
#execute(queryable, options = {}) ⇒ RDF::Query::Solutions
If the first operand is :unique
38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 |
# File 'lib/ld/patch/algebra/constraint.rb', line 38 def execute(queryable, = {}) debug() {"Constraint"} terms = Array(.fetch(:terms)) op, value = operands results = if op == :unique terms.length == 1 ? terms : [] else # op is a path, filter input terms based on the presense or absense of output terms. Additionally, if a constraint value is given, output terms must equal that value terms.select do |term| output_terms = op.execute(queryable, .merge(terms: [term])).map(&:path) output_terms = output_terms.select {|t| t == value} if value !output_terms.empty? end end RDF::Query::Solutions.new(results.map {|t| RDF::Query::Solution.new(path: t)}) end |