private Set<IVariable<?>> getMaybeProducedBindings(final UnionNode node, final Set<IVariable<?>> vars, final boolean recursive) { if (!recursive) { // Nothing to contribute. return vars; } /* * Collect all "maybe" bindings from each of the children. */ for (JoinGroupNode child : node) { getMaybeProducedBindings(child, vars, recursive); } return vars; }
private Set<IVariable<?>> getMaybeProducedBindings(final UnionNode node, final Set<IVariable<?>> vars, final boolean recursive) { if (!recursive) { // Nothing to contribute. return vars; } /* * Collect all "maybe" bindings from each of the children. */ for (JoinGroupNode child : node) { getMaybeProducedBindings(child, vars, recursive); } return vars; }
/** * Report the "MUST" and "MAYBE" bound variables projected by the service. * This involves checking the graph pattern reported by * {@link ServiceNode#getGraphPattern()}. A SERVICE does NOT have an * explicit PROJECTION so it can not rename the projected bindings. */ // MAY : ServiceNode public Set<IVariable<?>> getMaybeProducedBindings(final ServiceNode node) { final Set<IVariable<?>> vars = new LinkedHashSet<IVariable<?>>(); final GraphPatternGroup<IGroupMemberNode> graphPattern = (GraphPatternGroup<IGroupMemberNode>) node.getGraphPattern(); if (graphPattern != null) { getMaybeProducedBindings(graphPattern, vars, true/* recursive */); } return vars; }
/** * Report the "MUST" and "MAYBE" bound variables projected by the service. * This involves checking the graph pattern reported by * {@link ServiceNode#getGraphPattern()}. A SERVICE does NOT have an * explicit PROJECTION so it can not rename the projected bindings. */ // MAY : ServiceNode public Set<IVariable<?>> getMaybeProducedBindings(final ServiceNode node) { final Set<IVariable<?>> vars = new LinkedHashSet<IVariable<?>>(); final GraphPatternGroup<IGroupMemberNode> graphPattern = (GraphPatternGroup<IGroupMemberNode>) node.getGraphPattern(); if (graphPattern != null) { getMaybeProducedBindings(graphPattern, vars, true/* recursive */); } return vars; }
sa.getMaybeProducedBindings(group, maybeProd, true);
sa.getMaybeProducedBindings(group, maybeProd, true);
getMaybeProducedBindings(tmp, vars, recursive)
getMaybeProducedBindings(tmp, vars, recursive)
sa.getMaybeProducedBindings( (IBindingProducerNode)node, maybeProduced, true);
sa.getMaybeProducedBindings( (IBindingProducerNode)node, maybeProduced, true);
sa.getMaybeProducedBindings(queryRoot)); sa.getMaybeProducedBindings(whereClause, new LinkedHashSet<IVariable<?>>(), true/* recursive */));
sa.getMaybeProducedBindings(queryRoot)); sa.getMaybeProducedBindings(whereClause, new LinkedHashSet<IVariable<?>>(), true/* recursive */));
sa.getMaybeProducedBindings(whereClause, new LinkedHashSet<IVariable<?>>(), true/* recursive */));
sa.getMaybeProducedBindings(whereClause, new LinkedHashSet<IVariable<?>>(), true/* recursive */));
assertEquals(expected, sa.getMaybeProducedBindings(whereClause, new LinkedHashSet<IVariable<?>>(), true/* recursive */)); assertEquals(EMPTY_SET, sa.getMaybeProducedBindings(filterClause, new LinkedHashSet<IVariable<?>>(), true/* recursive */));
sa.getMaybeProducedBindings(queryRoot)); sa.getMaybeProducedBindings(whereClause, new LinkedHashSet<IVariable<?>>(), true/* recursive */));
sa.getMaybeProducedBindings(queryRoot)); sa.getMaybeProducedBindings(whereClause, new LinkedHashSet<IVariable<?>>(), true/* recursive */));
sa.getMaybeProducedBindings(queryRoot)); sa.getMaybeProducedBindings(whereClause, new LinkedHashSet<IVariable<?>>(), true/* recursive */));
sa.getMaybeProducedBindings(whereClause, new LinkedHashSet<IVariable<?>>(), true/* recursive */));
sa.getMaybeProducedBindings(queryRoot)); sa.getMaybeProducedBindings(whereClause, new LinkedHashSet<IVariable<?>>(), true/* recursive */));