102 	struct range new;  member
286 		(*dd)[i].new.from = c;  in readin()
287 		(*dd)[i].new.to = d;  in readin()
290 			    (*dd)[i].new.from < (*dd)[i - 1].new.to)  in readin()
296 		(*dd)[i].new.from = (*dd)[i].new.to = (*dd)[i - 1].new.to;  in readin()
377 		if (!t2 || (t1 && d1->new.to < d2->new.from)) {  in merge()
382 				keep(2, &d1->new);  in merge()
383 				change(3, &d1->new, false);  in merge()
391 		if (!t1 || (t2 && d2->new.to < d1->new.from)) {  in merge()
394 				keep(1, &d2->new);  in merge()
395 				change(3, &d2->new, false);  in merge()
409 		if (d1 + 1 < d13 + m1 && d1->new.to >= d1[1].new.from) {  in merge()
411 			d1[1].new.from = d1->new.from;  in merge()
417 		if (d2 + 1 < d23 + m2 && d2->new.to >= d2[1].new.from) {  in merge()
419 			d2[1].new.from = d2->new.from;  in merge()
424 		if (d1->new.from == d2->new.from && d1->new.to == d2->new.to) {  in merge()
435 				change(3, &d3->new, false);  in merge()
448 		if (d1->new.from < d2->new.from) {  in merge()
449 			d2->old.from -= d2->new.from - d1->new.from;  in merge()
450 			d2->new.from = d1->new.from;  in merge()
451 		} else if (d2->new.from < d1->new.from) {  in merge()
452 			d1->old.from -= d1->new.from - d2->new.from;  in merge()
453 			d1->new.from = d2->new.from;  in merge()
455 		if (d1->new.to > d2->new.to) {  in merge()
456 			d2->old.to += d1->new.to - d2->new.to;  in merge()
457 			d2->new.to = d1->new.to;  in merge()
458 		} else if (d2->new.to > d1->new.to) {  in merge()
459 			d1->old.to += d2->new.to - d1->new.to;  in merge()
460 			d1->new.to = d2->new.to;  in merge()
622 	de[j].new.from = diff->new.from;  in edit()
623 	de[j].new.to = diff->new.to;  in edit()
661 	struct range *new, *old;  in edscript()  local
664 		new = &de[n].new;  in edscript()
667 		delete = (new->from == new->to);  in edscript()
670 				printf("%dd\n", new->from - 1);  in edscript()
671 			else if (old->from == new->from && old->to == new->to) {  in edscript()
684 			printrange(fp[2], new);  in edscript()
714 	struct range *new, *old;  in Ascript()  local
717 		new = &de[n].new;  in Ascript()
719 		deletenew = (new->from == new->to);  in Ascript()
725 				printrange(fp[2], new);  in Ascript()
727 				startmark = new->to - 1;  in Ascript()
735 					(new->to - new->from));  in Ascript()
747 				printrange(fp[2], new);  in Ascript()
755 					r.to = new->to;  in Ascript()
761 				printrange(fp[2], new);  in Ascript()
794 	struct range r, *new, *old;  in mergescript()  local
802 		new = &de[n].new;  in mergescript()
809 		delete = (new->from == new->to);  in mergescript()
811 			r.to = new->from - 1;  in mergescript()
814 			r.to = new->from;  in mergescript()
823 				printrange(fp[2], new);  in mergescript()
829 			printrange(fp[2], new);  in mergescript()
834 				printrange(fp[2], new);  in mergescript()
845 						or.to = new->to;  in mergescript()
854 				printrange(fp[2], new);  in mergescript()
864 			r.from = new->to;  in mergescript()
877 	new = &de[n-1].new;  in mergescript()
880 	if (old->from == new->from && old->to == new->to)  in mergescript()
882 	else if (new->from == new->to)  in mergescript()