code: def ilevenshtein(seq1, seqs, max_dist=-1):
  	
  	for seq2 in seqs:
  		dist = levenshtein(seq1, seq2, max_dist=max_dist)
  		if dist != -1:
  			yield dist, seq2
docs: Compute the Levenshtein distance between the sequence `seq1` and the series
  	of	sequences `seqs`.
  	
  		`seq1`: the reference sequence
  		`seqs`: a series of sequences (can be a generator)
  		`max_dist`: if provided and > 0, only the sequences which distance from
  		the reference sequence is lower or equal to this value will be returned.
  	
  	The return value is a series of pairs (distance, sequence).
  	
  	The sequence objects in `seqs` are expected to be of the same kind than
  	the reference sequence in the C implementation; the same holds true for
  	`ifast_comp`.