Module mih_rs::ls

Implements a simple exhaustive search algorithm for comparison with MIH.

Functions

exhaustive_search	Computes all the Hamming distances bwtween codes and qcode. Returns the tuples of code id and the distance.
exhaustive_search_with_buf	Computes all the Hamming distances bwtween codes and qcode. The tuples of code id and the distance are stored in answers.
range_search	Finds the neighbors in codes, whose Hamming distances to qcode are within radius. Returns the ids of the neighbor codes.
range_search_with_buf	Finds the neighbors in codes, whose Hamming distances to qcode are within radius. The ids of the neighbor codes are stored in answers.