Lines Matching refs:bhi
305 def find_longest_match(self, alo=0, ahi=None, blo=0, bhi=None): argument
366 if bhi is None:
367 bhi = len(b)
383 if j >= bhi:
398 while besti+bestsize < ahi and bestj+bestsize < bhi and \
414 while besti+bestsize < ahi and bestj+bestsize < bhi and \
453 alo, ahi, blo, bhi = queue.pop()
454 i, j, k = x = self.find_longest_match(alo, ahi, blo, bhi)
462 if i+k < ahi and j+k < bhi:
463 queue.append((i+k, ahi, j+k, bhi))
860 for tag, alo, ahi, blo, bhi in cruncher.get_opcodes():
862 g = self._fancy_replace(a, alo, ahi, b, blo, bhi)
866 g = self._dump('+', b, blo, bhi)
879 def _plain_replace(self, a, alo, ahi, b, blo, bhi): argument
880 assert alo < ahi and blo < bhi
883 if bhi - blo < ahi - alo:
884 first = self._dump('+', b, blo, bhi)
888 second = self._dump('+', b, blo, bhi)
893 def _fancy_replace(self, a, alo, ahi, b, blo, bhi): argument
921 for j in range(blo, bhi):
945 yield from self._plain_replace(a, alo, ahi, b, blo, bhi)
985 yield from self._fancy_helper(a, best_i+1, ahi, b, best_j+1, bhi)
987 def _fancy_helper(self, a, alo, ahi, b, blo, bhi): argument
990 if blo < bhi:
991 g = self._fancy_replace(a, alo, ahi, b, blo, bhi)
994 elif blo < bhi:
995 g = self._dump('+', b, blo, bhi)