@Override public Iterator<Token> getTokens(final WME wme) { return IteratorUtils.iterator(size, index); }
@Override public Iterator<Token> getTokens(final WME wme) { return IteratorUtils.iterator(size, index); }
@Override public void notifyDeleteArray(final Graph g, final Triple[] triples) { notifyDeleteIterator(g, IteratorUtils.iterator(triples)); }
@Override public void notifyDeleteArray(final Graph g, final Triple[] triples) { notifyDeleteIterator(g, IteratorUtils.iterator(triples)); }
@Override public void notifyDeleteArray(final Graph g, final Triple[] triples) { notifyDeleteIterator(g, IteratorUtils.iterator(triples)); }
@Override public void notifyAddArray(final Graph g, final Triple[] triples) { notifyAddIterator(g, IteratorUtils.iterator(triples)); }
@Override public void notifyAddArray(final Graph g, final Triple[] triples) { notifyAddIterator(g, IteratorUtils.iterator(triples)); }
@Override public void notifyAddArray(final Graph g, final Triple[] triples) { notifyAddIterator(g, IteratorUtils.iterator(triples)); }
protected Iterator<CachedNode> getCachedNodes(final ABox abox, final ATermAppl c) { CachedNode node = abox.getCached(c); if (node != null) return IteratorUtils.singletonIterator(node); if (ATermUtils.isAnd(c)) { ATermList list = (ATermList) c.getArgument(0); final CachedNode[] nodes = new CachedNode[list.getLength()]; for (int i = 0; !list.isEmpty(); list = list.getNext()) { final ATermAppl d = (ATermAppl) list.getFirst(); node = abox.getCached(d); if (node == null) return IteratorUtils.emptyIterator(); else if (node.isBottom()) return IteratorUtils.singletonIterator(node); nodes[i++] = node; } return IteratorUtils.iterator(nodes); } return IteratorUtils.emptyIterator(); }
protected Iterator<CachedNode> getCachedNodes(final ABox abox, final ATermAppl c) { CachedNode node = abox.getCached(c); if (node != null) return IteratorUtils.singletonIterator(node); if (ATermUtils.isAnd(c)) { ATermList list = (ATermList) c.getArgument(0); final CachedNode[] nodes = new CachedNode[list.getLength()]; for (int i = 0; !list.isEmpty(); list = list.getNext()) { final ATermAppl d = (ATermAppl) list.getFirst(); node = abox.getCached(d); if (node == null) return IteratorUtils.emptyIterator(); else if (node.isBottom()) return IteratorUtils.singletonIterator(node); nodes[i++] = node; } return IteratorUtils.iterator(nodes); } return IteratorUtils.emptyIterator(); }