305     def find_longest_match(self, alo=0, ahi=None, blo=0, bhi=None):  argument
368         besti, bestj, bestsize = alo, blo, 0
381                 if j < blo:
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)
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)
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)
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):  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)