MCPcopy Create free account
hub / github.com/PurpleI2P/i2pd / FindClosest

Method FindClosest

libi2pd/KadDHT.cpp:189–195  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

187 }
188
189 std::shared_ptr<RouterInfo> DHTTable::FindClosest (const IdentHash& h, const Filter& filter) const
190 {
191 if (filter) m_Filter = filter;
192 auto r = FindClosest (h, m_Root, 0);
193 m_Filter = nullptr;
194 return r;
195 }
196
197 std::shared_ptr<RouterInfo> DHTTable::FindClosest (const IdentHash& h, DHTNode * root, int level) const
198 {

Callers 2

GetClosestFloodfillMethod · 0.80
GetClosestFloodfillsMethod · 0.80

Calls 1

push_backMethod · 0.80

Tested by

no test coverage detected