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
|
#ifndef GUID_INL_H_
#error "Direct inclusion of this file is not allowed, include guid.h"
// For the sake of sane code completion.
#include "guid.h"
#endif
namespace NYT {
////////////////////////////////////////////////////////////////////////////////
Y_FORCE_INLINE constexpr TGuid::TGuid()
: Parts32{}
{ }
Y_FORCE_INLINE constexpr TGuid::TGuid(ui32 part0, ui32 part1, ui32 part2, ui32 part3)
: Parts32{part0, part1, part2, part3}
{ }
Y_FORCE_INLINE constexpr TGuid::TGuid(ui64 part0, ui64 part1)
: Parts64{part0, part1}
{ }
Y_FORCE_INLINE bool TGuid::IsEmpty() const
{
return Parts64[0] == 0 && Parts64[1] == 0;
}
Y_FORCE_INLINE TGuid::operator bool() const
{
return !IsEmpty();
}
////////////////////////////////////////////////////////////////////////////////
Y_FORCE_INLINE bool LessImpl(TGuid lhs, TGuid rhs) noexcept
{
#ifdef __GNUC__
ui64 lhs0 = __builtin_bswap64(lhs.Parts64[0]);
ui64 rhs0 = __builtin_bswap64(rhs.Parts64[0]);
if (lhs0 < rhs0) {
return true;
}
if (lhs0 > rhs0) {
return false;
}
ui64 lhs1 = __builtin_bswap64(lhs.Parts64[1]);
ui64 rhs1 = __builtin_bswap64(rhs.Parts64[1]);
return lhs1 < rhs1;
#else
return memcmp(&lhs, &rhs, sizeof(TGuid)) < 0;
#endif
}
Y_FORCE_INLINE bool operator == (const TGuid& lhs, const TGuid& rhs) noexcept
{
return lhs.Parts64[0] == rhs.Parts64[0] &&
lhs.Parts64[1] == rhs.Parts64[1];
}
Y_FORCE_INLINE std::strong_ordering operator <=> (const TGuid& lhs, const TGuid& rhs) noexcept
{
if (LessImpl(lhs, rhs)) {
return std::strong_ordering::less;
}
if (lhs == rhs) {
return std::strong_ordering::equal;
}
return std::strong_ordering::greater;
}
////////////////////////////////////////////////////////////////////////////////
} // namespace NYT
Y_FORCE_INLINE size_t THash<NYT::TGuid>::operator()(const NYT::TGuid& guid) const
{
const size_t p = 1000000009; // prime number
return guid.Parts32[0] +
guid.Parts32[1] * p +
guid.Parts32[2] * p * p +
guid.Parts32[3] * p * p * p;
}
|
