fr.inria.corese.kgram.core.Query.getHaving()方法的使用及代码示例

x33g5p2x  于2022-01-28 转载在 其他  
字(2.7k)|赞(0)|评价(0)|浏览(182)

本文整理了Java中fr.inria.corese.kgram.core.Query.getHaving方法的一些代码示例,展示了Query.getHaving的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。Query.getHaving方法的具体详情如下:
包路径:fr.inria.corese.kgram.core.Query
类名称:Query
方法名:getHaving

Query.getHaving介绍

暂无

代码示例

代码示例来源:origin: fr.inria.corese/kgram

  1. public Mappings filter(Mappings map, Query q) {
  2. Query qq = map.getQuery();
  3. init(qq);
  4. qq.compile(q.getHaving().getFilter());
  5. qq.index(qq, q.getHaving().getFilter());
  6. //q.complete();
  7. map.filter(evaluator, q.getHaving().getFilter(), memory);
  8. return map;
  9. }

代码示例来源:origin: fr.inria.corese/kgram

  1. sb.append(getGroupBy());
  2. if (getHaving() != null) {
  3. sb.append("\n");
  4. sb.append("having ");
  5. sb.append(getHaving());

代码示例来源:origin: fr.inria.corese/kgram

  1. /**
  2. * Compile additional filters that may contain exists {}.
  3. */
  4. void modifier(Query q) {
  5. compile(q.getSelectFun());
  6. compile(q.getOrderBy());
  7. compile(q.getGroupBy());
  8. if (q.getHaving() != null) {
  9. compile(q.getHaving().getFilter());
  10. }
  11. for (Filter f : q.getFunList()) {
  12. compile(f);
  13. }
  14. }

代码示例来源:origin: fr.inria.corese/kgram

  1. void aggregate(Query qq, Evaluator evaluator, Memory memory, Producer p, boolean isFinish) {
  2. if (size() == 0) {
  3. if (qq.isAggregate()) {
  4. // SPARQL test cases requires that aggregate on empty result set return one empty result
  5. // and count() return 0
  6. add(Mapping.fake(qq));
  7. setFake(true);
  8. } else {
  9. return;
  10. }
  11. }
  12. boolean isEvent = hasEvent;
  13. // select (count(?n) as ?count)
  14. aggregate(evaluator, memory, p, qq.getSelectFun(), true);
  15. // order by count(?n)
  16. aggregate(evaluator, memory, p, qq.getOrderBy(), false);
  17. if (qq.getHaving() != null) {
  18. if (isEvent) {
  19. Event event = EventImpl.create(Event.AGG, query.getHaving());
  20. manager.send(event);
  21. }
  22. eval(evaluator, qq.getHaving(), memory, p, HAVING);
  23. }
  24. finish(qq);
  25. }

代码示例来源:origin: fr.inria.corese/kgram

  1. void finish(Query qq) {
  2. setNbsolutions(size());
  3. if (qq.hasGroupBy() && !qq.isConstruct()) {
  4. // after group by (and aggregate), leave one Mapping for each group
  5. // with result of the group
  6. groupBy();
  7. } else if (qq.getHaving() != null) {
  8. // clause 'having' with no group by
  9. // select (max(?x) as ?max where {}
  10. // having(?max > 100)
  11. having();
  12. } else if (qq.isAggregate() && !qq.isConstruct()) {
  13. clean();
  14. }
  15. }

代码示例来源:origin: fr.inria.corese/kgram

  1. /**
  2. *
  3. * index(node) use global query index
  4. */
  5. void complete2() {
  6. for (Filter f : getPathFilter()) {
  7. index(this, f);
  8. }
  9. index(getOrderBy());
  10. index(getGroupBy());
  11. if (getHaving() != null) {
  12. index(this, getHaving().getFilter());
  13. }
  14. for (Filter f :getFunList()){
  15. index(this, f);
  16. }
  17. for (Node node : getBindingNodes()) {
  18. index(node);
  19. }
  20. for (Node node : getArgList()) {
  21. index(node);
  22. }
  23. if (getGraphNode() != null) {
  24. index(getGraphNode());
  25. }
  26. if (getPathNode() != null) {
  27. index(getPathNode());
  28. }
  29. }

代码示例来源:origin: fr.inria.corese/compiler

  1. if (q.getHaving() != null) {
  2. visit(q.getHaving().getFilter().getExp(), list);

代码示例来源:origin: Wimmics/corese

  1. if (q.getHaving() != null) {
  2. visit(q.getHaving().getFilter().getExp(), list);

相关文章