  This paper describes the most efficient way to manage operations on ranges of
elements within an ordered set. The goal is to improve existing solutions, by
optimizing the average-case time complexity and getting rid of heavy
multiplicative constants in the worst-case, without sacrificing space
complexity. This is a high-impact operation in practical applications,
performed by introducing a new data structure called Wise Red-Black Tree, an
augmented version of the Red-Black Tree.
