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

#pragma once

#include <memory>
#include <unordered_map>

#include "common/assert.h"
#include "parsed_graph_entry.h"

namespace lbug {
namespace main {
class ClientContext;
}
namespace graph {

class GraphEntrySet {
public:
    void validateGraphNotExist(const std::string& name) const;
    void validateGraphExist(const std::string& name) const;

    bool hasGraph(const std::string& name) const { return nameToEntry.contains(name); }
    ParsedGraphEntry* getEntry(const std::string& name) const {
        DASSERT(hasGraph(name));
        return nameToEntry.at(name).get();
    }
    void addGraph(const std::string& name, std::unique_ptr<ParsedGraphEntry> entry) {
        nameToEntry.insert({name, std::move(entry)});
    }
    void dropGraph(const std::string& name) { nameToEntry.erase(name); }

    const std::unordered_map<std::string, std::unique_ptr<ParsedGraphEntry>>&
    getNameToEntryMap() const {
        return nameToEntry;
    }

    LBUG_API static GraphEntrySet* Get(const main::ClientContext& context);

private:
    std::unordered_map<std::string, std::unique_ptr<ParsedGraphEntry>> nameToEntry;
};

} // namespace graph
} // namespace lbug