Think about the data structures some text editors use to describe
special regions of the text. A common operation is to search for all
the special regions covering a particular cursor position.
Several data structures are available. I'm not aware of any that have
perfect behaviour in all corner cases.
It might be worth noting that these data structures are good at
determining the set of regions covering position X+1 having recently
calculated the set for position X. Perhaps that has relevance for
speeding up page scanning?
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to email@example.com
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/