#include <kclosestnodessearch.h>
- Author
- Joris Guisson joris.nosp@m..gui.nosp@m.sson@.nosp@m.gmai.nosp@m.l.com
Class used to store the search results during a K closests nodes search Note: we use a std::map because of lack of functionality in QMap
Definition at line 37 of file kclosestnodessearch.h.
◆ KClosestNodesSearch()
dht::KClosestNodesSearch::KClosestNodesSearch |
( |
const dht::Key & |
key, |
|
|
bt::Uint32 |
max_entries |
|
) |
| |
Constructor sets the key to compare with
- Parameters
-
key | The key to compare with |
max_entries | The maximum number of entries can be in the map |
- Returns
◆ pack()
◆ tryInsert()
void dht::KClosestNodesSearch::tryInsert |
( |
const KBucketEntry & |
e | ) |
|
Try to insert an entry.
- Parameters
-
The documentation for this class was generated from the following file: