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

#include "binder/query/updating_clause/bound_set_info.h"
#include "planner/operator/persistent/logical_set.h"
#include "planner/planner.h"

using namespace lbug::binder;

namespace lbug {
namespace planner {

void Planner::appendSetProperty(const std::vector<BoundSetPropertyInfo>& infos, LogicalPlan& plan) {
    auto set = std::make_shared<LogicalSetProperty>(copyVector(infos), plan.getLastOperator());
    for (auto i = 0u; i < set->getInfos().size(); ++i) {
        auto groupsPos = set->getGroupsPosToFlatten(i);
        appendFlattens(groupsPos, plan);
        set->setChild(0, plan.getLastOperator());
    }
    set->computeFactorizedSchema();
    plan.setLastOperator(std::move(set));
}

} // namespace planner
} // namespace lbug