aboutsummaryrefslogtreecommitdiffstats
path: root/src/MultigroupCodec.cpp
blob: 81d305c8568e371ccbc3b4d57d3b9140b5ab570c (plain) (blame)
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
#include "MultigroupCodec.h"

#include "Merkle.h"

namespace nt::MultigroupCodec
{
    // A relation with zero tuples reports an empty merkle_root externally.
    // The merkle tree's payload type is fixed-width Hash32, so the codec
    // maps "" ↔ the all-zero hash. The collision probability with a real
    // SHA256 hitting all-zero (2^-256) is treated as unreachable.
    static nt::Hash32 encode_payload(const std::string& hex)
    {
        if (hex.empty()) return nt::Hash32{};
        return nt::hex_to_bin(hex);
    }

    static std::string decode_payload(const nt::Hash32& bin)
    {
        static const nt::Hash32 zero{};
        if (bin == zero) return "";
        return nt::bin_to_hex(bin);
    }

    std::string Build(IStorageBackend& store,
                      const std::vector<RelationEntry>& relations)
    {
        std::string root;
        for (const auto& [name, root_hex] : relations)
            root = nt::Merkle<std::string>::Insert(store, root, name,
                                                    encode_payload(root_hex));
        return root;
    }

    std::vector<RelationEntry> List(IStorageBackend& store,
                                     const std::string& root_hex)
    {
        std::vector<RelationEntry> out;
        constexpr size_t kPageSize = 1024;
        size_t offset = 0;
        while (true)
        {
            auto page = nt::Merkle<std::string>::Page(store, root_hex,
                                                      offset, kPageSize);
            if (page.empty()) break;
            for (auto& entry : page)
                out.emplace_back(std::move(entry.key),
                                  decode_payload(entry.payload));
            if (page.size() < kPageSize) break;
            offset += page.size();
        }
        return out;
    }

    std::string InsertOne(IStorageBackend& store,
                          const std::string& root_hex,
                          const std::string& relation_name,
                          const std::string& relation_root_hex)
    {
        return nt::Merkle<std::string>::Insert(store, root_hex, relation_name,
                                                encode_payload(relation_root_hex));
    }

    std::string RemoveOne(IStorageBackend& store,
                          const std::string& root_hex,
                          const std::string& relation_name)
    {
        return nt::Merkle<std::string>::Remove(store, root_hex, relation_name);
    }

    std::string Lookup(IStorageBackend& store,
                       const std::string& root_hex,
                       const std::string& relation_name)
    {
        auto found = nt::Merkle<std::string>::Get(store, root_hex, relation_name);
        if (!found) return "";
        return decode_payload(*found);
    }
}