e1lama/i2pd
1
0
Fork 0
mirror of https://github.com/PurpleI2P/i2pd.git synced 2025-03-07 06:09:42 +00:00
Code Issues Packages Projects Releases Wiki Activity

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

3
libi2pd/KadDHT.h
View File

@@ -11,6 +11,7 @@
#define KADDHT_H__
#include <memory>
#include <vector>
#include <sstream>
#include "Identity.h"
@@ -42,6 +43,7 @@ namespace data
DHTNode * Insert (const IdentHash& h);
bool Remove (const IdentHash& h);
IdentHash * FindClosest (const IdentHash& h);
std::vector<IdentHash *> FindClosest (const IdentHash& h, size_t num);
void Print (std::stringstream& s);
size_t GetSize () const { return m_Size; };
@@ -51,6 +53,7 @@ namespace data
DHTNode * Insert (IdentHash * h, DHTNode * root, int level); // recursive
bool Remove (const IdentHash& h, DHTNode * root, int level);
IdentHash * FindClosest (const IdentHash& h, DHTNode * root, int level);
void FindClosest (const IdentHash& h, size_t num, DHTNode * root, int level, std::vector<IdentHash *>& hashes);
void Print (std::stringstream& s, DHTNode * root, int level);
private: