mirror of
https://github.com/RetroShare/RetroShare.git
synced 2025-01-03 20:01:07 -05:00
fff40eceac
There are many significant improvements to the DHT here. See commit logs on v0.5-peernet branch for details. This is not the final merge, but brings over the majority of expected v0.5-peernet/libbitdht changes git-svn-id: http://svn.code.sf.net/p/retroshare/code/trunk@4354 b45a01b8-16f6-495d-af2f-9b41ad6348cc
84 lines
1.8 KiB
C++
84 lines
1.8 KiB
C++
/*
|
|
* bitdht/bdquery_test.cc
|
|
*
|
|
* BitDHT: An Flexible DHT library.
|
|
*
|
|
* Copyright 2010 by Robert Fernie
|
|
*
|
|
* This library is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Library General Public
|
|
* License Version 3 as published by the Free Software Foundation.
|
|
*
|
|
* This library is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
* Library General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Library General Public
|
|
* License along with this library; if not, write to the Free Software
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
|
|
* USA.
|
|
*
|
|
* Please report all bugs and problems to "bitdht@lunamutt.com".
|
|
*
|
|
*/
|
|
|
|
|
|
#include "bitdht/bdpeer.h"
|
|
#include "bitdht/bdstddht.h"
|
|
#include "bitdht/bdquery.h"
|
|
|
|
#define N_PEERS_TO_ADD 10000
|
|
#define N_PEERS_TO_PRINT 1000
|
|
#define N_PEERS_TO_START 10
|
|
|
|
int main(int argc, char **argv)
|
|
{
|
|
|
|
/* create some ids */
|
|
bdNodeId ownId;
|
|
bdStdRandomNodeId(&ownId);
|
|
|
|
bdDhtFunctions *fns = new bdStdDht();
|
|
|
|
bdSpace space(&ownId, fns);
|
|
int i = 0;
|
|
for (i = 0; i < N_PEERS_TO_ADD; i++)
|
|
{
|
|
bdId tmpId;
|
|
bdStdRandomId(&tmpId);
|
|
|
|
space.add_peer(&tmpId, 0);
|
|
}
|
|
|
|
space.printDHT();
|
|
|
|
/* create a query */
|
|
bdId queryId;
|
|
bdStdRandomId(&queryId);
|
|
|
|
|
|
|
|
std::list<bdId> startList;
|
|
std::multimap<bdMetric, bdId> nearest;
|
|
std::multimap<bdMetric, bdId>::iterator it;
|
|
|
|
space.find_nearest_nodes(&(queryId.id), N_PEERS_TO_START, nearest);
|
|
|
|
for(it = nearest.begin(); it != nearest.end(); it++)
|
|
{
|
|
startList.push_back(it->second);
|
|
}
|
|
|
|
bdQuery query(&(queryId.id), startList, BITDHT_QFLAGS_DISGUISE, fns);
|
|
|
|
/* */
|
|
|
|
query.printQuery();
|
|
|
|
|
|
return 1;
|
|
}
|
|
|
|
|