@@ -174,7 +174,7 @@ template <typename ItemType, size_t bits_per_item, bool branchless,
174174 typename HashFamily, int k>
175175Status BloomFilter<ItemType, bits_per_item, branchless, HashFamily, k>::AddAll(
176176 const ItemType* keys, const size_t start, const size_t end) {
177- // we have that AddAll assumes that arrayLength << 6 is a
177+ // we have that AddAll assumes that arrayLength << 6 is a
178178 // 32-bit integer
179179 if (arrayLength > 0x3ffffff ) {
180180 for (size_t i = start; i < end; i++) {
@@ -188,7 +188,7 @@ Status BloomFilter<ItemType, bits_per_item, branchless, HashFamily, k>::AddAll(
188188 for (size_t i = start; i < end; i++) {
189189 uint64_t key = keys[i];
190190 uint64_t hash = hasher (key);
191- uint64_t a = (hash >> 32 ) | (hash << 32 );;
191+ uint64_t a = (hash >> 32 ) | (hash << 32 );
192192 uint64_t b = hash;
193193 for (int j = 0 ; j < k; j++) {
194194 int index = fastrangesize (a, this ->arrayLength );
@@ -219,7 +219,7 @@ template <typename ItemType, size_t bits_per_item, bool branchless,
219219Status BloomFilter<ItemType, bits_per_item, branchless, HashFamily, k>::Contain(
220220 const ItemType &key) const {
221221 uint64_t hash = hasher (key);
222- uint64_t a = (hash >> 32 ) | (hash << 32 );;
222+ uint64_t a = (hash >> 32 ) | (hash << 32 );
223223 uint64_t b = hash;
224224 if (branchless && k >= 3 ) {
225225 int b0 = data[fastrangesize (a, this ->arrayLength )] >> (a & 63 );
0 commit comments