Package org.apache.jena.rdf.model.impl

Class ReifierStd

  • public class ReifierStd
extends java.lang.Object
    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

      All Methods Static Methods Concrete Methods 
      Modifier and Type Method Description
      static ExtendedIterator<Node> allNodes​(Graph graph)
      return an iterator over all the nodes that are reifiying something in the graph
      static ExtendedIterator<Node> allNodes​(Graph graph, Triple t)
      return an iterator over all the nodes that are reifiying t in the graph
      static 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 getTriple​(Graph graph, Node n)
      Answer the triple associated with the node n.
      static boolean hasTriple​(Graph graph, Node node)
      true iff _n_ is associated with some triple.
      static boolean hasTriple​(Graph graph, Triple t)  
      static Node reifyAs​(Graph graph, Node node, Triple triple)
      note the triple _t_ as reified using _n_ as its representing node.
      static void remove​(Graph graph, Node node, Triple triple)
      remove any existing binding for _n_; hasNode(n) will return false and getTriple(n) will return null.
      static void remove​(Graph graph, Triple triple)
      remove all bindings which map to this triple.

      • Methods inherited from class java.lang.Object

        equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

    • Method Detail

      • findEither

        public static 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.

      • findExposed

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

      • getTriple

        public static Triple getTriple​(Graph graph,
                               Node n)
        Answer the triple associated with the node n.
        Parameters:
        n - the node to use as the key
        Returns:
        the associated triple, or null if none

      • hasTriple

        public static boolean hasTriple​(Graph graph,
                                Triple t)
        Returns:
        true iff there's > 0 mappings to this triple

      • hasTriple

        public static boolean hasTriple​(Graph graph,
                                Node node)
        true iff _n_ is associated with some triple.

      • allNodes

        public static ExtendedIterator<Node> allNodes​(Graph graph)
        return an iterator over all the nodes that are reifiying something in the graph

      • allNodes

        public static ExtendedIterator<Node> allNodes​(Graph graph,
                                              Triple t)
        return an iterator over all the nodes that are reifiying t in the graph

      • reifyAs

        public static Node reifyAs​(Graph graph,
                           Node node,
                           Triple triple)
        note the triple _t_ as reified using _n_ as its representing node. If _n_ is already reifying something, a AlreadyReifiedException is thrown.

      • remove

        public static void remove​(Graph graph,
                          Triple triple)
        remove all bindings which map to this triple.

      • remove

        public static void remove​(Graph graph,
                          Node node,
                          Triple triple)
        remove any existing binding for _n_; hasNode(n) will return false and getTriple(n) will return null. This only removes *unique, single* bindings.