Uses of Interface
com.hp.hpl.jena.reasoner.Finder

Packages that use Finder
com.hp.hpl.jena.reasoner The Jena2 reasoner subsystem is designed to allow a range of inference engines to be plugged into Jena. 
com.hp.hpl.jena.reasoner.rulesys Provides a selection of simple rule engines for Jena inference models. 
com.hp.hpl.jena.reasoner.transitiveReasoner This package contains a reasoner which supports transitive-reflexive closure of subPropertyOf and subClassOf relations. 
 

Uses of Finder in com.hp.hpl.jena.reasoner
 

Classes in com.hp.hpl.jena.reasoner that implement Finder
 class FGraph
          Wrapper round a Graph to implement the slighly modified Finder interface.
 

Methods in com.hp.hpl.jena.reasoner that return Finder
static Finder FinderUtil.cascade(Finder first, Finder second)
          Create a continuation object which is a cascade of two continuation objects.
static Finder FinderUtil.cascade(Finder first, Finder second, Finder third)
          Create a continuation object which is a cascade of three continuation objects.
static Finder FinderUtil.cascade(Finder first, Finder second, Finder third, Finder fourth)
          Create a continuation object which is a cascade of four continuation objects.
 

Methods in com.hp.hpl.jena.reasoner with parameters of type Finder
static Finder FinderUtil.cascade(Finder first, Finder second)
          Create a continuation object which is a cascade of two continuation objects.
static Finder FinderUtil.cascade(Finder first, Finder second, Finder third)
          Create a continuation object which is a cascade of three continuation objects.
static Finder FinderUtil.cascade(Finder first, Finder second, Finder third, Finder fourth)
          Create a continuation object which is a cascade of four continuation objects.
 com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> Finder.findWithContinuation(TriplePattern pattern, Finder continuation)
          Extended find interface used in situations where the implementator may or may not be able to answer the complete query.
 com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> FGraph.findWithContinuation(TriplePattern pattern, Finder continuation)
          Extended find interface used in situations where the implementator may or may not be able to answer the complete query.
abstract  com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> BaseInfGraph.findWithContinuation(TriplePattern pattern, Finder continuation)
          Extended find interface used in situations where the implementator may or may not be able to answer the complete query.
 

Uses of Finder in com.hp.hpl.jena.reasoner.rulesys
 

Methods in com.hp.hpl.jena.reasoner.rulesys with parameters of type Finder
 com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> LPBackwardRuleInfGraph.findWithContinuation(TriplePattern pattern, Finder continuation)
          Extended find interface used in situations where the implementator may or may not be able to answer the complete query.
 com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> FBRuleInfGraph.findWithContinuation(TriplePattern pattern, Finder continuation)
          Extended find interface used in situations where the implementator may or may not be able to answer the complete query.
 com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> BasicForwardRuleInfGraph.findWithContinuation(TriplePattern pattern, Finder continuation)
          Extended find interface used in situations where the implementator may or may not be able to answer the complete query.
static Node Util.getPropValue(Node root, Node prop, Finder context)
          Helper - returns the (singleton) value for the given property on the given root node in the data graph.
 void RulePreprocessHook.run(FBRuleInfGraph infGraph, Finder dataFind, Graph inserts)
          Invoke the preprocessing hook.
 

Uses of Finder in com.hp.hpl.jena.reasoner.transitiveReasoner
 

Classes in com.hp.hpl.jena.reasoner.transitiveReasoner that implement Finder
 class TransitiveGraphCache
          Datastructure used to represent a closed transitive reflexive relation.
 

Methods in com.hp.hpl.jena.reasoner.transitiveReasoner that return Finder
 Finder TransitiveEngine.getFinder(TriplePattern pattern, Finder continuation)
          Return a Finder instance appropriate for the given query.
 Finder TransitiveReasoner.getTbox()
          Accessor used during infgraph construction - return the partially bound tbox, if any.
 Finder TransitiveEngine.insert(Finder baseData, FGraph newData)
          Prepare the engine by inserting any new data not already included in the existing caches.
 

Methods in com.hp.hpl.jena.reasoner.transitiveReasoner with parameters of type Finder
 boolean TransitiveGraphCache.cacheAll(Finder graph, Node predicate)
          Cache all instances of the given predicate which are present in the given Graph.
static boolean TransitiveEngine.cacheSubClassUtility(Finder graph, TransitiveGraphCache spCache, TransitiveGraphCache scCache)
          Caches all subClass declarations, including those that are defined via subProperties of subClassOf.
static boolean TransitiveEngine.cacheSubPropUtility(Finder graph, TransitiveGraphCache spCache)
          Caches all subPropertyOf declarations, including any meta level ones (subPropertyOf subPropertyOf).
 com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> TransitiveInfGraph.findWithContinuation(TriplePattern pattern, Finder continuation)
          Extended find interface used in situations where the implementator may or may not be able to answer the complete query.
 com.hp.hpl.jena.util.iterator.ExtendedIterator<Triple> TransitiveGraphCache.findWithContinuation(TriplePattern pattern, Finder continuation)
          Extended find interface used in situations where the implementator may or may not be able to answer the complete query.
 Finder TransitiveEngine.getFinder(TriplePattern pattern, Finder continuation)
          Return a Finder instance appropriate for the given query.
 Finder TransitiveEngine.insert(Finder baseData, FGraph newData)
          Prepare the engine by inserting any new data not already included in the existing caches.
 



Copyright © 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 Hewlett-Packard Development Company, LP