@Override final public boolean isLeaf() { return !isRoot() && _outEdges.isEmpty(); }
@Override final public boolean isLeaf() { return !isRoot() && _outEdges.isEmpty(); }
protected Iterator<WME> toWMEs(final EdgeList edges, final EdgeDirection dir) { if (edges.isEmpty()) return IteratorUtils.emptyIterator(); else if (edges.size() == 1) { final Edge edge = edges.get(0); return IteratorUtils.<WME> singletonIterator(createEdge(edge, dir)); } else { final List<WME> wmes = new ArrayList<>(edges.size()); for (final Edge edge : edges) wmes.add(createEdge(edge, dir)); return wmes.iterator(); } }
protected Iterator<WME> toWMEs(final EdgeList edges, final EdgeDirection dir) { if (edges.isEmpty()) return IteratorUtils.emptyIterator(); else if (edges.size() == 1) { final Edge edge = edges.get(0); return IteratorUtils.<WME> singletonIterator(createEdge(edge, dir)); } else { final List<WME> wmes = new ArrayList<>(edges.size()); for (final Edge edge : edges) wmes.add(createEdge(edge, dir)); return wmes.iterator(); } }
return !edges.isEmpty();
return !edges.isEmpty();
while (!node.getInEdges().isEmpty())
while (!node.getInEdges().isEmpty())
protected boolean applyAllValuesPropertyChain(final Individual x, final ATermList chain, final ATermAppl c, final DependencySet ds) { final Role r = _strategy.getABox().getRole(chain.getFirst()); final EdgeList edges = x.getRNeighborEdges(r); if (!edges.isEmpty()) { final ATermAppl allRC = ATermUtils.makeAllValues(chain.getNext(), c); for (int e = 0; e < edges.size(); e++) { final Edge edgeToY = edges.get(e); final Node y = edgeToY.getNeighbor(x); final DependencySet finalDS = ds.union(edgeToY.getDepends(), _strategy.getABox().doExplanation()); applyAllValues(x, r, y, allRC, finalDS); if (x.isMerged() || _strategy.getABox().isClosed()) return false; } } return true; }
if (!selfEdges.isEmpty()) _abox.setClash(Clash.unexplained(this, selfEdges.getDepends(_abox.doExplanation())));
if (!selfEdges.isEmpty()) _abox.setClash(Clash.unexplained(this, selfEdges.getDepends(_abox.doExplanation())));
protected boolean applyAllValuesPropertyChain(final Individual x, final ATermList chain, final ATermAppl c, final DependencySet ds) { final Role r = _strategy.getABox().getRole(chain.getFirst()); final EdgeList edges = x.getRNeighborEdges(r); if (!edges.isEmpty()) { final ATermAppl allRC = ATermUtils.makeAllValues(chain.getNext(), c); for (int e = 0; e < edges.size(); e++) { final Edge edgeToY = edges.get(e); final Node y = edgeToY.getNeighbor(x); final DependencySet finalDS = ds.union(edgeToY.getDepends(), _strategy.getABox().doExplanation()); applyAllValues(x, r, y, allRC, finalDS); if (x.isMerged() || _strategy.getABox().isClosed()) return false; } } return true; }
if (!edges.isEmpty()) if (useExistingNode)
if (!edges.isEmpty()) if (useExistingNode)