lbug 0.15.4

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
36
37
38
39
40
41
42
43
44
45
46
47

#include "planner/operator/persistent/logical_delete.h"

#include "binder/expression/expression_util.h"
#include "binder/expression/node_expression.h"
#include "binder/expression/rel_expression.h"
#include "planner/operator/factorization/flatten_resolver.h"

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

namespace lbug {
namespace planner {

std::string LogicalDelete::getExpressionsForPrinting() const {
    expression_vector patterns;
    for (auto& info : infos) {
        patterns.push_back(info.pattern);
    }
    return ExpressionUtil::toString(patterns);
}

f_group_pos_set LogicalDelete::getGroupsPosToFlatten() const {
    DASSERT(!infos.empty());
    const auto childSchema = children[0]->getSchema();
    f_group_pos_set dependentGroupPos;
    switch (infos[0].tableType) {
    case TableType::NODE: {
        for (auto& info : infos) {
            auto nodeID = info.pattern->constCast<NodeExpression>().getInternalID();
            dependentGroupPos.insert(childSchema->getGroupPos(*nodeID));
        }
    } break;
    case TableType::REL: {
        for (auto& info : infos) {
            auto& rel = info.pattern->constCast<RelExpression>();
            dependentGroupPos.insert(childSchema->getGroupPos(*rel.getSrcNode()->getInternalID()));
            dependentGroupPos.insert(childSchema->getGroupPos(*rel.getDstNode()->getInternalID()));
        }
    } break;
    default:
        UNREACHABLE_CODE;
    }
    return FlattenAll::getGroupsPosToFlatten(dependentGroupPos, *childSchema);
}

} // namespace planner
} // namespace lbug