bigcache

> BigCache does not handle collisions. When new item is inserted and it's hash collides with previously stored item, new item overwrites previously stored value. I'm not sure what hashing algorithm it is using, but this seems like a pretty undesirable property. The code for the hash function is found here: https://github.com/allegro/bigcache/blob/f64abe8f4fe2f5769bd... // Sum64 gets the string and returns its uint64 hash value. func (f fnv64a) Sum64(key string) uint64 { var hash uint64 = offset64 for i := 0; i < len(key); i++ { hash ^= uint64(key[i]) hash *= prime64 } return hash } The referenced `offset64` is `14695981039346656037` and the `prime64` is `1099511628211`. I can find a reference to a similarly named `Sum64` function in https://godoc.org/blainsmith.com/go/se

The struct pointer itself wont be GC'd. It's intentional as the cache should be up for as long as the server process runs. However, that struct contains data that can and will be GC'd once no longer used. This is the type of the variable: https://github.com/allegro/bigcache/blob/master/bigcache.go

My understanding is that global variables in Go are not garbage collected. Is that true? If so then is this not creating the cache struct as a global var and therefore this cache will never be garbage collected? https://github.com/allegro/bigcache/blob/master/server/serve... I ask this because I’ve run into a problem with this in the past.

I wonder if libraries such as freecache[1] and bigcache[2] wouldn't offer a better solution for this use case. [1] https://github.com/coocood/freecache [2] https://github.com/allegro/bigcache