From d6e9e6ef36abc5110dc7abfd0fcffddc6100a62e Mon Sep 17 00:00:00 2001 From: Akansha Maloo Date: Tue, 24 Sep 2024 18:48:59 +0000 Subject: [PATCH] typo --- storage/dataflux/range_splitter.go | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/storage/dataflux/range_splitter.go b/storage/dataflux/range_splitter.go index 5da1aeb54804..4451e00aa48d 100644 --- a/storage/dataflux/range_splitter.go +++ b/storage/dataflux/range_splitter.go @@ -81,12 +81,12 @@ func newRangeSplitter(alphabet string) (*rangeSplitter, error) { // the algorithm assumes it to be sequence of smallest possible character and empty // end range as sequence of highest possible characters. // -// For example, sorted alphabet {"a","b","c","d"} +// For example, sorted alphabet = {"a","b","c","d"} // Input: startRange= "d", endRange= "", numSplits=2 // // This will be converted from base-N to base-10 integers. // While calculating base-10 integer, "a" will be appended to startRange -// and "d" will be appended to endRange until the difference between integers it +// and "d" will be appended to endRange until the difference between integers is // more than number of splits. // startInteger for "da" = 12, endInteger for "dd" = 15 //