aboutsummaryrefslogtreecommitdiff
path: root/src/rpc/graph_algo.rs
diff options
context:
space:
mode:
authorAlex <alex@adnab.me>2023-01-11 16:05:27 +0000
committerAlex <alex@adnab.me>2023-01-11 16:05:27 +0000
commit4f409f73dc160a09b350cd830ab121ae8e994347 (patch)
tree94ad886dacb0dbbd6394b05d37f79763e5c02bea /src/rpc/graph_algo.rs
parent80e4abb98dfbf2e88414a8b28e8c9134fa0a65e7 (diff)
parentcb07e6145cf26a9bbbe44fd06090a099030d0750 (diff)
downloadgarage-4f409f73dc160a09b350cd830ab121ae8e994347.tar.gz
garage-4f409f73dc160a09b350cd830ab121ae8e994347.zip
Merge pull request 'Changed all instances of assignation to assignment' (#465) from jpds/garage:assignments-correction into next
Reviewed-on: https://git.deuxfleurs.fr/Deuxfleurs/garage/pulls/465
Diffstat (limited to 'src/rpc/graph_algo.rs')
-rw-r--r--src/rpc/graph_algo.rs4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/rpc/graph_algo.rs b/src/rpc/graph_algo.rs
index f181e2ba..65450d64 100644
--- a/src/rpc/graph_algo.rs
+++ b/src/rpc/graph_algo.rs
@@ -1,5 +1,5 @@
//! This module deals with graph algorithms.
-//! It is used in layout.rs to build the partition to node assignation.
+//! It is used in layout.rs to build the partition to node assignment.
use rand::prelude::SliceRandom;
use std::cmp::{max, min};
@@ -177,7 +177,7 @@ impl Graph<FlowEdge> {
let flow_upper_bound = self.flow_upper_bound()?;
// To ensure the dispersion of the associations generated by the
- // assignation, we shuffle the neighbours of the nodes. Hence,
+ // assignment, we shuffle the neighbours of the nodes. Hence,
// the vertices do not consider their neighbours in the same order.
self.shuffle_edges();