3 ms·
You’re implementing hash tables on your 0.05$, 44.5 byte RAM, uphill-both-ways embedded devices?
by avgcorrection 5y ago
You’re implementing hash tables on your 0.05$, 44.5 byte RAM, uphill-both-ways embedded devices?
- smackeyacky 5y agoOh hell no. There are some useful uses of hashing in them though, such as verifying the contents of flash memory before loading it. I was recommended Murmer[0] and use it as a kind of "is what is contained in the flash memory consistent with what was written" check for an app that has to keep some state between reboots. You could use it in an embedded device for a hash table but it's probably faster to make a b-tree or just brute force an array. [0] https://en.wikipedia.org/wiki/MurmurHash https://en.wikipedia.org/wiki/MurmurHash