- cross-posted to:
- 196@lemmy.blahaj.zone
- cross-posted to:
- 196@lemmy.blahaj.zone
You must log in or register to comment.
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.