Docjar: A Java Source and Docuemnt Enginecom.*    java.*    javax.*    org.*    all    new    plug-in

Quick Search    Search Deep

com.hp.hpl.jena.graph
Interface Reifier  view Reifier download Reifier.java

All Superinterfaces:
GetTriple

public interface Reifier
extends GetTriple

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


Method Summary
 com.hp.hpl.jena.util.iterator.ExtendedIterator allNodes()
          return an iterator over all the nodes that are reifiying something in this reifier.
 com.hp.hpl.jena.util.iterator.ExtendedIterator 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 find(TripleMatch m)
          Answer an iterator over all the reification triples in this Reifier that match m.
 com.hp.hpl.jena.util.iterator.ExtendedIterator 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 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.
 com.hp.hpl.jena.shared.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.
 int size()
          Answer the number of exposed reification quadlets held in this reifier.
 
Methods inherited from interface com.hp.hpl.jena.graph.GetTriple
getTriple
 

Method Detail

find

public com.hp.hpl.jena.util.iterator.ExtendedIterator find(TripleMatch m)
Answer an iterator over all the reification triples in this Reifier that match m.


findExposed

public com.hp.hpl.jena.util.iterator.ExtendedIterator findExposed(TripleMatch m)
Answer an iterator over all the reification triples that this Reifier exposes (ie all if Standard, none otherwise) that match m.


findEither

public com.hp.hpl.jena.util.iterator.ExtendedIterator 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.


size

public int size()
Answer the number of exposed reification quadlets held in this reifier.


getStyle

public com.hp.hpl.jena.shared.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)

allNodes

public com.hp.hpl.jena.util.iterator.ExtendedIterator allNodes()
return an iterator over all the nodes that are reifiying something in this reifier.


allNodes

public com.hp.hpl.jena.util.iterator.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_.


close

public void close()
The reifier will no longer be used. Further operations on it are not defined by this interface.