fixed expensive-invariant-checks build

This commit is contained in:
Arvid Norberg 2009-05-25 17:23:03 +00:00
parent 3d8f09f12b
commit efb6ec5824
3 changed files with 10 additions and 4 deletions

View File

@ -289,6 +289,12 @@ namespace libtorrent
{
return lhs < rhs->address();
}
bool operator()(
peer const* lhs, peer const* rhs) const
{
return lhs->address() < rhs->address();
}
};
typedef std::deque<peer*> peers_t;

View File

@ -708,7 +708,7 @@ namespace libtorrent
{
iter = std::lower_bound(
m_peers.begin(), m_peers.end()
, c.remote().address(), peer_address_compare()
, c.remote().address(), peer_address_compare()
);
if (iter != m_peers.end() && (*iter)->address() == c.remote().address()) found = true;
@ -942,7 +942,7 @@ namespace libtorrent
{
iter = std::lower_bound(
m_peers.begin(), m_peers.end()
, remote.address(), peer_address_compare()
, remote.address(), peer_address_compare()
);
if (iter != m_peers.end() && (*iter)->address() == remote.address()) found = true;
@ -963,7 +963,7 @@ namespace libtorrent
// update the iterator to make it valid again
iter = std::lower_bound(
m_peers.begin(), m_peers.end()
, remote.address(), peer_address_compare()
, remote.address(), peer_address_compare()
);
}

View File

@ -4294,7 +4294,7 @@ namespace libtorrent
policy::const_iterator i = m_policy.begin_peer();
policy::const_iterator prev = i++;
policy::const_iterator end(m_policy.end_peer());
policy::peer_ptr_compare cmp;
policy::peer_address_compare cmp;
for (; i != end; ++i, ++prev)
{
TORRENT_ASSERT(!cmp(*i, *prev));