From 1a06bbe430ff57753c2f722040c7f2ff3edde010 Mon Sep 17 00:00:00 2001 From: antirez Date: Fri, 25 Oct 2013 17:05:55 +0200 Subject: [PATCH] Fixed typos in dictScan() comment. --- src/dict.c | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/src/dict.c b/src/dict.c index 1ac29f1d..3e010921 100644 --- a/src/dict.c +++ b/src/dict.c @@ -698,7 +698,7 @@ static unsigned long rev(unsigned long v) { * (in binary) 1111. The position of a key in the hash table will be always * the last four bits of the hash output, and so forth. * - * WHAT HAPPENS DURING REHASHING, WHEN YOU HAVE TWO TABLES? + * WHAT HAPPENS IF THE TABLE CHANGES IN SIZE? * * If the hash table grows, elements can go anyway in one multiple of * the old bucket: for example let's say that we already iterated with @@ -720,7 +720,7 @@ static unsigned long rev(unsigned long v) { * as we are sure that, we tried for example, both 0111 and 1111 (all the * variations of the higher bit) so we don't need to test it again. * - * But wait... You have *two* tables in a given moment during rehashing! + * WAIT... YOU HAVE *TWO* TABLES DURING REHASHING! * * Yes, this is true, but we always iterate the smaller one of the tables, * testing also all the expansions of the current cursor into the larger -- GitLab