Yiling-J

@elbaro I see. So how about adding a `simple` cache policy, which doesn't preallocate? Then you can set a very large cache size. About your second case, you can always...

Hi @aryehlev 1,2,4 in my comment are not difficult to implement, but the third one is a little tricky. I've done some work on the branch: https://github.com/Yiling-J/theine-go/tree/feature/stats, but the code...

Hi @aryehlev, are you working on this? I will have some time next month, if you haven't started yet I will try to finish it.

Get buffer size is 64 and you only insert 3 keys, so first the frequency sketch is not update yet. All 3 keys have frequency 0(if updated, all will be...

I want to confirm first, does this affect your real use case? Given the fact that frequency is dynamically updated, if your entry is popular enough it will be kept...

As mentioned in #33, StringKey is a temporary solution for structs containing strings. Its purpose is to address the lack of an official Go mechanism for customizing hashing. If Go...

Thanks @ben-manes . Just as ben said @ghz-max , optimize for your small cache may harm longer running, modestly sized cache. in your 512/8 case I think what you need...

I understand your point. Currently, the string key function is only used to select a shard, and the Go HashMap within the shard still relies on the original key struct....

hi @ben-manes , is the minimum window size in caffeine 1? In Theine window is in each shard, so the deque size in each shard is: capacity/100/shardCount, and minimum is...

Thanks @ben-manes , just take a look GDSF and I agree weight is better. But now that Ristretto is famous in Go community, I think I will just use the...