premiere-libtorrent/include/libtorrent/kademlia/get_item.hpp

94 lines
2.8 KiB
C++
Raw Normal View History

/*
Copyright (c) 2013, Steven Siloti
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the distribution.
* Neither the name of the author nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef LIBTORRENT_GET_ITEM_HPP
#define LIBTORRENT_GET_ITEM_HPP
#include <libtorrent/kademlia/find_data.hpp>
#include <libtorrent/kademlia/item.hpp>
#include <memory>
namespace libtorrent { namespace dht {
class get_item : public find_data
{
public:
typedef std::function<void(item const&, bool)> data_callback;
void got_data(bdecode_node const& v,
public_key const& pk,
sequence_number seq,
signature const& sig);
// for immutable items
get_item(node& dht_node
, node_id const& target
2015-09-22 20:10:57 +02:00
, data_callback const& dcallback
, nodes_callback const& ncallback);
// for mutable items
get_item(node& dht_node
, public_key const& pk
, span<char const> salt
2015-09-22 20:10:57 +02:00
, data_callback const& dcallback
, nodes_callback const& ncallback);
2017-09-12 23:10:11 +02:00
char const* name() const override;
protected:
2017-09-12 23:10:11 +02:00
observer_ptr new_observer(udp::endpoint const& ep
, node_id const& id) override;
bool invoke(observer_ptr o) override;
void done() override;
data_callback m_data_callback;
item m_data;
2015-11-20 03:41:56 +01:00
bool m_immutable;
};
class get_item_observer : public find_data_observer
{
public:
get_item_observer(
std::shared_ptr<traversal_algorithm> const& algorithm
, udp::endpoint const& ep, node_id const& id)
: find_data_observer(algorithm, ep, id)
{}
2017-09-12 23:10:11 +02:00
void reply(msg const&) override;
};
} } // namespace libtorrent::dht
#endif // LIBTORRENT_GET_ITEM_HPP