Lines Matching refs:alo
305 def find_longest_match(self, alo=0, ahi=None, blo=0, bhi=None):
306 """Find longest matching block in a[alo:ahi] and b[blo:bhi].
313 alo <= i <= i+k <= ahi
344 If no blocks match, return (alo, blo, 0).
368 besti, bestj, bestsize = alo, blo, 0
374 for i in range(alo, ahi):
394 while besti > alo and bestj > blo and \
410 while besti > alo and bestj > blo and \
453 alo, ahi, blo, bhi = queue.pop()
454 i, j, k = x = self.find_longest_match(alo, ahi, blo, bhi)
455 # a[alo:i] vs b[blo:j] unknown
460 if alo < i and blo < j:
461 queue.append((alo, i, blo, j))
860 for tag, alo, ahi, blo, bhi in cruncher.get_opcodes():
862 g = self._fancy_replace(a, alo, ahi, b, blo, bhi)
864 g = self._dump('-', a, alo, ahi)
868 g = self._dump(' ', a, alo, ahi)
879 def _plain_replace(self, a, alo, ahi, b, blo, bhi):
880 assert alo < ahi and blo < bhi
883 if bhi - blo < ahi - alo:
885 second = self._dump('-', a, alo, ahi)
887 first = self._dump('-', a, alo, ahi)
893 def _fancy_replace(self, a, alo, ahi, b, blo, bhi):
924 for i in range(alo, ahi):
945 yield from self._plain_replace(a, alo, ahi, b, blo, bhi)
957 yield from self._fancy_helper(a, alo, best_i, b, blo, best_j)
987 def _fancy_helper(self, a, alo, ahi, b, blo, bhi):
989 if alo < ahi:
991 g = self._fancy_replace(a, alo, ahi, b, blo, bhi)
993 g = self._dump('-', a, alo, ahi)