Construct the interpolation search table
This is expected to be an array with pairs of elements as a key-value pair packed into the array with keys. e.g. [0] = value, [1] = key and so on.
This will be mutated in-place, so copy if you do not wish the array to be mutated.
Get the number of items in this.
The number of itmes in this.
Implements Map Foreach.
The for each callback.
Optional
thisArg: anyOverridable this arg.
This is a sorted order data structure for constant/bulk insert data that performs near the speed of a hash table that maps 32 bit unsigned integers to 32bit unsigned integers.