|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface Reifier
This interface represents the type of things that can hold reified triples for a Jena Graph.
Nested Class Summary | |
---|---|
static class |
Reifier.Util
|
Method Summary | |
---|---|
ExtendedIterator |
allNodes()
return an iterator over all the nodes that are reifiying something in this reifier. |
ExtendedIterator |
allNodes(Triple t)
return an iterator over all the nodes that are reifiying t in this reifier. |
void |
close()
The reifier will no longer be used. |
ExtendedIterator |
find(TripleMatch m)
Answer an iterator over all the reification triples in this Reifier that match m . |
ExtendedIterator |
findEither(TripleMatch m,
boolean showHidden)
Answer an iterator over the reification triples of this Reifier, or an empty iterator - if showHidden is false, only the exposed triples, otherwise only the concealed ones. |
ExtendedIterator |
findExposed(TripleMatch m)
Answer an iterator over all the reification triples that this Reifier exposes (ie all if Standard, none otherwise) that match m. |
Graph |
getParentGraph()
get the Graph which uses this reifier. |
ReificationStyle |
getStyle()
Answer this reifier's style. |
boolean |
handledAdd(Triple t)
true iff the Reifier has handled an add of the triple _t_. |
boolean |
handledRemove(Triple t)
true iff the Reifier has handled a remove of the triple _t_. |
boolean |
hasTriple(Node n)
true iff _n_ is associated with some triple. |
boolean |
hasTriple(Triple t)
|
Node |
reifyAs(Node n,
Triple t)
note the triple _t_ as reified using _n_ as its representing node. |
void |
remove(Node n,
Triple t)
remove any existing binding for _n_; hasNode(n) will return false and getTriple(n) will return null. |
void |
remove(Triple t)
remove all bindings which map to this triple. |
int |
size()
Answer the number of exposed reification quadlets held in this reifier. |
Methods inherited from interface com.hp.hpl.jena.graph.GetTriple |
---|
getTriple |
Method Detail |
---|
ExtendedIterator find(TripleMatch m)
m
.
ExtendedIterator findExposed(TripleMatch m)
ExtendedIterator findEither(TripleMatch m, boolean showHidden)
int size()
ReificationStyle getStyle()
Graph getParentGraph()
Node reifyAs(Node n, Triple t)
boolean hasTriple(Node n)
boolean hasTriple(Triple t)
ExtendedIterator allNodes()
ExtendedIterator allNodes(Triple t)
void remove(Node n, Triple t)
void remove(Triple t)
boolean handledAdd(Triple t)
boolean handledRemove(Triple t)
void close()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |