Individual(final ATermAppl name, final ABoxImpl abox, final Individual parent) { super(name, abox); _parent = parent; if (parent == null) { _nominalLevel = NOMINAL; _depth = 0; } else { _nominalLevel = BLOCKABLE; _depth = (short) (parent._depth + 1); } for (int i = 0; i < TYPES; i++) { _types[i] = new ArrayList<>(); _applyNext[i] = 0; } _outEdges = new EdgeList(); }
Individual(final ATermAppl name, final ABoxImpl abox, final Individual parent) { super(name, abox); _parent = parent; if (parent == null) { _nominalLevel = NOMINAL; _depth = 0; } else { _nominalLevel = BLOCKABLE; _depth = (short) (parent._depth + 1); } for (int i = 0; i < TYPES; i++) { _types[i] = new ArrayList<>(); _applyNext[i] = 0; } _outEdges = new EdgeList(); }
private Individual(final Individual ind, final ABoxImpl abox) { super(ind, abox); _nominalLevel = ind._nominalLevel; _parent = ind._parent; for (int i = 0; i < TYPES; i++) { _types[i] = new ArrayList<>(ind._types[i]); _applyNext[i] = ind._applyNext[i]; } if (isPruned()) _outEdges = new EdgeList(ind._outEdges); else _outEdges = new EdgeList(ind._outEdges.size()); _depth = 0; }
private Individual(final Individual ind, final ABoxImpl abox) { super(ind, abox); _nominalLevel = ind._nominalLevel; _parent = ind._parent; for (int i = 0; i < TYPES; i++) { _types[i] = new ArrayList<>(ind._types[i]); _applyNext[i] = ind._applyNext[i]; } if (isPruned()) _outEdges = new EdgeList(ind._outEdges); else _outEdges = new EdgeList(ind._outEdges.size()); _depth = 0; }
@Override public EdgeList getOutEdges(final ATerm x) { final Node node = getNode(x); if (node instanceof Literal) return new EdgeList(); return ((Individual) node).getOutEdges(); }
@Override public EdgeList getOutEdges(final ATerm x) { final Node node = getNode(x); if (node instanceof Literal) return new EdgeList(); return ((Individual) node).getOutEdges(); }
public EdgeList getEdges(final Role role) { final EdgeList result = new EdgeList(); for (final Edge e : this) if (e.getRole().isSubRoleOf(role)) result.addEdge(e); return result; }
protected Node(final ATermAppl name, final ABox abox) { _name = name; _abox = abox; _isRoot = !ATermUtils.isAnon(name); _isConceptRoot = false; _mergeDepends = DependencySet.INDEPENDENT; _differents = CollectionUtils.makeMap(); _depends = CollectionUtils.makeMap(); _inEdges = new EdgeList(); }
protected Node(final ATermAppl name, final ABox abox) { _name = name; _abox = abox; _isRoot = !ATermUtils.isAnon(name); _isConceptRoot = false; _mergeDepends = DependencySet.INDEPENDENT; _differents = CollectionUtils.makeMap(); _depends = CollectionUtils.makeMap(); _inEdges = new EdgeList(); }
public EdgeList getEdges(final Role role) { final EdgeList result = new EdgeList(); for (final Edge e : this) if (e.getRole().isSubRoleOf(role)) result.addEdge(e); return result; }
public EdgeList getRNeighborEdges(final Role r) { if (null == r) return new EdgeList(); // TODO : this is really ugly. final EdgeList neighbors = _outEdges.getEdges(r); final Role invR = r.getInverse(); // inverse of datatype properties is not defined if (invR != null) neighbors.addAll(_inEdges.getEdges(invR)); return neighbors; }
public EdgeList getRNeighborEdges(final Role r) { if (null == r) return new EdgeList(); // TODO : this is really ugly. final EdgeList neighbors = _outEdges.getEdges(r); final Role invR = r.getInverse(); // inverse of datatype properties is not defined if (invR != null) neighbors.addAll(_inEdges.getEdges(invR)); return neighbors; }
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; }
_inEdges = new EdgeList(oldEdges.size()); for (int i = 0; i < oldEdges.size(); i++)
private EdgeList findEdges(final Role role, final Individual from, final Node to) { final EdgeList result = new EdgeList(); for (final Edge e : this) if ((from == null || from.equals(e.getFrom())) && (role == null || e.getRole().isSubRoleOf(role)) && (to == null || to.equals(e.getTo()))) result.addEdge(e); return result; }
private EdgeList findEdges(final Role role, final Individual from, final Node to) { final EdgeList result = new EdgeList(); for (final Edge e : this) if ((from == null || from.equals(e.getFrom())) && (role == null || e.getRole().isSubRoleOf(role)) && (to == null || to.equals(e.getTo()))) result.addEdge(e); return result; }
@Override protected void updateNodeReferences() { super.updateNodeReferences(); if (_parent != null) _parent = _abox.getIndividual(_parent.getName()); if (isPruned()) { final EdgeList oldEdges = _outEdges; _outEdges = new EdgeList(oldEdges.size()); for (int i = 0; i < oldEdges.size(); i++) { final Edge edge = oldEdges.get(i); final Node to = _abox.getNode(edge.getTo().getName()); final Edge newEdge = new DefaultEdge(edge.getRole(), this, to, edge.getDepends()); _outEdges.add(newEdge); } } }
@Override protected void updateNodeReferences() { super.updateNodeReferences(); if (_parent != null) _parent = _abox.getIndividual(_parent.getName()); if (isPruned()) { final EdgeList oldEdges = _outEdges; _outEdges = new EdgeList(oldEdges.size()); for (int i = 0; i < oldEdges.size(); i++) { final Edge edge = oldEdges.get(i); final Node to = _abox.getNode(edge.getTo().getName()); final Edge newEdge = new DefaultEdge(edge.getRole(), this, to, edge.getDepends()); _outEdges.add(newEdge); } } }
final EdgeList edges = new EdgeList();