chore: using existing variables makes the program easier to understand (

#20)
phuslu · Nov 5, 2024 · 9d6228e · 9d6228e
1 parent 9c96197
commit 9d6228e
Show file tree

Hide file tree

Showing 3 changed files with 3 additions and 3 deletions.
diff --git a/bytes_shard_table.go b/bytes_shard_table.go
@@ -35,7 +35,7 @@ func (s *bytesshard) tableSet(hash uint32, key []byte, index uint32) (prev uint3
 	subhash := hash >> dibBitSize
 	hdib := subhash<<dibBitSize | uint32(1)&maxDIB
 	mask := s.tableMask
-	i := (hdib >> dibBitSize) & mask
+	i := subhash & mask
 	b0 := unsafe.Pointer(&s.tableBuckets[0])
 	l0 := unsafe.Pointer(&s.list[0])
 	for {

diff --git a/lru_shard_table.go b/lru_shard_table.go
@@ -45,7 +45,7 @@ func (s *lrushard[K, V]) tableSet(hash uint32, key K, index uint32) (prev uint32
 	subhash := hash >> dibBitSize
 	hdib := subhash<<dibBitSize | uint32(1)&maxDIB
 	mask := s.tableMask
-	i := (hdib >> dibBitSize) & mask
+	i := subhash & mask
 	b0 := unsafe.Pointer(&s.tableBuckets[0])
 	l0 := unsafe.Pointer(&s.list[0])
 	for {

diff --git a/ttl_shard_table.go b/ttl_shard_table.go
@@ -37,7 +37,7 @@ func (s *ttlshard[K, V]) tableSet(hash uint32, key K, index uint32) (prev uint32
 	subhash := hash >> dibBitSize
 	hdib := subhash<<dibBitSize | uint32(1)&maxDIB
 	mask := s.tableMask
-	i := (hdib >> dibBitSize) & mask
+	i := subhash & mask
 	b0 := unsafe.Pointer(&s.tableBuckets[0])
 	l0 := unsafe.Pointer(&s.list[0])
 	for {