| java.lang.Object com.hp.hpl.jena.graph.impl.SimpleReifier
closed | protected boolean closed(Code) | | |
concealing | final protected boolean concealing(Code) | | |
intercepting | final protected boolean intercepting(Code) | | |
SimpleReifier | public SimpleReifier(GraphBase parent, ReificationStyle style)(Code) | | construct a simple reifier that is bound to the parent graph .
Parameters: parent - the Graph which we're reifiying for Parameters: style - the reification style to use |
addFragment | protected void addFragment(ReifierFragmentHandler s, Triple fragment)(Code) | | Add fragment to the fragments already present. This may
create a complete triple, or over-specify.
Parameters: s - Parameters: fragment - |
clear | public void clear()(Code) | | |
close | public void close()(Code) | | Close this reifier - discard (big) resources.
|
getParentGraph | public Graph getParentGraph()(Code) | | return the parent graph we are bound to
|
handledRemove | public boolean handledRemove(Triple fragment)(Code) | | |
hasTriple | public boolean hasTriple(Node n)(Code) | | true iff there is a triple bound to _n_
|
isClosed | public boolean isClosed()(Code) | | Answer true iff this SImpleReifier has been closed.
|
reifyAs | public Node reifyAs(Node tag, Triple toReify)(Code) | | reifiy toReify with tag tag . If a different triple is
already reified under tag , throw an AlreadyReifiedException.
|
reifyNewTriple | protected void reifyNewTriple(Node tag, Triple toReify)(Code) | | Reify toReify under tag ; there is no existing
complete reification. This code goes around the houses by adding the
fragments one-by-one and then seeing if that made a complete reification.
Perhaps there's a better way, but I couldn't see it.
|
remove | public void remove(Node n, Triple t)(Code) | | If n is bound to the triple t, remove that triple. If we're not concealing reification
quadlets, we need to remove them from the parent graph too.
|
toString | public String toString()(Code) | | our string representation is wrapped round the string representation
of our node map.
|
|
|