Class ReifierStd


public class ReifierStd extends Object
Library support for reification.
  • Method Details

    • findEither

      public static ExtendedIterator<Triple> findEither(Graph graph, Triple match, boolean showHidden)
      Answer an iterator over the reification triples of the graph, 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 match.
    • getTriple

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

      public static boolean hasTriple(Graph graph, Triple t)
      true iff there are > 0 reification quads for the triple.
    • hasTriple

      public static boolean hasTriple(Graph graph, Node node)
      true iff _n_ is associated with some triple rfication
    • 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 refications 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.