From aef52c0e19c3699cd21a200136d785e0ea9dccb3 Mon Sep 17 00:00:00 2001 From: Josh Soref <2119212+jsoref@users.noreply.github.com> Date: Tue, 19 Mar 2024 08:25:46 -0400 Subject: [PATCH] spelling: would Signed-off-by: Josh Soref <2119212+jsoref@users.noreply.github.com> --- design/tlog-spilling.md.html | 2 +- fdbserver/include/fdbserver/MovingWindow.h | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/design/tlog-spilling.md.html b/design/tlog-spilling.md.html index 51c0b1c064b..0d05a53add8 100644 --- a/design/tlog-spilling.md.html +++ b/design/tlog-spilling.md.html @@ -571,7 +571,7 @@ If this turns out to be an issue, it's trivial to address. There's no reason to do only a binary search when drives support parallel requests. A - 32-way search could reasonably be done, and would would make a 4TB Disk + 32-way search could reasonably be done, and would make a 4TB Disk Queue file faster to recover than a 4GB one currently. 3. Disk queue files can now shrink. diff --git a/fdbserver/include/fdbserver/MovingWindow.h b/fdbserver/include/fdbserver/MovingWindow.h index 09d2c0784e8..95588f671be 100644 --- a/fdbserver/include/fdbserver/MovingWindow.h +++ b/fdbserver/include/fdbserver/MovingWindow.h @@ -33,7 +33,7 @@ // want to get the actual average bytes moved rate by DD in the past DD_TRACE_MOVE_BYTES_AVERAGE_INTERVAL. We would have // a sense of how many bytes DD moved recently and it will help us get to know DD workload. // Comparison with Smoother: if you want to use a recency-based weighting(i.e. less important if sampled long time ago) -// Smoother(which uses an exponential function for smoothing) woule be a good choice. On the other hand, if you want to +// Smoother(which uses an exponential function for smoothing) would be a good choice. On the other hand, if you want to // know the average sample rates in the last , MovingWindow might be better. template