protected void addQueueElement(final Node node) { _strategy.getABox().getCompletionQueue().add(new QueueElement(node), _nodeSelector); } }
protected void addQueueElement(final Node node) { _strategy.getABox().getCompletionQueue().add(new QueueElement(node), _nodeSelector); } }
public void reset(final boolean onlyApplyTypes) { assert onlyApplyTypes || isRootNominal() : "Only asserted individuals can be reset: " + this; if (OpenlletOptions.USE_COMPLETION_QUEUE) _abox.getCompletionQueue().add(new QueueElement(this)); if (onlyApplyTypes) return; if (_pruned != null) unprune(DependencySet.NO_BRANCH); _mergedTo = this; _mergeDepends = DependencySet.INDEPENDENT; _merged = null; final Iterator<DependencySet> i = _differents.values().iterator(); while (i.hasNext()) { final DependencySet d = i.next(); if (d.getBranch() != DependencySet.NO_BRANCH) i.remove(); } resetTypes(); _inEdges.reset(); }
public void reset(final boolean onlyApplyTypes) { assert onlyApplyTypes || isRootNominal() : "Only asserted individuals can be reset: " + this; if (OpenlletOptions.USE_COMPLETION_QUEUE) _abox.getCompletionQueue().add(new QueueElement(this)); if (onlyApplyTypes) return; if (_pruned != null) unprune(DependencySet.NO_BRANCH); _mergedTo = this; _mergeDepends = DependencySet.INDEPENDENT; _merged = null; final Iterator<DependencySet> i = _differents.values().iterator(); while (i.hasNext()) { final DependencySet d = i.next(); if (d.getBranch() != DependencySet.NO_BRANCH) i.remove(); } resetTypes(); _inEdges.reset(); }
_abox.getCompletionQueue().add(newElement, NodeSelector.MAX_NUMBER); _abox.getCompletionQueue().add(newElement, NodeSelector.CHOOSE); _abox.getCompletionQueue().add(newElement, NodeSelector.MAX_NUMBER); _abox.getCompletionQueue().add(newElement, NodeSelector.CHOOSE);
_abox.getCompletionQueue().add(qe, NodeSelector.MAX_NUMBER); _abox.getCompletionQueue().add(qe, NodeSelector.GUESS); _abox.getCompletionQueue().add(qe, NodeSelector.CHOOSE); _abox.getCompletionQueue().add(qe, NodeSelector.UNIVERSAL); ind._applyNext[Node.MAX] = 0; final QueueElement qe = new QueueElement(ind); _abox.getCompletionQueue().add(qe, NodeSelector.MAX_NUMBER); _abox.getCompletionQueue().add(qe, NodeSelector.GUESS); _abox.getCompletionQueue().add(qe, NodeSelector.CHOOSE); _abox.getCompletionQueue().add(qe, NodeSelector.UNIVERSAL);
_abox.getCompletionQueue().add(new QueueElement(this), NodeSelector.EXISTENTIAL); _abox.getCompletionQueue().add(new QueueElement(this), NodeSelector.MIN_NUMBER);
_abox.getCompletionQueue().add(qe, NodeSelector.MAX_NUMBER); _abox.getCompletionQueue().add(qe, NodeSelector.GUESS); _abox.getCompletionQueue().add(qe, NodeSelector.CHOOSE); _abox.getCompletionQueue().add(qe, NodeSelector.UNIVERSAL); ind._applyNext[Node.MAX] = 0; final QueueElement qe = new QueueElement(ind); _abox.getCompletionQueue().add(qe, NodeSelector.MAX_NUMBER); _abox.getCompletionQueue().add(qe, NodeSelector.GUESS); _abox.getCompletionQueue().add(qe, NodeSelector.CHOOSE); _abox.getCompletionQueue().add(qe, NodeSelector.UNIVERSAL);
_abox.getCompletionQueue().add(newElement, NodeSelector.MAX_NUMBER); _abox.getCompletionQueue().add(newElement, NodeSelector.CHOOSE); _abox.getCompletionQueue().add(newElement, NodeSelector.MAX_NUMBER); _abox.getCompletionQueue().add(newElement, NodeSelector.CHOOSE);
_abox.getCompletionQueue().add(new QueueElement(this), NodeSelector.EXISTENTIAL); _abox.getCompletionQueue().add(new QueueElement(this), NodeSelector.MIN_NUMBER);
succInd._applyNext[Node.MAX] = 0; final QueueElement qe = new QueueElement(succInd); _abox.getCompletionQueue().add(qe, NodeSelector.MAX_NUMBER); _abox.getCompletionQueue().add(qe, NodeSelector.GUESS); _abox.getCompletionQueue().add(qe, NodeSelector.CHOOSE); _abox.getCompletionQueue().add(qe, NodeSelector.MAX_NUMBER); _abox.getCompletionQueue().add(qe, NodeSelector.GUESS); _abox.getCompletionQueue().add(qe, NodeSelector.CHOOSE);
succInd._applyNext[Node.MAX] = 0; final QueueElement qe = new QueueElement(succInd); _abox.getCompletionQueue().add(qe, NodeSelector.MAX_NUMBER); _abox.getCompletionQueue().add(qe, NodeSelector.GUESS); _abox.getCompletionQueue().add(qe, NodeSelector.CHOOSE); _abox.getCompletionQueue().add(qe, NodeSelector.MAX_NUMBER); _abox.getCompletionQueue().add(qe, NodeSelector.GUESS); _abox.getCompletionQueue().add(qe, NodeSelector.CHOOSE);
_abox.getCompletionQueue().add(new QueueElement(this), NodeSelector.NOMINAL);
_abox.getCompletionQueue().add(new QueueElement(this), NodeSelector.NOMINAL);
/** * Indicates that _node has been changed in a way that requires us to recheck the concepts of given type. * * @param type type of concepts that need to be rechecked */ public void setChanged(final int type) { //Check if we need to updated the completion _queue //Currently we only updated the changed lists for checkDatatypeCount() final QueueElement newElement = new QueueElement(this); //update the datatype _queue if ((type == Node.ALL || type == Node.MIN) && OpenlletOptions.USE_COMPLETION_QUEUE) _abox.getCompletionQueue().add(newElement, NodeSelector.DATATYPE); // add _node to effected list if (_abox.getBranchIndex() >= 0 && OpenlletOptions.TRACK_BRANCH_EFFECTS) _abox.getBranchEffectTracker().add(_abox.getBranchIndex(), getName()); }
final IndividualIterator i = OpenlletOptions.USE_COMPLETION_QUEUE ? _abox.getCompletionQueue() : _abox.getIndIterator(); _abox.getCompletionQueue().flushQueue(); _abox.getCompletionQueue().setClosed(_abox.isClosed()); _abox.getCompletionQueue().setClosed(false); _abox.getCompletionQueue().flushQueue();
final IndividualIterator i = OpenlletOptions.USE_COMPLETION_QUEUE ? _abox.getCompletionQueue() : _abox.getIndIterator(); _abox.getCompletionQueue().flushQueue(); _abox.getCompletionQueue().setClosed(_abox.isClosed()); _abox.getCompletionQueue().setClosed(false); _abox.getCompletionQueue().flushQueue();
/** * Indicates that _node has been changed in a way that requires us to recheck the concepts of given type. * * @param type type of concepts that need to be rechecked */ public void setChanged(final int type) { //Check if we need to updated the completion _queue //Currently we only updated the changed lists for checkDatatypeCount() final QueueElement newElement = new QueueElement(this); //update the datatype _queue if ((type == Node.ALL || type == Node.MIN) && OpenlletOptions.USE_COMPLETION_QUEUE) _abox.getCompletionQueue().add(newElement, NodeSelector.DATATYPE); // add _node to effected list if (_abox.getBranchIndex() >= 0 && OpenlletOptions.TRACK_BRANCH_EFFECTS) _abox.getBranchEffectTracker().add(_abox.getBranchIndex(), getName()); }
_abox.getCompletionQueue().add(new QueueElement(ind));
_abox.getCompletionQueue().add(new QueueElement(ind));