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
47
48

#pragma once

#include "logical_operator_visitor.h"

namespace lbug {
namespace optimizer {

class LogicalOperatorCollector : public LogicalOperatorVisitor {
public:
    ~LogicalOperatorCollector() override = default;

    void collect(planner::LogicalOperator* op);

    bool hasOperators() const { return !ops.empty(); }
    const std::vector<planner::LogicalOperator*>& getOperators() const { return ops; }

protected:
    std::vector<planner::LogicalOperator*> ops;
};

class LogicalFlattenCollector final : public LogicalOperatorCollector {
protected:
    void visitFlatten(planner::LogicalOperator* op) override { ops.push_back(op); }
};

class LogicalFilterCollector final : public LogicalOperatorCollector {
protected:
    void visitFilter(planner::LogicalOperator* op) override { ops.push_back(op); }
};

class LogicalScanNodeTableCollector final : public LogicalOperatorCollector {
protected:
    void visitScanNodeTable(planner::LogicalOperator* op) override { ops.push_back(op); }
};

// TODO(Xiyang): Rename me.
class LogicalIndexScanNodeCollector final : public LogicalOperatorCollector {
protected:
    void visitScanNodeTable(planner::LogicalOperator* op) override;
};

class LogicalRecursiveExtendCollector final : public LogicalOperatorCollector {
protected:
    void visitRecursiveExtend(planner::LogicalOperator* op) override { ops.push_back(op); }
};

} // namespace optimizer
} // namespace lbug