/**
* Return an iterator over all of the triples representing outgoing links from this node.
*
* @param closed if set to true it returns triples in the transitive closure, if set to false it
* returns triples in the transitive reduction
* @param tgc the enclosing TransitiveGraphCache
*/
public ExtendedIterator<Triple> listTriples(boolean closed, TransitiveGraphCache tgc) {
if (tgc.cacheTriples) {
// TODO implement - for now default to non-cached
return WrappedIterator.create(
leadNode().triplesForSuccessors(rdfNode, closed, tgc).iterator());
} else {
return WrappedIterator.create(
leadNode().triplesForSuccessors(rdfNode, closed, tgc).iterator());
}
}
public Iterator<GraphNode> concatenateSiblings(Iterator<GraphNode> base) {
return WrappedIterator.create(base).andThen(siblings.siblingIterator());
}
public static ExtendedIterator subjectsFor(Graph g, Node p, Node o) {
Set objects = CollectionFactory.createHashedSet();
ClosableIterator it = g.find(Node.ANY, p, o);
while (it.hasNext()) objects.add(((Triple) it.next()).getSubject());
return WrappedIterator.createNoRemove(objects.iterator());
}
public static ExtendedIterator predicatesFor(Graph g, Node s, Node o) {
Set predicates = CollectionFactory.createHashedSet();
ClosableIterator it = g.find(s, Node.ANY, o);
while (it.hasNext()) predicates.add(((Triple) it.next()).getPredicate());
return WrappedIterator.createNoRemove(predicates.iterator());
}
@Override
public ExtendedIterator filterKeep(Iterator it) {
return WrappedIterator.create(it);
}
