Reifier.Util| Constructor and Description |
|---|
BasicFBReifier(BasicForwardRuleInfGraph parent,
Reifier base,
com.hp.hpl.jena.reasoner.rulesys.BasicFBReifier.GetReifier deductions,
ReificationStyle style) |
| Modifier and Type | Method and Description |
|---|---|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Node> |
allNodes()
return an iterator over all the nodes that are reifiying something in
this reifier.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Node> |
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.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
find(TripleMatch m)
Answer an iterator over all the reification triples in this Reifier that match
m. |
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
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.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> |
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.
|
Triple |
getTriple(Node n)
Answer the triple associated with the node
n. |
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.
|
public BasicFBReifier(BasicForwardRuleInfGraph parent, Reifier base, com.hp.hpl.jena.reasoner.rulesys.BasicFBReifier.GetReifier deductions, ReificationStyle style)
public com.hp.hpl.jena.util.iterator.ExtendedIterator<Node> allNodes()
Reifierpublic com.hp.hpl.jena.util.iterator.ExtendedIterator<Node> allNodes(Triple t)
Reifierpublic void close()
Reifierpublic com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> find(TripleMatch m)
Reifierm.public com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> findEither(TripleMatch m, boolean showHidden)
ReifierfindEither in interface Reifierpublic com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> findExposed(TripleMatch m)
ReifierfindExposed in interface Reifierpublic Graph getParentGraph()
ReifiergetParentGraph in interface Reifierpublic ReificationStyle getStyle()
Reifierpublic boolean handledAdd(Triple t)
ReifierhandledAdd in interface Reifierpublic boolean handledRemove(Triple t)
ReifierhandledRemove in interface Reifierpublic boolean hasTriple(Node n)
Reifierpublic boolean hasTriple(Triple t)
public Node reifyAs(Node n, Triple t)
Reifierpublic void remove(Node n, Triple t)
Reifierpublic void remove(Triple t)
Reifierpublic int size()
ReifierLicenced under the Apache License, Version 2.0