|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectcom.hp.hpl.jena.sparql.graph.GraphBase2
public abstract class GraphBase2
| Field Summary |
|---|
| Fields inherited from interface com.hp.hpl.jena.graph.Graph |
|---|
emptyGraph |
| Constructor Summary | |
|---|---|
GraphBase2()
Initialise this graph |
|
| Method Summary | |
|---|---|
void |
add(com.hp.hpl.jena.graph.Triple t)
Add a triple, and notify the event manager. |
void |
close()
Close this graph. |
boolean |
contains(com.hp.hpl.jena.graph.Node s,
com.hp.hpl.jena.graph.Node p,
com.hp.hpl.jena.graph.Node o)
Answer true if this graph contains (s, p, o);
this canonical implementation cannot be over-ridden. |
boolean |
contains(com.hp.hpl.jena.graph.Triple t)
Answer true iff t is in the graph as revealed by
find(t) being non-empty. |
void |
delete(com.hp.hpl.jena.graph.Triple t)
Delete a triple, and notify the event manager. |
boolean |
dependsOn(com.hp.hpl.jena.graph.Graph other)
Default implementation answers true iff this graph is the
same graph as the argument graph. |
com.hp.hpl.jena.util.iterator.ExtendedIterator<com.hp.hpl.jena.graph.Triple> |
find(com.hp.hpl.jena.graph.Node s,
com.hp.hpl.jena.graph.Node p,
com.hp.hpl.jena.graph.Node o)
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<com.hp.hpl.jena.graph.Triple> |
find(com.hp.hpl.jena.graph.TripleMatch m)
Answer an (extended) iterator over all the triples in this Graph matching m. |
com.hp.hpl.jena.util.iterator.ExtendedIterator<com.hp.hpl.jena.graph.Triple> |
forTestingOnly_graphBaseFind(com.hp.hpl.jena.graph.TripleMatch tm)
|
com.hp.hpl.jena.graph.BulkUpdateHandler |
getBulkUpdateHandler()
Answer a BulkUpdateHandler bound to this graph. |
com.hp.hpl.jena.graph.Capabilities |
getCapabilities()
Answer the capabilities of this graph; the default is an AllCapabilities object (the same one each time, not that it matters - Capabilities should be immutable). |
com.hp.hpl.jena.graph.GraphEventManager |
getEventManager()
Answer the event manager for this graph; allocate a new one if required. |
com.hp.hpl.jena.shared.PrefixMapping |
getPrefixMapping()
Answer the PrefixMapping object for this graph, the same one each time. |
com.hp.hpl.jena.graph.Reifier |
getReifier()
Answer this graph's reifier. |
com.hp.hpl.jena.graph.GraphStatisticsHandler |
getStatisticsHandler()
|
com.hp.hpl.jena.graph.TransactionHandler |
getTransactionHandler()
Answer a transaction handler bound to this graph. |
boolean |
isClosed()
|
boolean |
isEmpty()
Answer true iff this graph contains no triples (hidden reification quads do not count). |
boolean |
isIsomorphicWith(com.hp.hpl.jena.graph.Graph g)
Answer true iff this graph is isomorphic to g according to
the algorithm (indeed, method) in GraphMatcher. |
void |
notifyAdd(com.hp.hpl.jena.graph.Triple t)
Tell the event manager that the triple t has been added to the graph. |
void |
notifyDelete(com.hp.hpl.jena.graph.Triple t)
Tell the event manager that the triple t has been deleted from the
graph. |
void |
performAdd(com.hp.hpl.jena.graph.Triple t)
Add a triple to the triple store. |
void |
performDelete(com.hp.hpl.jena.graph.Triple t)
Remove a triple from the triple store. |
abstract com.hp.hpl.jena.graph.query.QueryHandler |
queryHandler()
Answer a QueryHandler bound to this graph. |
int |
size()
Answer the size of this graph (ie the number of exposed triples). |
String |
toString()
Answer a human-consumable representation of this graph. |
| Methods inherited from class java.lang.Object |
|---|
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Constructor Detail |
|---|
public GraphBase2()
| Method Detail |
|---|
public void close()
close in interface com.hp.hpl.jena.graph.Graphpublic boolean isClosed()
isClosed in interface com.hp.hpl.jena.graph.Graphpublic boolean dependsOn(com.hp.hpl.jena.graph.Graph other)
true iff this graph is the
same graph as the argument graph.
dependsOn in interface com.hp.hpl.jena.graph.Graphpublic abstract com.hp.hpl.jena.graph.query.QueryHandler queryHandler()
queryHandler in interface com.hp.hpl.jena.graph.Graphpublic com.hp.hpl.jena.graph.GraphStatisticsHandler getStatisticsHandler()
getStatisticsHandler in interface com.hp.hpl.jena.graph.Graphpublic com.hp.hpl.jena.graph.GraphEventManager getEventManager()
getEventManager in interface com.hp.hpl.jena.graph.Graphpublic void notifyAdd(com.hp.hpl.jena.graph.Triple t)
t has been added to the graph.
public void notifyDelete(com.hp.hpl.jena.graph.Triple t)
t has been deleted from the
graph.
public com.hp.hpl.jena.graph.TransactionHandler getTransactionHandler()
getTransactionHandler in interface com.hp.hpl.jena.graph.Graphpublic com.hp.hpl.jena.graph.BulkUpdateHandler getBulkUpdateHandler()
getBulkUpdateHandler in interface com.hp.hpl.jena.graph.Graphpublic com.hp.hpl.jena.graph.Capabilities getCapabilities()
getCapabilities in interface com.hp.hpl.jena.graph.Graphpublic com.hp.hpl.jena.shared.PrefixMapping getPrefixMapping()
getPrefixMapping in interface com.hp.hpl.jena.graph.Graphpublic void add(com.hp.hpl.jena.graph.Triple t)
add in interface com.hp.hpl.jena.graph.GraphAddpublic void performAdd(com.hp.hpl.jena.graph.Triple t)
performAdd in interface com.hp.hpl.jena.graph.impl.GraphWithPerformpublic final void delete(com.hp.hpl.jena.graph.Triple t)
delete in interface com.hp.hpl.jena.graph.Graphpublic void performDelete(com.hp.hpl.jena.graph.Triple t)
performDelete in interface com.hp.hpl.jena.graph.impl.GraphWithPerformpublic final com.hp.hpl.jena.util.iterator.ExtendedIterator<com.hp.hpl.jena.graph.Triple> find(com.hp.hpl.jena.graph.TripleMatch m)
m. Subclasses cannot over-ride this, because it implements
the appending of reification quadlets; instead they must implement
graphBaseFind(TripleMatch).
find in interface com.hp.hpl.jena.graph.Graphpublic com.hp.hpl.jena.util.iterator.ExtendedIterator<com.hp.hpl.jena.graph.Triple> forTestingOnly_graphBaseFind(com.hp.hpl.jena.graph.TripleMatch tm)
public final com.hp.hpl.jena.util.iterator.ExtendedIterator<com.hp.hpl.jena.graph.Triple> find(com.hp.hpl.jena.graph.Node s,
com.hp.hpl.jena.graph.Node p,
com.hp.hpl.jena.graph.Node o)
find in interface com.hp.hpl.jena.graph.Graphpublic final boolean contains(com.hp.hpl.jena.graph.Triple t)
true iff t is in the graph as revealed by
find(t) being non-empty. t may contain ANY
wildcards. Sub-classes may over-ride reifierContains and graphBaseContains
for efficiency.
contains in interface com.hp.hpl.jena.graph.Graph
public final boolean contains(com.hp.hpl.jena.graph.Node s,
com.hp.hpl.jena.graph.Node p,
com.hp.hpl.jena.graph.Node o)
true if this graph contains (s, p, o);
this canonical implementation cannot be over-ridden.
contains in interface com.hp.hpl.jena.graph.Graphpublic com.hp.hpl.jena.graph.Reifier getReifier()
constructReifier instead.
getReifier in interface com.hp.hpl.jena.graph.Graphpublic final int size()
size in interface com.hp.hpl.jena.graph.Graphpublic boolean isEmpty()
size() == 0, which is
fine if size is reasonable efficient. Subclasses may override
if necessary. This method may become final and defined in terms of other
methods.
isEmpty in interface com.hp.hpl.jena.graph.Graphpublic boolean isIsomorphicWith(com.hp.hpl.jena.graph.Graph g)
g according to
the algorithm (indeed, method) in GraphMatcher.
isIsomorphicWith in interface com.hp.hpl.jena.graph.Graphpublic String toString()
toString in class Object
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||