Optimise getting the next connection attempt address

zebra-network/src/address_book.rs

@@ -1,12 +1,7 @@
 //! The `AddressBook` manages information about what peers exist, when they were
 //! seen, and what services they provide.
 
-use std::{
-    collections::{BTreeSet, HashMap},
-    iter::Extend,
-    net::SocketAddr,
-    time::Instant,
-};
+use std::{collections::HashMap, iter::Extend, net::SocketAddr, time::Instant};
 
 use chrono::{DateTime, Utc};
 use tracing::Span;
@@ -323,19 +318,14 @@ impl AddressBook {
             .cloned()
     }
 
-    /// Return an iterator over peers that are due for a connection attempt,
-    /// in connection attempt order.
-    pub fn connection_peers_ordered(&'_ self) -> impl Iterator<Item = MetaAddr> + '_ {
+    /// Return the next peer that is due for a connection attempt.
+    pub fn next_attempt_peer(&self) -> Option<MetaAddr> {
         let _guard = self.span.enter();
 
-        // TODO: optimise, if needed, or get rid of older peers
-
-        // Skip recently used peers (including live peers), then sort using BTreeSet
-        self.by_addr
-            .values()
+        // Skip recently used peers (including live peers)
+        self.peers_unordered()
             .filter(move |peer| !self.recently_used_addr(&peer.addr))
-            .collect::<BTreeSet<_>>()
-            .into_iter()
+            .max()
             .cloned()
     }
 

zebra-network/src/peer_set/candidate_set.rs

@@ -290,7 +290,7 @@ where
             let mut guard = self.address_book.lock().unwrap();
             // It's okay to return without sleeping here, because we're returning
             // `None`. We only need to sleep before yielding an address.
-            let connect = guard.connection_peers_ordered().next()?;
+            let connect = guard.next_attempt_peer()?;
 
             let connect = MetaAddr::update_attempt(&connect.addr);
             guard.update(connect)?