Easier way to do text-movement algorithm?

[Monte Goulding]

>    Any better ideas than these?
>
Assuming that your starting point is a list of start and end chars for each
section you could simply subtract the number of chars of section A from each
section prior to C then add the number of chars of A - the number of chars
of C to each section after C.

Hope that makes sense. It should be alot faster than a whole heap of
matchchunk calls.

Cheers

Monte