com.hp.hpl.jena.graph
Interface Reifier

All Superinterfaces:
GetTriple

public interface Reifier
extends GetTriple

This interface represents the type of things that can hold reified triples for a Jena Graph.

Author:
kers

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.
 Graph getHiddenTriples()
          return a read-only Graph of the triples used for reification.
 Graph getParentGraph()
          get the Graph which uses this reifier.
 Graph getReificationTriples()
          Answer a read-only graph of all the reification quadlets in 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.
 
Methods inherited from interface com.hp.hpl.jena.graph.GetTriple
getTriple
 

Method Detail

getHiddenTriples

public Graph getHiddenTriples()
return a read-only Graph of the triples used for reification.


getReificationTriples

public Graph getReificationTriples()
Answer a read-only graph of all the reification quadlets in this reifier.


getStyle

public ReificationStyle getStyle()
Answer this reifier's style.


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.


allNodes

public ExtendedIterator allNodes(Triple t)
return an iterator over all the nodes that are reifiying t 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. This only removes *unique, single* bindings.


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_.



Copyright © 2000-2003 Hewlett-Packard. All Rights Reserved.