blob: d12333147eaaf3c44a04b3559c4fcdadcd204a43 (
plain)
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 "../types.hpp"
#include <array>
#include <unordered_map>
namespace sibs
{
const usize PUBSUB_KEY_LENGTH = 32;
// Source: https://stackoverflow.com/a/11414104 (public license)
static size_t fnvHash(const unsigned char *key, int len)
{
size_t h = 2166136261;
for (int i = 0; i < len; i++)
h = (h * 16777619) ^ key[i];
return h;
}
class PubsubKey
{
public:
PubsubKey();
// Create pubsub key from existing data, data will be cutoff at PUBSUB_KEY_LENGTH. If @size is less than PUBSUB_KEY_LENGTH then data is appended with 0
PubsubKey(const void *data, const usize size);
bool operator == (const PubsubKey &other) const;
bool operator != (const PubsubKey &other) const;
std::array<u8, PUBSUB_KEY_LENGTH> data;
};
struct PubsubKeyHasher
{
size_t operator()(const PubsubKey &pubsubKey) const
{
return fnvHash((const unsigned char*)pubsubKey.data.data(), PUBSUB_KEY_LENGTH);
}
};
template <typename ValueType>
using PubsubKeyMap = std::unordered_map<PubsubKey, ValueType, PubsubKeyHasher>;
}
|
