https://bugs.kde.org/show_bug.cgi?id=448688
Vlad Zahorodnii <vlad.zahorod...@kde.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
Component|general |core
Severity|normal |minor
--- Comment #1 from Vlad Zahorodnii <vlad.zahorod...@kde.org> ---
> (https://invent.kde.org/plasma/kwin/-/blob/master/src/placement.cpp#L198 ?)
> correctly , the search does not take window's stacking/last-activated rank
> into account in computing the overlap, but rather will traverse the screen
> from left to right and top to bottom and sum up the potential overlaps with
> all windows equally. However, there is apparently already a penalty for
> windows set as keep above:
> https://invent.kde.org/plasma/kwin/-/blob/master/src/placement.cpp#L262
No, it traverses the windows in the stacking order.
https://invent.kde.org/plasma/kwin/-/blob/8f941e52508ed16f28ee23e10e4515eedb4696bb/src/placement.cpp#L248
Note that there are effectively two stacking orders - visual stacking order
(workspace()->stackingOrder()) and unconstrained stacking order
(workspace::unconstrained_stacking_order). The most recently raised window will
be the last one in workspace::unconstrained_stacking_order.
workspace()->stackingOrder() is the same as
workspace::unconstrained_stacking_order but with stacking order constraints
applied, e.g. a dialog should always be above its parent, etc
--
You are receiving this mail because:
You are watching all bug changes.
