src/kademlia/routing_table.cpp
// this function is called every time the node sees a sign of a node being
// alive. This node will either be inserted in the k-buckets or be moved to the
// top of its bucket. the return value indicates if the table needs a refresh.
// if true, the node should refresh the table (i.e. do a find_node on its own
// id)
this function is called every time the node sees a sign of a node being
alive. This node will either be inserted in the k-buckets or be moved to the
top of its bucket. the return value indicates if the table needs a refresh.
if true, the node should refresh the table
this function is called every time the node sees a sign of a node being alive . This node will either be inserted in the k - buckets or be moved to the top of its bucket . the return value indicates if the table needs a refresh . if true the node should refresh the table
bool routing_table::node_seen(node_id const& id, udp::endpoint ep, int rtt)
{
	if (!verify_node_address(m_settings, id, ep.address())) return false;
	return add_node(node_entry(id, ep, rtt, true));
}
bool routing_table :: node_seen ( node_id const & id , udp :: endpoint ep , int rtt ) { if ( ! verify_node_address ( m_settings , id , ep . address ( ) ) ) return false ; return add_node ( node_entry ( id , ep , rtt , true ) ) ; }
this function is called every time the node sees a sign of a node being
alive.
this function is called every time the node sees a sign of a node being alive .