Uses of Class
org.aksw.jena_sparql_api.sparql_path2.PredicateClass

Packages that use PredicateClass

Package	Description
org.aksw.jena_sparql_api_sparql_path2.playground
org.aksw.jena_sparql_api.sparql_path2

Uses of PredicateClass in org.aksw.jena_sparql_api_sparql_path2.playground

Method parameters in org.aksw.jena_sparql_api_sparql_path2.playground with type arguments of type PredicateClass

Modifier and Type	Method	Description
static <S, T> int	EdgeReducer.determineRequiredPredicateDirectionsForRetrieval(org.jgrapht.Graph<S,T> graph, S state, Function<T,PredicateClass> toPredicateClass)	0: no predicates (occurrs e.g.
static <S, T> NfaAnalysisResult<S>	EdgeReducer.estimateFrontierCost(Nfa<S,T> nfa, Predicate<T> isEpsilon, Function<T,PredicateClass> transToPredicateClass, Pair<Map<org.apache.jena.graph.Node,Number>> initPredFreqs, JoinSummaryService joinSummaryService)	- Vertices: are mapped to the estimated set of predicates with their estimated (maximum) frequency - Edge: Their property classes are resolved to explicit sets of predicates.
static <S, T> Map<T,Double>	EdgeReducer.trimPredicates(Nfa<S,T> nfa, Predicate<T> isEpsilon, Function<T,PredicateClass> transitionToPredicateClass, Pair<Map<org.apache.jena.graph.Node,Number>> initDiPredToCost, Map<S,Pair<Map<org.apache.jena.graph.Node,Number>>> stateToDiPredToCost, JoinSummaryService joinSummaryService)	This method takes as input an nfa where edges are labeled with the predicates according to the join summary.

Uses of PredicateClass in org.aksw.jena_sparql_api.sparql_path2

Fields in org.aksw.jena_sparql_api.sparql_path2 declared as PredicateClass

Modifier and Type	Field	Description
protected PredicateClass	PathVisitorPredicateClass.result

Methods in org.aksw.jena_sparql_api.sparql_path2 that return PredicateClass

Modifier and Type	Method	Description
PredicateClass	PathVisitorPredicateClass.getResult()
static PredicateClass	VertexClass.reverse(PredicateClass pc)	Reverse the direction of a predicate class
static PredicateClass	PathVisitorPredicateClass.toPredicateClass(org.apache.jena.sparql.path.P_NegPropSet path)
static PredicateClass	PathVisitorPredicateClass.toPredicateClass(org.apache.jena.sparql.path.P_Path0 path)
static PredicateClass	PathVisitorPredicateClass.transform(org.apache.jena.sparql.path.Path path)

Methods in org.aksw.jena_sparql_api.sparql_path2 that return types with arguments of type PredicateClass

Modifier and Type	Method	Description
static Nfa<Integer,LabeledEdge<Integer,PredicateClass>>	PathCompiler.compileToNfa(org.apache.jena.sparql.path.Path path)

Methods in org.aksw.jena_sparql_api.sparql_path2 with parameters of type PredicateClass

Modifier and Type	Method	Description
static boolean	PredicateClass.matchesStep(PredicateClass pclass, org.apache.jena.sparql.path.P_Path0 step)
static PredicateClass	VertexClass.reverse(PredicateClass pc)	Reverse the direction of a predicate class

Method parameters in org.aksw.jena_sparql_api.sparql_path2 with type arguments of type PredicateClass

Modifier and Type	Method	Description
static boolean	JoinSummaryUtils.existsJoinSummaryPath(Nfa<Integer,LabeledEdge<Integer,PredicateClass>> nfa, Set<Integer> states, org.jgrapht.Graph<org.apache.jena.graph.Node,org.jgrapht.graph.DefaultEdge> joinGraph, org.apache.jena.graph.Node augStart, org.apache.jena.graph.Node augEnd)	Checks whether there exists a path connecting start and end nodes via the nfa
static boolean	JoinSummaryUtils.existsReachability(Nfa<Integer,LabeledEdge<Integer,PredicateClass>> nfa, Set<Integer> states, org.jgrapht.Graph<org.apache.jena.graph.Node,org.jgrapht.graph.DefaultEdge> endAugJoinGraph, org.apache.jena.graph.Node augEnd, org.apache.jena.graph.Node predicate, boolean reverse)	Given a predicate and a direction, determine whether a path exists for this predicate
static List<NestedPath<org.apache.jena.graph.Node,org.jgrapht.graph.DefaultEdge>>	JoinSummaryUtils.findJoinSummaryPaths(Nfa<Integer,LabeledEdge<Integer,PredicateClass>> nfa, Set<Integer> states, org.jgrapht.Graph<org.apache.jena.graph.Node,org.jgrapht.graph.DefaultEdge> joinGraph, org.apache.jena.graph.Node augStart, org.apache.jena.graph.Node augEnd, Long k)