com.hp.hpl.jena.graph
Interface Reifier

All Superinterfaces:

GetTriple

public interface Reifier

extends GetTriple

Nested Class Summary

static class	Reifier.AlreadyReifiedException The exception raised by reifyAs if a node is already bound to a single reified triple.
static class	Reifier.CannotReifyException The exception thrown by reifyAs if a node is bound to bits and pieces of (an)other triple(s).
static class	Reifier.Style Reification styles have two boolean components: whether the graph+reifier will intercept reification triples or not [if not, the only in-Jena reification is through the reifyAs operation], and whether or not reification triples will be visible in the graph.

Field Summary

static Reifier.Style	Convenient
static Reifier.Style	Minimal
static Node	object
static Node	predicate
static Reifier.Style	Standard
static Node	Statement
static Node	subject
static Node	type

Method Summary

ExtendedIterator	allNodes() return an iterator over all the nodes that are reifiying something in this reifier.
Graph	getHiddenTriples() return a read-only Graph of the triples used for reification.
Graph	getParentGraph() get the Graph which uses this reifier.
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.

Methods inherited from interface com.hp.hpl.jena.graph.GetTriple

getTriple

Field Detail

type

public static final Node type

subject

public static final Node subject

predicate

public static final Node predicate

object

public static final Node object

Statement

public static final Node Statement

Standard

public static final Reifier.Style Standard

Convenient

public static final Reifier.Style Convenient

Minimal

public static final Reifier.Style Minimal

Method Detail

getHiddenTriples

public Graph getHiddenTriples()

return a read-only Graph of the triples used for reification.

getParentGraph

public Graph getParentGraph()

get the Graph which uses this reifier.

reifyAs

public Node reifyAs(Node n,
                    Triple t)

note the triple _t_ as reified using _n_ as its representing node. If _n_ is already reifying something, a AlreadyReifiedException is thrown.

hasTriple

public boolean hasTriple(Node n)

true iff _n_ is associated with some triple.

hasTriple

public boolean hasTriple(Triple t)

Returns:

true iff there's > 0 mappings to this triple

allNodes

public ExtendedIterator allNodes()

return an iterator over all the nodes that are reifiying something in this reifier.

remove

public void remove(Node n,
                   Triple t)

remove any existing binding for _n_; hasNode(n) will return false and getTriple(n) will return null.

remove

public void remove(Triple t)

remove all bindings which map to this triple.

handledAdd

public boolean handledAdd(Triple t)

true iff the Reifier has handled an add of the triple _t_.

handledRemove

public boolean handledRemove(Triple t)

true iff the Reifier has handled a remove of the triple _t_.