92 	int from;  member
288 		(*dd)[i].old.from = a;  in readin()
290 		(*dd)[i].new.from = c;  in readin()
293 			if ((*dd)[i].old.from < (*dd)[i - 1].old.to ||  in readin()
294 			    (*dd)[i].new.from < (*dd)[i - 1].new.to)  in readin()
299 		(*dd)[i].old.from = (*dd)[i].old.to = (*dd)[i - 1].old.to;  in readin()
300 		(*dd)[i].new.from = (*dd)[i].new.to = (*dd)[i - 1].new.to;  in readin()
387 		if (!t2 || (t1 && d1->new.to < d2->new.from)) {  in merge()
403 			f1f3delta += (d1->old.to - d1->old.from) -  in merge()
404 			    (d1->new.to - d1->new.from);  in merge()
409 		if (!t1 || (t2 && d2->new.to < d1->new.from)) {  in merge()
428 		if (d1 + 1 < d13 + m1 && d1->new.to >= d1[1].new.from) {  in merge()
429 			d1[1].old.from = d1->old.from;  in merge()
430 			d1[1].new.from = d1->new.from;  in merge()
436 		if (d2 + 1 < d23 + m2 && d2->new.to >= d2[1].new.from) {  in merge()
437 			d2[1].old.from = d2->old.from;  in merge()
438 			d2[1].new.from = d2->new.from;  in merge()
443 		if (d1->new.from == d2->new.from && d1->new.to == d2->new.to) {  in merge()
453 				d3 = d1->old.to > d1->old.from ? d1 : d2;  in merge()
467 			f1f3delta += (d1->old.to - d1->old.from) -  in merge()
468 			    (d1->new.to - d1->new.from);  in merge()
477 		if (d1->new.from < d2->new.from) {  in merge()
478 			d2->old.from -= d2->new.from - d1->new.from;  in merge()
479 			d2->new.from = d1->new.from;  in merge()
480 		} else if (d2->new.from < d1->new.from) {  in merge()
481 			d1->old.from -= d1->new.from - d2->new.from;  in merge()
482 			d1->new.from = d2->new.from;  in merge()
522 	skip(i, rold->from, NULL);  in change()
534 	if (rold->to <= rold->from)  in prange()
535 		printf("%da\n", rold->from - 1);  in prange()
537 		printf("%d", rold->from);  in prange()
538 		if (rold->to > rold->from + 1)  in prange()
559 	trange.from = rnew->from - delta;  in keep()
569 skip(int i, int from, const char *pr)  in skip()  argument
574 	for (n = 0; cline[i] < from - 1; n += j) {  in skip()
595 	if (r1->to-r1->from != r2->to-r2->from)  in duplicate()
597 	skip(0, r1->from, NULL);  in duplicate()
598 	skip(1, r2->from, NULL);  in duplicate()
600 	for (nline = 0; nline < r1->to - r1->from; nline++) {  in duplicate()
645 	de[j].old.from = diff->old.from;  in edit()
647 	de[j].new.from = diff->new.from;  in edit()
660 	if (r->from == r->to)  in printrange()
663 	if (r->from > r->to)  in printrange()
673 		if (i >= r->from)  in printrange()
692 		delete = (new->from == new->to);  in edscript()
695 				printf("%dd\n", new->from - 1);  in edscript()
696 			else if (old->from == new->from && old->to == new->to) {  in edscript()
697 				printf("%dc\n", old->from);  in edscript()
715 				printf("%da\n%s %s\n.\n", old->from - 1,  in edscript()
744 		deletenew = (new->from == new->to);  in Ascript()
745 		deleteold = (old->from == old->to);  in Ascript()
760 					(new->to - new->from));  in Ascript()
779 					r.from = old->from-1;  in Ascript()
800 					startmark - (old->to - old->from),  in Ascript()
822 	r.from = 1;  in mergescript()
836 			r.to = new->from + de_delta[n];  in mergescript()
838 			r.to = old->from;  in mergescript()
862 					if (old->from == old->to) {  in mergescript()
864 						or.from = old->from - 1;  in mergescript()
883 			r.from = new->to + de_delta[n];  in mergescript()
885 			r.from = old->to;  in mergescript()
892 	r.from -= f1f3delta;  in mergescript()