337     def find_longest_match(self, alo=0, ahi=None, blo=0, bhi=None):  argument
400         besti, bestj, bestsize = alo, blo, 0
406         for i in range(alo, ahi):
426         while besti > alo and bestj > blo and \
442         while besti > alo and bestj > blo and \
485             alo, ahi, blo, bhi = queue.pop()
486             i, j, k = x = self.find_longest_match(alo, ahi, blo, bhi)
492                 if alo < i and blo < j:
493                     queue.append((alo, i, blo, j))
900         for tag, alo, ahi, blo, bhi in cruncher.get_opcodes():
902                 g = self._fancy_replace(a, alo, ahi, b, blo, bhi)
904                 g = self._dump('-', a, alo, ahi)
908                 g = self._dump(' ', a, alo, ahi)
919     def _plain_replace(self, a, alo, ahi, b, blo, bhi):  argument
920         assert alo < ahi and blo < bhi
923         if bhi - blo < ahi - alo:
925             second = self._dump('-', a, alo, ahi)
927             first  = self._dump('-', a, alo, ahi)
933     def _fancy_replace(self, a, alo, ahi, b, blo, bhi):  argument
964             for i in range(alo, ahi):
985                 yield from self._plain_replace(a, alo, ahi, b, blo, bhi)
997         yield from self._fancy_helper(a, alo, best_i, b, blo, best_j)
1027     def _fancy_helper(self, a, alo, ahi, b, blo, bhi):  argument
1029         if alo < ahi:
1031                 g = self._fancy_replace(a, alo, ahi, b, blo, bhi)
1033                 g = self._dump('-', a, alo, ahi)