mirror of
https://github.com/Xahau/xahaud.git
synced 2025-12-06 17:27:52 +00:00
3a1a5d12de
* Revise documentation in README.md * Inject abstract_clock in Manager * Introduce the Slot object as a replacement for Peer * New bullet-proof method for slot accounting * Replace Peer with Slot for tracking connections * Prevent duplicate outbound connection attempts * Improved connection and bootstrap business logic * Refactor PeerImp, PeersImp private interfaces * Give PeersImp access to the PeerImp interface * Handle errors retrieving endpoints from asio sockets * Use weak_ptr to manage PeerImp lifetime * Better handling of socket closure in PeerImp * Improve the orderly shutdown logic of PeersImp
79 lines
2.3 KiB
C++
79 lines
2.3 KiB
C++
//------------------------------------------------------------------------------
|
|
/*
|
|
This file is part of rippled: https://github.com/ripple/rippled
|
|
Copyright (c) 2012, 2013 Ripple Labs Inc.
|
|
|
|
Permission to use, copy, modify, and/or distribute this software for any
|
|
purpose with or without fee is hereby granted, provided that the above
|
|
copyright notice and this permission notice appear in all copies.
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
|
WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
|
MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
|
|
ANY SPECIAL , DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
|
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
|
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
|
|
OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
|
*/
|
|
//==============================================================================
|
|
|
|
#ifndef RIPPLE_PEERFINDER_SIM_PREDICATES_H_INCLUDED
|
|
#define RIPPLE_PEERFINDER_SIM_PREDICATES_H_INCLUDED
|
|
|
|
namespace ripple {
|
|
namespace PeerFinder {
|
|
namespace Sim {
|
|
|
|
/** UnaryPredicate, returns `true` if the 'to' node on a Link matches. */
|
|
/** @{ */
|
|
template <typename Node>
|
|
class is_remote_node_pred
|
|
{
|
|
public:
|
|
is_remote_node_pred (Node const& node)
|
|
: node (node)
|
|
{ }
|
|
template <typename Link>
|
|
bool operator() (Link const& l) const
|
|
{ return &node == &l.remote_node(); }
|
|
private:
|
|
Node const& node;
|
|
};
|
|
|
|
template <typename Node>
|
|
is_remote_node_pred <Node> is_remote_node (Node const& node)
|
|
{
|
|
return is_remote_node_pred <Node> (node);
|
|
}
|
|
|
|
template <typename Node>
|
|
is_remote_node_pred <Node> is_remote_node (Node const* node)
|
|
{
|
|
return is_remote_node_pred <Node> (*node);
|
|
}
|
|
/** @} */
|
|
|
|
//------------------------------------------------------------------------------
|
|
|
|
/** UnaryPredicate, `true` if the remote address matches. */
|
|
class is_remote_endpoint
|
|
{
|
|
public:
|
|
explicit is_remote_endpoint (IPAddress const& address)
|
|
: m_endpoint (address)
|
|
{ }
|
|
template <typename Link>
|
|
bool operator() (Link const& link) const
|
|
{
|
|
return link.remote_endpoint() == m_endpoint;
|
|
}
|
|
private:
|
|
IPAddress const m_endpoint;
|
|
};
|
|
|
|
}
|
|
}
|
|
}
|
|
|
|
#endif
|