/** * {@inheritDoc} */ @Override public DependencySet getDepends(final boolean doExplanation) { DependencySet ds = DependencySet.INDEPENDENT; for (final WME wme : _wmes) ds = ds.union(wme.getDepends(), doExplanation); return ds; }
public DependencySet getDepends(final boolean doExplanation) { DependencySet ds = DependencySet.INDEPENDENT; for (final Edge e : this) ds = ds.union(e.getDepends(), doExplanation); return ds; }
/** * {@inheritDoc} */ @Override public DependencySet getDepends(final boolean doExplanation) { DependencySet ds = DependencySet.INDEPENDENT; for (final WME wme : _wmes) ds = ds.union(wme.getDepends(), doExplanation); return ds; }
public DependencySet getDepends(final boolean doExplanation) { DependencySet ds = DependencySet.INDEPENDENT; for (final Edge e : this) ds = ds.union(e.getDepends(), doExplanation); return ds; }
/** * {@inheritDoc} */ @Override public DependencySet getDepends(final boolean doExplanation) { DependencySet ds = DependencySet.INDEPENDENT; for (ListToken t = this; t != null; t = t._next) ds = ds.union(t._wme.getDepends(), doExplanation); return ds; }
/** * {@inheritDoc} */ @Override public DependencySet getDepends(final boolean doExplanation) { DependencySet ds = DependencySet.INDEPENDENT; for (ListToken t = this; t != null; t = t._next) ds = ds.union(t._wme.getDepends(), doExplanation); return ds; }
public void inheritDifferents(final Node y, final DependencySet ds) { for (final Map.Entry<Node, DependencySet> entry : y._differents.entrySet()) { final Node yDiff = entry.getKey(); final DependencySet finalDS = ds.union(entry.getValue(), _abox.doExplanation()); setDifferent(yDiff, finalDS); } }
public void inheritDifferents(final Node y, final DependencySet ds) { for (final Map.Entry<Node, DependencySet> entry : y._differents.entrySet()) { final Node yDiff = entry.getKey(); final DependencySet finalDS = ds.union(entry.getValue(), _abox.doExplanation()); setDifferent(yDiff, finalDS); } }
private void getAllMerged(final DependencySet ds, final Map<Node, DependencySet> result) { if (_merged == null) return; for (final Node mergedNode : _merged) { final DependencySet mergeDS = ds.union(mergedNode.getMergeDependency(false), false); result.put(mergedNode, mergeDS); mergedNode.getAllMerged(mergeDS, result); } }
private void getAllMerged(final DependencySet ds, final Map<Node, DependencySet> result) { if (_merged == null) return; for (final Node mergedNode : _merged) { final DependencySet mergeDS = ds.union(mergedNode.getMergeDependency(false), false); result.put(mergedNode, mergeDS); mergedNode.getAllMerged(mergeDS, result); } }
public void addAllTypes(final Map<ATermAppl, DependencySet> types, final DependencySet ds) { for (final Entry<ATermAppl, DependencySet> entry : types.entrySet()) { final ATermAppl c = entry.getKey(); if (hasType(c)) continue; final DependencySet depends = entry.getValue(); super.addType(c, depends.union(ds, _abox.doExplanation())); } checkClash(); }
public void addAllTypes(final Map<ATermAppl, DependencySet> types, final DependencySet ds) { for (final Entry<ATermAppl, DependencySet> entry : types.entrySet()) { final ATermAppl c = entry.getKey(); if (hasType(c)) continue; final DependencySet depends = entry.getValue(); super.addType(c, depends.union(ds, _abox.doExplanation())); } checkClash(); }
protected void resetDependencySet(final Token token) { final boolean doExplanation = _strategy.getABox().doExplanation(); _ds = token.getDepends(doExplanation); if (doExplanation) _ds = _ds.union(_explain, doExplanation); }
protected void resetDependencySet(final Token token) { final boolean doExplanation = _strategy.getABox().doExplanation(); _ds = token.getDepends(doExplanation); if (doExplanation) _ds = _ds.union(_explain, doExplanation); }
public void setLastClash(final DependencySet ds) { if (getTryNext() >= 0) { _combinedClash = _combinedClash.union(ds, _abox.doExplanation()); if (OpenlletOptions.USE_INCREMENTAL_DELETION) //CHW - added for incremental deletions support THIS SHOULD BE MOVED TO SUPER _abox.getKB().getDependencyIndex().addCloseBranchDependency(this, ds); } }
public void setLastClash(final DependencySet ds) { if (getTryNext() >= 0) { _combinedClash = _combinedClash.union(ds, _abox.doExplanation()); if (OpenlletOptions.USE_INCREMENTAL_DELETION) //CHW - added for incremental deletions support THIS SHOULD BE MOVED TO SUPER _abox.getKB().getDependencyIndex().addCloseBranchDependency(this, ds); } }
protected Node getNode(final NodeProvider provider, final Token token) { Node node = provider.getNode(null, token); if (node.isMerged()) { final boolean doExplanation = _strategy.getABox().doExplanation(); _ds = _ds.union(node.getMergeDependency(true), doExplanation); node = node.getSame(); } return node; }
protected Node getNode(final NodeProvider provider, final Token token) { Node node = provider.getNode(null, token); if (node.isMerged()) { final boolean doExplanation = _strategy.getABox().doExplanation(); _ds = _ds.union(node.getMergeDependency(true), doExplanation); node = node.getSame(); } return node; }
protected WME createEdge(final Edge edge, final EdgeDirection dir) { if (_doExplanation) { final DependencySet ds = dir == EdgeDirection.FORWARD ? _role.getExplainSub(edge.getRole().getName()) : _role.getInverse().getExplainSub(edge.getRole().getName()); if (!ds.getExplain().isEmpty()) return WME.createEdge(new DefaultEdge(edge.getRole(), edge.getFrom(), edge.getTo(), edge.getDepends().union(ds, _doExplanation)), dir); } return WME.createEdge(edge, dir); }
protected WME createEdge(final Edge edge, final EdgeDirection dir) { if (_doExplanation) { final DependencySet ds = dir == EdgeDirection.FORWARD ? _role.getExplainSub(edge.getRole().getName()) : _role.getInverse().getExplainSub(edge.getRole().getName()); if (!ds.getExplain().isEmpty()) return WME.createEdge(new DefaultEdge(edge.getRole(), edge.getFrom(), edge.getTo(), edge.getDepends().union(ds, _doExplanation)), dir); } return WME.createEdge(edge, dir); }