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
32
33
34
35

#include "binder/bound_table_scan_info.h"
#include "binder/query/reading_clause/bound_table_function_call.h"
#include "planner/operator/logical_table_function_call.h"
#include "planner/planner.h"

using namespace lbug::binder;

namespace lbug {
namespace planner {

void Planner::appendTableFunctionCall(const BoundTableScanInfo& info, LogicalPlan& plan) {
    DASSERT(info.func.has_value());
    auto call = std::make_shared<LogicalTableFunctionCall>(*info.func, info.bindData->copy());
    call->computeFactorizedSchema();
    plan.setLastOperator(std::move(call));
}

std::shared_ptr<LogicalOperator> Planner::getTableFunctionCall(const BoundTableScanInfo& info) {
    DASSERT(info.func.has_value());
    auto call = std::make_shared<LogicalTableFunctionCall>(*info.func, info.bindData->copy());
    call->computeFactorizedSchema();
    return call;
}

std::shared_ptr<LogicalOperator> Planner::getTableFunctionCall(
    const BoundReadingClause& readingClause) {
    auto& call = readingClause.constCast<BoundTableFunctionCall>();
    auto op =
        std::make_shared<LogicalTableFunctionCall>(call.getTableFunc(), call.getBindData()->copy());
    op->computeFactorizedSchema();
    return op;
}

} // namespace planner
} // namespace lbug