mirror of
https://github.com/oxen-io/lokinet.git
synced 2024-11-07 15:20:31 +00:00
9a8470bcc1
* use std::map's upper_bound to find many closer entries * randomize key for exploration to allow many explore jobs in paralell
27 lines
432 B
C++
27 lines
432 B
C++
#ifndef LLARP_DHT_KADEMLIA_HPP
|
|
#define LLARP_DHT_KADEMLIA_HPP
|
|
|
|
#include <dht/key.hpp>
|
|
|
|
namespace llarp
|
|
{
|
|
namespace dht
|
|
{
|
|
struct XorMetric
|
|
{
|
|
const Key_t us;
|
|
|
|
XorMetric(const Key_t& ourKey) : us(ourKey)
|
|
{
|
|
}
|
|
|
|
bool
|
|
operator()(const Key_t& left, const Key_t& right) const
|
|
{
|
|
return (us ^ left) < (us ^ right);
|
|
}
|
|
};
|
|
} // namespace dht
|
|
} // namespace llarp
|
|
#endif
|