Package org.topbraid.jenax.util
Class JenaUtilHelper
java.lang.Object
org.topbraid.jenax.util.JenaUtilHelper
This is an extension point for the SPIN library
allowing modification of some low level utilities
that are exposed through
JenaUtil.
Note: Unstable - should not be used outside of TopBraid.- Author:
- Jeremy Carroll
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionorg.apache.jena.graph.GraphasReadOnlyGraph(org.apache.jena.graph.Graph g) org.apache.jena.rdf.model.ModelasReadOnlyModel(org.apache.jena.rdf.model.Model m) org.apache.jena.graph.Graphorg.apache.jena.graph.GraphA memory graph with no reification.org.apache.jena.graph.compose.MultiUnionReturn a multiunion.org.apache.jena.graph.compose.MultiUnioncreateMultiUnion(Iterator<org.apache.jena.graph.Graph> graphs) Return a multiunion, initialized with the given graphs.org.apache.jena.graph.compose.MultiUnioncreateMultiUnion(org.apache.jena.graph.Graph[] graphs) Return a multiunion, initialized with the given graphs.org.apache.jena.ontology.OntModelcreateOntologyModel(org.apache.jena.ontology.OntModelSpec spec, org.apache.jena.rdf.model.Model base) org.apache.jena.graph.GraphdeepCloneReadOnlyGraph(org.apache.jena.graph.Graph g) booleanisMemoryGraph(org.apache.jena.graph.Graph graph) Returns true if optimizations for faster graphs should be applied; false if graph is slower.voidsetGraphReadOptimization(boolean b)
-
Constructor Details
-
JenaUtilHelper
public JenaUtilHelper()
-
-
Method Details
-
createMultiUnion
public org.apache.jena.graph.compose.MultiUnion createMultiUnion()Return a multiunion.- Returns:
- the MultiUnion graph
-
createMultiUnion
public org.apache.jena.graph.compose.MultiUnion createMultiUnion(Iterator<org.apache.jena.graph.Graph> graphs) Return a multiunion, initialized with the given graphs.- Parameters:
graphs- the Graphs to convert- Returns:
- the MultiUnion graph
-
createMultiUnion
public org.apache.jena.graph.compose.MultiUnion createMultiUnion(org.apache.jena.graph.Graph[] graphs) Return a multiunion, initialized with the given graphs.- Parameters:
graphs- the Graphs to convert- Returns:
- the MultiUnion graph
-
createDefaultGraph
public org.apache.jena.graph.Graph createDefaultGraph()A memory graph with no reification.- Returns:
- the default Graph
-
isMemoryGraph
public boolean isMemoryGraph(org.apache.jena.graph.Graph graph) Returns true if optimizations for faster graphs should be applied; false if graph is slower. A typical fast graph is stored in memory, a typical slow graph is stored in a database. The calling codeJenaUtil.isMemoryGraph(Graph)deals withMultiUnions by taking the logical AND of the subgraphs.- Parameters:
graph- A simple graph, not aMultiUnion- Returns:
- true if the graph is fast
-
asReadOnlyModel
public org.apache.jena.rdf.model.Model asReadOnlyModel(org.apache.jena.rdf.model.Model m) -
asReadOnlyGraph
public org.apache.jena.graph.Graph asReadOnlyGraph(org.apache.jena.graph.Graph g) -
createOntologyModel
public org.apache.jena.ontology.OntModel createOntologyModel(org.apache.jena.ontology.OntModelSpec spec, org.apache.jena.rdf.model.Model base) -
createConcurrentGraph
public org.apache.jena.graph.Graph createConcurrentGraph() -
setGraphReadOptimization
public void setGraphReadOptimization(boolean b) -
deepCloneReadOnlyGraph
public org.apache.jena.graph.Graph deepCloneReadOnlyGraph(org.apache.jena.graph.Graph g)
-