Rust-Cache

https://crates.io/crates/priority-expiry-cache/0.2.1

by LucaPaterlini • 3 years ago

8 23 3 years ago

Keep you cache in check not only by LRU but by expirity time and priority too :)

jemfinch• 3 years ago

Now we can make an assumption that the int it's a finite number say u32, this means we can construct a binary tree with a depth of 32 with access time of O(32) therefore O(1) time and space.

Heck, let's go even further. All the computers I've used have a fixed amount of memory, addressable by a u64, so I guess all my algorithms are constant time now.

I guess we've solved the interview, folks.

josh-sematic• 3 years ago

Yeah, my curiously disappeared when I read this line.

burntsushi7• 3 years ago

big-O notation isn't some fundamental secret of the universe. It's a model devised by humans, and typically used in the context of real world computers as a means for conveying an understanding of how algorithms scale.

If we considered the bits of integers as the smallest unit of work in all cases (it is of course relevant to consider bits as the unit of work in some cases), then big-O notation becomes a lot more tedious without typically adding more value.

See: https://cs.stackexchange.com/questions/140642/silly-question...

remram5• 3 years ago

Still it's a notation that had meaning, about the behavior as n goes to infinity. If you take out n, or if you don't have an n, just don't use it.

pentamassiv2• 3 years ago

This crate was downloaded less than 100 times in total until yesterday. Today it has 74,797,449 downloads. Looks a bit sketchy

neoneye2• 3 years ago

It has 3 stars on github.

codetrotter2• 3 years ago

inb4 the project suddenly gets millions of stars on GitHub

codetrotter2• 3 years ago

Today it has 74,797,449 downloads.

Maybe one of the users forgot to cache their deps (:

pentamassiv2• 3 years ago

Interestingly it now down again to only 27 total downloads. Looks like the crates.io team cleaned it up. The search results page still shows millions of downloads. Let's hope that's just a cached number and gets taken care of too.

mike_d• 3 years ago

The answer to this question is always use Redis or memcached. Nothing you whip up on your own is ever going to be a good as a well tested cache implementation that has seen every edge case.

This is the difference between a mid-level and a senior engineer during an interview. The latter will explain to you the pitfalls of what you are asking for before even considering writing a line of code.

Rust-Cache

Related Stories