101 	struct range new;  member
565 		(*dd)[i].new.from = c;  in readin()
566 		(*dd)[i].new.to = d;  in readin()
571 		(*dd)[i].new.from = (*dd)[i-1].new.to;  in readin()
650 			d1->new.from, d1->new.to,  in merge()
652 			d2->new.from, d2->new.to);  in merge()
656 		if (!t2 || (t1 && d1->new.to < d2->new.from)) {  in merge()
661 				keep(2, &d1->new);  in merge()
662 				change(3, &d1->new, 0);  in merge()
669 		if (!t1 || (t2 && d2->new.to < d1->new.from)) {  in merge()
672 				keep(1, &d2->new);  in merge()
674 				change(3, &d2->new, 0);  in merge()
684 		if (d1 + 1 < d13 + m1 && d1->new.to >= d1[1].new.from) {  in merge()
686 			d1[1].new.from = d1->new.from;  in merge()
692 		if (d2 + 1 < d23 + m2 && d2->new.to >= d2[1].new.from) {  in merge()
694 			d2[1].new.from = d2->new.from;  in merge()
699 		if (d1->new.from == d2->new.from && d1->new.to == d2->new.to) {  in merge()
713 				change(3, &d3->new, 0);  in merge()
725 		if (d1->new.from < d2->new.from) {  in merge()
726 			d2->old.from -= d2->new.from-d1->new.from;  in merge()
727 			d2->new.from = d1->new.from;  in merge()
728 		} else if (d2->new.from < d1->new.from) {  in merge()
729 			d1->old.from -= d1->new.from-d2->new.from;  in merge()
730 			d1->new.from = d2->new.from;  in merge()
732 		if (d1->new.to > d2->new.to) {  in merge()
733 			d2->old.to += d1->new.to - d2->new.to;  in merge()
734 			d2->new.to = d1->new.to;  in merge()
735 		} else if (d2->new.to > d1->new.to) {  in merge()
736 			d1->old.to += d2->new.to - d1->new.to;  in merge()
737 			d1->new.to = d2->new.to;  in merge()
879 	de[j].new.from = de[j-1].new.to + skip(2, diff->new.from, NULL);  in edit()
880 	de[j].new.to = de[j].new.from + skip(2, diff->new.to, NULL);  in edit()
896 		(void)fseek(fp[2], (long)de[n].new.from, SEEK_SET);  in edscript()
897 		for (k = de[n].new.to-de[n].new.from; k > 0; k-= j) {  in edscript()