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/table/table.rs | |
parent | 255b01b626096ef98cf24c9552b39c0372fb4eb3 (diff) | |
download | garage-2eb9fcae20cb7e41b1197f4565db492a97f95736.tar.gz garage-2eb9fcae20cb7e41b1197f4565db492a97f95736.zip |
Fix all typos
Diffstat (limited to 'src/table/table.rs')
-rw-r--r-- | src/table/table.rs | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/table/table.rs b/src/table/table.rs index a5be2910..ea8471d0 100644 --- a/src/table/table.rs +++ b/src/table/table.rs @@ -171,11 +171,11 @@ impl<F: TableSchema, R: TableReplication> Table<F, R> { // We will here batch all items into a single request for each concerned // node, with all of the entries it must store within that request. // Each entry has to be saved to a specific list of "write sets", i.e. a set - // of node within wich a quorum must be achieved. In normal operation, there + // of node within which a quorum must be achieved. In normal operation, there // is a single write set which corresponds to the quorum in the current // cluster layout, but when the layout is updated, multiple write sets might // have to be handled at once. Here, since we are sending many entries, we - // will have to handle many write sets in all cases. The algorihtm is thus + // will have to handle many write sets in all cases. The algorithm is thus // to send one request to each node with all the items it must save, // and keep track of the OK responses within each write set: if for all sets // a quorum of nodes has answered OK, then the insert has succeeded and |