lokinet/llarp/dht/key.hpp
2023-10-03 13:11:51 -07:00

75 lines
1.4 KiB
C++

#pragma once
#include <llarp/util/aligned.hpp>
#include <llarp/router_id.hpp>
#include <llarp/util/formattable.hpp>
#include <array>
namespace llarp::dht
{
struct Key_t : public AlignedBuffer<32>
{
explicit Key_t(const byte_t* buf) : AlignedBuffer<SIZE>(buf)
{}
explicit Key_t(const std::array<byte_t, SIZE>& data) : AlignedBuffer<SIZE>(data)
{}
explicit Key_t(const AlignedBuffer<SIZE>& data) : AlignedBuffer<SIZE>(data)
{}
Key_t() : AlignedBuffer<SIZE>()
{}
/// get snode address string
std::string
SNode() const
{
const RouterID rid{as_array()};
return rid.ToString();
}
util::StatusObject
ExtractStatus() const;
std::string
ToString() const
{
return SNode();
}
Key_t
operator^(const Key_t& other) const
{
Key_t dist;
std::transform(begin(), end(), other.begin(), dist.begin(), std::bit_xor<byte_t>());
return dist;
}
bool
operator==(const Key_t& other) const
{
return as_array() == other.as_array();
}
bool
operator!=(const Key_t& other) const
{
return as_array() != other.as_array();
}
bool
operator<(const Key_t& other) const
{
return as_array() < other.as_array();
}
bool
operator>(const Key_t& other) const
{
return as_array() > other.as_array();
}
};
} // namespace llarp::dht