Ronchon
Member
Hi,
I would like to generate a "hash" out of datastructures such as ds_grids that would allow to quickly compare 2 different grids to know if they hold the same values, for example.
Comparing each tile's values is too slow, and too problematic if the values are of different types.
How would you approach this problem? How would you design a simple algorithm cheap and reliable enough to limit the odds of generating the same hash for 2 different grids ?
I would like to generate a "hash" out of datastructures such as ds_grids that would allow to quickly compare 2 different grids to know if they hold the same values, for example.
Comparing each tile's values is too slow, and too problematic if the values are of different types.
How would you approach this problem? How would you design a simple algorithm cheap and reliable enough to limit the odds of generating the same hash for 2 different grids ?