public class DifferenceDatasetGraph extends DyadicDatasetGraph
Transactional.Promote| Constructor and Description |
|---|
DifferenceDatasetGraph(DatasetGraph left,
DatasetGraph right,
Context c) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
contains(Node g,
Node s,
Node p,
Node o)
Test whether the dataset (including default graph) contains a quad - may include wildcards, Node.ANY or null
|
boolean |
containsGraph(Node graphNode)
Does the DatasetGraph contain a specific named graph?
Whether a dataset contains a graph if there are no triples is
not defined - see the specific implementation.
|
Graph |
getDefaultGraph()
Get the default graph as a Jena Graph
|
Graph |
getGraph(Node graphNode)
Get the graph named by graphNode : returns null when there is no such graph.
|
boolean |
isEmpty()
Test whether the dataset is empty
|
Iterator<Node> |
listGraphNodes()
Iterate over all names of named graphs
|
long |
size()
Get the size (number of named graphs) - may be -1 for unknown
|
abort, add, add, addGraph, begin, begin, begin, clear, close, commit, contains, delete, delete, deleteAny, end, find, find, find, findNG, getContext, getLock, getUnionGraph, isInTransaction, promote, removeGraph, setContext, setDefaultGraph, supportsTransactionAbort, supportsTransactions, transactionMode, transactionTypeapply, both, either, forEachcar, cdr, create, equals, getLeft, getRight, hashCode, toStringpromotepublic DifferenceDatasetGraph(DatasetGraph left, DatasetGraph right, Context c)
public Graph getDefaultGraph()
DatasetGraphpublic Graph getGraph(Node graphNode)
DatasetGraphpublic boolean containsGraph(Node graphNode)
DatasetGraphpublic Iterator<Node> listGraphNodes()
DatasetGraphpublic boolean contains(Node g, Node s, Node p, Node o)
DatasetGraphpublic boolean isEmpty()
DatasetGraphisEmpty in interface DatasetGraphisEmpty in class DyadicDatasetGraphpublic long size()
DatasetGraphsize in interface DatasetGraphsize in class DyadicDatasetGraphLicenced under the Apache License, Version 2.0