blob: 85a07943bfdbf6a9911ca69c6baad6468366ce68 (
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
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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
|
/*
* include/framework/RecordInterface.h
*
* Copyright (C) 2023 Douglas Rumbaugh <drumbaugh@psu.edu>
* Dong Xie <dongx@psu.edu>
*
* All rights reserved. Published under the Modified BSD License.
*
*/
#pragma once
#include <cstring>
#include <concepts>
#include <cmath>
#include "util/base.h"
#include "util/hash.h"
namespace de {
template<typename R>
concept RecordInterface = requires(R r, R s) {
{ r < s } ->std::convertible_to<bool>;
{ r == s } ->std::convertible_to<bool>;
};
template<typename R>
concept WeightedRecordInterface = requires(R r) {
{r.weight} -> std::convertible_to<double>;
};
template<typename R>
concept NDRecordInterface = RecordInterface<R> && requires(R r, R s) {
{r.calc_distance(s)} -> std::convertible_to<double>;
};
template <typename R>
concept KVPInterface = RecordInterface<R> && requires(R r) {
r.key;
r.value;
};
template<typename R>
concept WrappedInterface = RecordInterface<R> && requires(R r, R s, bool b) {
{r.header} -> std::convertible_to<uint32_t>;
r.rec;
{r.set_delete()};
{r.is_deleted()} -> std::convertible_to<bool>;
{r.set_tombstone(b)};
{r.is_tombstone()} -> std::convertible_to<bool>;
{r < s} -> std::convertible_to<bool>;
};
template<RecordInterface R>
struct Wrapped {
uint32_t header;
R rec;
inline void set_delete() {
header |= 2;
}
inline bool is_deleted() const {
return header & 2;
}
inline void set_tombstone(bool val=true) {
if (val) {
header |= val;
} else {
header &= 0;
}
}
inline bool is_tombstone() const {
return header & 1;
}
inline bool operator<(const Wrapped& other) const {
return rec < other.rec || (rec == other.rec && header < other.header);
}
};
template <typename K, typename V>
struct Record {
K key;
V value;
uint32_t header = 0;
inline bool operator<(const Record& other) const {
return key < other.key || (key == other.key && value < other.value);
}
inline bool operator==(const Record& other) const {
return key == other.key && value == other.value;
}
};
template <typename K, typename V, typename W>
struct WeightedRecord {
K key;
V value;
W weight = 1;
inline bool operator==(const WeightedRecord& other) const {
return key == other.key && value == other.value;
}
inline bool operator<(const WeightedRecord& other) const {
return key < other.key || (key == other.key && value < other.value);
}
};
template <typename V, size_t D=2>
struct CosinePoint{
V data[D];
inline bool operator==(const CosinePoint& other) const {
for (size_t i=0; i<D; i++) {
if (data[i] != other.data[i]) {
return false;
}
}
return true;
}
// lexicographic order
inline bool operator<(const CosinePoint& other) const {
for (size_t i=0; i<D; i++) {
if (data[i] < other.data[i]) {
return true;
} else if (data[i] > other.data[i]) {
return false;
}
}
return false;
}
inline double calc_distance(const CosinePoint& other) const {
double prod = 0;
double asquared = 0;
double bsquared = 0;
for (size_t i=0; i<D; i++) {
prod += data[i] * other.data[i];
asquared += data[i]*data[i];
bsquared += other.data[i]*other.data[i];
}
return prod / std::sqrt(asquared * bsquared);
}
};
template <typename V, size_t D=2>
struct EuclidPoint{
V data[D];
inline bool operator==(const EuclidPoint& other) const {
for (size_t i=0; i<D; i++) {
if (data[i] != other.data[i]) {
return false;
}
}
return true;
}
// lexicographic order
inline bool operator<(const EuclidPoint& other) const {
for (size_t i=0; i<D; i++) {
if (data[i] < other.data[i]) {
return true;
} else if (data[i] > other.data[i]) {
return false;
}
}
return false;
}
inline double calc_distance(const EuclidPoint& other) const {
double dist = 0;
for (size_t i=0; i<D; i++) {
dist += pow(data[i] - other.data[i], 2);
}
return sqrt(dist);
}
};
template<RecordInterface R>
struct RecordHash {
size_t operator()(R const &rec) const {
return hash_bytes((char *) &rec, sizeof(R));
}
};
}
|