@Override public DependencySet getDepends() { return _edge.getDepends(); }
@Override public DependencySet getDepends() { return _edge.getDepends(); }
public DependencySet getDepends(final boolean doExplanation) { DependencySet ds = DependencySet.INDEPENDENT; for (final Edge e : this) ds = ds.union(e.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; }
public DependencyEntry(final DependencyEntry that) { _types.addAll(that._types); //TODO:may need to perform a deep copy here _merges.addAll(that._merges); //TODO:may need to perform a deep copy here for (final Edge next : that._edges) //copy edge depenedencies _edges.add(new DefaultEdge(next.getRole(), next.getFrom(), next.getTo(), next.getDepends())); _branchAdds.addAll(that._branchAdds); //TODO:may need to perform a deep copy here _branchCloses.addAll(that._branchCloses); //TODO:may need to perform a deep copy here _clash = that._clash; //TODO:may need to perform a deep copy here }
public DependencyEntry(final DependencyEntry that) { _types.addAll(that._types); //TODO:may need to perform a deep copy here _merges.addAll(that._merges); //TODO:may need to perform a deep copy here for (final Edge next : that._edges) //copy edge depenedencies _edges.add(new DefaultEdge(next.getRole(), next.getFrom(), next.getTo(), next.getDepends())); _branchAdds.addAll(that._branchAdds); //TODO:may need to perform a deep copy here _branchCloses.addAll(that._branchCloses); //TODO:may need to perform a deep copy here _clash = that._clash; //TODO:may need to perform a deep copy here }
public EdgeList sort() { final EdgeList sorted = new EdgeList(this); sort((e1, e2) -> e1.getDepends().max() - e2.getDepends().max()); return sorted; }
public EdgeList sort() { final EdgeList sorted = new EdgeList(this); sort((e1, e2) -> e1.getDepends().max() - e2.getDepends().max()); return sorted; }
public CachedOutEdge(final Edge edge) { super(edge.getRole(), edge.getToName(), edge.getDepends()); }
public CachedInEdge(final Edge edge) { super(edge.getRole(), edge.getFromName(), edge.getDepends()); }
@Override public String toString() { final boolean isFwd = _dir == EdgeDirection.FORWARD; return String.format("%s%s-%s-%s%s %s", _edge.getFrom(), isFwd ? "" : "<", _edge.getRole(), isFwd ? ">" : "", _edge.getTo(), _edge.getDepends()); } }
@Override public String toString() { final boolean isFwd = _dir == EdgeDirection.FORWARD; return String.format("%s%s-%s-%s%s %s", _edge.getFrom(), isFwd ? "" : "<", _edge.getRole(), isFwd ? ">" : "", _edge.getTo(), _edge.getDepends()); } }
private static Bool checkSelfClash(final KnowledgeBase kb, final ATermAppl self, final CachedNode root, final CachedNode otherRoot) { final Role r = kb.getRole(self.getArgument(0)); for (final Edge e : otherRoot.getOutEdges()) if (e.getRole().isSubRoleOf(r) && e.getToName().equals(otherRoot.getName())) { if (_logger.isLoggable(Level.FINE)) _logger.fine(root + " has not(" + self + ") " + otherRoot + " has self edge"); final boolean allIndependent = root.isIndependent() && otherRoot.isIndependent() && e.getDepends().isIndependent(); return allIndependent ? Bool.FALSE : Bool.UNKNOWN; } return null; }
private static Bool checkSelfClash(final KnowledgeBase kb, final ATermAppl self, final CachedNode root, final CachedNode otherRoot) { final Role r = kb.getRole(self.getArgument(0)); for (final Edge e : otherRoot.getOutEdges()) if (e.getRole().isSubRoleOf(r) && e.getToName().equals(otherRoot.getName())) { if (_logger.isLoggable(Level.FINE)) _logger.fine(root + " has not(" + self + ") " + otherRoot + " has self edge"); final boolean allIndependent = root.isIndependent() && otherRoot.isIndependent() && e.getDepends().isIndependent(); return allIndependent ? Bool.FALSE : Bool.UNKNOWN; } return null; }
public DependencySet check(final Individual node1, final Node node2) { final EdgeList list = node1.getRNeighborEdges(_role); for (int i = 0, n = list.size(); i < n; i++) { final Edge edge = list.get(i); if (edge.getNeighbor(node1).equals(node2)) return edge.getDepends(); } return null; }
public DependencySet check(final Individual node1, final Node node2) { final EdgeList list = node1.getRNeighborEdges(_role); for (int i = 0, n = list.size(); i < n; i++) { final Edge edge = list.get(i); if (edge.getNeighbor(node1).equals(node2)) return edge.getDepends(); } return null; }
protected void addOutEdge(final Edge edge) { setChanged(ALL); setChanged(MAX); _applyNext[MAX] = 0; if (edge.getRole().isBottom()) _abox.setClash(Clash.bottomProperty(edge.getFrom(), edge.getDepends(), edge.getRole().getName())); else _outEdges.add(edge); }
protected void addOutEdge(final Edge edge) { setChanged(ALL); setChanged(MAX); _applyNext[MAX] = 0; if (edge.getRole().isBottom()) _abox.setClash(Clash.bottomProperty(edge.getFrom(), edge.getDepends(), edge.getRole().getName())); else _outEdges.add(edge); }
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); }