I won't let Big Closet tell me how to live my life.

1.2k points · 22 comments · view on lemmy.world

22 Comments

fubo@lemmy.world · 76 pts · 2y (1 reply)

Just be sure to pause for garbage collection occasionally.

jaybone@lemmy.world · 14 pts · 2y

And mark items dirty.

JPAKx4@lemmy.sdf.org · 47 pts · 2y

There is increased corruption as the lifespan of the cache grows, maintaining speed but reducing element quality

fibojoly@sh.itjust.works · 36 pts · 2y (1 reply)

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.

InputZero@lemmy.ml · 15 pts · 2y

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.

RojoSanIchiban@lemmy.world · 35 pts · 2y

Normalize and index your damn drawers or you're deadlocked!

tias@discuss.tchncs.de · 26 pts · 2y (1 reply)

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.

Dyskolos@lemmy.zip · 9 pts · 2y
[ removed ]
xmunk@sh.itjust.works · 18 pts · 2y (3 replies)

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.

Karyoplasma@discuss.tchncs.de · 2 pts · 2y (2 replies)

What was you hash function? return 1?

xmunk@sh.itjust.works · 4 pts · 2y (1 reply)

shirt.isShortSleeved()

Karyoplasma@discuss.tchncs.de · 2 pts · 2y

shirt.isShortSleeved()

That would actually be sufficient for my use case, not gonna lie.

lowleveldata@programming.dev · 18 pts · 2y (6 replies)

Access to the chair cache is O(n) tho

gvasco@discuss.tchncs.de · 12 pts · 2y (5 replies)

n = 1 and you have O(1)

lowleveldata@programming.dev · 9 pts · 2y (1 reply)

Mom is way too harsh to call it a messy pile with only 1 cloth on the chair...

gvasco@discuss.tchncs.de · 3 pts · 2y

True that!

sigh@lemmy.world · 0 pts · 2y (2 replies)

n isn't even real

Natanael@slrpnk.net · 3 pts · 2y

Random fractal cloth patches for an irrational n

gvasco@discuss.tchncs.de · 0 pts · 2y

N is the number elements to be parsed by the function

indigomirage@lemmy.ca · 15 pts · 2y
[ removed ]
BannanaLama@lemmy.world · 14 pts · 2y (1 reply)

Posts and Comments like this is why I love this place

perishthethought@lemm.ee · -1 pts · 2y

Yeah, who needs R*****.

Fixbeat@lemmy.ml · 10 pts · 2y
[ removed ]
cupcakezealot@lemmy.blahaj.zone · 5 pts · 2y

big closet sounds like one of jay pritchett's competitors

CurlyMoustache@lemmy.world · 2 pts · 2y

LIFO for lyfe!