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

Packages that use Pair

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

Uses of Pair in org.aksw.jena_sparql_api_sparql_path2.playground

Fields in org.aksw.jena_sparql_api_sparql_path2.playground with type parameters of type Pair

Modifier and Type	Field	Description
Map<S,Pair<Map<org.apache.jena.graph.Node,Number>>>	NfaAnalysisResult.stateToDiPredToCost

Methods in org.aksw.jena_sparql_api_sparql_path2.playground with parameters of type Pair

Modifier and Type	Method	Description
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 <T, V, E> boolean	NfaDijkstra.isOrigin(Pair<ValueSet<V>> vertexClass, V vertex, org.aksw.commons.util.triplet.Triplet<V,E> triplet)	Check whether a triplet originated from a certain transition
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.

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

Modifier and Type	Method	Description
static <S, T, V, E> org.aksw.commons.util.triplet.TripletPath<V,E>	NfaDijkstra.dijkstra(Nfa<S,T> nfa, Predicate<T> isEpsilon, Function<T,Pair<ValueSet<V>>> transToVertexClass, Function<Pair<ValueSet<V>>,Function<? super Iterable<V>,Map<V,Set<org.aksw.commons.util.triplet.Triplet<V,E>>>>> createTripletLookupService, V source, V target)	Finds the shortest path connecting the source and target nodes in accordance with an nfa
static <S, T, V, E> List<org.aksw.commons.util.triplet.TripletPath<Map.Entry<S,V>,org.aksw.commons.util.Directed<E>>>	YensKShortestPaths.findPaths(Nfa<S,T> nfa, Predicate<T> isEpsilon, Function<T,? extends Pair<ValueSet<V>>> transToVertexClass, Function<Pair<ValueSet<V>>,? extends Function<? super Iterable<V>,Map<V,Set<org.aksw.commons.util.triplet.Triplet<V,E>>>>> createTripletLookupService, V source, V target, int maxK)
static <S, T, V, E> Map<Map.Entry<S,V>,Set<org.aksw.commons.util.triplet.Triplet<Map.Entry<S,V>,org.aksw.commons.util.Directed<E>>>>	NfaDijkstra.getSuccessors(Nfa<S,T> nfa, Predicate<T> isEpsilon, Function<T,? extends Pair<ValueSet<V>>> transToVertexClass, Function<Pair<ValueSet<V>>,? extends Function<? super Iterable<V>,Map<V,Set<org.aksw.commons.util.triplet.Triplet<V,E>>>>> createTripletLookupService, Iterable<Map.Entry<S,V>> stateVertexPairs)	Note: When when requesting successors of a vertex, the state component will be resolved to non-epsilon state, and the result will be accociated back with the requested state Note: we could require T to be T extends Pair<ValueSet>
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.

Constructor parameters in org.aksw.jena_sparql_api_sparql_path2.playground with type arguments of type Pair

Modifier	Constructor	Description
	NfaAnalysisResult(Map<S,Pair<Map<org.apache.jena.graph.Node,Number>>> stateToDiPredToCost, org.jgrapht.Graph<org.apache.jena.graph.Node,org.jgrapht.graph.DefaultEdge> joinGraph)

Uses of Pair in org.aksw.jena_sparql_api.sparql_path2

Subclasses of Pair in org.aksw.jena_sparql_api.sparql_path2

Modifier and Type	Class	Description
class	PredicateClass	The main reason this class extends pair is to have the list interface which allows iterating the directions with get(0) and get(1)
class	VertexClass<V>	The main reason this class extends pair is to have the list interface which allows iterating the directions with get(0) and get(1)

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

Modifier and Type	Method	Description
static <T> Pair<T>	Pair.create(T key, T value)
static <S, D, T extends LabeledEdge<S, ? extends org.aksw.commons.util.Directed<? extends ValueSet<D>>>> Pair<ValueSet<D>>	NfaExecutionUtils.extractNextPropertyClasses(org.jgrapht.Graph<S,T> nfaGraph, Predicate<T> isEpsilon, Set<S> states, boolean reverse)

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

Modifier and Type	Method	Description
static void	PathVisitorResourceShapeBuilder.apply(ResourceShapeBuilder rsb, Pair<ValueSet<org.apache.jena.graph.Node>> predicateClass, boolean reverse)
static <S, T> org.aksw.commons.rx.lookup.LookupService<org.apache.jena.graph.Node,Set<org.aksw.commons.util.triplet.Triplet<org.apache.jena.graph.Node,org.apache.jena.graph.Node>>>	PathExecutionUtils.createLookupService(org.aksw.jenax.dataaccess.sparql.factory.execution.query.QueryExecutionFactoryQuery qef, Pair<ValueSet<org.apache.jena.graph.Node>> predicateClass)	A function that creates a lookup service for a given qef and predicate class
static <S, T, P, Q> boolean	NfaExecutionUtils.isTargetReachable(Nfa<S,T> nfa, Predicate<T> isEpsilon, Set<S> states, BiPredicate<org.aksw.commons.util.Directed<T>,Q> matcher, org.jgrapht.Graph<P,Q> joinGraph, org.aksw.commons.util.Directed<P> diPredicate, Pair<Set<P>> targetPreds)	Given - an nfa and - join graph, determine for a given - predicate (pointing either forwards or backwards) in a certain set of //nestedPath in a certain set of - nfa states of whether it can reach the - set of predicates leading to the target states.
static <V> VertexClass<V>	VertexClass.merge(Pair<ValueSet<V>> a, Pair<ValueSet<V>> b, BinaryOperator<ValueSet<V>> op)
static <V> VertexClass<V>	VertexClass.union(Pair<ValueSet<V>> a, Pair<ValueSet<V>> b)