code: def ifast_comp(seq1, seqs, transpositions=False):
  	
  	for seq2 in seqs:
  		dist = fast_comp(seq1, seq2, transpositions)
  		if dist != -1:
  			yield dist, seq2
docs: Return an iterator over all the sequences in `seqs` which distance from
  	`seq1` is lower or equal to 2. The sequences which distance from the
  	reference sequence is higher than that are dropped.
  	
  		`seq1`: the reference sequence.
  		`seqs`: a series of sequences (can be a generator)
  		`transpositions` has the same sense than in `fast_comp`.
  	
  	The return value is a series of pairs (distance, sequence).
  	
  	You might want to call `sorted()` on the iterator to get the results in a
  	significant order:
  	
  		>>> g = ifast_comp("foo", ["fo", "bar", "foob", "foo", "foobaz"])
  		>>> sorted(g)
  		[(0, 'foo'), (1, 'fo'), (1, 'foob')]