diff options
| author | Jonathan Davies <jpds@protonmail.com> | 2023-01-05 11:09:25 +0000 |
|---|---|---|
| committer | Jonathan Davies <jpds@protonmail.com> | 2023-01-05 11:09:25 +0000 |
| commit | cb07e6145cf26a9bbbe44fd06090a099030d0750 (patch) | |
| tree | 94ad886dacb0dbbd6394b05d37f79763e5c02bea /src/rpc/graph_algo.rs | |
| parent | 80e4abb98dfbf2e88414a8b28e8c9134fa0a65e7 (diff) | |
| download | garage-cb07e6145cf26a9bbbe44fd06090a099030d0750.tar.gz garage-cb07e6145cf26a9bbbe44fd06090a099030d0750.zip | |
Changed all instances of assignation to assignment.
Diffstat (limited to 'src/rpc/graph_algo.rs')
| -rw-r--r-- | src/rpc/graph_algo.rs | 4 |
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(); |