On 05/19/2011 07:27 PM, Gleb Natapov wrote:
> Think of how a window manager folds windows with priorities onto a > flat framebuffer. > > You do a depth-first walk of the tree. For each child list, you > iterate it from the lowest to highest priority, allowing later > subregions override earlier subregions. > I do not think that window manager is a good analogy. Window can overlap with only its siblings. In our memory tree each final node may overlap with any other node in the tree.
Transparent windows. -- I have a truly marvellous patch that fixes the bug which this signature is too narrow to contain.
