public abstract class DatasetGraphTrackActive extends Object implements DatasetGraph, Transactional
Modifier and Type | Method and Description |
---|---|
void |
abort()
Abort a transaction - finish the transaction and undo any changes (if a "write" transaction)
|
void |
add(Node g,
Node s,
Node p,
Node o)
Add a quad
|
void |
add(Quad quad)
Add a quad
|
void |
addGraph(Node graphName,
Graph graph)
Add the given graph to the dataset.
|
void |
begin(ReadWrite readWrite)
Start either a READ or WRITE transaction
|
void |
close()
Close the dataset
|
void |
commit()
Commit a transaction - finish the transaction and make any changes permanent (if a "write" transaction)
|
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 |
contains(Quad quad)
Test whether the dataset contains a quad (including default graph)- may include wildcards, Node.ANY or null
|
boolean |
containsGraph(Node graphNode) |
void |
delete(Node g,
Node s,
Node p,
Node o)
Delete a quad
|
void |
delete(Quad quad)
Delete a quad
|
void |
deleteAny(Node g,
Node s,
Node p,
Node o)
Delete any quads matching the pattern
|
void |
end()
Finish the transaction - if a write transaction and commit() has not been called, then abort
|
Iterator<Quad> |
find()
Iterate over all quads in the dataset graph
|
Iterator<Quad> |
find(Node g,
Node s,
Node p,
Node o)
Find matching quads in the dataset (including default graph) - may include wildcards, Node.ANY or null
|
Iterator<Quad> |
find(Quad quad)
Find matching quads in the dataset - may include wildcards, Node.ANY or null
|
Iterator<Quad> |
findNG(Node g,
Node s,
Node p,
Node o)
Find matching quads in the dataset in named graphs only - may include wildcards, Node.ANY or null
|
Graph |
getDefaultGraph()
Get the default graph as a Jena Graph
|
Graph |
getGraph(Node graphNode)
Get the graph named by graphNode : returns null on no graph
NB Whether a dataset contains a graph if there are no triples is not defined - see the specifc implementation.
|
Lock |
getLock()
Return a lock for the dataset to help with concurrency control
|
boolean |
isEmpty()
Test whether the dataset is empty
|
boolean |
isInTransaction()
Say whether a transaction is active
|
Iterator<Node> |
listGraphNodes()
Iterate over all names of named graphs
|
void |
removeGraph(Node graphName)
Remove all data associated with the named graph
|
void |
setDefaultGraph(Graph g)
Set the default graph.
|
long |
size()
Get the size (number of named graphs) - may be -1 for unknown
|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
getContext
public final void begin(ReadWrite readWrite)
Transactional
begin
in interface Transactional
public void commit()
Transactional
commit
in interface Transactional
public void abort()
Transactional
abort
in interface Transactional
public void end()
Transactional
end
in interface Transactional
public boolean isInTransaction()
Transactional
isInTransaction
in interface Transactional
public void close()
DatasetGraph
close
in interface DatasetGraph
close
in interface Closeable
public boolean containsGraph(Node graphNode)
containsGraph
in interface DatasetGraph
public Graph getDefaultGraph()
DatasetGraph
getDefaultGraph
in interface DatasetGraph
public Graph getGraph(Node graphNode)
DatasetGraph
getGraph
in interface DatasetGraph
public void addGraph(Node graphName, Graph graph)
DatasetGraph
DatasetGraph.getGraph(com.hp.hpl.jena.graph.Node)
addGraph
in interface DatasetGraph
public void removeGraph(Node graphName)
DatasetGraph
removeGraph
in interface DatasetGraph
public void setDefaultGraph(Graph g)
DatasetGraph
DatasetGraph.getDefaultGraph()
setDefaultGraph
in interface DatasetGraph
public Lock getLock()
DatasetGraph
getLock
in interface DatasetGraph
Lock
public Iterator<Node> listGraphNodes()
DatasetGraph
listGraphNodes
in interface DatasetGraph
public void add(Quad quad)
DatasetGraph
add
in interface DatasetGraph
public void delete(Quad quad)
DatasetGraph
delete
in interface DatasetGraph
public void add(Node g, Node s, Node p, Node o)
DatasetGraph
add
in interface DatasetGraph
public void delete(Node g, Node s, Node p, Node o)
DatasetGraph
delete
in interface DatasetGraph
public void deleteAny(Node g, Node s, Node p, Node o)
DatasetGraph
deleteAny
in interface DatasetGraph
public boolean isEmpty()
DatasetGraph
isEmpty
in interface DatasetGraph
public Iterator<Quad> find()
DatasetGraph
find
in interface DatasetGraph
public Iterator<Quad> find(Quad quad)
DatasetGraph
find
in interface DatasetGraph
Graph.find(TripleMatch)
public Iterator<Quad> find(Node g, Node s, Node p, Node o)
DatasetGraph
find
in interface DatasetGraph
Graph.find(Node,Node,Node)
public Iterator<Quad> findNG(Node g, Node s, Node p, Node o)
DatasetGraph
findNG
in interface DatasetGraph
Graph.find(Node,Node,Node)
public boolean contains(Quad quad)
DatasetGraph
contains
in interface DatasetGraph
public boolean contains(Node g, Node s, Node p, Node o)
DatasetGraph
contains
in interface DatasetGraph
public long size()
DatasetGraph
size
in interface DatasetGraph
Licenced under the Apache License, Version 2.0