Lines Matching refs:bhi
135 find_longest_match(alo, ahi, blo, bhi)
136 Find longest matching block in a[alo:ahi] and b[blo:bhi].
350 def find_longest_match(self, alo, ahi, blo, bhi):
351 """Find longest matching block in a[alo:ahi] and b[blo:bhi].
357 blo <= j <= j+k <= bhi
422 if j >= bhi:
437 while besti+bestsize < ahi and bestj+bestsize < bhi and \
453 while besti+bestsize < ahi and bestj+bestsize < bhi and \
492 alo, ahi, blo, bhi = queue.pop()
493 i, j, k = x = self.find_longest_match(alo, ahi, blo, bhi)
496 # a[i+k:ahi] vs b[j+k:bhi] unknown
501 if i+k < ahi and j+k < bhi:
502 queue.append((i+k, ahi, j+k, bhi))
910 for tag, alo, ahi, blo, bhi in cruncher.get_opcodes():
912 g = self._fancy_replace(a, alo, ahi, b, blo, bhi)
916 g = self._dump('+', b, blo, bhi)
930 def _plain_replace(self, a, alo, ahi, b, blo, bhi):
931 assert alo < ahi and blo < bhi
934 if bhi - blo < ahi - alo:
935 first = self._dump('+', b, blo, bhi)
939 second = self._dump('+', b, blo, bhi)
945 def _fancy_replace(self, a, alo, ahi, b, blo, bhi):
973 for j in xrange(blo, bhi):
997 for line in self._plain_replace(a, alo, ahi, b, blo, bhi):
1040 for line in self._fancy_helper(a, best_i+1, ahi, b, best_j+1, bhi):
1043 def _fancy_helper(self, a, alo, ahi, b, blo, bhi):
1046 if blo < bhi:
1047 g = self._fancy_replace(a, alo, ahi, b, blo, bhi)
1050 elif blo < bhi:
1051 g = self._dump('+', b, blo, bhi)
