diff options
| author | Stefan Majer <stefan.majer@f-i-ts.de> | 2025-01-16 13:22:00 +0100 |
|---|---|---|
| committer | Stefan Majer <stefan.majer@f-i-ts.de> | 2025-01-16 13:22:00 +0100 |
| commit | 2eb9fcae20cb7e41b1197f4565db492a97f95736 (patch) | |
| tree | be9b2912ae92b07ef5e7905372b1bc2a542234c6 /src/rpc/layout/test.rs | |
| parent | 255b01b626096ef98cf24c9552b39c0372fb4eb3 (diff) | |
| download | garage-2eb9fcae20cb7e41b1197f4565db492a97f95736.tar.gz garage-2eb9fcae20cb7e41b1197f4565db492a97f95736.zip | |
Fix all typos
Diffstat (limited to 'src/rpc/layout/test.rs')
| -rw-r--r-- | src/rpc/layout/test.rs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/rpc/layout/test.rs b/src/rpc/layout/test.rs index fcbb9dfc..5462160b 100644 --- a/src/rpc/layout/test.rs +++ b/src/rpc/layout/test.rs @@ -9,7 +9,7 @@ use crate::replication_mode::ReplicationFactor; // This function checks that the partition size S computed is at least better than the // one given by a very naive algorithm. To do so, we try to run the naive algorithm -// assuming a partion size of S+1. If we succed, it means that the optimal assignment +// assuming a partition size of S+1. If we succeed, it means that the optimal assignment // was not optimal. The naive algorithm is the following : // - we compute the max number of partitions associated to every node, capped at the // partition number. It gives the number of tokens of every node. |