always announce new heads

1 files changed, 1 insertions, 11 deletions

diff --git a/src/swarm/topology/mod.rs b/src/swarm/topology/mod.rs
index df75f46..e3479e3 100644
--- a/src/swarm/topology/mod.rs
+++ b/src/swarm/topology/mod.rs
@@ -67,6 +67,7 @@ pub(crate) fn view_known(state: &AppState) -> bool {
 }
 
 /// Whether every reachable member is our neighbour (also while the view is unknown).
+#[cfg(test)]
 pub(crate) fn is_full_mesh(state: &AppState) -> bool {
     state
         .neighbours
@@ -141,17 +142,6 @@ pub(crate) fn intended_graph(state: &AppState) -> Option<BTreeMap<String, BTreeS
     Some(graph)
 }
 
-/// `member`'s neighbours as the member list makes them, as this node sees it (as in
-/// `intended_graph`); None until the view is known, or for one the list doesn't have.
-pub(crate) fn neighbours_of(state: &AppState, member: &str) -> Option<BTreeSet<String>> {
-    let view = state.neighbours.read_or_recover();
-    let view = view.as_ref()?;
-    view.members
-        .iter()
-        .any(|listed| listed == member)
-        .then(|| view.neighbours_of(state.local_id(), member))
-}
-
 /// The transports `member` is on, by the member list (the schemes of its addresses);
 /// ours as we are on them. None known: empty.
 pub(crate) fn transports_of(state: &AppState, member: &str) -> BTreeSet<String> {