| 
|||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||||
A factory for providing instances of graphs with appropriate storage models. It is not part of the contract for this factory that each instance is unique; some applications may legitimately want to write triples into a single graph (such as a database).
Updated by kers; added methods that create or locate named graphs.
| Method Summary | |
 void | 
close()
Close the factory - no more requests need be honoured, and any clean-up can be done.  | 
 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 an instance of a graph  | 
 boolean | 
hasGraph(java.lang.String name)
return true iff the factory has a graph with the given name  | 
 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. create will now be able to create a graph with that name, and open will no longer be able to find it.  | 
| Method Detail | 
public Graph getGraph()
Answer an instance of a graph
public 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.public Graph createGraph(java.lang.String name)
createGraph( name, false ).
public 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 graphpublic Graph openGraph(java.lang.String name)
openGraph( name, false )
public void removeGraph(java.lang.String name)
name - the name to disassociate
DoesNotExistException - if the name is unboundpublic boolean hasGraph(java.lang.String name)
name - the name of the graph to look for
public void close()
  | 
|||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||||