summaryrefslogtreecommitdiffstats
path: root/Operations.hs
diff options
context:
space:
mode:
Diffstat (limited to 'Operations.hs')
-rw-r--r--Operations.hs4
1 files changed, 1 insertions, 3 deletions
diff --git a/Operations.hs b/Operations.hs
index 59f3f7e..469f153 100644
--- a/Operations.hs
+++ b/Operations.hs
@@ -122,7 +122,7 @@ windows f = do
-- We now go to some effort to compute the minimal set of windows to hide.
-- The minimal set being only those windows which weren't previously hidden,
-- which is the intersection of previously visible windows with those now hidden
- mapM_ hide . concatMap (integrate . W.stack) $
+ mapM_ hide . concatMap (W.integrate . W.stack) $
intersectBy (\w x -> W.tag w == W.tag x)
(map W.workspace $ W.current old : W.visible old)
(W.hidden new)
@@ -130,8 +130,6 @@ windows f = do
clearEnterEvents
-- TODO: move this into StackSet. This isn't exactly the usual integrate.
- where integrate W.Empty = []
- integrate (W.Node x l r) = x : l ++ r
-- | setWMState. set the WM_STATE property
setWMState :: Window -> Int -> X ()