chore: minor improvement for docs

Signed-off-by: claudecodering <[email protected]>

Author: claudecodering

README.md

@@ -51,6 +51,7 @@ use hashbrown::HashMap;
 let mut map = HashMap::new();
 map.insert(1, "one");
 ```
+
 ## Flags
 This crate has the following Cargo features:
 

src/control/group/generic.rs

@@ -102,7 +102,7 @@ impl Group {
     /// - This never happens for `EMPTY` and `DELETED`, only full entries.
     /// - The check for key equality will catch these.
     /// - This only happens if there is at least 1 true match.
-    /// - The chance of this happening is very low (< 1% chance per byte).
+    /// - The chance of this happening is very low (< 1% chance per tag).
     #[inline]
     pub(crate) fn match_tag(self, tag: Tag) -> BitMask {
         // This algorithm is derived from

src/map.rs

@@ -1491,7 +1491,7 @@ where
     ///     "Bodleian Library",
     /// ]) else { panic!() };
     ///
-    /// // Assert values of Athenæum and Library of Congress
+    /// // Get values for Athenæum and Library of Congress
     /// let got = libraries.get_disjoint_mut([
     ///     "Athenæum",
     ///     "Library of Congress",

src/set.rs

@@ -13,8 +13,8 @@ use crate::DefaultHashBuilder;
 // =============================
 //
 // Iteration over zero sized values is a noop. There is no need
-// for `bucket.val` in the case of HashSet. I suppose we would need HKT
-// to get rid of it properly.
+// for `bucket.val` in the case of HashSet. We might need Higher Kinded Types (HKT)
+// to eliminate this field properly.
 
 /// A hash set implemented as a `HashMap` where the value is `()`.
 ///