go/go-mixed
1
0
Fork 0
mirror of https://github.com/charlienet/go-mixed.git synced 2025-07-18 08:32:40 +08:00
Code Issues Projects Releases Wiki Activity

Use the FNV algorithm

Browse Source
This commit is contained in:
charlie
2022-03-29 10:36:16 +08:00
parent bd4a7aed01
commit 7eb426e5b2
1 changed files with 8 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

23
collections/generics/concurrent_map.go
View File

@ -4,6 +4,9 @@ import (
"fmt" "fmt"
"runtime" "runtime"
"sync" "sync"
"github.com/charlienet/go-mixed/bytesconv"
"github.com/charlienet/go-mixed/hash"
) )
var _ Map[string, string] = &ConcurrnetMap[string, string]{} var _ Map[string, string] = &ConcurrnetMap[string, string]{}
@ -98,7 +101,7 @@ func getTag[T comparable](v T) uint64 {
switch vv.(type) { switch vv.(type) {
case string: case string:
return fnv64(vv.(string)) return fnv(vv.(string))
case int8: case int8:
return uint64(vv.(int8)) return uint64(vv.(int8))
case uint8: case uint8:
@ -114,21 +117,11 @@ func getTag[T comparable](v T) uint64 {
case uint64: case uint64:
return vv.(uint64) return vv.(uint64)
default: default:
return fnv64(fmt.Sprintf("%v", v)) return fnv(fmt.Sprintf("%v", v))
} }
} }
const ( func fnv(k string) uint64 {
prime32 = uint64(16777619) bytes := bytesconv.StringToBytes(k)
) return uint64(hash.Funv32(bytes))
func fnv64(k string) uint64 {
var hash = uint64(2166136261)
l := len(k)
for i := 0; i < l; i++ {
hash *= prime32
hash ^= uint64(k[i])
}
return hash
} }