336     def find_longest_match(self, alo, ahi, blo, bhi):  argument
408                 if j >= bhi:
423         while besti+bestsize < ahi and bestj+bestsize < bhi and \
439         while besti+bestsize < ahi and bestj+bestsize < bhi and \
478             alo, ahi, blo, bhi = queue.pop()
479             i, j, k = x = self.find_longest_match(alo, ahi, blo, bhi)
487                 if i+k < ahi and j+k < bhi:
488                     queue.append((i+k, ahi, j+k, bhi))
895         for tag, alo, ahi, blo, bhi in cruncher.get_opcodes():
897                 g = self._fancy_replace(a, alo, ahi, b, blo, bhi)
901                 g = self._dump('+', b, blo, bhi)
914     def _plain_replace(self, a, alo, ahi, b, blo, bhi):  argument
915         assert alo < ahi and blo < bhi
918         if bhi - blo < ahi - alo:
919             first  = self._dump('+', b, blo, bhi)
923             second = self._dump('+', b, blo, bhi)
928     def _fancy_replace(self, a, alo, ahi, b, blo, bhi):  argument
956         for j in range(blo, bhi):
980                 yield from self._plain_replace(a, alo, ahi, b, blo, bhi)
1020         yield from self._fancy_helper(a, best_i+1, ahi, b, best_j+1, bhi)
1022     def _fancy_helper(self, a, alo, ahi, b, blo, bhi):  argument
1025             if blo < bhi:
1026                 g = self._fancy_replace(a, alo, ahi, b, blo, bhi)
1029         elif blo < bhi:
1030             g = self._dump('+', b, blo, bhi)