|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
true iff t is in the graph as revealed by
find(t) being non-empty.
true if this graph contains (s, p, o);
this canonical implementation cannot be over-ridden.
UpdateExecutionFactory.create(Update,GraphStore) instead
UpdateExecutionFactory.create(Update,GraphStore,QuerySolution) instead
UpdateExecutionFactory.create(Update,GraphStore,Binding) instead
UpdateExecutionFactory.create(UpdateRequest,GraphStore) instead
UpdateExecutionFactory.create(UpdateRequest,GraphStore,QuerySolution) instead
UpdateExecutionFactory.create(UpdateRequest,GraphStore,Binding) instead
true iff this graph is the
same graph as the argument graph.
Substitute.substitute(PropFuncArg, Binding)
m.
ExecutionContextg according to
the algorithm (indeed, method) in GraphMatcher.
QueryFactory.create() preferred.
t has been added to the graph.
t has been deleted from the
graph.
@link{http://www.w3.org/2001/sw/DataAccess/tests/result-set}#
LARQ.setDefaultIndex(IndexLARQ))
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||