110 	struct range new;  member
237 		(*dd)[i].new.from = c;  in readin()
238 		(*dd)[i].new.to = d;  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()
323 				keep(2, &d1->new);  in merge()
324 				change(3, &d1->new, false);  in merge()
330 		if (!t1 || (t2 && d2->new.to < d1->new.from)) {  in merge()
333 				keep(1, &d2->new);  in merge()
334 				change(3, &d2->new, false);  in merge()
347 		if (d1 + 1 < d13 + m1 && d1->new.to >= d1[1].new.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()
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()
373 				change(3, &d3->new, false);  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()
393 		if (d1->new.to > d2->new.to) {  in merge()
394 			d2->old.to += d1->new.to - d2->new.to;  in merge()
395 			d2->new.to = d1->new.to;  in merge()
396 		} else if (d2->new.to > d1->new.to) {  in merge()
397 			d1->old.to += d2->new.to - d1->new.to;  in merge()
398 			d1->new.to = d2->new.to;  in merge()
554 	de[j].new.from = diff->new.from;  in edit()
555 	de[j].new.to = diff->new.to;  in edit()
594 	struct range *new, *old;  in edscript()  local
597 		new = &de[n].new;  in edscript()
600 		delete = (new->from == new->to);  in edscript()
607 		printrange(fp[2], new);  in edscript()
636 	struct range *new, *old;  in Ascript()  local
639 		new = &de[n].new;  in Ascript()
641 		deletenew = (new->from == new->to);  in Ascript()
647 				printrange(fp[2], new);  in Ascript()
649 				startmark = new->to;  in Ascript()
660 					(new->to - new->from));  in Ascript()
672 				printrange(fp[2], new);  in Ascript()
680 					r.to = new->to;  in Ascript()
686 				printrange(fp[2], new);  in Ascript()
719 	struct range r, *new, *old;  in mergescript()  local
726 		new = &de[n].new;  in mergescript()
737 			printrange(fp[2], new);  in mergescript()
741 				printrange(fp[2], new);  in mergescript()
751 					or.to = new->to;  in mergescript()
758 				printrange(fp[2], new);  in mergescript()
764 			r.from = new->to;  in mergescript()
776 	new = &de[n-1].new;  in mergescript()
778 	if ((old->from == new->from) &&  in mergescript()
779 		(old->to == new->to))  in mergescript()
781 	else if (new->from == new->to)  in mergescript()