pub fn longest_common_substrings(
first: &[u8],
second: &[u8],
algo_spec: AlgoSpec,
number: usize,
) -> Result<Vec<Match>, AlgoSpecError>Expand description
Return the N longest common substrings between two byte slices. The vector is sorted in
decreasing order of Match length.