Alexey Mayshev

> I assume that this will result in a NumCounters

Everything indicates at the moment that the latest versions of ristretto have very serious bugs that have not been fixed for a long time. (everything is fine with hit ratio...

> the underlying cost for each item saved is much bigger than that. Oh my God, I realized what happened and it's not good at all. The fact is that...

It looks cool, but as far as I know the SIEVE authors tried to keep it as simple as possible. That's why they didn't add things like this, which obviously...

By the way, you can call the authors here as well😄

@thomasmueller Totally agree, but the word "simpler" is literally in the title of the original paper. 🙃 In my opinion, the original version of SIEVE is better seen as a...

I recalculated the benchmark results with the updated ristretto configuration, and also added gcache, ttlcache and golang-lru. The [results](https://maypok86.github.io/otter/performance/throughput/) look quite plausible. It's only necessary to make a reservation that...

Hi, yeah, it looks like I made a mistake in two places at once. It really should have been an unsigned shift. I tried to test the correctness of this...

The approximate api of the builder. ```go type Builder[K comparable, V any] interface { // It seems better to separate cost and size after all. // In the experience of...

```go type Cache[K comparable, V any] interface { Has(key K) bool Get(key K) (V, bool) Set(key K, value V) bool // the existing value? // I also want to return...