Changeset View

Standalone View

Show First 20 Lines • Show All 106 Lines • ▼ Show 20 Lines	return nodes.modify(nit, [&](Node &n) {
n.pubkey = std::move(pubkey);		n.pubkey = std::move(pubkey);
});		});
}		}

bool PeerManager::removeNode(NodeId nodeid) {		bool PeerManager::removeNode(NodeId nodeid) {
return nodes.erase(nodeid) > 0;		return nodes.erase(nodeid) > 0;
}		}

		bool PeerManager::updateNextRequestTime(NodeId nodeid, TimePoint timeout) {
		auto it = nodes.find(nodeid);
		if (it == nodes.end()) {
		return false;
		}

		return nodes.modify(it, [&](Node &n) { n.nextRequestTime = timeout; });
		}

NodeId PeerManager::getSuitableNodeToQuery() {		NodeId PeerManager::getSuitableNodeToQuery() {
for (int retry = 0; retry < SELECT_NODE_MAX_RETRY; retry++) {		for (int retry = 0; retry < SELECT_NODE_MAX_RETRY; retry++) {
const PeerId p = selectPeer();		const PeerId p = selectPeer();

// If we cannot find a peer, it may be due to the fact that it is		// If we cannot find a peer, it may be due to the fact that it is
// unlikely due to high fragmentation, so compact and retry.		// unlikely due to high fragmentation, so compact and retry.
if (p == NO_PEER) {		if (p == NO_PEER) {
compact();		compact();
▲ Show 20 Lines • Show All 160 Lines • Show Last 20 Lines