lbug 0.22.0

An in-process property graph database management system built for query speed and scalability
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
48

#include "planner/operator/scan/logical_grouped_reachable_count.h"

namespace lbug {
namespace planner {

void LogicalGroupedReachableCount::computeFactorizedSchema() {
    createEmptySchema();
    // Multi-row source: one group holding keys + aggregates, not single-state (unlike the
    // single-row count operators).
    auto groupPos = schema->createGroup();
    for (auto& key : keys) {
        schema->insertToGroupAndScope(key, groupPos);
    }
    if (countExpr != nullptr) {
        schema->insertToGroupAndScope(countExpr, groupPos);
    }
    if (avgExpr != nullptr) {
        schema->insertToGroupAndScope(avgExpr, groupPos);
    }
}

void LogicalGroupedReachableCount::computeFlatSchema() {
    createEmptySchema();
    auto groupPos = schema->createGroup();
    for (auto& key : keys) {
        schema->insertToGroupAndScope(key, groupPos);
    }
    if (countExpr != nullptr) {
        schema->insertToGroupAndScope(countExpr, groupPos);
    }
    if (avgExpr != nullptr) {
        schema->insertToGroupAndScope(avgExpr, groupPos);
    }
}

std::string LogicalGroupedReachableCount::getExpressionsForPrinting() const {
    std::string result;
    for (auto& key : keys) {
        if (!result.empty()) {
            result += ",";
        }
        result += key->toString();
    }
    return result;
}

} // namespace planner
} // namespace lbug