lbug 0.16.0

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

#pragma once

#include "planner/operator/logical_operator.h"

namespace lbug {
namespace planner {

class LogicalLimit final : public LogicalOperator {
    static constexpr LogicalOperatorType type_ = LogicalOperatorType::LIMIT;

public:
    LogicalLimit(std::shared_ptr<binder::Expression> skipNum,
        std::shared_ptr<binder::Expression> limitNum, std::shared_ptr<LogicalOperator> child)
        : LogicalOperator{type_, std::move(child)}, skipNum{std::move(skipNum)},
          limitNum{std::move(limitNum)} {}

    f_group_pos_set getGroupsPosToFlatten();

    void computeFactorizedSchema() override { copyChildSchema(0); }
    void computeFlatSchema() override { copyChildSchema(0); }

    std::string getExpressionsForPrinting() const override;

    bool hasSkipNum() const { return skipNum != nullptr; }
    std::shared_ptr<binder::Expression> getSkipNum() const { return skipNum; }

    bool hasLimitNum() const { return limitNum != nullptr; }
    std::shared_ptr<binder::Expression> getLimitNum() const { return limitNum; }

    f_group_pos getGroupPosToSelect() const;

    std::unordered_set<f_group_pos> getGroupsPosToLimit() const {
        return schema->getGroupsPosInScope();
    }

    std::unique_ptr<LogicalOperator> copy() override {
        return make_unique<LogicalLimit>(skipNum, limitNum, children[0]->copy());
    }

private:
    std::shared_ptr<binder::Expression> skipNum;
    std::shared_ptr<binder::Expression> limitNum;
};

} // namespace planner
} // namespace lbug