From bcbcdcbc4c7487981758f01c2f81baf8081a507e Mon Sep 17 00:00:00 2001
From: khizmax <libcds.dev@gmail.com>
Date: Sun, 7 May 2017 11:46:58 +0300
Subject: [PATCH] Docfix

---
 cds/intrusive/cuckoo_set.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/cds/intrusive/cuckoo_set.h b/cds/intrusive/cuckoo_set.h
index ea026a0f..c31f0846 100644
--- a/cds/intrusive/cuckoo_set.h
+++ b/cds/intrusive/cuckoo_set.h
@@ -1614,7 +1614,7 @@ namespace cds { namespace intrusive {
 
             [From <i>"The Art of Multiprocessor Programming"</i>]
             <a href="https://en.wikipedia.org/wiki/Cuckoo_hashing">Cuckoo hashing</a> is a hashing algorithm in which a newly added item displaces any earlier item
-            occupying the same slot. For brevity, a table is a k-entry array of items. For a hash set f size
+            occupying the same slot. For brevity, a table is a k-entry array of items. For a hash set of size
             N = 2k we use a two-entry array of tables, and two independent hash functions,
             <tt> h0, h1: KeyRange -> 0,...,k-1</tt>
             mapping the set of possible keys to entries in he array. To test whether a value \p x is in the set,
-- 
2.34.1