- cross-posted to:
- adhd@lemmy.dbzer0.com
- cross-posted to:
- adhd@lemmy.dbzer0.com
You must log in or register to comment.
- argv_minus_one ( @argv_minus_one@beehaw.org ) 16•1 year ago
Finding clothes on a chair isn’t constant-time. You have to search through the heap of clothes to find the item you want. It has the same time complexity as searching through the closet; it’s only fast because n is small.
- omenmis ( @omenmis@beehaw.org ) 6•1 year ago
It takes 2 pause cycles, that’s essentially O(1) compared to a cache miss.
- jcg ( @jcg@halubilo.social ) 11•1 year ago
You could implement in-closet indexing instead to make the cache misses hurt less, trading off some extra insertion time but needing less memory for the cache which is much more expensive cost wise. At this point you’re storing almost your whole DB in the cache and your room’s a mess.
- Kettlepants ( @Kettlepants@lemm.ee ) 10•1 year ago
I like this logic.
- darcy ( @darcy@lemmy.blahaj.zone ) 8•1 year ago
I just expand my L1 cache to half my wardrobe hehe
I feel better now about my bad habits