Dec-03-2019, 11:19 PM
(Dec-03-2019, 10:51 PM)Gribouillis Wrote: hash()
is meant to be fast in order to implement hash-table-like algorithms.
Yes, I liked the fast part and glossed over collisions

Tomorrow I'll try to remove the
str()
hack and take hash-collisions into account, hoping it won't be too slow/use too much memory with the full dataset (that I still haven't tried with the str()
hack, but now I am convinced that it won't work). But now I need sleep.Thank you!