Do any of you know of a method by which any overlapping, adjoining or self containing start and end positions for coloured portions of a string can be merged to produce new start and end positions. I have developed a method that in practice works but in theory could allow for mistakes. ie it is not full proof. Curiosity leads me to ask how easily a full proof method can be coded.
In reply to Overlapping portions of sub strings by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |