00001 /* 00002 00003 Copyright (c) 2006, Arvid Norberg & Daniel Wallin 00004 All rights reserved. 00005 00006 Redistribution and use in source and binary forms, with or without 00007 modification, are permitted provided that the following conditions 00008 are met: 00009 00010 * Redistributions of source code must retain the above copyright 00011 notice, this list of conditions and the following disclaimer. 00012 * Redistributions in binary form must reproduce the above copyright 00013 notice, this list of conditions and the following disclaimer in 00014 the documentation and/or other materials provided with the distribution. 00015 * Neither the name of the author nor the names of its 00016 contributors may be used to endorse or promote products derived 00017 from this software without specific prior written permission. 00018 00019 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 00020 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00021 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 00022 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 00023 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 00024 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 00025 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 00026 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 00027 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 00028 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 00029 POSSIBILITY OF SUCH DAMAGE. 00030 00031 */ 00032 00033 #ifndef CLOSEST_NODES_050323_HPP 00034 #define CLOSEST_NODES_050323_HPP 00035 00036 #include <vector> 00037 00038 #include <libtorrent/kademlia/traversal_algorithm.hpp> 00039 #include <libtorrent/kademlia/node_id.hpp> 00040 #include <libtorrent/kademlia/routing_table.hpp> 00041 00042 #include <boost/function.hpp> 00043 00044 namespace libtorrent { namespace dht 00045 { 00046 00047 class rpc_manager; 00048 00049 // -------- closest nodes ----------- 00050 00051 class closest_nodes : public traversal_algorithm 00052 { 00053 public: 00054 typedef boost::function< 00055 void(std::vector<node_entry> const&) 00056 > done_callback; 00057 00058 static void initiate( 00059 node_id target 00060 , int branch_factor 00061 , int max_results 00062 , routing_table& table 00063 , rpc_manager& rpc 00064 , done_callback const& callback 00065 ); 00066 00067 private: 00068 void done(); 00069 void invoke(node_id const& id, asio::ip::udp::endpoint addr); 00070 00071 closest_nodes( 00072 node_id target 00073 , int branch_factor 00074 , int max_results 00075 , routing_table& table 00076 , rpc_manager& rpc 00077 , done_callback const& callback 00078 ); 00079 00080 done_callback m_done_callback; 00081 }; 00082 00083 } } // namespace libtorrent::dht 00084 00085 #endif // CLOSEST_NODES_050323_HPP 00086
1.5.6