pub fn reconnection_peers(&'_ self) -> impl Iterator<Item = MetaAddr> + '_ {
        let _guard = self.span.enter();

        // TODO: optimise, if needed, or get rid of older peers

        // Skip live peers, and peers pending a reconnect attempt, then sort using BTreeSet
        self.by_addr
            .values()
            .filter(move |peer| !self.maybe_connected_addr(&peer.addr))
            .collect::<BTreeSet<_>>()
            .into_iter()
            .cloned()
    }
/// Return an iterator over peers that are due for a reconnection attempt,
/// in reconnection attempt order.
Return an iterator over peers that are due for a reconnection attempt,
in reconnection attempt order.
Return an iterator over peers that are due for a reconnection attempt in reconnection attempt order .
pub fn reconnection_peers(&'_ self) -> impl Iterator<Item = MetaAddr> + '_ {
        let _guard = self.span.enter();
        // TODO: optimise, if needed, or get rid of older peers
        // Skip live peers, and peers pending a reconnect attempt, then sort using BTreeSet
        self.by_addr
            .values()
            .filter(move |peer| !self.maybe_connected_addr(&peer.addr))
            .collect::<BTreeSet<_>>()
            .into_iter()
            .cloned()
    }
pub fn reconnection_peers ( & ' _ self ) -> impl Iterator < Item = MetaAddr > + ' _ { let _guard = self . span . enter ( ) ; // TODO: optimise, if needed, or get rid of older peers // Skip live peers, and peers pending a reconnect attempt, then sort using BTreeSet self . by_addr . values ( ) . filter ( move | peer | ! self . maybe_connected_addr ( & peer . addr ) ) . collect :: < BTreeSet < _ > > ( ) . into_iter ( ) . cloned ( ) }
Return an iterator over peers that are due for a reconnection attempt,
in reconnection attempt order.
Return an iterator over peers that are due for a reconnection attempt in reconnection attempt order .
&'_ self