java.lang.Object
org.apache.jena.rdf.model.impl.ReifierStd
A Reifier that only supports one style Standard (intercept, no conceal
-- and intercept is a no-op anyway because all triples
appear in the underlying graph for storing all triples).
This exists to give reification style "Standard" semantics primarily for legacy reasons.
-
Method Summary
Modifier and TypeMethodDescriptionstatic ExtendedIterator<Node>
return an iterator over all the nodes that are reifiying something in the graphstatic ExtendedIterator<Node>
return an iterator over all the nodes that are reifiying t in the graphstatic ExtendedIterator<Triple>
findEither
(Graph graph, Triple match, 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.static ExtendedIterator<Triple>
findExposed
(Graph graph, Triple match) Answer an iterator over all the reification triples that this Reifier exposes (ie all if Standard, none otherwise) that match m.static Triple
Answer the triple associated with the noden
.static boolean
true iff _n_ is associated with some triple.static boolean
static Node
note the triple _t_ as reified using _n_ as its representing node.static void
remove any existing binding for _n_; hasNode(n) will return false and getTriple(n) will return null.static void
remove all bindings which map to this triple.
-
Method Details
-
findEither
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. -
findExposed
Answer an iterator over all the reification triples that this Reifier exposes (ie all if Standard, none otherwise) that match m. -
getTriple
Answer the triple associated with the noden
.- Parameters:
n
- the node to use as the key- Returns:
- the associated triple, or
null
if none
-
hasTriple
- Returns:
- true iff there's > 0 mappings to this triple
-
hasTriple
true iff _n_ is associated with some triple. -
allNodes
return an iterator over all the nodes that are reifiying something in the graph -
allNodes
return an iterator over all the nodes that are reifiying t in the graph -
reifyAs
note the triple _t_ as reified using _n_ as its representing node. If _n_ is already reifying something, a AlreadyReifiedException is thrown. -
remove
remove all bindings which map to this triple. -
remove
remove any existing binding for _n_; hasNode(n) will return false and getTriple(n) will return null. This only removes *unique, single* bindings.
-