Manuel Stoeckl d180f4d9b3 util: add struct to track union of rectangles ... The new struct rect_union is designed to make it easier to efficiently accumulate a list of rectangles, and then operate on an exact cover of their union. Using rect_union, the times needed to added t rectangles, and then compute their exact cover will be O(t), and something between Ω(t) and O(t^2), depending on the rectangle arrangement. If one tries to do the same by storing a pixman_region32_t and updating it with pixman_region32_union_rect(), then total time needed would be between Ω(t^2) and O(t^3), depending on the input. Without changing the public API (data structure + rectangle ordering rules) for pixman_region32_t, it is impossible to improve its worst case time.		2023-10-05 11:45:32 +00:00
..
backend	docs: replace the less commonly used "::" with "."	2023-10-02 22:10:16 +03:00
interfaces	types/wlr_input_device: move init and finish function to private API	2022-03-07 16:37:41 +00:00
render	docs: replace the less commonly used "::" with "."	2023-10-02 22:10:16 +03:00
types	docs: replace the less commonly used "::" with "."	2023-10-02 22:10:16 +03:00
util	util: add struct to track union of rectangles	2023-10-05 11:45:32 +00:00
wlr	drop KDE idle protocol support	2023-10-04 12:19:30 -04:00
xcursor	Add some missing includes/declarations	2023-06-05 21:06:19 +00:00
xwayland	docs: replace the less commonly used "::" with "."	2023-10-02 22:10:16 +03:00
meson.build	build: unify naming for HAVE_* defines	2022-12-06 22:39:45 +00:00