| com.hp.hpl.jena.reasoner.BaseInfGraph
 com.hp.hpl.jena.reasoner.transitiveReasoner.TransitiveInfGraph
| TransitiveInfGraph | | public class TransitiveInfGraph extends BaseInfGraph (Code) | | Implementation of InfGraph used by the TransitiveReasoner.
This is returned by the TransitiveReasoner when a data graph
(together with an optional schema) has been bound.
The cached property and class graphs are calculated by the
reasoner when the schema is bound. If the data graph does not
include schema information then the caches generated at
schema binding stage are reused here. Otherwise the caches
are regenerated.
author:
Dave Reynolds
version:
$Revision: 1.25 $ on $Date: 2008/01/02 12:07:50 $ |
| dataFind | | protected Finder dataFind(Code) | | The combined data and schema finder
|
| tbox | | protected Finder tbox(Code) | | The graph registered as the schema, if any
|
| transitiveEngine | | protected TransitiveEngine transitiveEngine(Code) | | The paire of subclass and subproperty lattices
|
| TransitiveInfGraph | | public TransitiveInfGraph(Graph data, TransitiveReasoner reasoner)(Code) | | Constructor. Called by the TransitiveReasoner when it
is bound to a data graph.
Parameters:
reasoner - the parent instance of the transitive reasoner,including any precomputed class and property caches
Parameters:
data - the data graph being bound in. |
| find | | public ExtendedIterator find(TriplePattern pattern)(Code) | | Basic pattern lookup interface.
Parameters:
pattern - a TriplePattern to be matched against the data a ExtendedIterator over all Triples in the data setthat match the pattern |
| findWithContinuation | | public ExtendedIterator findWithContinuation(TriplePattern pattern, Finder continuation)(Code) | | Extended find interface used in situations where the implementator
may or may not be able to answer the complete query. It will
attempt to answer the pattern but if its answers are not known
to be complete then it will also pass the request on to the nested
Finder to append more results.
Parameters:
pattern - a TriplePattern to be matched against the data
Parameters:
continuation - either a Finder or a normal Graph whichwill be asked for additional match results if the implementormay not have completely satisfied the query. |
| getCapabilities | | public Capabilities getCapabilities()(Code) | | Answer the InfCapabilities of this InfGraph.
|
| getSchemaGraph | | public Graph getSchemaGraph()(Code) | | Return the schema graph, if any, bound into this inference graph.
|
| performAdd | | public synchronized void performAdd(Triple t)(Code) | | Add one triple to the data graph, run any rules triggered by
the new data item, recursively adding any generated triples.
|
| performDelete | | public void performDelete(Triple t)(Code) | | Removes the triple t (if possible) from the set belonging to this graph.
|
| prepare | | public void prepare()(Code) | | Perform any initial processing and caching. This call is optional. Most
engines either have negligable set up work or will perform an implicit
"prepare" if necessary. The call is provided for those occasions where
substantial preparation work is possible (e.g. running a forward chaining
rule system) and where an application might wish greater control over when
this prepration is done.
|
|
|