replace eager links by trees

1 files changed, 0 insertions, 10 deletions

diff --git a/src/state/peer.rs b/src/state/peer.rs
index 06269e9..ca721b5 100644
--- a/src/state/peer.rs
+++ b/src/state/peer.rs
@@ -146,11 +146,6 @@ pub(crate) struct PeerState {
     /// with its epoch: once they are ours, it has every change we would announce to it
     /// (`swarm::relay`).
     pub(crate) last_heads: Option<(transport::Epoch, transport::HeadsSummary)>,
-    /// The link's modes (`swarm::relay`): whether the peer wants our changes as we apply
-    /// them (its STATUS says so: we forward them to it), and whether we want its (ours
-    /// says so). Both lazy (announced only) until a pull makes ours eager.
-    pub(crate) eager_to: bool,
-    pub(crate) eager_from: bool,
     /// Whom it said it reaches (`swarm::reach`), by pair key, and when.
     pub(crate) reaches: Option<(Instant, Vec<u64>)>,
     /// Whose change the next sync message to it passes on along the writer's tree
@@ -247,8 +242,6 @@ impl PeerState {
             syncs_with_us: None,
             reported_heads: None,
             last_heads: None,
-            eager_to: false,
-            eager_from: false,
             reaches: None,
             tree_writer: None,
             left: false,
@@ -266,9 +259,6 @@ impl PeerState {
         let mut reply_backoff = self.sync.reply_backoff;
         reply_backoff.reset();
         self.sync = SyncSession::new(reply_backoff);
-        // The link starts lazy again: a pull makes it eager when it proves itself.
-        self.eager_to = false;
-        self.eager_from = false;
         // Said over the session that ended.
         self.reaches = None;
     }