func (m ConcurrentMap[K, V]) Count() int {
	count := 0
	for i := 0; i < SHARD_COUNT; i++ {
		shard := m.shards[i]
		shard.RLock()
		count += len(shard.items)
		shard.RUnlock()
	}
	return count
}

The function len(shard.items) only reads the count count at the bottom of the hmap and doesn't go through it; there is no need to count a separate count

func (m ConcurrentMap[K, V]) Count() int {
	count := 0
	for i := 0; i < SHARD_COUNT; i++ {
		shard := m.shards[i]
		shard.RLock()
		count += len(shard.items)
		shard.RUnlock()
	}
	return count
}

The function len(shard.items) only reads the count count at the bottom of the hmap and doesn't go through it; there is no need to count a separate count

there's lock in the function ,the benchmark demonstrate it's necessary to separate count instead of count it

func (m ConcurrentMap[K, V]) Count() int {
	count := 0
	for i := 0; i < SHARD_COUNT; i++ {
		shard := m.shards[i]
		shard.RLock()
		count += len(shard.items)
		shard.RUnlock()
	}
	return count
}

The function len(shard.items) only reads the count count at the bottom of the hmap and doesn't go through it; there is no need to count a separate count

there's lock in the function ,the benchmark demonstrate it's necessary to separate count instead of count it

You're right, I read your code, excellent job