@Override final public Individual getSame() { return (Individual) super.getSame(); }
public Node getSame() { if (_mergedTo == this) return this; return _mergedTo.getSame(); }
@Override public final Literal getSame() { return (Literal) super.getSame(); }
@Override public final Literal getSame() { return (Literal) super.getSame(); }
public Node getSame() { if (_mergedTo == this) return this; return _mergedTo.getSame(); }
@Override final public Individual getSame() { return (Individual) super.getSame(); }
/** * @return the next element of a queue of a given type */ @Override public Node nextLiteral() { //get the next _index findNext(-1); Node node = _abox.getNode(_queue.get(_current)); node = node.getSame(); _current++; return node; }
/** * @return the next element of a _queue of a given type */ @Override public Node nextLiteral() { //get the next _index findNext(_currentType); Node node = _abox.getNode(_queue[_currentType].get(_current[_currentType])); node = node.getSame(); _current[_currentType]++; return node; }
/** * @return the next element of a queue of a given type */ @Override public Node nextLiteral() { //get the next _index findNext(-1); Node node = _abox.getNode(_queue.get(_current)); node = node.getSame(); _current++; return node; }
/** * @return the next element of a _queue of a given type */ @Override public Node nextLiteral() { //get the next _index findNext(_currentType); Node node = _abox.getNode(_queue[_currentType].get(_current[_currentType])); node = node.getSame(); _current[_currentType]++; return node; }
/** * Find the next _individual in a given _queue * * @param type */ @Override protected void findNext(final int type) { for (; _current[type] < _cutOff[type]; _current[type]++) { Node node = _abox.getNode(_queue[type].get(_current[type])); //because we do not maitain the _queue during restore this _node could be non-existent if (node == null) continue; node = node.getSame(); if (node != null) if ((node instanceof Literal && isAllowLiterals() || node instanceof Individual && !isAllowLiterals()) && !node.isPruned()) break; } }
/** * Find the next _individual in a given _queue * * @param type */ @Override protected void findNext(final int type) { for (; _current[type] < _cutOff[type]; _current[type]++) { Node node = _abox.getNode(_queue[type].get(_current[type])); //because we do not maitain the _queue during restore this _node could be non-existent if (node == null) continue; node = node.getSame(); if (node != null) if ((node instanceof Literal && isAllowLiterals() || node instanceof Individual && !isAllowLiterals()) && !node.isPruned()) break; } }
/** * Find the next _individual in a given queue * * @param type */ @Override protected void findNext(final int type) { for (; _current < _cutOff; _current++) { Node node = _abox.getNode(_queue.get(_current)); //because we do not maitain the _queue during restore this _node could be non-existent if (node == null) continue; node = node.getSame(); if ((node.isLiteral() && isAllowLiterals() || node.isIndividual() && !isAllowLiterals()) && !node.isPruned()) break; } }
/** * Find the next _individual in a given queue * * @param type */ @Override protected void findNext(final int type) { for (; _current < _cutOff; _current++) { Node node = _abox.getNode(_queue.get(_current)); //because we do not maitain the _queue during restore this _node could be non-existent if (node == null) continue; node = node.getSame(); if ((node.isLiteral() && isAllowLiterals() || node.isIndividual() && !isAllowLiterals()) && !node.isPruned()) break; } }
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; }
private void addEdge(final ATermAppl p, final ATermAppl s, final ATermAppl o) { DependencySet edgeDS = _ds; Individual node1 = _abox.getIndividual(s); if (node1.isMerged()) { edgeDS = node1.getMergeDependency(true); node1 = node1.getSame(); } if (_negated) { final ATermAppl cls = all(p, not(value(o))); _strategy.addType(node1, cls, _ds); } else { Node node2 = _abox.getNode(o); if (node2.isMerged()) { edgeDS = node2.getMergeDependency(true); node2 = node2.getSame(); } _strategy.addEdge(node1, _abox.getRole(p), node2, edgeDS); } }
private void addEdge(final ATermAppl p, final ATermAppl s, final ATermAppl o) { DependencySet edgeDS = _ds; Individual node1 = _abox.getIndividual(s); if (node1.isMerged()) { edgeDS = node1.getMergeDependency(true); node1 = node1.getSame(); } if (_negated) { final ATermAppl cls = all(p, not(value(o))); _strategy.addType(node1, cls, _ds); } else { Node node2 = _abox.getNode(o); if (node2.isMerged()) { edgeDS = node2.getMergeDependency(true); node2 = node2.getSame(); } _strategy.addEdge(node1, _abox.getRole(p), node2, edgeDS); } }