Crate tilecoding

Structs

IHT	An index-hash-table, or IHT. It will allow to collect tile indices up to a certain size, after which collisions will start to occur. The underlying storage is a HashMap

Functions

base_hash	Convenience function for hashing a hashable object using the std hashmap's default hasher
tiles	This function takes a series of floating point and integer values, and encodes them as tile indices using a provided size. This function is generally reserved for when you have extraordinarily large sizes that are too large for the IHT.