Lines Matching refs:j1
196 # a list of (tag, i1, i2, j1, j2) tuples, where tag is
198 # 'replace' a[i1:i2] should be replaced by b[j1:j2]
200 # 'insert' b[j1:j2] should be inserted
201 # 'equal' a[i1:i2] == b[j1:j2]
508 i1 = j1 = k1 = 0
511 # Is this block adjacent to i1, j1, k1?
512 if i1 + k1 == i2 and j1 + k1 == j2:
522 non_adjacent.append((i1, j1, k1))
523 i1, j1, k1 = i2, j2, k2
525 non_adjacent.append((i1, j1, k1))
534 Each tuple is of the form (tag, i1, i2, j1, j2). The first tuple
535 has i1 == j1 == 0, and remaining tuples have i1 == the i2 from the
536 tuple preceding it, and likewise for j1 == the previous j2.
540 'replace': a[i1:i2] should be replaced by b[j1:j2]
542 Note that j1==j2 in this case.
543 'insert': b[j1:j2] should be inserted at a[i1:i1].
545 'equal': a[i1:i2] == b[j1:j2]
550 >>> for tag, i1, i2, j1, j2 in s.get_opcodes():
552 ... (tag, i1, i2, a[i1:i2], j1, j2, b[j1:j2]))
616 tag, i1, i2, j1, j2 = codes[0]
617 codes[0] = tag, max(i1, i2-n), i2, max(j1, j2-n), j2
619 tag, i1, i2, j1, j2 = codes[-1]
620 codes[-1] = tag, i1, min(i2, i1+n), j1, min(j2, j1+n)
624 for tag, i1, i2, j1, j2 in codes:
628 group.append((tag, i1, min(i2, i1+n), j1, min(j2, j1+n)))
631 i1, j1 = max(i1, i2-n), max(j1, j2-n)
632 group.append((tag, i1, i2, j1 ,j2))
1213 for tag, i1, i2, j1, j2 in group:
1222 for line in b[j1:j2]:
1311 for tag, _, _, j1, j2 in group:
1313 for line in b[j1:j2]:
