diff options
Diffstat (limited to 'src/simtest/bench.rs')
| -rw-r--r-- | src/simtest/bench.rs | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/simtest/bench.rs b/src/simtest/bench.rs index 2a96007..e8e452c 100644 --- a/src/simtest/bench.rs +++ b/src/simtest/bench.rs @@ -122,7 +122,7 @@ fn lossy(sim: &Sim, _: &[String]) { /// from 20 to 250 ms, each message within a fifth of its link's. So what the uniform /// 50–500 ms of `lossy` gives that real links don't: messages on one link overtake each /// other only within the jitter, and the fast links to a node are fast every time. -fn mycelium_like(sim: &Sim, ids: &[String]) { +pub(super) fn mycelium_like(sim: &Sim, ids: &[String]) { let mut rng = crate::testrand::Rng::new(7); for (i, from) in ids.iter().enumerate() { for to in &ids[i + 1..] { @@ -694,7 +694,7 @@ async fn trees(out: &mut String, nodes: &[AppState], net: &crate::transport::sim /// says it has them; a session whose peer never sends one (along a tree, with one /// writer) keeps all. And of those, how many because another parent brings them /// (`SyncSession::known_to_peer`): a session with a neighbour we count as covered. -async fn sent_kept(out: &mut String, nodes: &[AppState]) { +pub(super) async fn sent_kept(out: &mut String, nodes: &[AppState]) { let (mut most, mut sum) = (0, 0); let (mut most_elsewhere, mut sum_elsewhere) = (0, 0); let mut sessions = 0; |