lbug 0.16.1

An in-process property graph database management system built for query speed and scalability
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

#include "binder/expression/literal_expression.h"
#include "binder/expression_visitor.h"
#include "binder/query/reading_clause/bound_unwind_clause.h"
#include "expression_evaluator/expression_evaluator_utils.h"
#include "planner/operator/logical_unwind.h"
#include "planner/planner.h"

using namespace lbug::binder;
using namespace lbug::common;

namespace lbug {
namespace planner {

void Planner::appendUnwind(const BoundReadingClause& readingClause, LogicalPlan& plan) {
    auto& unwindClause = dynamic_cast_checked<const BoundUnwindClause&>(readingClause);
    auto inExpr = unwindClause.getInExpr();
    if (ConstantExpressionVisitor::isConstant(*inExpr)) {
        auto value =
            evaluator::ExpressionEvaluatorUtils::evaluateConstantExpression(inExpr, clientContext);
        inExpr = std::make_shared<LiteralExpression>(std::move(value), inExpr->getUniqueName());
    }
    auto unwind = make_shared<LogicalUnwind>(inExpr, unwindClause.getOutExpr(),
        unwindClause.getIDExpr(), plan.getLastOperator());
    appendFlattens(unwind->getGroupsPosToFlatten(), plan);
    unwind->setChild(0, plan.getLastOperator());
    unwind->computeFactorizedSchema();
    plan.setLastOperator(unwind);
}

} // namespace planner
} // namespace lbug