summaryrefslogtreecommitdiff
path: root/name-hash.c
diff options
context:
space:
mode:
authorElijah Newren <newren@gmail.com>2019-11-05 23:31:32 (GMT)
committerJunio C Hamano <gitster@pobox.com>2019-11-07 05:41:00 (GMT)
commit77363a51fb00a0ca348f3b6bfb5bbe7d36877886 (patch)
tree2e89101b7d10f8c92177d08b735f5976f012581b /name-hash.c
parentc92faa4d22a1377ab9776063cfd33b3cfd9f5884 (diff)
downloadgit-77363a51fb00a0ca348f3b6bfb5bbe7d36877886.zip
git-77363a51fb00a0ca348f3b6bfb5bbe7d36877886.tar.gz
git-77363a51fb00a0ca348f3b6bfb5bbe7d36877886.tar.bz2
name-hash.c: remove duplicate word in comment
Signed-off-by: Elijah Newren <newren@gmail.com> Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 'name-hash.c')
-rw-r--r--name-hash.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/name-hash.c b/name-hash.c
index ceb1d7b..4885bae 100644
--- a/name-hash.c
+++ b/name-hash.c
@@ -218,7 +218,7 @@ static int lookup_lazy_params(struct index_state *istate)
* However, the hashmap is going to put items into bucket
* chains based on their hash values. Use that to create n
* mutexes and lock on mutex[bucket(hash) % n]. This will
- * decrease the collision rate by (hopefully) by a factor of n.
+ * decrease the collision rate by (hopefully) a factor of n.
*/
static void init_dir_mutex(void)
{