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

#pragma once

#include "bound_delete_info.h"
#include "bound_updating_clause.h"

namespace lbug {
namespace binder {

class BoundDeleteClause final : public BoundUpdatingClause {
public:
    BoundDeleteClause() : BoundUpdatingClause{common::ClauseType::DELETE_} {};

    void addInfo(BoundDeleteInfo info) { infos.push_back(std::move(info)); }

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

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

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

} // namespace binder
} // namespace lbug