/usr/include/libktorrent/dht/kclosestnodessearch.h is in libktorrent-dev 1.3.1-5.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 | /***************************************************************************
* Copyright (C) 2005 by Joris Guisson *
* joris.guisson@gmail.com *
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
* This program 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 General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program; if not, write to the *
* Free Software Foundation, Inc., *
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *
***************************************************************************/
#ifndef DHTKCLOSESTNODESSEARCH_H
#define DHTKCLOSESTNODESSEARCH_H
#include <map>
#include "key.h"
#include "kbucket.h"
namespace dht
{
class PackedNodeContainer;
/**
* @author Joris Guisson <joris.guisson@gmail.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
*/
class KClosestNodesSearch
{
dht::Key key;
std::map<dht::Key, KBucketEntry> emap;
bt::Uint32 max_entries;
public:
/**
* Constructor sets the key to compare with
* @param key The key to compare with
* @param max_entries The maximum number of entries can be in the map
* @return
*/
KClosestNodesSearch(const dht::Key & key, bt::Uint32 max_entries);
virtual ~KClosestNodesSearch();
typedef std::map<dht::Key, KBucketEntry>::iterator Itr;
typedef std::map<dht::Key, KBucketEntry>::const_iterator CItr;
Itr begin() {return emap.begin();}
Itr end() {return emap.end();}
CItr begin() const {return emap.begin();}
CItr end() const {return emap.end();}
/// Get the target key of the search3
const dht::Key & getSearchTarget() const {return key;}
/// Get the number of entries.
bt::Uint32 getNumEntries() const {return emap.size();}
/**
* Try to insert an entry.
* @param e The entry
*/
void tryInsert(const KBucketEntry & e);
/**
* Pack the search results in a PackedNodeContainer.
* @param cnt Place to store IPv6 nodes
*/
void pack(PackedNodeContainer* cnt);
};
}
#endif
|