blob: 6936a8b62aa5618b94760facba273f307b8fa162 (
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
|
/*
* 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"
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<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>
struct Point{
V x;
V y;
inline bool operator==(const Point& other) const {
return x == other.x && y == other.y;
}
// lexicographic order
inline bool operator<(const Point& other) const {
return x < other.x || (x == other.x && y < other.y);
}
inline double calc_distance(const Point& other) const {
return sqrt(pow(x - other.x, 2) + pow(y - other.y, 2));
}
};
}
|