úÎËN Experimental .Hamrouni Ghassen <ghamrouni@iptechinside.com> Recursively compute the hash. 6Compute max size (in bit) for an element of the list. 1Compute maximum size for an element of the list. %Returns true if the list is hashable . A list is hashable IIF for every element x :  x > (maxSize list) Recursively compute the hash.  Shift the elements by n + index -Set all bits to 0, except the bit at index n    DimensionalHash-0.1.5.2Data.DimensionalHash MortonNumberdimensionalHash maxBitSizemaxSize isHashablehash concatBits shiftElements takeBitAt