blob: ff19e92e2d83fd2d70fb7865ada9ad1a2e7ed3d8 (
plain)
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
|
/***************************************************************************
* Copyright (C) 2005 by Joris Guisson *
* [email protected] *
* *
* 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 DHTNODELOOKUP_H
#define DHTNODELOOKUP_H
#include "key.h"
#include "task.h"
namespace dht
{
class Node;
class RPCServer;
/**
* @author Joris Guisson <[email protected]>
*
* Task to do a node lookup.
*/
class NodeLookup : public Task
{
public:
NodeLookup(const dht::Key & node_id,RPCServer* rpc,Node* node);
virtual ~NodeLookup();
virtual void update();
virtual void callFinished(RPCCall* c, MsgBase* rsp);
virtual void callTimeout(RPCCall* c);
private:
dht::Key node_id;
bt::Uint32 num_nodes_rsp;
};
}
#endif
|
