diff options
Diffstat (limited to 'src/swarm')
| -rw-r--r-- | src/swarm/dissemination.rs | 3 | ||||
| -rw-r--r-- | src/swarm/refusals.rs | 3 | ||||
| -rw-r--r-- | src/swarm/topology/mod.rs | 3 |
3 files changed, 3 insertions, 6 deletions
diff --git a/src/swarm/dissemination.rs b/src/swarm/dissemination.rs index 9763449..4c15d0f 100644 --- a/src/swarm/dissemination.rs +++ b/src/swarm/dissemination.rs @@ -1,8 +1,7 @@ //! How a change reaches every member: whom a node sends a writer's changes to at once, //! and whom it leaves to the announcement rounds (`swarm::relay`, which repair what it //! misses: announcements, pulls, the slow round). Writers' trees (`swarm::tree`) are -//! one way; others can be tried against them in the benchmark (`docs/future-work.md`, -//! Swappable topology and dissemination). One per swarm: a node's part in passing a +//! one way; others can be tried against them in the benchmark. One per swarm: a node's part in passing a //! change on is worked out by itself and by its neighbours, and must agree. //! //! What every way keeps: the base underneath, pairs of neighbours syncing with diff --git a/src/swarm/refusals.rs b/src/swarm/refusals.rs index 30c3971..652f9bc 100644 --- a/src/swarm/refusals.rs +++ b/src/swarm/refusals.rs @@ -12,8 +12,7 @@ //! everything built on it: its document as it would be without them, its own writes //! among them quarantined, the others' listed as refused (`AppState::drop_taken`); one //! taking much, once a second member says so too. If its rules take it, the two -//! policies disagree, which it logs; finding out which is right is left -//! (`future-work.md`, Write protection by checking changes). +//! policies disagree, which it logs; it doesn't find out which is right. use std::time::Duration; diff --git a/src/swarm/topology/mod.rs b/src/swarm/topology/mod.rs index 2d812e5..8fae0ed 100644 --- a/src/swarm/topology/mod.rs +++ b/src/swarm/topology/mod.rs @@ -41,8 +41,7 @@ use graph::*; pub(crate) use graph::{RingAndPairs, pair_key, pair_score}; /// How members' neighbours are chosen: the graph above (`RingAndPairs`) is one way; -/// others can be tried against it in the benchmark (`docs/future-work.md`, Swappable -/// topology and dissemination). One per swarm: a node's neighbours must count it as +/// others can be tried against it in the benchmark. One per swarm: a node's neighbours must count it as /// theirs. /// /// A topology either computes a graph every node shares (`graph`: the same inputs give |