[WIP] Locality Sensitive Hashing for approximate nearest neighbor search(GSoC)

These masks are created to perform bitwise operations for hashed data points. So these masks cannot be created with bitwise operations. In general (for 32 bit long hash) there will be only 66 masks, so the time consumption is insignificant for this operation, isn't it?