libdht

A simple helper library for distributed hash tables.
git clone git://r-36.net/libdht
Log | Files | Refs | LICENSE

commit 95fe3e191752f3c0c61ab062ade1ccd8b07c6b3f
parent 0f07ba665e3bb84594cbaaac03393a72d26219e8
Author: Christoph Lohmann <20h@r-36.net>
Date:   Tue,  8 Mar 2011 02:48:21 +0100

Correcting the function description.

Diffstat:
dht.h | 5++---
1 file changed, 2 insertions(+), 3 deletions(-)

diff --git a/dht.h b/dht.h @@ -99,13 +99,12 @@ dhtlist_t *dhtrouting_findclosest(dhtrouting_t *route, dhtnode_t *target, /* * These are the high-level functions for dht handling. */ - dht_t *dht_new(char *network); /* network is a unique identifier */ void dht_free(dht_t *dht); /* - * This function will get you a dhtlist with a maximum of max elements, - * which are the closest nodes to your position. + * This function will return a list of nodes, with a maximum of max entries, + * which are close to the target node and known by you. */ dhtlist_t *dht_find(dht_t *dht, dhtnode_t *target, int max);