| com.hp.hpl.jena.db.impl.SpecializedGraphReifier
All known Subclasses: com.hp.hpl.jena.db.impl.SpecializedGraphReifier_RDB,
| SpecializedGraphReifier | | public interface SpecializedGraphReifier extends SpecializedGraph(Code) | | Interface for a specialized graphs that are optimized for reification.
author:
csayers
version:
$Revision: 1.8 $ |
| Method Summary | |
| public void | add(Node n, Triple t, CompletionFlag complete)
Add a reified triple to the specialized graph.
Note that when calling add, the call will either fail (complete=false)
indicating the graph can not store the quad, or succeed (complete=true)
indicating that a subsequent call to contains(node, triple) will return true
and that the add operation is complete.
Adding the same triple twice is not an error. | | public boolean | contains(Node n, Triple t, CompletionFlag complete)
Tests if a reified triple is contained in the specialized graph.
Parameters:
n - is the node to be tested - may be null to indicate any node
Parameters:
t - is the triple to be tested
Parameters:
complete - is true if the graph can guarantee that no other specialized graph could hold any matching triples. | | public void | delete(Node n, Triple t, CompletionFlag complete)
Attempt to delete a reified triple from the specialized graph. | | public ExtendedIterator | findReifiedNodes(Triple t, CompletionFlag complete)
Finds matching reified triples in the specialized graph and returns their nodes.
// * @param t the TripleMatch
Parameters:
t - the Triple
Parameters:
complete - is true if the graph can guarantee that no other specialized graph could hold any matching triples. | | public Triple | findReifiedTriple(Node n, CompletionFlag complete)
Finds the reified triple corresponding to a particular node in the specialized graph.
Parameters:
t - the TripleMatch
Parameters:
complete - is true if the graph can guarantee that no other specialized graph could hold any matching triples. |
| add | | public void add(Node n, Triple t, CompletionFlag complete) throws AlreadyReifiedException(Code) | | Add a reified triple to the specialized graph.
Note that when calling add, the call will either fail (complete=false)
indicating the graph can not store the quad, or succeed (complete=true)
indicating that a subsequent call to contains(node, triple) will return true
and that the add operation is complete.
Adding the same triple twice is not an error. However adding the same
node twice is an error and should throw a Reifier.AlreadyReifiedException.
Parameters:
n - is the Node to be added
Parameters:
t - is the triple to be added
Parameters:
complete - is true if a subsequent call to contains(triple) will return true.
throws:
Reifier.AlreadyReifiedException - if the node already reifies a triple |
| contains | | public boolean contains(Node n, Triple t, CompletionFlag complete)(Code) | | Tests if a reified triple is contained in the specialized graph.
Parameters:
n - is the node to be tested - may be null to indicate any node
Parameters:
t - is the triple to be tested
Parameters:
complete - is true if the graph can guarantee that no other specialized graph could hold any matching triples. boolean result to indicte if the tripple was contained |
| delete | | public void delete(Node n, Triple t, CompletionFlag complete)(Code) | | Attempt to delete a reified triple from the specialized graph.
Parameters:
t - is the triple to be deleted
Parameters:
complete - is true if either (i) the triple was in the graph and was deleted, or (ii) the triple was not in the graph the graph can guarantee that a call to add(Triple)would have succeeded, had it been made for that same triple. |
| findReifiedNodes | | public ExtendedIterator findReifiedNodes(Triple t, CompletionFlag complete)(Code) | | Finds matching reified triples in the specialized graph and returns their nodes.
// * @param t the TripleMatch
Parameters:
t - the Triple
Parameters:
complete - is true if the graph can guarantee that no other specialized graph could hold any matching triples. ExtendedIterator which iterates over any matching nodes |
| findReifiedTriple | | public Triple findReifiedTriple(Node n, CompletionFlag complete)(Code) | | Finds the reified triple corresponding to a particular node in the specialized graph.
Parameters:
t - the TripleMatch
Parameters:
complete - is true if the graph can guarantee that no other specialized graph could hold any matching triples. ExtendedIterator which iterates over any matching nodes |
|
|