mirror of
https://github.com/RetroShare/RetroShare.git
synced 2025-06-06 05:38:51 -04:00
Merging from branches/v0.5-peernet/libbitdht (--- Merging r4354 through r4356 into '.')
* adding Bloom filter to speed up finding RS peers. * fixed startup bug. (loops into FAILURE) git-svn-id: http://svn.code.sf.net/p/retroshare/code/trunk@4357 b45a01b8-16f6-495d-af2f-9b41ad6348cc
This commit is contained in:
parent
702ff44194
commit
79b48d5a89
15 changed files with 820 additions and 21 deletions
91
libbitdht/src/tests/bdbloom_makefilter.cc
Normal file
91
libbitdht/src/tests/bdbloom_makefilter.cc
Normal file
|
@ -0,0 +1,91 @@
|
|||
/*
|
||||
* bitdht/bdbloom_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 "util/bdbloom.h"
|
||||
#include "bitdht/bdstddht.h"
|
||||
#include <iostream>
|
||||
#include <sstream>
|
||||
|
||||
#define N_TESTS 100
|
||||
|
||||
int main(int argc, char **argv)
|
||||
{
|
||||
/* read from the file */
|
||||
if (argc < 2)
|
||||
{
|
||||
std::cerr << "Missing Hash File";
|
||||
std::cerr << std::endl;
|
||||
}
|
||||
|
||||
FILE *fd = fopen(argv[1], "r");
|
||||
if (!fd)
|
||||
{
|
||||
std::cerr << "Failed to Open File: " << argv[1];
|
||||
std::cerr << std::endl;
|
||||
return 1;
|
||||
}
|
||||
|
||||
char line[1000];
|
||||
|
||||
bdBloom filter;
|
||||
|
||||
int nHashes = 0;
|
||||
while(fgets(line, 1000-1, fd))
|
||||
{
|
||||
std::string hash = line;
|
||||
std::cerr << "Read Hash: " << hash;
|
||||
std::cerr << std::endl;
|
||||
|
||||
filter.add(hash);
|
||||
nHashes++;
|
||||
}
|
||||
fclose(fd);
|
||||
|
||||
filter.printFilter(std::cerr);
|
||||
|
||||
int bits = filter.countBits();
|
||||
int filterBits = filter.filterBits();
|
||||
std::cerr << "Filter Bits Set: " << bits;
|
||||
std::cerr << std::endl;
|
||||
|
||||
double possible = ((double) bits) * bits;
|
||||
double max = ((double) filterBits) * filterBits;
|
||||
std::cerr << "Therefore Possible Finds: " << possible << "/" << max << " = %" << 100 * possible / max;
|
||||
std::cerr << std::endl;
|
||||
std::cerr << "With Insertions: " << nHashes;
|
||||
std::cerr << std::endl;
|
||||
|
||||
std::cerr << std::endl;
|
||||
std::cerr << std::endl;
|
||||
|
||||
std::cerr << "Filter String: " << filter.getFilter() << std::endl;
|
||||
std::cerr << std::endl;
|
||||
std::cerr << std::endl;
|
||||
|
||||
return 1;
|
||||
}
|
||||
|
||||
|
Loading…
Add table
Add a link
Reference in a new issue