From 0406845d2068ef61e40eced2acdfd24aa0d1c8a1 Mon Sep 17 00:00:00 2001 From: Spencer Janssen Date: Mon, 4 Jun 2007 08:26:53 +0200 Subject: Use the new integrate function darcs-hash:20070604062653-a5988-8a6456ccc1dd03fa1c733e71dfa056dd76a91186.gz --- Operations.hs | 4 +--- 1 file changed, 1 insertion(+), 3 deletions(-) (limited to 'Operations.hs') 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 () -- cgit v1.2.3