65 lines
2.2 KiB
C++
65 lines
2.2 KiB
C++
/*
|
|
|
|
Copyright (c) 2013, Arvid Norberg
|
|
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 TORRENT_RESOLVER_INTERFACE_HPP_INCLUDE
|
|
#define TORRENT_RESOLVER_INTERFACE_HPP_INCLUDE
|
|
|
|
#include <boost/function.hpp>
|
|
#include <vector>
|
|
#include "libtorrent/error_code.hpp"
|
|
#include "libtorrent/address.hpp"
|
|
|
|
namespace libtorrent
|
|
{
|
|
|
|
using boost::asio::ip::tcp;
|
|
|
|
struct resolver_interface
|
|
{
|
|
typedef boost::function<void(error_code const&, std::vector<address> const&)>
|
|
callback_t;
|
|
|
|
// prefer_cache will always use the cache if we have
|
|
// an entry, regardless of how old it is. This is usefull
|
|
// when completing the lookup quickly is more important
|
|
// than accuracy
|
|
enum flags_t { prefer_cache = 1 };
|
|
|
|
virtual void async_resolve(std::string const& host, int flags
|
|
, callback_t const& h) = 0;
|
|
};
|
|
|
|
}
|
|
|
|
#endif
|
|
|