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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139

#pragma once

#include <algorithm>
#include <vector>

#include "common/serializer/deserializer.h"
#include "common/serializer/serializer.h"
#include "common/types/types.h"
#include "common/uniq_lock.h"
#include "common/utils.h"

namespace lbug {
namespace storage {
class MemoryManager;

template<class T>
class GroupCollection {
public:
    GroupCollection() {}

    common::UniqLock lock() const { return common::UniqLock{mtx}; }

    void deserializeGroups(MemoryManager& memoryManager, common::Deserializer& deSer,
        const std::vector<common::LogicalType>& columnTypes) {
        auto lockGuard = lock();
        deSer.deserializeVectorOfPtrs<T>(groups, [&](common::Deserializer& deser) {
            return T::deserialize(memoryManager, deser, columnTypes);
        });
    }

    void removeTrailingGroups([[maybe_unused]] const common::UniqLock& lock,
        common::idx_t numGroupsToRemove) {
        DASSERT(lock.isLocked());
        DASSERT(numGroupsToRemove <= groups.size());
        groups.erase(groups.end() - numGroupsToRemove, groups.end());
    }

    void serializeGroups(common::Serializer& ser) {
        auto lockGuard = lock();
        ser.serializeVectorOfPtrs<T>(groups);
    }

    void appendGroup(const common::UniqLock& lock, std::unique_ptr<T> group) {
        DASSERT(group);
        DASSERT(lock.isLocked());
        UNUSED(lock);
        groups.push_back(std::move(group));
    }
    T* getGroup(const common::UniqLock& lock, common::idx_t groupIdx) const {
        DASSERT(lock.isLocked());
        UNUSED(lock);
        DASSERT(groupIdx < groups.size());
        return groups[groupIdx].get();
    }
    T* getGroupNoLock(common::idx_t groupIdx) const {
        DASSERT(groupIdx < groups.size());
        return groups[groupIdx].get();
    }
    void replaceGroup(const common::UniqLock& lock, common::idx_t groupIdx,
        std::unique_ptr<T> group) {
        DASSERT(group);
        DASSERT(lock.isLocked());
        UNUSED(lock);
        if (groupIdx >= groups.size()) {
            groups.resize(groupIdx + 1);
        }
        groups[groupIdx] = std::move(group);
    }

    void resize(const common::UniqLock& lock, common::idx_t newSize) {
        DASSERT(lock.isLocked());
        UNUSED(lock);
        if (newSize <= groups.size()) {
            return;
        }
        groups.resize(newSize);
    }

    bool isEmpty(const common::UniqLock& lock) const {
        DASSERT(lock.isLocked());
        UNUSED(lock);
        return groups.empty();
    }
    common::idx_t getNumGroups(const common::UniqLock& lock) const {
        DASSERT(lock.isLocked());
        UNUSED(lock);
        return groups.size();
    }
    common::idx_t getNumGroupsNoLock() const { return groups.size(); }

    const std::vector<std::unique_ptr<T>>& getAllGroups(const common::UniqLock& lock) const {
        DASSERT(lock.isLocked());
        UNUSED(lock);
        return groups;
    }
    T* getFirstGroup(const common::UniqLock& lock) const {
        DASSERT(lock.isLocked());
        UNUSED(lock);
        if (groups.empty()) {
            return nullptr;
        }
        return groups.front().get();
    }
    T* getFirstGroupNoLock() const {
        if (groups.empty()) {
            return nullptr;
        }
        return groups.front().get();
    }
    T* getLastGroup(const common::UniqLock& lock) const {
        DASSERT(lock.isLocked());
        UNUSED(lock);
        if (groups.empty()) {
            return nullptr;
        }
        return groups.back().get();
    }

    void clear(const common::UniqLock& lock) {
        DASSERT(lock.isLocked());
        UNUSED(lock);
        groups.clear();
    }

    common::idx_t getNumEmptyTrailingGroups(const common::UniqLock& lock) {
        const auto& groupsVector = getAllGroups(lock);
        return common::safeIntegerConversion<common::idx_t>(
            std::find_if(groupsVector.rbegin(), groupsVector.rend(),
                [](const auto& group) { return (group->getNumRows() != 0); }) -
            groupsVector.rbegin());
    }

private:
    mutable std::mutex mtx;
    std::vector<std::unique_ptr<T>> groups;
};

} // namespace storage
} // namespace lbug