|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Mapping | |
---|---|
com.hp.hpl.jena.graph.query | Defines the graph-level Query classes, allowing multi-pattern query over arbitrary graphs. |
Uses of Mapping in com.hp.hpl.jena.graph.query |
---|
Methods in com.hp.hpl.jena.graph.query with parameters of type Mapping | |
---|---|
static QueryNode |
QueryNode.classify(QueryNodeFactory f,
Mapping map,
Set<Node> recent,
Node n)
Answer a QueryNode that classifies the argument node n . |
static QueryTriple |
QueryTriple.classify(QueryNodeFactory f,
Mapping m,
Triple t)
|
static QueryTriple[] |
QueryTriple.classify(QueryNodeFactory f,
Mapping m,
Triple[] t)
|
static Pattern[] |
PatternStageCompiler.compile(PatternCompiler compiler,
Mapping map,
Triple[] source)
to compile an array of triples, compile each triple and form the corresponding array of Patterns. |
ValuatorSet[] |
GuardArranger.makeGuards(Mapping map,
ExpressionSet constraints)
|
Stage |
SimpleQueryHandler.patternStage(Mapping map,
ExpressionSet constraints,
Triple[] t)
|
Stage |
QueryHandler.patternStage(Mapping map,
ExpressionSet constraints,
Triple[] p)
produce a single Stage which will probe the underlying graph for triples matching p and inject all the resulting bindings into the processing stream (see Stage for details) |
Constructors in com.hp.hpl.jena.graph.query with parameters of type Mapping | |
---|---|
ConstraintStage(Mapping map,
ExpressionSet constraint)
Initialise this ConstraintStage with the mapping [from names to indexes] and ExpressionSet [the constraint expressions] that will be evaluated when the constraint stage runs. |
|
PatternStage(Graph graph,
Mapping map,
ExpressionSet constraints,
Triple[] triples)
|
|
PatternStageBase(QueryNodeFactory factory,
Graph graph,
Mapping map,
ExpressionSet constraints,
Triple[] triples)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |