本文整理汇总了Java中com.hp.hpl.jena.sparql.algebra.op.OpUnion类的典型用法代码示例。如果您正苦于以下问题:Java OpUnion类的具体用法?Java OpUnion怎么用?Java OpUnion使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
OpUnion类属于com.hp.hpl.jena.sparql.algebra.op包,在下文中一共展示了OpUnion类的12个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于我们的系统推荐出更棒的Java代码示例。
示例1: transform
import com.hp.hpl.jena.sparql.algebra.op.OpUnion; //导入依赖的package包/类
@Override
public Op transform(OpUnion opUnion, Op left, Op right) {
if(left instanceof OpLabel){
if(right instanceof OpLabel){
return OpLabel.create(PRUNED ,null);
}else
{
return substitute((Op0) right);
}
}else{
if(right instanceof OpLabel){
return substitute((Op0) left);
}
}
return substitute(opUnion, left, right);
}
开发者ID:peterjohnlawrence,项目名称:com.inova8.remediator,代码行数:17,代码来源:Substituter.java
示例2: SparkUnion
import com.hp.hpl.jena.sparql.algebra.op.OpUnion; //导入依赖的package包/类
public SparkUnion(OpUnion op) {
this.op = op;
}
开发者ID:aschaetzle,项目名称:S2X,代码行数:4,代码来源:SparkUnion.java
示例3: visit
import com.hp.hpl.jena.sparql.algebra.op.OpUnion; //导入依赖的package包/类
@Override
public void visit(OpUnion opUnion) {
executionQueue.add(new SparkUnion(opUnion));
}
开发者ID:aschaetzle,项目名称:S2X,代码行数:5,代码来源:AlgebraTranslator.java
示例4: visit
import com.hp.hpl.jena.sparql.algebra.op.OpUnion; //导入依赖的package包/类
@Override
public void visit(OpUnion opUnion) {
SqlOp rightOp = stack.pop();
SqlOp leftOp = stack.pop();
stack.push(new SQLUnion(opUnion, leftOp, rightOp, prefixes));
}
开发者ID:aschaetzle,项目名称:S2RDF,代码行数:7,代码来源:AlgebraTransformer.java
示例5: SQLUnion
import com.hp.hpl.jena.sparql.algebra.op.OpUnion; //导入依赖的package包/类
public SQLUnion(OpUnion _opUnion, SqlOp _leftOp, SqlOp _rightOp,
PrefixMapping _prefixes) {
super(_leftOp, _rightOp, _prefixes);
opUnion = _opUnion;
resultName = Tags.UNION;
}
开发者ID:aschaetzle,项目名称:S2RDF,代码行数:7,代码来源:SQLUnion.java
示例6: PigUnion
import com.hp.hpl.jena.sparql.algebra.op.OpUnion; //导入依赖的package包/类
public PigUnion(OpUnion _opUnion, PigOp _leftOp, PigOp _rightOp, PrefixMapping _prefixes) {
super(_leftOp, _rightOp, _prefixes);
opUnion = _opUnion;
resultName = Tags.UNION;
}
开发者ID:aschaetzle,项目名称:PigSPARQL,代码行数:6,代码来源:PigUnion.java
示例7: visit
import com.hp.hpl.jena.sparql.algebra.op.OpUnion; //导入依赖的package包/类
@Override
public void visit(OpUnion opUnion) {
ImpalaOp rightOp = stack.pop();
ImpalaOp leftOp = stack.pop();
stack.push(new ImpalaUnion(opUnion, leftOp, rightOp, prefixes));
}
开发者ID:aschaetzle,项目名称:Sempala,代码行数:7,代码来源:AlgebraTransformer.java
示例8: ImpalaUnion
import com.hp.hpl.jena.sparql.algebra.op.OpUnion; //导入依赖的package包/类
public ImpalaUnion(OpUnion _opUnion, ImpalaOp _leftOp, ImpalaOp _rightOp,
PrefixMapping _prefixes) {
super(_leftOp, _rightOp, _prefixes);
opUnion = _opUnion;
resultName = Tags.UNION;
}
开发者ID:aschaetzle,项目名称:Sempala,代码行数:7,代码来源:ImpalaUnion.java
示例9: checkMoveDownFilterExprAndVisitOpUnion
import com.hp.hpl.jena.sparql.algebra.op.OpUnion; //导入依赖的package包/类
/**
* Checks first if a filterexpression can be moved down. And after visits
* the operator
*/
private void checkMoveDownFilterExprAndVisitOpUnion(OpUnion opUnion) {
Op left = null;
Op right = null;
Op newOp;
List<Expr> filterExprBeforeOpUnion, filterExprAfterOpUnion, notMoveableFilterExpr;
// contains the filterexpressions that are valid before this op2
filterExprBeforeOpUnion = new ArrayList<Expr>(this.filterExpr);
// contains the filterexpressions that are valid after this op2
// this is needed because during the bottom-up-stepping all
// filterexpressions
// which could not be transformed down, must be inserted by means of an
// OpFilter
// above this op2
filterExprAfterOpUnion = new ArrayList<Expr>();
// check left subtree
if ((left = opUnion.getLeft()) != null) {
// calculate the set of filterexpressions that are also valid for
// the
// left subtree
this.filterExpr = calcValidFilterExpr(filterExprBeforeOpUnion, left);
filterExprAfterOpUnion.addAll(this.filterExpr);
// step down
opUnion.getLeft().visit(this);
left = stack.pop();
}
// check the right subtree
if ((right = opUnion.getRight()) != null) {
// calculate the set of filterexpressions that are also valid for
// the
// right subtree
this.filterExpr = calcValidFilterExpr(filterExprBeforeOpUnion,
right);
filterExprAfterOpUnion.addAll(this.filterExpr);
// step down
opUnion.getRight().visit(this);
right = stack.pop();
}
// note: filterExprAfterOpUnion contains now all filterexpressions which
// could
// be moved down
// now calculate all filterexpressions which were not moveable
notMoveableFilterExpr = new ArrayList<Expr>(filterExprBeforeOpUnion);
notMoveableFilterExpr.removeAll(filterExprAfterOpUnion);
// if there are some filterexpressions which could not be moved down,
// an opFilter must be inserted that contains this filterexpressions
if (!notMoveableFilterExpr.isEmpty()) {
// create the filter
newOp = OpFilter.filter(OpUnion.create(left, right));
// add the conditions
((OpFilter) newOp).getExprs().getList()
.addAll(notMoveableFilterExpr);
} else {
newOp = opUnion;
}
// restore filterexpressions
this.filterExpr = filterExprBeforeOpUnion;
this.stack.push(newOp);
}
开发者ID:aitoralmeida,项目名称:c4a_data_repository,代码行数:70,代码来源:PushDownOpFilterVisitor.java
示例10: transform
import com.hp.hpl.jena.sparql.algebra.op.OpUnion; //导入依赖的package包/类
@Override
public Op transform(OpUnion opUnion, Op left, Op right) {
return mergeToBGP(left, right);
}
开发者ID:peterjohnlawrence,项目名称:com.inova8.remediator,代码行数:5,代码来源:Simplifier.java
示例11: union
import com.hp.hpl.jena.sparql.algebra.op.OpUnion; //导入依赖的package包/类
protected Op union(Op current, Op newOp) {
return OpUnion.create(current, newOp) ;
}
开发者ID:KMax,项目名称:cqels,代码行数:4,代码来源:LogicCompiler.java
示例12: visit
import com.hp.hpl.jena.sparql.algebra.op.OpUnion; //导入依赖的package包/类
/**
* When visiting an OpUnion also 3 conditions for moving down the
* filterconditions are checked. Only when a condition is satisfied, the
* filtercondition can be moved down to the next operator in the tree.
* Otherwise the condition will stay here and during the bottum-up-stepping
* an OpFilter containing these remained filterconditions will be inserted
* in the operator-tree. Conditions for moving down a filtercondition: (M1,
* M2 are graphpatterns, F is a filtercondition) 1) Filter(Union(M1, M2),
* F)) will become Union(Filter(M1, F), M2) when the filterexpression is
* only referenced to M1 2) Filter(Union(M1, M2), F)) will become Union(M1,
* Filter(M2, F)) when the filterexpression is only referenced to M2
*
* TODO: Dubious! Shouldn't this be Union(Filter(M1,F), Filter(M2,F))? What
* does the code actually do?
*
* 3) Filter(Union(M1, M2), F)) will become Join(Union(M1, F), Union(M2, F))
* when the filterexpression is referenced to M1 and M2
*/
public void visit(OpUnion opUnion) {
checkMoveDownFilterExprAndVisitOpUnion(opUnion);
}
开发者ID:aitoralmeida,项目名称:c4a_data_repository,代码行数:22,代码来源:PushDownOpFilterVisitor.java
注:本文中的com.hp.hpl.jena.sparql.algebra.op.OpUnion类示例整理自Github/MSDocs等源码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。 |
请发表评论