minor comments

Author: jermp

include/cache_line_elias_fano.hpp

@@ -24,8 +24,7 @@ namespace bits {
 
     Reference:
 
-    Ragnar Groot Koerkamp. 2025.
-    "PtrHash: Minimal Perfect Hashing at RAM Throughput",
+    Ragnar Groot Koerkamp. "PtrHash: Minimal Perfect Hashing at RAM Throughput", SEA 2025.
     https://arxiv.org/abs/2502.15539.
 
 */

include/elias_fano.hpp

@@ -345,7 +345,7 @@ struct elias_fano {
         assert(begin < size());
 
         /*
-            `begin` is the position of the elements that have high part >= h_x
+            `begin` is the position of the first element that has high part >= h_x
             and `p` is the position in `m_high_bits` of the (h_x-1)-th 0,
             so it is passed to the iterator as a hint to recover the high part
             of the element at position `begin` without doing a select_1.

include/endpoints_sequence.hpp

@@ -251,7 +251,7 @@ struct endpoints_sequence {
         assert(begin < size());
 
         /*
-            `begin` is the position of the elements that have high part >= h_x
+            `begin` is the position of the first element that has high part >= h_x
             and `p` is the position in `m_high_bits` of the (h_x-1)-th 0,
             so it is passed to the iterator as a hint to recover the high part
             of the element at position `begin` without doing a select_1.