96 	int from;  member
235 		(*dd)[i].old.from = a;  in readin()
237 		(*dd)[i].new.from = c;  in readin()
241 		(*dd)[i].old.from = (*dd)[i - 1].old.to;  in readin()
242 		(*dd)[i].new.from = (*dd)[i - 1].new.to;  in readin()
318 		if (!t2 || (t1 && d1->new.to < d2->new.from)) {  in merge()
330 		if (!t1 || (t2 && d2->new.to < d1->new.from)) {  in merge()
347 		if (d1 + 1 < d13 + m1 && d1->new.to >= d1[1].new.from) {  in merge()
348 			d1[1].old.from = d1->old.from;  in merge()
349 			d1[1].new.from = d1->new.from;  in merge()
355 		if (d2 + 1 < d23 + m2 && d2->new.to >= d2[1].new.from) {  in merge()
356 			d2[1].old.from = d2->old.from;  in merge()
357 			d2[1].new.from = d2->new.from;  in merge()
362 		if (d1->new.from == d2->new.from && d1->new.to == d2->new.to) {  in merge()
372 				d3 = d1->old.to > d1->old.from ? d1 : d2;  in merge()
386 		if (d1->new.from < d2->new.from) {  in merge()
387 			d2->old.from -= d2->new.from - d1->new.from;  in merge()
388 			d2->new.from = d1->new.from;  in merge()
389 		} else if (d2->new.from < d1->new.from) {  in merge()
390 			d1->old.from -= d1->new.from - d2->new.from;  in merge()
391 			d1->new.from = d2->new.from;  in merge()
425 	skip(i, rold->from, NULL);  in change()
437 	if (rold->to <= rold->from)  in prange()
438 		printf("%da\n", rold->from - 1);  in prange()
440 		printf("%d", rold->from);  in prange()
441 		if (rold->to > rold->from + 1)  in prange()
462 	trange.from = rnew->from - delta;  in keep()
472 skip(int i, int from, const char *pr)  in skip()  argument
477 	for (n = 0; cline[i] < from - 1; n += j) {  in skip()
498 	if (r1->to-r1->from != r2->to-r2->from)  in duplicate()
500 	skip(0, r1->from, NULL);  in duplicate()
501 	skip(1, r2->from, NULL);  in duplicate()
503 	for (nline = 0; nline < r1->to - r1->from; nline++) {  in duplicate()
552 	de[j].old.from = diff->old.from;  in edit()
554 	de[j].new.from = diff->new.from;  in edit()
568 	if (r->from == r->to)  in printrange()
571 	if (r->from > r->to)  in printrange()
581 		if (i >= r->from)  in printrange()
600 		delete = (new->from == new->to);  in edscript()
613 			printf("%da\n%s %s\n.\n", old->from - 1,  in edscript()
641 		deletenew = (new->from == new->to);  in Ascript()
642 		deleteold = (old->from == old->to);  in Ascript()
660 					(new->to - new->from));  in Ascript()
679 					r.from = old->from-1;  in Ascript()
700 					startmark - (old->to - old->from),  in Ascript()
722 	r.from = 1;  in mergescript()
730 		r.to = old->from;  in mergescript()
748 				if (old->from == old->to) {  in mergescript()
750 					or.from = old->from - 1;  in mergescript()
763 		if (old->from == old->to)  in mergescript()
764 			r.from = new->to;  in mergescript()
766 			r.from = old->to;  in mergescript()
778 	if ((old->from == new->from) &&  in mergescript()
780 		r.from--;  in mergescript()
781 	else if (new->from == new->to)  in mergescript()
782 		r.from = old->from;  in mergescript()
789 		r.from++;  in mergescript()