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
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43

#pragma once

#include "bound_insert_info.h"
#include "bound_updating_clause.h"

namespace lbug {
namespace binder {

class BoundInsertClause final : public BoundUpdatingClause {
public:
    explicit BoundInsertClause(std::vector<BoundInsertInfo> infos)
        : BoundUpdatingClause{common::ClauseType::INSERT}, infos{std::move(infos)} {}

    const std::vector<BoundInsertInfo>& getInfos() const { return infos; }

    bool hasNodeInfo() const {
        return hasInfo(
            [](const BoundInsertInfo& info) { return info.tableType == common::TableType::NODE; });
    }
    std::vector<const BoundInsertInfo*> getNodeInfos() const {
        return getInfos(
            [](const BoundInsertInfo& info) { return info.tableType == common::TableType::NODE; });
    }
    bool hasRelInfo() const {
        return hasInfo(
            [](const BoundInsertInfo& info) { return info.tableType == common::TableType::REL; });
    }
    std::vector<const BoundInsertInfo*> getRelInfos() const {
        return getInfos(
            [](const BoundInsertInfo& info) { return info.tableType == common::TableType::REL; });
    }

private:
    bool hasInfo(const std::function<bool(const BoundInsertInfo& info)>& check) const;
    std::vector<const BoundInsertInfo*> getInfos(
        const std::function<bool(const BoundInsertInfo& info)>& check) const;

private:
    std::vector<BoundInsertInfo> infos;
};

} // namespace binder
} // namespace lbug