Cache is not garaunteed to be consistent. Introduce distributed lock before set?

[someone1]

How does this library handle competing updates to a key? I'm not sure if the strategy here is always consistent. Is this functionality out of scope for this library?

Have a read: https://redislabs.com/blog/caches-promises-locks/

Or a CompareAndSet approach: https://github.com/qedus/nds/tree/v2/cachers/redis

[someone1]

I think I misunderstood the point of this package - it doesn't handle any aspects of updates to key. Not ideal for use in front of a database if you want a consistent cache to the database.