4 ms·
Ah yes this is a good point thank you. Can probably just using a hashing function and perform a quick lookup to avoid collisions as you suggest. If there is a c
by bobblemouse 2y ago
Ah yes this is a good point thank you. Can probably just using a hashing function and perform a quick lookup to avoid collisions as you suggest. If there is a collision what would you suggest is the best way to deal with it? Anything else we should keep in mind when doing this?
- solardev 2y agoIt would be easier just to use a longer hash with fewer chances of collisions. In the past, for non cryptographic uses, I've also just appended two hash algorithms one after the other, figuring that the same collision between two algorithms would be exceedingly improbable.