348     def find_longest_match(self, alo, ahi, blo, bhi):  argument
420                 if j >= bhi:
435         while besti+bestsize < ahi and bestj+bestsize < bhi and \
451         while besti+bestsize < ahi and bestj+bestsize < bhi and \
490             alo, ahi, blo, bhi = queue.pop()
491             i, j, k = x = self.find_longest_match(alo, ahi, blo, bhi)
499                 if i+k < ahi and j+k < bhi:
500                     queue.append((i+k, ahi, j+k, bhi))
908         for tag, alo, ahi, blo, bhi in cruncher.get_opcodes():
910                 g = self._fancy_replace(a, alo, ahi, b, blo, bhi)
914                 g = self._dump('+', b, blo, bhi)
928     def _plain_replace(self, a, alo, ahi, b, blo, bhi):  argument
929         assert alo < ahi and blo < bhi
932         if bhi - blo < ahi - alo:
933             first  = self._dump('+', b, blo, bhi)
937             second = self._dump('+', b, blo, bhi)
943     def _fancy_replace(self, a, alo, ahi, b, blo, bhi):  argument
971         for j in xrange(blo, bhi):
995                 for line in self._plain_replace(a, alo, ahi, b, blo, bhi):
1038         for line in self._fancy_helper(a, best_i+1, ahi, b, best_j+1, bhi):
1041     def _fancy_helper(self, a, alo, ahi, b, blo, bhi):  argument
1044             if blo < bhi:
1045                 g = self._fancy_replace(a, alo, ahi, b, blo, bhi)
1048         elif blo < bhi:
1049             g = self._dump('+', b, blo, bhi)