Mirrors/i2pd
2
0
Fork 0
mirror of https://github.com/PurpleI2P/i2pd.git synced 2025-04-28 11:47:48 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions

find multiple closest hashes

Browse source
This commit is contained in:
orignal 2023-02-18 19:45:31 -05:00
parent ce05cce331
commit eaca435a5b
2 changed files with 36 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

33
libi2pd/KadDHT.cpp
View file

@ -205,6 +205,39 @@ namespace data
}
return nullptr;
}
std::vector<IdentHash *> DHTTable::FindClosest (const IdentHash& h, size_t num)
{
std::vector<IdentHash *> vec;
if (num > 0)
FindClosest (h, num, m_Root, 0, vec);
return vec;
}
void DHTTable::FindClosest (const IdentHash& h, size_t num, DHTNode * root, int level, std::vector<IdentHash *>& hashes)
{
if (hashes.size () >= num) return;
if (root->hash)
{
hashes.push_back (root->hash);
return;
}
int bit = h.GetBit (level);
if (bit)
{
if (root->one)
FindClosest (h, num, root->one, level + 1, hashes);
if (hashes.size () < num && root->zero)
FindClosest (h, num, root->zero, level + 1, hashes);
}
else
{
if (root->zero)
FindClosest (h, num, root->zero, level + 1, hashes);
if (hashes.size () < num && root->one)
FindClosest (h, num, root->one, level + 1, hashes);
}
}
void DHTTable::Print (std::stringstream& s)
{