- cross-posted to:
- 196@lemmy.blahaj.zone
- cross-posted to:
- 196@lemmy.blahaj.zone
You must log in or register to comment.
Just be sure to pause for garbage collection occasionally.
And mark items dirty.
There is increased corruption as the lifespan of the cache grows, maintaining speed but reducing element quality
This is acceptable for commonly used, hot items. But you also need a colder storage for stuff that you ain’t gonna wear everyday!
This young lady is just inefficient and has no care for the cost of hot cache.Personally, I use a top of bed hot cache, a chair warm cache and the rest in cold closet.
I use to run my closet asynchronously like that, but I would loose way too many small packets waiting for the cache to fill. Especially when they were mirrored. Now I exclusively use synchronous writes to the cold store. It may be slower but it’s worth it for better data integrity.
Oh pro tip, if you use a FAT filesystem avoid horizontal striping.
Normalize and index your damn drawers or you’re deadlocked!
This is unironically how I think. Also carrying single items to their designated place is inefficient. I wait until there’s a pile so I can process in batch and avoid latency overhead. Same for vacuum cleaning, I need to strike a thoughtful balance between accumulated dust and the time expended on vacuuming. All to maximize throughput in my life.
Same. You can’t imagine the amount of discussions with wifey i had about this. Life is hard 🙄
Also it’s not chaos when i exactly know where everything is. Even if there are socks on top of it. I put them there. For a reason.
Remember that cache goes stale
Is mom the cache invalidator we deserve?
But not the one you need. When she notices a smell it’s already too late.
Access to the chair cache is O(n) tho
n = 1 and you have O(1)
Mom is way too harsh to call it a messy pile with only 1 cloth on the chair…
True that!
n isn’t even real
Random fractal cloth patches for an irrational n
N is the number elements to be parsed by the function
Personally I assemble my clothes in a B+ tree on my desk. I’ve found that the hash lookup algorithm I was using had too many collisions.
What was you hash function? return 1?
shirt.isShortSleeved()shirt.isShortSleeved()
That would actually be sufficient for my use case, not gonna lie.
deleted by creator
Posts and Comments like this is why I love this place
Yeah, who needs R*****.
deleted by creator
big closet sounds like one of jay pritchett’s competitors
LIFO for lyfe!
