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 "planner/operator/logical_noop.h"
#include "processor/plan_mapper.h"
#include <format>

using namespace lbug::planner;

namespace lbug {
namespace processor {

std::unique_ptr<PhysicalOperator> PlanMapper::mapNoop(const LogicalOperator* logicalOperator) {
    std::vector<std::unique_ptr<PhysicalOperator>> children;
    for (auto child : logicalOperator->getChildren()) {
        children.push_back(mapOperator(child.get()));
    }
    auto noop = logicalOperator->constPtrCast<LogicalNoop>();
    auto idx = noop->getMessageChildIdx();
    DASSERT(idx < children.size());
    auto child = children[idx].get();
    // LCOV_EXCL_START
    if (!child->isSink()) {
        throw common::InternalException(
            std::format("Trying to propagate result table from a non sink operator. This "
                        "should never happen."));
    }
    // LCOV_EXCL_STOP
    auto fTable = child->ptrCast<Sink>()->getResultFTable();
    auto op = std::make_unique<DummySimpleSink>(fTable, getOperatorID());
    for (auto& childOp : children) {
        op->addChild(std::move(childOp));
    }
    return op;
}

} // namespace processor
} // namespace lbug