Interface NodeTable

All Superinterfaces:
org.apache.jena.atlas.lib.Closeable, org.apache.jena.atlas.lib.Sync
All Known Implementing Classes:
NodeTableCache, NodeTableInline, NodeTableLogger, NodeTableNative, NodeTableReadonly, NodeTableWrapper

public interface NodeTable extends org.apache.jena.atlas.lib.Sync, org.apache.jena.atlas.lib.Closeable
Node table - conceptually a two way mapping of Node <-> NodeId where Nodes can be stored and NodeIds allocated.
See Also:
  • Method Summary

    Modifier and Type
    Method
    Description
    Iterator<org.apache.jena.atlas.lib.Pair<NodeId,org.apache.jena.graph.Node>>
    all()
    Iterate over all nodes (not necessarily fast).
    The offset needed to predicate allocation difference between persistent tables - internal function
    boolean
    containsNode(org.apache.jena.graph.Node node)
    Test whether the node table contains an entry for node
    boolean
    Test whether the node table contains an entry for node
    getAllocateNodeId(org.apache.jena.graph.Node node)
    Store the node in the node table (if not already present) and return the allocated Id.
    org.apache.jena.graph.Node
    Look up node id and return the Node - return null if not found
    getNodeIdForNode(org.apache.jena.graph.Node node)
    Look up node and return the NodeId - return NodeId.NodeDoesNotExist if not found
    boolean
    Anything there?
    Return a NodeTable if this instance wraps another, else return null

    Methods inherited from interface org.apache.jena.atlas.lib.Closeable

    close

    Methods inherited from interface org.apache.jena.atlas.lib.Sync

    sync
  • Method Details

    • getAllocateNodeId

      NodeId getAllocateNodeId(org.apache.jena.graph.Node node)
      Store the node in the node table (if not already present) and return the allocated Id.
    • getNodeIdForNode

      NodeId getNodeIdForNode(org.apache.jena.graph.Node node)
      Look up node and return the NodeId - return NodeId.NodeDoesNotExist if not found
    • getNodeForNodeId

      org.apache.jena.graph.Node getNodeForNodeId(NodeId id)
      Look up node id and return the Node - return null if not found
    • containsNode

      boolean containsNode(org.apache.jena.graph.Node node)
      Test whether the node table contains an entry for node
    • containsNodeId

      boolean containsNodeId(NodeId nodeId)
      Test whether the node table contains an entry for node
    • all

      Iterator<org.apache.jena.atlas.lib.Pair<NodeId,org.apache.jena.graph.Node>> all()
      Iterate over all nodes (not necessarily fast). Does not include inlined NodeIds
    • allocOffset

      NodeId allocOffset()
      The offset needed to predicate allocation difference between persistent tables - internal function
    • isEmpty

      boolean isEmpty()
      Anything there?
    • wrapped

      NodeTable wrapped()
      Return a NodeTable if this instance wraps another, else return null