On Wed, 23 Oct 1996 10:40:11 +0200, J.A.vanderMost writes:
>[..SNIP..]
>>
>>A possible optimization: keep a sorted list of the y coordinate of the
>>bottom edge of each existing window; then instead of adding 1, set y to
>>the next-higher element of the list. (Why this algorithm works is left
>>as an exercise.)
>
>What about shaped windows ? If you treat a shaped window as if it was a
>rectangle then your method will work fine. If you want your new window to
>use the "transparent" space of the shaped window then this method will
>fail.
So will the current method. The existing code determines overlap based
on the rectangular bounds of the windows on the screen and the window
being placed. There is no case where my optimized method will fail to
place a window where the current code would have placed it anyway.
Dealing with shaped windows is a *much* harder problem, and it's my
opinion that fvwm shouldn't try to solve it.
-- People shouldn't think that it's better to have
Dan Astoorian loved and lost than never loved at all. It's
http://www.utopia.csas.com not, it's better to have loved and won. All
djast_at_utopia.csas.com the other options really suck. --Dan Redican
--
Visit the official FVWM web page at <URL:http://www.hpc.uh.edu/fvwm/>.
To unsubscribe from the list, send "unsubscribe fvwm" in the body of a
message to majordomo_at_hpc.uh.edu.
To report problems, send mail to fvwm-owner_at_hpc.uh.edu.
Received on Wed Oct 23 1996 - 09:08:17 BST