Age | Commit message (Collapse) | Author | |
---|---|---|---|
2019-02-19 | WindowServer: Avoid overdraw by shattering dirty rects into unique shards. | Andreas Kling | |
The algorithm I came up with is O(n^2) but given the small numbers of rects we're typically working with, it doesn't really matter. May need to revisit this in the future if we find ourselves with a huge number of rects. |