|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface GraphMaker
A factory for providing instances of named graphs with appropriate storage models. It represents a directory, or a database, or a mapping: names map to graphs for the lifetime of the GraphMaker. Names can be "arbitrary" character sequences.
A GraphMaker has a reification style which is shared by all the graphs it creates.
Method Summary | |
---|---|
void |
close()
Close the factory - no more requests need be honoured, and any clean-up can be done. |
Graph |
createGraph()
Answer a graph who's name isn't interesting. |
Graph |
createGraph(java.lang.String name)
Create a graph that does not already exist - equivalent to createGraph( name, false ) . |
Graph |
createGraph(java.lang.String name,
boolean strict)
Create a new graph associated with the given name. |
Graph |
getGraph()
Answer the default graph of this GraphMaker. |
ReificationStyle |
getReificationStyle()
Answer the reification style of all the graphs that this GraphMaker constructs. |
boolean |
hasGraph(java.lang.String name)
return true iff the factory has a graph with the given name |
com.hp.hpl.jena.util.iterator.ExtendedIterator<java.lang.String> |
listGraphs()
Answer an [extended] iterator where each element is the name of a graph in the maker, and the complete sequence exhausts the set of names. |
Graph |
openGraph()
Answer the default graph of this GraphMaker, if it has one. |
Graph |
openGraph(java.lang.String name)
Equivalent to openGraph( name, false ) |
Graph |
openGraph(java.lang.String name,
boolean strict)
Find an existing graph that this factory knows about under the given name. |
void |
removeGraph(java.lang.String name)
Remove the association between the name and the graph. |
Method Detail |
---|
ReificationStyle getReificationStyle()
Graph getGraph()
Graph openGraph()
Graph createGraph()
Graph createGraph(java.lang.String name, boolean strict)
strict
is false, return the associated graph. Otherwise throw an AlreadyExistsException.
name
- the name to give to the new graphstrict
- true to cause existing bindings to throw an exception
AlreadyExistsException
- if that name is already bound.Graph createGraph(java.lang.String name)
createGraph( name, false )
.
Graph openGraph(java.lang.String name, boolean strict)
strict
is false, create a new graph, associate it with the name, and return it.
Otherwise throw a DoesNotExistException.
name
- the name of the graph to find and returnstrict
- false to create a new one if one doesn't already exist
DoesNotExistException
- if there's no such named graphGraph openGraph(java.lang.String name)
openGraph( name, false )
void removeGraph(java.lang.String name)
name
- the name to disassociate
DoesNotExistException
- if the name is unboundboolean hasGraph(java.lang.String name)
name
- the name of the graph to look for
void close()
com.hp.hpl.jena.util.iterator.ExtendedIterator<java.lang.String> listGraphs()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |