@Override
public boolean contains(Triple t) {
return base.contains(t);
}
/** Return true if the given pattern occurs somewhere in the find sequence. */
@Override
public boolean contains(TriplePattern pattern) {
return graph.contains(pattern.getSubject(), pattern.getPredicate(), pattern.getObject());
}
@Override
public boolean contains(Node s, Node p, Node o) {
return base.contains(s, p, o);
}
/**
* this is a simple-minded implementation of containsNode that uses find up to three times to
* locate the node. Almost certainly particular graphs will be able to offer better query-handlers
* ...
*/
public boolean containsNode(Node n) {
return graph.contains(n, Node.ANY, Node.ANY)
|| graph.contains(Node.ANY, n, Node.ANY)
|| graph.contains(Node.ANY, Node.ANY, n);
}
public NodeInGraph(E node, @Nullable Graph<E> graph) {
this.node = checkNotNull(node);
this.graph = graph;
checkArgument(graph == null || graph.contains(node));
}
@Override
public final boolean contains(GNode<N> n, byte flags) {
return g.contains(n, flags);
}
@Override
public final boolean contains(GNode<N> n) {
return g.contains(n);
}
