{-# LANGUAGE PatternGuards, ParallelListComp, FlexibleInstances, FlexibleContexts, MultiParamTypeClasses, ViewPatterns #-}
-----------------------------------------------------------------------------
-- |
-- Module      :  XMonad.Layout.SubLayouts
-- Description :  A layout combinator that allows layouts to be nested.
-- Copyright   :  (c) 2009 Adam Vogt
-- License     :  BSD-style (see xmonad/LICENSE)
--
-- Maintainer  :  vogt.adam@gmail.com
-- Stability   :  unstable
-- Portability :  unportable
--
-- A layout combinator that allows layouts to be nested.
--
-----------------------------------------------------------------------------

module XMonad.Layout.SubLayouts (
    -- * Usage
    -- $usage
    subLayout,
    subTabbed,

    pushGroup, pullGroup,
    pushWindow, pullWindow,
    onGroup, toSubl, mergeDir,

    GroupMsg(..),
    Broadcast(..),

    defaultSublMap,

    Sublayout,

    -- * Screenshots
    -- $screenshots

    -- * Todo
    -- $todo
    )
    where

import XMonad.Layout.Circle () -- so haddock can find the link

import XMonad.Layout.Decoration(Decoration, DefaultShrinker)
import XMonad.Layout.LayoutModifier(LayoutModifier(handleMess, modifyLayout,
                                    redoLayout),
                                    ModifiedLayout(..))
import XMonad.Layout.Simplest(Simplest(..))
import XMonad.Layout.Tabbed(shrinkText,
                            TabbedDecoration, addTabs)
import XMonad.Layout.WindowNavigation(Navigate(Apply))
import XMonad.Util.Invisible(Invisible(..))
import XMonad.Util.Types(Direction2D(..))
import XMonad hiding (def)
import XMonad.Prelude
import Control.Arrow(Arrow(second, (&&&)))

import qualified XMonad as X
import qualified XMonad.Layout.BoringWindows as B
import qualified XMonad.StackSet as W
import qualified Data.Map as M
import Data.Map(Map)
import qualified Data.Set as S

-- $screenshots
--
-- <<http://haskell.org/sitewiki/images/thumb/8/8b/Xmonad-SubLayouts-xinerama.png/480px-Xmonad-SubLayouts-xinerama.png>>
--
-- Larger version: <http://haskell.org/sitewiki/images/8/8b/Xmonad-SubLayouts-xinerama.png>

-- $todo
--  /Issue 288/
--
--  "XMonad.Layout.ResizableTile" assumes that its environment
--  contains only the windows it is running: sublayouts are currently run with
--  the stack containing only the windows passed to it in its environment, but
--  any changes that the layout makes are not merged back.
--
--  Should the behavior be made optional?
--
--  /Features/
--
--   * suggested managehooks for merging specific windows, or the apropriate
--     layout based hack to find out the number of groups currently showed, but
--     the size of current window groups is not available (outside of this
--     growing module)
--
--  /SimpleTabbed as a SubLayout/
--
--  'subTabbed' works well, but it would be more uniform to avoid the use of
--  addTabs, with the sublayout being Simplest (but
--  'XMonad.Layout.Tabbed.simpleTabbed' is this...).  The only thing to be
--  gained by fixing this issue is the ability to mix and match decoration
--  styles. Better compatibility with some other layouts of which I am not
--  aware could be another benefit.
--
--  'simpleTabbed' (and other decorated layouts) fail horribly when used as
--  subLayouts:
--
--    * decorations stick around: layout is run after being told to Hide
--
--    * mouse events do not change focus: the group-ungroup does not respect
--      the focus changes it wants?
--
--    * sending ReleaseResources before running it makes xmonad very slow, and
--      still leaves borders sticking around
--

-- $usage
-- You can use this module with the following in your @~\/.xmonad\/xmonad.hs@:
--
-- > import XMonad.Layout.SubLayouts
-- > import XMonad.Layout.WindowNavigation
--
-- Using "XMonad.Layout.BoringWindows" is optional and it allows you to add a
-- keybinding to skip over the non-visible windows.
--
-- > import XMonad.Layout.BoringWindows
--
-- Then edit your @layoutHook@ by adding the 'subTabbed' layout modifier:
--
-- > myLayout = windowNavigation $ subTabbed $ boringWindows $
-- >                        Tall 1 (3/100) (1/2) ||| etc..
-- > main = xmonad def { layoutHook = myLayout }
--
-- "XMonad.Layout.WindowNavigation" is used to specify which windows to merge,
-- and it is not integrated into the modifier because it can be configured, and
-- works best as the outer modifier.
--
-- Then to your keybindings add:
--
--  > , ((modm .|. controlMask, xK_h), sendMessage $ pullGroup L)
--  > , ((modm .|. controlMask, xK_l), sendMessage $ pullGroup R)
--  > , ((modm .|. controlMask, xK_k), sendMessage $ pullGroup U)
--  > , ((modm .|. controlMask, xK_j), sendMessage $ pullGroup D)
--  >
--  > , ((modm .|. controlMask, xK_m), withFocused (sendMessage . MergeAll))
--  > , ((modm .|. controlMask, xK_u), withFocused (sendMessage . UnMerge))
--  >
--  > , ((modm .|. controlMask, xK_period), onGroup W.focusUp')
--  > , ((modm .|. controlMask, xK_comma), onGroup W.focusDown')
--
--  These additional keybindings require the optional
--  "XMonad.Layout.BoringWindows" layoutModifier. The focus will skip over the
--  windows that are not focused in each sublayout.
--
--  > , ((modm, xK_j), focusDown)
--  > , ((modm, xK_k), focusUp)
--
--  A 'submap' can be used to make modifying the sublayouts using 'onGroup' and
--  'toSubl' simpler:
--
--  > ,((modm, xK_s), submap $ defaultSublMap conf)
--
--  /NOTE:/ is there some reason that @asks config >>= submap . defaultSublMap@
--  could not be used in the keybinding instead? It avoids having to explicitly
--  pass the conf.
--
-- For more detailed instructions, see:
--
-- "XMonad.Doc.Extending#Editing_the_layout_hook"
-- "XMonad.Doc.Extending#Adding_key_bindings"

-- | The main layout modifier arguments:
--
-- @subLayout advanceInnerLayouts innerLayout outerLayout@
--
--  [@advanceInnerLayouts@] When a new group at index @n@ in the outer layout
--  is created (even with one element), the @innerLayout@ is used as the
--  layout within that group after being advanced with @advanceInnerLayouts !!
--  n@ 'NextLayout' messages. If there is no corresponding element in the
--  @advanceInnerLayouts@ list, then @innerLayout@ is not given any 'NextLayout'
--  messages.
--
--  [@innerLayout@] The single layout given to be run as a sublayout.
--
--  [@outerLayout@] The layout that determines the rectangles given to each
--  group.
--
--  Ex. The second group is 'Tall', the third is 'Circle', all others are tabbed
--  with:
--
--  > myLayout = addTabs shrinkText def
--  >          $ subLayout [0,1,2] (Simplest ||| Tall 1 0.2 0.5 ||| Circle)
--  >          $ Tall 1 0.2 0.5 ||| Full
subLayout :: [Int] -> subl a -> l a -> ModifiedLayout (Sublayout subl) l a
subLayout :: [Int] -> subl a -> l a -> ModifiedLayout (Sublayout subl) l a
subLayout [Int]
nextLayout subl a
sl = Sublayout subl a -> l a -> ModifiedLayout (Sublayout subl) l a
forall (m :: * -> *) (l :: * -> *) a.
m a -> l a -> ModifiedLayout m l a
ModifiedLayout (Invisible [] (SomeMessage, a)
-> ([Int], subl a) -> [(subl a, Stack a)] -> Sublayout subl a
forall (l :: * -> *) a.
Invisible [] (SomeMessage, a)
-> ([Int], l a) -> [(l a, Stack a)] -> Sublayout l a
Sublayout ([(SomeMessage, a)] -> Invisible [] (SomeMessage, a)
forall (m :: * -> *) a. m a -> Invisible m a
I []) ([Int]
nextLayout,subl a
sl) [])

-- | @subTabbed@ is a use of 'subLayout' with 'addTabs' to show decorations.
subTabbed :: (Eq a, LayoutModifier (Sublayout Simplest) a, LayoutClass l a) =>
    l a -> ModifiedLayout (Decoration TabbedDecoration DefaultShrinker)
                          (ModifiedLayout (Sublayout Simplest) l) a
subTabbed :: l a
-> ModifiedLayout
     (Decoration TabbedDecoration DefaultShrinker)
     (ModifiedLayout (Sublayout Simplest) l)
     a
subTabbed  l a
x = DefaultShrinker
-> Theme
-> ModifiedLayout (Sublayout Simplest) l a
-> ModifiedLayout
     (Decoration TabbedDecoration DefaultShrinker)
     (ModifiedLayout (Sublayout Simplest) l)
     a
forall a (l :: * -> *) s.
(Eq a, LayoutClass l a, Shrinker s) =>
s
-> Theme
-> l a
-> ModifiedLayout (Decoration TabbedDecoration s) l a
addTabs DefaultShrinker
shrinkText Theme
forall a. Default a => a
X.def (ModifiedLayout (Sublayout Simplest) l a
 -> ModifiedLayout
      (Decoration TabbedDecoration DefaultShrinker)
      (ModifiedLayout (Sublayout Simplest) l)
      a)
-> ModifiedLayout (Sublayout Simplest) l a
-> ModifiedLayout
     (Decoration TabbedDecoration DefaultShrinker)
     (ModifiedLayout (Sublayout Simplest) l)
     a
forall a b. (a -> b) -> a -> b
$ [Int]
-> Simplest a -> l a -> ModifiedLayout (Sublayout Simplest) l a
forall (subl :: * -> *) a (l :: * -> *).
[Int] -> subl a -> l a -> ModifiedLayout (Sublayout subl) l a
subLayout [] Simplest a
forall a. Simplest a
Simplest l a
x

-- | @defaultSublMap@ is an attempt to create a set of keybindings like the
-- defaults ones but to be used as a 'submap' for sending messages to the
-- sublayout.
defaultSublMap :: XConfig l -> Map (KeyMask, KeySym) (X ())
defaultSublMap :: XConfig l -> Map (KeyMask, KeySym) (X ())
defaultSublMap XConfig{ modMask :: forall (l :: * -> *). XConfig l -> KeyMask
modMask = KeyMask
modm } = [((KeyMask, KeySym), X ())] -> Map (KeyMask, KeySym) (X ())
forall k a. Ord k => [(k, a)] -> Map k a
M.fromList
         [((KeyMask
modm, KeySym
xK_space), ChangeLayout -> X ()
forall a. Message a => a -> X ()
toSubl ChangeLayout
NextLayout),
          ((KeyMask
modm, KeySym
xK_j), (Stack KeySym -> Stack KeySym) -> X ()
onGroup Stack KeySym -> Stack KeySym
forall a. Stack a -> Stack a
W.focusDown'),
          ((KeyMask
modm, KeySym
xK_k), (Stack KeySym -> Stack KeySym) -> X ()
onGroup Stack KeySym -> Stack KeySym
forall a. Stack a -> Stack a
W.focusUp'),
          ((KeyMask
modm, KeySym
xK_h), Resize -> X ()
forall a. Message a => a -> X ()
toSubl Resize
Shrink),
          ((KeyMask
modm, KeySym
xK_l), Resize -> X ()
forall a. Message a => a -> X ()
toSubl Resize
Expand),
          ((KeyMask
modm, KeySym
xK_Tab), (Stack KeySym -> Stack KeySym) -> X ()
onGroup Stack KeySym -> Stack KeySym
forall a. Stack a -> Stack a
W.focusDown'),
          ((KeyMask
modm KeyMask -> KeyMask -> KeyMask
forall a. Bits a => a -> a -> a
.|. KeyMask
shiftMask, KeySym
xK_Tab), (Stack KeySym -> Stack KeySym) -> X ()
onGroup Stack KeySym -> Stack KeySym
forall a. Stack a -> Stack a
W.focusUp'),
          ((KeyMask
modm, KeySym
xK_m), (Stack KeySym -> Stack KeySym) -> X ()
onGroup Stack KeySym -> Stack KeySym
forall a. Stack a -> Stack a
focusMaster'),
          ((KeyMask
modm, KeySym
xK_comma), IncMasterN -> X ()
forall a. Message a => a -> X ()
toSubl (IncMasterN -> X ()) -> IncMasterN -> X ()
forall a b. (a -> b) -> a -> b
$ Int -> IncMasterN
IncMasterN Int
1),
          ((KeyMask
modm, KeySym
xK_period), IncMasterN -> X ()
forall a. Message a => a -> X ()
toSubl (IncMasterN -> X ()) -> IncMasterN -> X ()
forall a b. (a -> b) -> a -> b
$ Int -> IncMasterN
IncMasterN (-Int
1)),
          ((KeyMask
modm, KeySym
xK_Return), (Stack KeySym -> Stack KeySym) -> X ()
onGroup Stack KeySym -> Stack KeySym
forall a. Stack a -> Stack a
swapMaster')
         ]
        where
         -- should these go into XMonad.StackSet?
         focusMaster' :: Stack a -> Stack a
focusMaster' Stack a
st = let ([a] -> NonEmpty a
forall a. HasCallStack => [a] -> NonEmpty a
notEmpty -> a
f :| [a]
fs) = Stack a -> [a]
forall a. Stack a -> [a]
W.integrate Stack a
st
            in a -> [a] -> [a] -> Stack a
forall a. a -> [a] -> [a] -> Stack a
W.Stack a
f [] [a]
fs
         swapMaster' :: Stack a -> Stack a
swapMaster' (W.Stack a
f [a]
u [a]
d) = a -> [a] -> [a] -> Stack a
forall a. a -> [a] -> [a] -> Stack a
W.Stack a
f [] ([a] -> Stack a) -> [a] -> Stack a
forall a b. (a -> b) -> a -> b
$ [a] -> [a]
forall a. [a] -> [a]
reverse [a]
u [a] -> [a] -> [a]
forall a. [a] -> [a] -> [a]
++ [a]
d

data Sublayout l a = Sublayout
    { Sublayout l a -> Invisible [] (SomeMessage, a)
delayMess :: Invisible [] (SomeMessage,a)
                          -- ^ messages are handled when running the layout,
                          -- not in the handleMessage, I'm not sure that this
                          -- is necessary
    , Sublayout l a -> ([Int], l a)
def :: ([Int], l a) -- ^ how many NextLayout messages to send to newly
                          -- populated layouts. If there is no corresponding
                          -- index, then don't send any.
    , Sublayout l a -> [(l a, Stack a)]
subls :: [(l a,W.Stack a)]
                          -- ^ The sublayouts and the stacks they manage
    }
    deriving (ReadPrec [Sublayout l a]
ReadPrec (Sublayout l a)
Int -> ReadS (Sublayout l a)
ReadS [Sublayout l a]
(Int -> ReadS (Sublayout l a))
-> ReadS [Sublayout l a]
-> ReadPrec (Sublayout l a)
-> ReadPrec [Sublayout l a]
-> Read (Sublayout l a)
forall a.
(Int -> ReadS a)
-> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
forall (l :: * -> *) a.
(Read a, Read (l a)) =>
ReadPrec [Sublayout l a]
forall (l :: * -> *) a.
(Read a, Read (l a)) =>
ReadPrec (Sublayout l a)
forall (l :: * -> *) a.
(Read a, Read (l a)) =>
Int -> ReadS (Sublayout l a)
forall (l :: * -> *) a.
(Read a, Read (l a)) =>
ReadS [Sublayout l a]
readListPrec :: ReadPrec [Sublayout l a]
$creadListPrec :: forall (l :: * -> *) a.
(Read a, Read (l a)) =>
ReadPrec [Sublayout l a]
readPrec :: ReadPrec (Sublayout l a)
$creadPrec :: forall (l :: * -> *) a.
(Read a, Read (l a)) =>
ReadPrec (Sublayout l a)
readList :: ReadS [Sublayout l a]
$creadList :: forall (l :: * -> *) a.
(Read a, Read (l a)) =>
ReadS [Sublayout l a]
readsPrec :: Int -> ReadS (Sublayout l a)
$creadsPrec :: forall (l :: * -> *) a.
(Read a, Read (l a)) =>
Int -> ReadS (Sublayout l a)
Read,Int -> Sublayout l a -> ShowS
[Sublayout l a] -> ShowS
Sublayout l a -> String
(Int -> Sublayout l a -> ShowS)
-> (Sublayout l a -> String)
-> ([Sublayout l a] -> ShowS)
-> Show (Sublayout l a)
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
forall (l :: * -> *) a.
(Show a, Show (l a)) =>
Int -> Sublayout l a -> ShowS
forall (l :: * -> *) a.
(Show a, Show (l a)) =>
[Sublayout l a] -> ShowS
forall (l :: * -> *) a.
(Show a, Show (l a)) =>
Sublayout l a -> String
showList :: [Sublayout l a] -> ShowS
$cshowList :: forall (l :: * -> *) a.
(Show a, Show (l a)) =>
[Sublayout l a] -> ShowS
show :: Sublayout l a -> String
$cshow :: forall (l :: * -> *) a.
(Show a, Show (l a)) =>
Sublayout l a -> String
showsPrec :: Int -> Sublayout l a -> ShowS
$cshowsPrec :: forall (l :: * -> *) a.
(Show a, Show (l a)) =>
Int -> Sublayout l a -> ShowS
Show)

-- | Groups assumes this invariant:
--     M.keys gs == map W.focus (M.elems gs)  (ignoring order)
--     All windows in the workspace are in the Map
--
-- The keys are visible windows, the rest are hidden.
--
-- This representation probably simplifies the internals of the modifier.
type Groups a = Map a (W.Stack a)

-- | Stack of stacks, a simple representation of groups for purposes of focus.
type GroupStack a = W.Stack (W.Stack a)

-- | GroupMsg take window parameters to determine which group the action should
-- be applied to
data GroupMsg a
    = UnMerge a -- ^ free the focused window from its tab stack
    | UnMergeAll a
                -- ^ separate the focused group into singleton groups
    | Merge a a -- ^ merge the first group into the second group
    | MergeAll a
                -- ^ make one large group, keeping the parameter focused
    | Migrate a a
                -- ^ used to the window named in the first argument to the
                -- second argument's group, this may be replaced by a
                -- combination of 'UnMerge' and 'Merge'
    | WithGroup (W.Stack a -> X (W.Stack a)) a
    | SubMessage SomeMessage  a
                -- ^ the sublayout with the given window will get the message

-- | merge the window that would be focused by the function when applied to the
-- W.Stack of all windows, with the current group removed. The given window
-- should be focused by a sublayout. Example usage: @withFocused (sendMessage .
-- mergeDir W.focusDown')@
mergeDir :: (W.Stack Window -> W.Stack Window) -> Window -> GroupMsg Window
mergeDir :: (Stack KeySym -> Stack KeySym) -> KeySym -> GroupMsg KeySym
mergeDir Stack KeySym -> Stack KeySym
f = (Stack KeySym -> X (Stack KeySym)) -> KeySym -> GroupMsg KeySym
forall a. (Stack a -> X (Stack a)) -> a -> GroupMsg a
WithGroup Stack KeySym -> X (Stack KeySym)
g
 where g :: Stack KeySym -> X (Stack KeySym)
g Stack KeySym
cs = do
        let onlyOthers :: Stack KeySym -> Maybe (Stack KeySym)
onlyOthers = (KeySym -> Bool) -> Stack KeySym -> Maybe (Stack KeySym)
forall a. (a -> Bool) -> Stack a -> Maybe (Stack a)
W.filter (KeySym -> [KeySym] -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`notElem` Stack KeySym -> [KeySym]
forall a. Stack a -> [a]
W.integrate Stack KeySym
cs)
        (Maybe (Stack KeySym) -> (Stack KeySym -> X ()) -> X ()
forall (m :: * -> *) a. Monad m => Maybe a -> (a -> m ()) -> m ()
`whenJust` GroupMsg KeySym -> X ()
forall a. Message a => a -> X ()
sendMessage (GroupMsg KeySym -> X ())
-> (Stack KeySym -> GroupMsg KeySym) -> Stack KeySym -> X ()
forall b c a. (b -> c) -> (a -> b) -> a -> c
. KeySym -> KeySym -> GroupMsg KeySym
forall a. a -> a -> GroupMsg a
Merge (Stack KeySym -> KeySym
forall a. Stack a -> a
W.focus Stack KeySym
cs) (KeySym -> GroupMsg KeySym)
-> (Stack KeySym -> KeySym) -> Stack KeySym -> GroupMsg KeySym
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Stack KeySym -> KeySym
forall a. Stack a -> a
W.focus (Stack KeySym -> KeySym)
-> (Stack KeySym -> Stack KeySym) -> Stack KeySym -> KeySym
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Stack KeySym -> Stack KeySym
f)
            (Maybe (Stack KeySym) -> X ())
-> (Maybe (Stack KeySym) -> Maybe (Stack KeySym))
-> Maybe (Stack KeySym)
-> X ()
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Stack KeySym -> Maybe (Stack KeySym)
onlyOthers (Stack KeySym -> Maybe (Stack KeySym))
-> Maybe (Stack KeySym) -> Maybe (Stack KeySym)
forall (m :: * -> *) a b. Monad m => (a -> m b) -> m a -> m b
=<<)
          (Maybe (Stack KeySym) -> X ()) -> X (Maybe (Stack KeySym)) -> X ()
forall (m :: * -> *) a b. Monad m => (a -> m b) -> m a -> m b
=<< X (Maybe (Stack KeySym))
currentStack
        Stack KeySym -> X (Stack KeySym)
forall (m :: * -> *) a. Monad m => a -> m a
return Stack KeySym
cs

newtype Broadcast = Broadcast SomeMessage -- ^ send a message to all sublayouts

instance Message Broadcast
instance Typeable a => Message (GroupMsg a)

-- | @pullGroup@, @pushGroup@ allow you to merge windows or groups inheriting
-- the position of the current window (pull) or the other window (push).
--
-- @pushWindow@ and @pullWindow@ move individual windows between groups. They
-- are less effective at preserving window positions.
pullGroup,pushGroup,pullWindow,pushWindow :: Direction2D -> Navigate
pullGroup :: Direction2D -> Navigate
pullGroup = (KeySym -> KeySym -> X ()) -> Direction2D -> Navigate
mergeNav (\KeySym
o KeySym
c -> GroupMsg KeySym -> X ()
forall a. Message a => a -> X ()
sendMessage (GroupMsg KeySym -> X ()) -> GroupMsg KeySym -> X ()
forall a b. (a -> b) -> a -> b
$ KeySym -> KeySym -> GroupMsg KeySym
forall a. a -> a -> GroupMsg a
Merge KeySym
o KeySym
c)
pushGroup :: Direction2D -> Navigate
pushGroup = (KeySym -> KeySym -> X ()) -> Direction2D -> Navigate
mergeNav (\KeySym
o KeySym
c -> GroupMsg KeySym -> X ()
forall a. Message a => a -> X ()
sendMessage (GroupMsg KeySym -> X ()) -> GroupMsg KeySym -> X ()
forall a b. (a -> b) -> a -> b
$ KeySym -> KeySym -> GroupMsg KeySym
forall a. a -> a -> GroupMsg a
Merge KeySym
c KeySym
o)
pullWindow :: Direction2D -> Navigate
pullWindow = (KeySym -> KeySym -> X ()) -> Direction2D -> Navigate
mergeNav (\KeySym
o KeySym
c -> GroupMsg KeySym -> X ()
forall a. Message a => a -> X ()
sendMessage (GroupMsg KeySym -> X ()) -> GroupMsg KeySym -> X ()
forall a b. (a -> b) -> a -> b
$ KeySym -> KeySym -> GroupMsg KeySym
forall a. a -> a -> GroupMsg a
Migrate KeySym
o KeySym
c)
pushWindow :: Direction2D -> Navigate
pushWindow = (KeySym -> KeySym -> X ()) -> Direction2D -> Navigate
mergeNav (\KeySym
o KeySym
c -> GroupMsg KeySym -> X ()
forall a. Message a => a -> X ()
sendMessage (GroupMsg KeySym -> X ()) -> GroupMsg KeySym -> X ()
forall a b. (a -> b) -> a -> b
$ KeySym -> KeySym -> GroupMsg KeySym
forall a. a -> a -> GroupMsg a
Migrate KeySym
c KeySym
o)

mergeNav :: (Window -> Window -> X ()) -> Direction2D -> Navigate
mergeNav :: (KeySym -> KeySym -> X ()) -> Direction2D -> Navigate
mergeNav KeySym -> KeySym -> X ()
f = (KeySym -> X ()) -> Direction2D -> Navigate
Apply ((KeySym -> X ()) -> X ()
withFocused ((KeySym -> X ()) -> X ())
-> (KeySym -> KeySym -> X ()) -> KeySym -> X ()
forall b c a. (b -> c) -> (a -> b) -> a -> c
. KeySym -> KeySym -> X ()
f)

-- | Apply a function on the stack belonging to the currently focused group. It
-- works for rearranging windows and for changing focus.
onGroup :: (W.Stack Window -> W.Stack Window) -> X ()
onGroup :: (Stack KeySym -> Stack KeySym) -> X ()
onGroup Stack KeySym -> Stack KeySym
f = (KeySym -> X ()) -> X ()
withFocused (GroupMsg KeySym -> X ()
forall a. Message a => a -> X ()
sendMessage (GroupMsg KeySym -> X ())
-> (KeySym -> GroupMsg KeySym) -> KeySym -> X ()
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Stack KeySym -> X (Stack KeySym)) -> KeySym -> GroupMsg KeySym
forall a. (Stack a -> X (Stack a)) -> a -> GroupMsg a
WithGroup (Stack KeySym -> X (Stack KeySym)
forall (m :: * -> *) a. Monad m => a -> m a
return (Stack KeySym -> X (Stack KeySym))
-> (Stack KeySym -> Stack KeySym)
-> Stack KeySym
-> X (Stack KeySym)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Stack KeySym -> Stack KeySym
f))

-- | Send a message to the currently focused sublayout.
toSubl :: (Message a) => a -> X ()
toSubl :: a -> X ()
toSubl a
m = (KeySym -> X ()) -> X ()
withFocused (GroupMsg KeySym -> X ()
forall a. Message a => a -> X ()
sendMessage (GroupMsg KeySym -> X ())
-> (KeySym -> GroupMsg KeySym) -> KeySym -> X ()
forall b c a. (b -> c) -> (a -> b) -> a -> c
. SomeMessage -> KeySym -> GroupMsg KeySym
forall a. SomeMessage -> a -> GroupMsg a
SubMessage (a -> SomeMessage
forall a. Message a => a -> SomeMessage
SomeMessage a
m))

instance (Read (l Window), Show (l Window), LayoutClass l Window) => LayoutModifier (Sublayout l) Window where
    modifyLayout :: Sublayout l KeySym
-> Workspace String (l KeySym) KeySym
-> Rectangle
-> X ([(KeySym, Rectangle)], Maybe (l KeySym))
modifyLayout Sublayout{ subls :: forall (l :: * -> *) a. Sublayout l a -> [(l a, Stack a)]
subls = [(l KeySym, Stack KeySym)]
osls } (W.Workspace String
i l KeySym
la Maybe (Stack KeySym)
st) Rectangle
r = do
            let gs' :: Groups KeySym
gs' = Maybe (Stack KeySym) -> Groups KeySym -> Groups KeySym
forall a. Ord a => Maybe (Stack a) -> Groups a -> Groups a
updateGroup Maybe (Stack KeySym)
st (Groups KeySym -> Groups KeySym) -> Groups KeySym -> Groups KeySym
forall a b. (a -> b) -> a -> b
$ [(l KeySym, Stack KeySym)] -> Groups KeySym
forall a a1. Ord a => [(a1, Stack a)] -> Map a (Stack a)
toGroups [(l KeySym, Stack KeySym)]
osls
                st' :: Maybe (Stack KeySym)
st' = (KeySym -> Bool) -> Stack KeySym -> Maybe (Stack KeySym)
forall a. (a -> Bool) -> Stack a -> Maybe (Stack a)
W.filter (KeySym -> [KeySym] -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`elem` Groups KeySym -> [KeySym]
forall k a. Map k a -> [k]
M.keys Groups KeySym
gs') (Stack KeySym -> Maybe (Stack KeySym))
-> Maybe (Stack KeySym) -> Maybe (Stack KeySym)
forall (m :: * -> *) a b. Monad m => (a -> m b) -> m a -> m b
=<< Maybe (Stack KeySym)
st
            Groups KeySym -> X ()
updateWs Groups KeySym
gs'
            Maybe (Stack KeySym)
oldStack <- X (Maybe (Stack KeySym))
currentStack
            Maybe (Stack KeySym) -> X ()
setStack Maybe (Stack KeySym)
st'
            Workspace String (l KeySym) KeySym
-> Rectangle -> X ([(KeySym, Rectangle)], Maybe (l KeySym))
forall (layout :: * -> *) a.
LayoutClass layout a =>
Workspace String (layout a) a
-> Rectangle -> X ([(a, Rectangle)], Maybe (layout a))
runLayout (String
-> l KeySym
-> Maybe (Stack KeySym)
-> Workspace String (l KeySym) KeySym
forall i l a. i -> l -> Maybe (Stack a) -> Workspace i l a
W.Workspace String
i l KeySym
la Maybe (Stack KeySym)
st') Rectangle
r X ([(KeySym, Rectangle)], Maybe (l KeySym))
-> X () -> X ([(KeySym, Rectangle)], Maybe (l KeySym))
forall (f :: * -> *) a b. Applicative f => f a -> f b -> f a
<* Maybe (Stack KeySym) -> X ()
setStack Maybe (Stack KeySym)
oldStack
            -- FIXME: merge back reordering, deletions?

    redoLayout :: Sublayout l KeySym
-> Rectangle
-> Maybe (Stack KeySym)
-> [(KeySym, Rectangle)]
-> X ([(KeySym, Rectangle)], Maybe (Sublayout l KeySym))
redoLayout Sublayout{ delayMess :: forall (l :: * -> *) a.
Sublayout l a -> Invisible [] (SomeMessage, a)
delayMess = I [(SomeMessage, KeySym)]
ms, def :: forall (l :: * -> *) a. Sublayout l a -> ([Int], l a)
def = ([Int], l KeySym)
defl, subls :: forall (l :: * -> *) a. Sublayout l a -> [(l a, Stack a)]
subls = [(l KeySym, Stack KeySym)]
osls } Rectangle
_r Maybe (Stack KeySym)
st [(KeySym, Rectangle)]
arrs = do
        let gs' :: Groups KeySym
gs' = Maybe (Stack KeySym) -> Groups KeySym -> Groups KeySym
forall a. Ord a => Maybe (Stack a) -> Groups a -> Groups a
updateGroup Maybe (Stack KeySym)
st (Groups KeySym -> Groups KeySym) -> Groups KeySym -> Groups KeySym
forall a b. (a -> b) -> a -> b
$ [(l KeySym, Stack KeySym)] -> Groups KeySym
forall a a1. Ord a => [(a1, Stack a)] -> Map a (Stack a)
toGroups [(l KeySym, Stack KeySym)]
osls
        [(Bool, (l KeySym, Stack KeySym))]
sls <- ([Int], l KeySym)
-> Maybe (Stack KeySym)
-> Groups KeySym
-> [(l KeySym, Stack KeySym)]
-> X [(Bool, (l KeySym, Stack KeySym))]
forall (layout :: * -> *) a k b.
(LayoutClass layout a, Ord k) =>
([Int], layout a)
-> Maybe (Stack k)
-> Groups k
-> [(layout a, b)]
-> X [(Bool, (layout a, Stack k))]
fromGroups ([Int], l KeySym)
defl Maybe (Stack KeySym)
st Groups KeySym
gs' [(l KeySym, Stack KeySym)]
osls

        let newL :: LayoutClass l Window => Rectangle -> WorkspaceId -> l Window -> Bool
                    -> Maybe (W.Stack Window) -> X ([(Window, Rectangle)], l Window)
            newL :: Rectangle
-> String
-> l KeySym
-> Bool
-> Maybe (Stack KeySym)
-> X ([(KeySym, Rectangle)], l KeySym)
newL Rectangle
rect String
n l KeySym
ol Bool
isNew Maybe (Stack KeySym)
sst = do
                Maybe (Stack KeySym)
orgStack <- X (Maybe (Stack KeySym))
currentStack
                let handle :: layout a -> (SomeMessage, b) -> X (layout a)
handle layout a
l (SomeMessage
y,b
_)
                        | Bool -> Bool
not Bool
isNew = layout a -> Maybe (layout a) -> layout a
forall a. a -> Maybe a -> a
fromMaybe layout a
l (Maybe (layout a) -> layout a)
-> X (Maybe (layout a)) -> X (layout a)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> layout a -> SomeMessage -> X (Maybe (layout a))
forall (layout :: * -> *) a.
LayoutClass layout a =>
layout a -> SomeMessage -> X (Maybe (layout a))
handleMessage layout a
l SomeMessage
y
                        | Bool
otherwise = layout a -> X (layout a)
forall (m :: * -> *) a. Monad m => a -> m a
return layout a
l
                    kms :: [(SomeMessage, KeySym)]
kms = ((SomeMessage, KeySym) -> Bool)
-> [(SomeMessage, KeySym)] -> [(SomeMessage, KeySym)]
forall a. (a -> Bool) -> [a] -> [a]
filter ((KeySym -> [KeySym] -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`elem` Groups KeySym -> [KeySym]
forall k a. Map k a -> [k]
M.keys Groups KeySym
gs') (KeySym -> Bool)
-> ((SomeMessage, KeySym) -> KeySym)
-> (SomeMessage, KeySym)
-> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (SomeMessage, KeySym) -> KeySym
forall a b. (a, b) -> b
snd) [(SomeMessage, KeySym)]
ms
                Maybe (Stack KeySym) -> X ()
setStack Maybe (Stack KeySym)
sst
                l KeySym
nl <- (l KeySym -> (SomeMessage, KeySym) -> X (l KeySym))
-> l KeySym -> [(SomeMessage, KeySym)] -> X (l KeySym)
forall (t :: * -> *) (m :: * -> *) b a.
(Foldable t, Monad m) =>
(b -> a -> m b) -> b -> t a -> m b
foldM l KeySym -> (SomeMessage, KeySym) -> X (l KeySym)
forall (layout :: * -> *) a b.
LayoutClass layout a =>
layout a -> (SomeMessage, b) -> X (layout a)
handle l KeySym
ol ([(SomeMessage, KeySym)] -> X (l KeySym))
-> [(SomeMessage, KeySym)] -> X (l KeySym)
forall a b. (a -> b) -> a -> b
$ ((SomeMessage, KeySym) -> Bool)
-> [(SomeMessage, KeySym)] -> [(SomeMessage, KeySym)]
forall a. (a -> Bool) -> [a] -> [a]
filter ((KeySym -> [KeySym] -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`elem` Maybe (Stack KeySym) -> [KeySym]
forall a. Maybe (Stack a) -> [a]
W.integrate' Maybe (Stack KeySym)
sst) (KeySym -> Bool)
-> ((SomeMessage, KeySym) -> KeySym)
-> (SomeMessage, KeySym)
-> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (SomeMessage, KeySym) -> KeySym
forall a b. (a, b) -> b
snd) [(SomeMessage, KeySym)]
kms
                ([(KeySym, Rectangle)], Maybe (l KeySym))
result <- Workspace String (l KeySym) KeySym
-> Rectangle -> X ([(KeySym, Rectangle)], Maybe (l KeySym))
forall (layout :: * -> *) a.
LayoutClass layout a =>
Workspace String (layout a) a
-> Rectangle -> X ([(a, Rectangle)], Maybe (layout a))
runLayout (String
-> l KeySym
-> Maybe (Stack KeySym)
-> Workspace String (l KeySym) KeySym
forall i l a. i -> l -> Maybe (Stack a) -> Workspace i l a
W.Workspace String
n l KeySym
nl Maybe (Stack KeySym)
sst) Rectangle
rect
                Maybe (Stack KeySym) -> X ()
setStack Maybe (Stack KeySym)
orgStack -- FIXME: merge back reordering, deletions?
                ([(KeySym, Rectangle)], l KeySym)
-> X ([(KeySym, Rectangle)], l KeySym)
forall (m :: * -> *) a. Monad m => a -> m a
return (([(KeySym, Rectangle)], l KeySym)
 -> X ([(KeySym, Rectangle)], l KeySym))
-> ([(KeySym, Rectangle)], l KeySym)
-> X ([(KeySym, Rectangle)], l KeySym)
forall a b. (a -> b) -> a -> b
$ l KeySym -> Maybe (l KeySym) -> l KeySym
forall a. a -> Maybe a -> a
fromMaybe l KeySym
nl (Maybe (l KeySym) -> l KeySym)
-> ([(KeySym, Rectangle)], Maybe (l KeySym))
-> ([(KeySym, Rectangle)], l KeySym)
forall (a :: * -> * -> *) b c d.
Arrow a =>
a b c -> a (d, b) (d, c)
`second` ([(KeySym, Rectangle)], Maybe (l KeySym))
result

            ([X ([(KeySym, Rectangle)], l KeySym)]
urls,[Maybe (Stack KeySym)]
ssts) = [(X ([(KeySym, Rectangle)], l KeySym), Maybe (Stack KeySym))]
-> ([X ([(KeySym, Rectangle)], l KeySym)], [Maybe (Stack KeySym)])
forall a b. [(a, b)] -> ([a], [b])
unzip [ (Rectangle
-> String
-> l KeySym
-> Bool
-> Maybe (Stack KeySym)
-> X ([(KeySym, Rectangle)], l KeySym)
forall (l :: * -> *).
LayoutClass l KeySym =>
Rectangle
-> String
-> l KeySym
-> Bool
-> Maybe (Stack KeySym)
-> X ([(KeySym, Rectangle)], l KeySym)
newL Rectangle
gr String
i l KeySym
l Bool
isNew Maybe (Stack KeySym)
sst, Maybe (Stack KeySym)
sst)
                    | (Bool
isNew,(l KeySym
l,Stack KeySym
_st)) <- [(Bool, (l KeySym, Stack KeySym))]
sls
                    | String
i <- (Int -> String) -> [Int] -> [String]
forall a b. (a -> b) -> [a] -> [b]
map Int -> String
forall a. Show a => a -> String
show [ Int
0 :: Int .. ]
                    | (KeySym
k,Rectangle
gr) <- [(KeySym, Rectangle)]
arrs, let sst :: Maybe (Stack KeySym)
sst = KeySym -> Groups KeySym -> Maybe (Stack KeySym)
forall k a. Ord k => k -> Map k a -> Maybe a
M.lookup KeySym
k Groups KeySym
gs' ]

        [([(KeySym, Rectangle)], l KeySym)]
arrs' <- [X ([(KeySym, Rectangle)], l KeySym)]
-> X [([(KeySym, Rectangle)], l KeySym)]
forall (t :: * -> *) (m :: * -> *) a.
(Traversable t, Monad m) =>
t (m a) -> m (t a)
sequence [X ([(KeySym, Rectangle)], l KeySym)]
urls
        Maybe (Sublayout l KeySym)
sls' <- Sublayout l KeySym -> Maybe (Sublayout l KeySym)
forall (m :: * -> *) a. Monad m => a -> m a
return (Sublayout l KeySym -> Maybe (Sublayout l KeySym))
-> ([(Bool, (l KeySym, Stack KeySym))] -> Sublayout l KeySym)
-> [(Bool, (l KeySym, Stack KeySym))]
-> Maybe (Sublayout l KeySym)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Invisible [] (SomeMessage, KeySym)
-> ([Int], l KeySym)
-> [(l KeySym, Stack KeySym)]
-> Sublayout l KeySym
forall (l :: * -> *) a.
Invisible [] (SomeMessage, a)
-> ([Int], l a) -> [(l a, Stack a)] -> Sublayout l a
Sublayout ([(SomeMessage, KeySym)] -> Invisible [] (SomeMessage, KeySym)
forall (m :: * -> *) a. m a -> Invisible m a
I []) ([Int], l KeySym)
defl ([(l KeySym, Stack KeySym)] -> Sublayout l KeySym)
-> ([(Bool, (l KeySym, Stack KeySym))]
    -> [(l KeySym, Stack KeySym)])
-> [(Bool, (l KeySym, Stack KeySym))]
-> Sublayout l KeySym
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ((Bool, (l KeySym, Stack KeySym)) -> (l KeySym, Stack KeySym))
-> [(Bool, (l KeySym, Stack KeySym))] -> [(l KeySym, Stack KeySym)]
forall a b. (a -> b) -> [a] -> [b]
map (Bool, (l KeySym, Stack KeySym)) -> (l KeySym, Stack KeySym)
forall a b. (a, b) -> b
snd ([(Bool, (l KeySym, Stack KeySym))] -> Maybe (Sublayout l KeySym))
-> X [(Bool, (l KeySym, Stack KeySym))]
-> X (Maybe (Sublayout l KeySym))
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> ([Int], l KeySym)
-> Maybe (Stack KeySym)
-> Groups KeySym
-> [(l KeySym, Stack KeySym)]
-> X [(Bool, (l KeySym, Stack KeySym))]
forall (layout :: * -> *) a k b.
(LayoutClass layout a, Ord k) =>
([Int], layout a)
-> Maybe (Stack k)
-> Groups k
-> [(layout a, b)]
-> X [(Bool, (layout a, Stack k))]
fromGroups ([Int], l KeySym)
defl Maybe (Stack KeySym)
st Groups KeySym
gs'
                        [ (l KeySym
l,Stack KeySym
s) | ([(KeySym, Rectangle)]
_,l KeySym
l) <- [([(KeySym, Rectangle)], l KeySym)]
arrs' | (Just Stack KeySym
s) <- [Maybe (Stack KeySym)]
ssts ]
        ([(KeySym, Rectangle)], Maybe (Sublayout l KeySym))
-> X ([(KeySym, Rectangle)], Maybe (Sublayout l KeySym))
forall (m :: * -> *) a. Monad m => a -> m a
return ((([(KeySym, Rectangle)], l KeySym) -> [(KeySym, Rectangle)])
-> [([(KeySym, Rectangle)], l KeySym)] -> [(KeySym, Rectangle)]
forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
concatMap ([(KeySym, Rectangle)], l KeySym) -> [(KeySym, Rectangle)]
forall a b. (a, b) -> a
fst [([(KeySym, Rectangle)], l KeySym)]
arrs', Maybe (Sublayout l KeySym)
sls')

    handleMess :: Sublayout l KeySym -> SomeMessage -> X (Maybe (Sublayout l KeySym))
handleMess (Sublayout (I [(SomeMessage, KeySym)]
ms) ([Int], l KeySym)
defl [(l KeySym, Stack KeySym)]
sls) SomeMessage
m
        | Just (SubMessage SomeMessage
sm KeySym
w) <- SomeMessage -> Maybe (GroupMsg KeySym)
forall m. Message m => SomeMessage -> Maybe m
fromMessage SomeMessage
m =
            Maybe (Sublayout l KeySym) -> X (Maybe (Sublayout l KeySym))
forall (m :: * -> *) a. Monad m => a -> m a
return (Maybe (Sublayout l KeySym) -> X (Maybe (Sublayout l KeySym)))
-> Maybe (Sublayout l KeySym) -> X (Maybe (Sublayout l KeySym))
forall a b. (a -> b) -> a -> b
$ Sublayout l KeySym -> Maybe (Sublayout l KeySym)
forall a. a -> Maybe a
Just (Sublayout l KeySym -> Maybe (Sublayout l KeySym))
-> Sublayout l KeySym -> Maybe (Sublayout l KeySym)
forall a b. (a -> b) -> a -> b
$ Invisible [] (SomeMessage, KeySym)
-> ([Int], l KeySym)
-> [(l KeySym, Stack KeySym)]
-> Sublayout l KeySym
forall (l :: * -> *) a.
Invisible [] (SomeMessage, a)
-> ([Int], l a) -> [(l a, Stack a)] -> Sublayout l a
Sublayout ([(SomeMessage, KeySym)] -> Invisible [] (SomeMessage, KeySym)
forall (m :: * -> *) a. m a -> Invisible m a
I ((SomeMessage
sm,KeySym
w)(SomeMessage, KeySym)
-> [(SomeMessage, KeySym)] -> [(SomeMessage, KeySym)]
forall a. a -> [a] -> [a]
:[(SomeMessage, KeySym)]
ms)) ([Int], l KeySym)
defl [(l KeySym, Stack KeySym)]
sls

        | Just (Broadcast SomeMessage
sm) <- SomeMessage -> Maybe Broadcast
forall m. Message m => SomeMessage -> Maybe m
fromMessage SomeMessage
m = do
            [(SomeMessage, KeySym)]
ms' <- (Maybe (Stack KeySym) -> [(SomeMessage, KeySym)])
-> X (Maybe (Stack KeySym)) -> X [(SomeMessage, KeySym)]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap ([SomeMessage] -> [KeySym] -> [(SomeMessage, KeySym)]
forall a b. [a] -> [b] -> [(a, b)]
zip (SomeMessage -> [SomeMessage]
forall a. a -> [a]
repeat SomeMessage
sm) ([KeySym] -> [(SomeMessage, KeySym)])
-> (Maybe (Stack KeySym) -> [KeySym])
-> Maybe (Stack KeySym)
-> [(SomeMessage, KeySym)]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Maybe (Stack KeySym) -> [KeySym]
forall a. Maybe (Stack a) -> [a]
W.integrate') X (Maybe (Stack KeySym))
currentStack
            Maybe (Sublayout l KeySym) -> X (Maybe (Sublayout l KeySym))
forall (m :: * -> *) a. Monad m => a -> m a
return (Maybe (Sublayout l KeySym) -> X (Maybe (Sublayout l KeySym)))
-> Maybe (Sublayout l KeySym) -> X (Maybe (Sublayout l KeySym))
forall a b. (a -> b) -> a -> b
$ if [(SomeMessage, KeySym)] -> Bool
forall (t :: * -> *) a. Foldable t => t a -> Bool
null [(SomeMessage, KeySym)]
ms' then Maybe (Sublayout l KeySym)
forall a. Maybe a
Nothing
                else Sublayout l KeySym -> Maybe (Sublayout l KeySym)
forall a. a -> Maybe a
Just (Sublayout l KeySym -> Maybe (Sublayout l KeySym))
-> Sublayout l KeySym -> Maybe (Sublayout l KeySym)
forall a b. (a -> b) -> a -> b
$ Invisible [] (SomeMessage, KeySym)
-> ([Int], l KeySym)
-> [(l KeySym, Stack KeySym)]
-> Sublayout l KeySym
forall (l :: * -> *) a.
Invisible [] (SomeMessage, a)
-> ([Int], l a) -> [(l a, Stack a)] -> Sublayout l a
Sublayout ([(SomeMessage, KeySym)] -> Invisible [] (SomeMessage, KeySym)
forall (m :: * -> *) a. m a -> Invisible m a
I ([(SomeMessage, KeySym)] -> Invisible [] (SomeMessage, KeySym))
-> [(SomeMessage, KeySym)] -> Invisible [] (SomeMessage, KeySym)
forall a b. (a -> b) -> a -> b
$ [(SomeMessage, KeySym)]
ms' [(SomeMessage, KeySym)]
-> [(SomeMessage, KeySym)] -> [(SomeMessage, KeySym)]
forall a. [a] -> [a] -> [a]
++ [(SomeMessage, KeySym)]
ms) ([Int], l KeySym)
defl [(l KeySym, Stack KeySym)]
sls

        | Just UpdateBoring
B.UpdateBoring <- SomeMessage -> Maybe UpdateBoring
forall m. Message m => SomeMessage -> Maybe m
fromMessage SomeMessage
m = do
            let bs :: [KeySym]
bs = (Stack KeySym -> [KeySym]) -> [Stack KeySym] -> [KeySym]
forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
concatMap Stack KeySym -> [KeySym]
forall a. Stack a -> [a]
unfocused ([Stack KeySym] -> [KeySym]) -> [Stack KeySym] -> [KeySym]
forall a b. (a -> b) -> a -> b
$ Groups KeySym -> [Stack KeySym]
forall k a. Map k a -> [a]
M.elems Groups KeySym
gs
            Workspace String (Layout KeySym) KeySym
ws <- (XState -> Workspace String (Layout KeySym) KeySym)
-> X (Workspace String (Layout KeySym) KeySym)
forall s (m :: * -> *) a. MonadState s m => (s -> a) -> m a
gets (Screen String (Layout KeySym) KeySym ScreenId ScreenDetail
-> Workspace String (Layout KeySym) KeySym
forall i l a sid sd. Screen i l a sid sd -> Workspace i l a
W.workspace (Screen String (Layout KeySym) KeySym ScreenId ScreenDetail
 -> Workspace String (Layout KeySym) KeySym)
-> (XState
    -> Screen String (Layout KeySym) KeySym ScreenId ScreenDetail)
-> XState
-> Workspace String (Layout KeySym) KeySym
forall b c a. (b -> c) -> (a -> b) -> a -> c
. StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
-> Screen String (Layout KeySym) KeySym ScreenId ScreenDetail
forall i l a sid sd. StackSet i l a sid sd -> Screen i l a sid sd
W.current (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
 -> Screen String (Layout KeySym) KeySym ScreenId ScreenDetail)
-> (XState
    -> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail)
-> XState
-> Screen String (Layout KeySym) KeySym ScreenId ScreenDetail
forall b c a. (b -> c) -> (a -> b) -> a -> c
. XState
-> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
windowset)
            (BoringMessage -> Workspace String (Layout KeySym) KeySym -> X ())
-> Workspace String (Layout KeySym) KeySym -> BoringMessage -> X ()
forall a b c. (a -> b -> c) -> b -> a -> c
flip BoringMessage -> Workspace String (Layout KeySym) KeySym -> X ()
forall a.
Message a =>
a -> Workspace String (Layout KeySym) KeySym -> X ()
sendMessageWithNoRefresh Workspace String (Layout KeySym) KeySym
ws (BoringMessage -> X ()) -> BoringMessage -> X ()
forall a b. (a -> b) -> a -> b
$ String -> [KeySym] -> BoringMessage
B.Replace String
"Sublayouts" [KeySym]
bs
            Maybe (Sublayout l KeySym) -> X (Maybe (Sublayout l KeySym))
forall (m :: * -> *) a. Monad m => a -> m a
return Maybe (Sublayout l KeySym)
forall a. Maybe a
Nothing

        | Just (WithGroup Stack KeySym -> X (Stack KeySym)
f KeySym
w) <- SomeMessage -> Maybe (GroupMsg KeySym)
forall m. Message m => SomeMessage -> Maybe m
fromMessage SomeMessage
m
        , Just Stack KeySym
g <- KeySym -> Groups KeySym -> Maybe (Stack KeySym)
forall k a. Ord k => k -> Map k a -> Maybe a
M.lookup KeySym
w Groups KeySym
gs = do
            Stack KeySym
g' <- Stack KeySym -> X (Stack KeySym)
f Stack KeySym
g
            let gs' :: Groups KeySym
gs' = KeySym -> Stack KeySym -> Groups KeySym -> Groups KeySym
forall k a. Ord k => k -> a -> Map k a -> Map k a
M.insert (Stack KeySym -> KeySym
forall a. Stack a -> a
W.focus Stack KeySym
g') Stack KeySym
g' (Groups KeySym -> Groups KeySym) -> Groups KeySym -> Groups KeySym
forall a b. (a -> b) -> a -> b
$ KeySym -> Groups KeySym -> Groups KeySym
forall k a. Ord k => k -> Map k a -> Map k a
M.delete (Stack KeySym -> KeySym
forall a. Stack a -> a
W.focus Stack KeySym
g) Groups KeySym
gs
            Bool -> X () -> X ()
forall (f :: * -> *). Applicative f => Bool -> f () -> f ()
when (Groups KeySym
gs' Groups KeySym -> Groups KeySym -> Bool
forall a. Eq a => a -> a -> Bool
/= Groups KeySym
gs) (X () -> X ()) -> X () -> X ()
forall a b. (a -> b) -> a -> b
$ Groups KeySym -> X ()
updateWs Groups KeySym
gs'
            Bool -> X () -> X ()
forall (f :: * -> *). Applicative f => Bool -> f () -> f ()
when (KeySym
w KeySym -> KeySym -> Bool
forall a. Eq a => a -> a -> Bool
/= Stack KeySym -> KeySym
forall a. Stack a -> a
W.focus Stack KeySym
g') (X () -> X ()) -> X () -> X ()
forall a b. (a -> b) -> a -> b
$ (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
 -> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail)
-> X ()
windows (KeySym
-> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
-> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
forall s a i l sd.
(Eq s, Eq a, Eq i) =>
a -> StackSet i l a s sd -> StackSet i l a s sd
W.focusWindow (KeySym
 -> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
 -> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail)
-> KeySym
-> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
-> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
forall a b. (a -> b) -> a -> b
$ Stack KeySym -> KeySym
forall a. Stack a -> a
W.focus Stack KeySym
g')
            Maybe (Sublayout l KeySym) -> X (Maybe (Sublayout l KeySym))
forall (m :: * -> *) a. Monad m => a -> m a
return Maybe (Sublayout l KeySym)
forall a. Maybe a
Nothing

        | Just (MergeAll KeySym
w) <- SomeMessage -> Maybe (GroupMsg KeySym)
forall m. Message m => SomeMessage -> Maybe m
fromMessage SomeMessage
m =
            let gs' :: Maybe (Groups KeySym)
gs' = (Stack KeySym -> Groups KeySym)
-> Maybe (Stack KeySym) -> Maybe (Groups KeySym)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (KeySym -> Stack KeySym -> Groups KeySym
forall k a. k -> a -> Map k a
M.singleton KeySym
w)
                    (Maybe (Stack KeySym) -> Maybe (Groups KeySym))
-> Maybe (Stack KeySym) -> Maybe (Groups KeySym)
forall a b. (a -> b) -> a -> b
$ (KeySym -> Stack KeySym -> Maybe (Stack KeySym)
forall a. Eq a => a -> Stack a -> Maybe (Stack a)
focusWindow' KeySym
w (Stack KeySym -> Maybe (Stack KeySym))
-> Maybe (Stack KeySym) -> Maybe (Stack KeySym)
forall (m :: * -> *) a b. Monad m => (a -> m b) -> m a -> m b
=<<) (Maybe (Stack KeySym) -> Maybe (Stack KeySym))
-> Maybe (Stack KeySym) -> Maybe (Stack KeySym)
forall a b. (a -> b) -> a -> b
$ [KeySym] -> Maybe (Stack KeySym)
forall a. [a] -> Maybe (Stack a)
W.differentiate
                    ([KeySym] -> Maybe (Stack KeySym))
-> [KeySym] -> Maybe (Stack KeySym)
forall a b. (a -> b) -> a -> b
$ (Stack KeySym -> [KeySym]) -> [Stack KeySym] -> [KeySym]
forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
concatMap Stack KeySym -> [KeySym]
forall a. Stack a -> [a]
W.integrate ([Stack KeySym] -> [KeySym]) -> [Stack KeySym] -> [KeySym]
forall a b. (a -> b) -> a -> b
$ Groups KeySym -> [Stack KeySym]
forall k a. Map k a -> [a]
M.elems Groups KeySym
gs
            in X (Maybe (Sublayout l KeySym))
-> (Groups KeySym -> X (Maybe (Sublayout l KeySym)))
-> Maybe (Groups KeySym)
-> X (Maybe (Sublayout l KeySym))
forall b a. b -> (a -> b) -> Maybe a -> b
maybe (Maybe (Sublayout l KeySym) -> X (Maybe (Sublayout l KeySym))
forall (m :: * -> *) a. Monad m => a -> m a
return Maybe (Sublayout l KeySym)
forall a. Maybe a
Nothing) Groups KeySym -> X (Maybe (Sublayout l KeySym))
fgs Maybe (Groups KeySym)
gs'

        | Just (UnMergeAll KeySym
w) <- SomeMessage -> Maybe (GroupMsg KeySym)
forall m. Message m => SomeMessage -> Maybe m
fromMessage SomeMessage
m =
            let ws :: [KeySym]
ws = (Stack KeySym -> [KeySym]) -> [Stack KeySym] -> [KeySym]
forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
concatMap Stack KeySym -> [KeySym]
forall a. Stack a -> [a]
W.integrate ([Stack KeySym] -> [KeySym]) -> [Stack KeySym] -> [KeySym]
forall a b. (a -> b) -> a -> b
$ Groups KeySym -> [Stack KeySym]
forall k a. Map k a -> [a]
M.elems Groups KeySym
gs
                KeySym
_ = KeySym
w :: Window
                mkSingleton :: a -> Map a (Stack a)
mkSingleton a
f = a -> Stack a -> Map a (Stack a)
forall k a. k -> a -> Map k a
M.singleton a
f (a -> [a] -> [a] -> Stack a
forall a. a -> [a] -> [a] -> Stack a
W.Stack a
f [] [])
            in Groups KeySym -> X (Maybe (Sublayout l KeySym))
fgs (Groups KeySym -> X (Maybe (Sublayout l KeySym)))
-> Groups KeySym -> X (Maybe (Sublayout l KeySym))
forall a b. (a -> b) -> a -> b
$ [Groups KeySym] -> Groups KeySym
forall (f :: * -> *) k a.
(Foldable f, Ord k) =>
f (Map k a) -> Map k a
M.unions ([Groups KeySym] -> Groups KeySym)
-> [Groups KeySym] -> Groups KeySym
forall a b. (a -> b) -> a -> b
$ (KeySym -> Groups KeySym) -> [KeySym] -> [Groups KeySym]
forall a b. (a -> b) -> [a] -> [b]
map KeySym -> Groups KeySym
forall a. a -> Map a (Stack a)
mkSingleton [KeySym]
ws

        | Just (Merge KeySym
x KeySym
y) <- SomeMessage -> Maybe (GroupMsg KeySym)
forall m. Message m => SomeMessage -> Maybe m
fromMessage SomeMessage
m
        , Just (W.Stack KeySym
_ [KeySym]
xb [KeySym]
xn) <- KeySym -> Maybe (Stack KeySym)
findGroup KeySym
x
        , Just Stack KeySym
yst <- KeySym -> Maybe (Stack KeySym)
findGroup KeySym
y =
            let zs :: Stack KeySym
zs = KeySym -> [KeySym] -> [KeySym] -> Stack KeySym
forall a. a -> [a] -> [a] -> Stack a
W.Stack KeySym
x [KeySym]
xb ([KeySym]
xn [KeySym] -> [KeySym] -> [KeySym]
forall a. [a] -> [a] -> [a]
++ Stack KeySym -> [KeySym]
forall a. Stack a -> [a]
W.integrate Stack KeySym
yst)
            in Groups KeySym -> X (Maybe (Sublayout l KeySym))
fgs (Groups KeySym -> X (Maybe (Sublayout l KeySym)))
-> Groups KeySym -> X (Maybe (Sublayout l KeySym))
forall a b. (a -> b) -> a -> b
$ KeySym -> Stack KeySym -> Groups KeySym -> Groups KeySym
forall k a. Ord k => k -> a -> Map k a -> Map k a
M.insert KeySym
x Stack KeySym
zs (Groups KeySym -> Groups KeySym) -> Groups KeySym -> Groups KeySym
forall a b. (a -> b) -> a -> b
$ KeySym -> Groups KeySym -> Groups KeySym
forall k a. Ord k => k -> Map k a -> Map k a
M.delete (Stack KeySym -> KeySym
forall a. Stack a -> a
W.focus Stack KeySym
yst) Groups KeySym
gs

        | Just (UnMerge KeySym
x) <- SomeMessage -> Maybe (GroupMsg KeySym)
forall m. Message m => SomeMessage -> Maybe m
fromMessage SomeMessage
m =
            Groups KeySym -> X (Maybe (Sublayout l KeySym))
fgs (Groups KeySym -> X (Maybe (Sublayout l KeySym)))
-> (Groups KeySym -> Groups KeySym)
-> Groups KeySym
-> X (Maybe (Sublayout l KeySym))
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [(KeySym, Stack KeySym)] -> Groups KeySym
forall k a. Ord k => [(k, a)] -> Map k a
M.fromList ([(KeySym, Stack KeySym)] -> Groups KeySym)
-> (Groups KeySym -> [(KeySym, Stack KeySym)])
-> Groups KeySym
-> Groups KeySym
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Stack KeySym -> (KeySym, Stack KeySym))
-> [Stack KeySym] -> [(KeySym, Stack KeySym)]
forall a b. (a -> b) -> [a] -> [b]
map (Stack KeySym -> KeySym
forall a. Stack a -> a
W.focus (Stack KeySym -> KeySym)
-> (Stack KeySym -> Stack KeySym)
-> Stack KeySym
-> (KeySym, Stack KeySym)
forall (a :: * -> * -> *) b c c'.
Arrow a =>
a b c -> a b c' -> a b (c, c')
&&& Stack KeySym -> Stack KeySym
forall a. a -> a
id) ([Stack KeySym] -> [(KeySym, Stack KeySym)])
-> (Groups KeySym -> [Stack KeySym])
-> Groups KeySym
-> [(KeySym, Stack KeySym)]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Groups KeySym -> [Stack KeySym]
forall k a. Map k a -> [a]
M.elems
                    (Groups KeySym -> X (Maybe (Sublayout l KeySym)))
-> Groups KeySym -> X (Maybe (Sublayout l KeySym))
forall a b. (a -> b) -> a -> b
$ (Stack KeySym -> Maybe (Stack KeySym))
-> Groups KeySym -> Groups KeySym
forall a b k. (a -> Maybe b) -> Map k a -> Map k b
M.mapMaybe ((KeySym -> Bool) -> Stack KeySym -> Maybe (Stack KeySym)
forall a. (a -> Bool) -> Stack a -> Maybe (Stack a)
W.filter (KeySym
xKeySym -> KeySym -> Bool
forall a. Eq a => a -> a -> Bool
/=)) Groups KeySym
gs

        -- XXX sometimes this migrates an incorrect window, why?
        | Just (Migrate KeySym
x KeySym
y) <- SomeMessage -> Maybe (GroupMsg KeySym)
forall m. Message m => SomeMessage -> Maybe m
fromMessage SomeMessage
m
        , Just Stack KeySym
xst <- KeySym -> Maybe (Stack KeySym)
findGroup KeySym
x
        , Just (W.Stack KeySym
yf [KeySym]
yu [KeySym]
yd) <- KeySym -> Maybe (Stack KeySym)
findGroup KeySym
y =
            let zs :: Stack KeySym
zs = KeySym -> [KeySym] -> [KeySym] -> Stack KeySym
forall a. a -> [a] -> [a] -> Stack a
W.Stack KeySym
x (KeySym
yfKeySym -> [KeySym] -> [KeySym]
forall a. a -> [a] -> [a]
:[KeySym]
yu) [KeySym]
yd
                nxsAdd :: Groups KeySym -> Groups KeySym
nxsAdd = (Groups KeySym -> Groups KeySym)
-> (Stack KeySym -> Groups KeySym -> Groups KeySym)
-> Maybe (Stack KeySym)
-> Groups KeySym
-> Groups KeySym
forall b a. b -> (a -> b) -> Maybe a -> b
maybe Groups KeySym -> Groups KeySym
forall a. a -> a
id (\Stack KeySym
e -> KeySym -> Stack KeySym -> Groups KeySym -> Groups KeySym
forall k a. Ord k => k -> a -> Map k a -> Map k a
M.insert (Stack KeySym -> KeySym
forall a. Stack a -> a
W.focus Stack KeySym
e) Stack KeySym
e) (Maybe (Stack KeySym) -> Groups KeySym -> Groups KeySym)
-> Maybe (Stack KeySym) -> Groups KeySym -> Groups KeySym
forall a b. (a -> b) -> a -> b
$ (KeySym -> Bool) -> Stack KeySym -> Maybe (Stack KeySym)
forall a. (a -> Bool) -> Stack a -> Maybe (Stack a)
W.filter (KeySym
xKeySym -> KeySym -> Bool
forall a. Eq a => a -> a -> Bool
/=) Stack KeySym
xst
            in Groups KeySym -> X (Maybe (Sublayout l KeySym))
fgs (Groups KeySym -> X (Maybe (Sublayout l KeySym)))
-> Groups KeySym -> X (Maybe (Sublayout l KeySym))
forall a b. (a -> b) -> a -> b
$ Groups KeySym -> Groups KeySym
nxsAdd (Groups KeySym -> Groups KeySym) -> Groups KeySym -> Groups KeySym
forall a b. (a -> b) -> a -> b
$ KeySym -> Stack KeySym -> Groups KeySym -> Groups KeySym
forall k a. Ord k => k -> a -> Map k a -> Map k a
M.insert KeySym
x Stack KeySym
zs (Groups KeySym -> Groups KeySym) -> Groups KeySym -> Groups KeySym
forall a b. (a -> b) -> a -> b
$ KeySym -> Groups KeySym -> Groups KeySym
forall k a. Ord k => k -> Map k a -> Map k a
M.delete KeySym
yf Groups KeySym
gs


        | Bool
otherwise = Maybe (Maybe (Sublayout l KeySym)) -> Maybe (Sublayout l KeySym)
forall (m :: * -> *) a. Monad m => m (m a) -> m a
join (Maybe (Maybe (Sublayout l KeySym)) -> Maybe (Sublayout l KeySym))
-> X (Maybe (Maybe (Sublayout l KeySym)))
-> X (Maybe (Sublayout l KeySym))
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Maybe (X (Maybe (Sublayout l KeySym)))
-> X (Maybe (Maybe (Sublayout l KeySym)))
forall (t :: * -> *) (f :: * -> *) a.
(Traversable t, Applicative f) =>
t (f a) -> f (t a)
sequenceA (LayoutMessages -> X (Maybe (Sublayout l KeySym))
catchLayoutMess (LayoutMessages -> X (Maybe (Sublayout l KeySym)))
-> Maybe LayoutMessages -> Maybe (X (Maybe (Sublayout l KeySym)))
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> SomeMessage -> Maybe LayoutMessages
forall m. Message m => SomeMessage -> Maybe m
fromMessage SomeMessage
m)
     where gs :: Groups KeySym
gs = [(l KeySym, Stack KeySym)] -> Groups KeySym
forall a a1. Ord a => [(a1, Stack a)] -> Map a (Stack a)
toGroups [(l KeySym, Stack KeySym)]
sls
           fgs :: Groups KeySym -> X (Maybe (Sublayout l KeySym))
fgs Groups KeySym
gs' = do
                Maybe (Stack KeySym)
st <- X (Maybe (Stack KeySym))
currentStack
                Sublayout l KeySym -> Maybe (Sublayout l KeySym)
forall a. a -> Maybe a
Just (Sublayout l KeySym -> Maybe (Sublayout l KeySym))
-> ([(Bool, (l KeySym, Stack KeySym))] -> Sublayout l KeySym)
-> [(Bool, (l KeySym, Stack KeySym))]
-> Maybe (Sublayout l KeySym)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Invisible [] (SomeMessage, KeySym)
-> ([Int], l KeySym)
-> [(l KeySym, Stack KeySym)]
-> Sublayout l KeySym
forall (l :: * -> *) a.
Invisible [] (SomeMessage, a)
-> ([Int], l a) -> [(l a, Stack a)] -> Sublayout l a
Sublayout ([(SomeMessage, KeySym)] -> Invisible [] (SomeMessage, KeySym)
forall (m :: * -> *) a. m a -> Invisible m a
I [(SomeMessage, KeySym)]
ms) ([Int], l KeySym)
defl ([(l KeySym, Stack KeySym)] -> Sublayout l KeySym)
-> ([(Bool, (l KeySym, Stack KeySym))]
    -> [(l KeySym, Stack KeySym)])
-> [(Bool, (l KeySym, Stack KeySym))]
-> Sublayout l KeySym
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ((Bool, (l KeySym, Stack KeySym)) -> (l KeySym, Stack KeySym))
-> [(Bool, (l KeySym, Stack KeySym))] -> [(l KeySym, Stack KeySym)]
forall a b. (a -> b) -> [a] -> [b]
map (Bool, (l KeySym, Stack KeySym)) -> (l KeySym, Stack KeySym)
forall a b. (a, b) -> b
snd ([(Bool, (l KeySym, Stack KeySym))] -> Maybe (Sublayout l KeySym))
-> X [(Bool, (l KeySym, Stack KeySym))]
-> X (Maybe (Sublayout l KeySym))
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> ([Int], l KeySym)
-> Maybe (Stack KeySym)
-> Groups KeySym
-> [(l KeySym, Stack KeySym)]
-> X [(Bool, (l KeySym, Stack KeySym))]
forall (layout :: * -> *) a k b.
(LayoutClass layout a, Ord k) =>
([Int], layout a)
-> Maybe (Stack k)
-> Groups k
-> [(layout a, b)]
-> X [(Bool, (layout a, Stack k))]
fromGroups ([Int], l KeySym)
defl Maybe (Stack KeySym)
st Groups KeySym
gs' [(l KeySym, Stack KeySym)]
sls

           findGroup :: KeySym -> Maybe (Stack KeySym)
findGroup KeySym
z = Maybe (Stack KeySym)
-> Maybe (Stack KeySym) -> Maybe (Stack KeySym)
forall (m :: * -> *) a. MonadPlus m => m a -> m a -> m a
mplus (KeySym -> Groups KeySym -> Maybe (Stack KeySym)
forall k a. Ord k => k -> Map k a -> Maybe a
M.lookup KeySym
z Groups KeySym
gs) (Maybe (Stack KeySym) -> Maybe (Stack KeySym))
-> Maybe (Stack KeySym) -> Maybe (Stack KeySym)
forall a b. (a -> b) -> a -> b
$ [Stack KeySym] -> Maybe (Stack KeySym)
forall a. [a] -> Maybe a
listToMaybe
                    ([Stack KeySym] -> Maybe (Stack KeySym))
-> [Stack KeySym] -> Maybe (Stack KeySym)
forall a b. (a -> b) -> a -> b
$ Groups KeySym -> [Stack KeySym]
forall k a. Map k a -> [a]
M.elems (Groups KeySym -> [Stack KeySym])
-> Groups KeySym -> [Stack KeySym]
forall a b. (a -> b) -> a -> b
$ (Stack KeySym -> Bool) -> Groups KeySym -> Groups KeySym
forall a k. (a -> Bool) -> Map k a -> Map k a
M.filter ((KeySym
z KeySym -> [KeySym] -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`elem`) ([KeySym] -> Bool)
-> (Stack KeySym -> [KeySym]) -> Stack KeySym -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Stack KeySym -> [KeySym]
forall a. Stack a -> [a]
W.integrate) Groups KeySym
gs
           -- catchLayoutMess :: LayoutMessages -> X (Maybe (Sublayout l Window))
           --  This l must be the same as from the instance head,
           --  -XScopedTypeVariables should bring it into scope, but we are
           --  trying to avoid warnings with ghc-6.8.2 and avoid CPP
           catchLayoutMess :: LayoutMessages -> X (Maybe (Sublayout l KeySym))
catchLayoutMess LayoutMessages
x = do
            let m' :: LayoutMessages
m' = LayoutMessages
x LayoutMessages -> LayoutMessages -> LayoutMessages
forall a. a -> a -> a
`asTypeOf` (LayoutMessages
forall a. HasCallStack => a
undefined :: LayoutMessages)
            [(SomeMessage, KeySym)]
ms' <- [SomeMessage] -> [KeySym] -> [(SomeMessage, KeySym)]
forall a b. [a] -> [b] -> [(a, b)]
zip (SomeMessage -> [SomeMessage]
forall a. a -> [a]
repeat (SomeMessage -> [SomeMessage]) -> SomeMessage -> [SomeMessage]
forall a b. (a -> b) -> a -> b
$ LayoutMessages -> SomeMessage
forall a. Message a => a -> SomeMessage
SomeMessage LayoutMessages
m') ([KeySym] -> [(SomeMessage, KeySym)])
-> (Maybe (Stack KeySym) -> [KeySym])
-> Maybe (Stack KeySym)
-> [(SomeMessage, KeySym)]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Maybe (Stack KeySym) -> [KeySym]
forall a. Maybe (Stack a) -> [a]
W.integrate'
                    (Maybe (Stack KeySym) -> [(SomeMessage, KeySym)])
-> X (Maybe (Stack KeySym)) -> X [(SomeMessage, KeySym)]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> X (Maybe (Stack KeySym))
currentStack
            Maybe (Sublayout l KeySym) -> X (Maybe (Sublayout l KeySym))
forall (m :: * -> *) a. Monad m => a -> m a
return (Maybe (Sublayout l KeySym) -> X (Maybe (Sublayout l KeySym)))
-> Maybe (Sublayout l KeySym) -> X (Maybe (Sublayout l KeySym))
forall a b. (a -> b) -> a -> b
$ do Bool -> Maybe ()
forall (f :: * -> *). Alternative f => Bool -> f ()
guard (Bool -> Maybe ()) -> Bool -> Maybe ()
forall a b. (a -> b) -> a -> b
$ Bool -> Bool
not (Bool -> Bool) -> Bool -> Bool
forall a b. (a -> b) -> a -> b
$ [(SomeMessage, KeySym)] -> Bool
forall (t :: * -> *) a. Foldable t => t a -> Bool
null [(SomeMessage, KeySym)]
ms'
                        Sublayout l KeySym -> Maybe (Sublayout l KeySym)
forall a. a -> Maybe a
Just (Sublayout l KeySym -> Maybe (Sublayout l KeySym))
-> Sublayout l KeySym -> Maybe (Sublayout l KeySym)
forall a b. (a -> b) -> a -> b
$ Invisible [] (SomeMessage, KeySym)
-> ([Int], l KeySym)
-> [(l KeySym, Stack KeySym)]
-> Sublayout l KeySym
forall (l :: * -> *) a.
Invisible [] (SomeMessage, a)
-> ([Int], l a) -> [(l a, Stack a)] -> Sublayout l a
Sublayout ([(SomeMessage, KeySym)] -> Invisible [] (SomeMessage, KeySym)
forall (m :: * -> *) a. m a -> Invisible m a
I ([(SomeMessage, KeySym)] -> Invisible [] (SomeMessage, KeySym))
-> [(SomeMessage, KeySym)] -> Invisible [] (SomeMessage, KeySym)
forall a b. (a -> b) -> a -> b
$ [(SomeMessage, KeySym)]
ms' [(SomeMessage, KeySym)]
-> [(SomeMessage, KeySym)] -> [(SomeMessage, KeySym)]
forall a. [a] -> [a] -> [a]
++ [(SomeMessage, KeySym)]
ms) ([Int], l KeySym)
defl [(l KeySym, Stack KeySym)]
sls

currentStack :: X (Maybe (W.Stack Window))
currentStack :: X (Maybe (Stack KeySym))
currentStack = (XState -> Maybe (Stack KeySym)) -> X (Maybe (Stack KeySym))
forall s (m :: * -> *) a. MonadState s m => (s -> a) -> m a
gets (Workspace String (Layout KeySym) KeySym -> Maybe (Stack KeySym)
forall i l a. Workspace i l a -> Maybe (Stack a)
W.stack (Workspace String (Layout KeySym) KeySym -> Maybe (Stack KeySym))
-> (XState -> Workspace String (Layout KeySym) KeySym)
-> XState
-> Maybe (Stack KeySym)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Screen String (Layout KeySym) KeySym ScreenId ScreenDetail
-> Workspace String (Layout KeySym) KeySym
forall i l a sid sd. Screen i l a sid sd -> Workspace i l a
W.workspace (Screen String (Layout KeySym) KeySym ScreenId ScreenDetail
 -> Workspace String (Layout KeySym) KeySym)
-> (XState
    -> Screen String (Layout KeySym) KeySym ScreenId ScreenDetail)
-> XState
-> Workspace String (Layout KeySym) KeySym
forall b c a. (b -> c) -> (a -> b) -> a -> c
. StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
-> Screen String (Layout KeySym) KeySym ScreenId ScreenDetail
forall i l a sid sd. StackSet i l a sid sd -> Screen i l a sid sd
W.current (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
 -> Screen String (Layout KeySym) KeySym ScreenId ScreenDetail)
-> (XState
    -> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail)
-> XState
-> Screen String (Layout KeySym) KeySym ScreenId ScreenDetail
forall b c a. (b -> c) -> (a -> b) -> a -> c
. XState
-> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
windowset)

-- | update Group to follow changes in the workspace
updateGroup :: Ord a => Maybe (W.Stack a) -> Groups a -> Groups a
updateGroup :: Maybe (Stack a) -> Groups a -> Groups a
updateGroup Maybe (Stack a)
Nothing Groups a
_ = Groups a
forall a. Monoid a => a
mempty
updateGroup (Just Stack a
st) Groups a
gs = GroupStack a -> Groups a
forall a. Ord a => GroupStack a -> Groups a
fromGroupStack (Groups a -> Stack a -> GroupStack a
forall a. Ord a => Groups a -> Stack a -> GroupStack a
toGroupStack Groups a
gs Stack a
st)

-- | rearrange the windowset to put the groups of tabs next to eachother, so
-- that the stack of tabs stays put.
updateWs :: Groups Window -> X ()
updateWs :: Groups KeySym -> X ()
updateWs = (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
 -> Maybe
      (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail))
-> X ()
windowsMaybe ((StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
  -> Maybe
       (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail))
 -> X ())
-> (Groups KeySym
    -> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
    -> Maybe
         (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail))
-> Groups KeySym
-> X ()
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Groups KeySym
-> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
-> Maybe
     (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail)
updateWs'

updateWs' :: Groups Window -> WindowSet -> Maybe WindowSet
updateWs' :: Groups KeySym
-> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
-> Maybe
     (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail)
updateWs' Groups KeySym
gs StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
ws = do
    Stack KeySym
w <- Workspace String (Layout KeySym) KeySym -> Maybe (Stack KeySym)
forall i l a. Workspace i l a -> Maybe (Stack a)
W.stack (Workspace String (Layout KeySym) KeySym -> Maybe (Stack KeySym))
-> (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
    -> Workspace String (Layout KeySym) KeySym)
-> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
-> Maybe (Stack KeySym)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Screen String (Layout KeySym) KeySym ScreenId ScreenDetail
-> Workspace String (Layout KeySym) KeySym
forall i l a sid sd. Screen i l a sid sd -> Workspace i l a
W.workspace (Screen String (Layout KeySym) KeySym ScreenId ScreenDetail
 -> Workspace String (Layout KeySym) KeySym)
-> (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
    -> Screen String (Layout KeySym) KeySym ScreenId ScreenDetail)
-> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
-> Workspace String (Layout KeySym) KeySym
forall b c a. (b -> c) -> (a -> b) -> a -> c
. StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
-> Screen String (Layout KeySym) KeySym ScreenId ScreenDetail
forall i l a sid sd. StackSet i l a sid sd -> Screen i l a sid sd
W.current (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
 -> Maybe (Stack KeySym))
-> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
-> Maybe (Stack KeySym)
forall a b. (a -> b) -> a -> b
$ StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
ws
    let w' :: Stack KeySym
w' = GroupStack KeySym -> Stack KeySym
forall a. GroupStack a -> Stack a
flattenGroupStack (GroupStack KeySym -> Stack KeySym)
-> (Stack KeySym -> GroupStack KeySym)
-> Stack KeySym
-> Stack KeySym
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Groups KeySym -> Stack KeySym -> GroupStack KeySym
forall a. Ord a => Groups a -> Stack a -> GroupStack a
toGroupStack Groups KeySym
gs (Stack KeySym -> Stack KeySym) -> Stack KeySym -> Stack KeySym
forall a b. (a -> b) -> a -> b
$ Stack KeySym
w
    Bool -> Maybe ()
forall (f :: * -> *). Alternative f => Bool -> f ()
guard (Bool -> Maybe ()) -> Bool -> Maybe ()
forall a b. (a -> b) -> a -> b
$ Stack KeySym
w Stack KeySym -> Stack KeySym -> Bool
forall a. Eq a => a -> a -> Bool
/= Stack KeySym
w'
    StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
-> Maybe
     (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail)
forall (f :: * -> *) a. Applicative f => a -> f a
pure (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
 -> Maybe
      (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail))
-> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
-> Maybe
     (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail)
forall a b. (a -> b) -> a -> b
$ (Stack KeySym -> Stack KeySym)
-> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
-> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
forall a i l s sd.
(Stack a -> Stack a) -> StackSet i l a s sd -> StackSet i l a s sd
W.modify' (Stack KeySym -> Stack KeySym -> Stack KeySym
forall a b. a -> b -> a
const Stack KeySym
w') StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
ws

-- | Flatten a stack of stacks.
flattenGroupStack :: GroupStack a -> W.Stack a
flattenGroupStack :: GroupStack a -> Stack a
flattenGroupStack (W.Stack (W.Stack a
f [a]
lf [a]
rf) [Stack a]
ls [Stack a]
rs) =
    let l :: [a]
l = [a]
lf [a] -> [a] -> [a]
forall a. [a] -> [a] -> [a]
++ (Stack a -> [a]) -> [Stack a] -> [a]
forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
concatMap ([a] -> [a]
forall a. [a] -> [a]
reverse ([a] -> [a]) -> (Stack a -> [a]) -> Stack a -> [a]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Stack a -> [a]
forall a. Stack a -> [a]
W.integrate) [Stack a]
ls
        r :: [a]
r = [a]
rf [a] -> [a] -> [a]
forall a. [a] -> [a] -> [a]
++ (Stack a -> [a]) -> [Stack a] -> [a]
forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
concatMap Stack a -> [a]
forall a. Stack a -> [a]
W.integrate [Stack a]
rs
    in a -> [a] -> [a] -> Stack a
forall a. a -> [a] -> [a] -> Stack a
W.Stack a
f [a]
l [a]
r

-- | Extract Groups from a stack of stacks.
fromGroupStack :: (Ord a) => GroupStack a -> Groups a
fromGroupStack :: GroupStack a -> Groups a
fromGroupStack = [(a, Stack a)] -> Groups a
forall k a. Ord k => [(k, a)] -> Map k a
M.fromList ([(a, Stack a)] -> Groups a)
-> (GroupStack a -> [(a, Stack a)]) -> GroupStack a -> Groups a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Stack a -> (a, Stack a)) -> [Stack a] -> [(a, Stack a)]
forall a b. (a -> b) -> [a] -> [b]
map (Stack a -> a
forall a. Stack a -> a
W.focus (Stack a -> a) -> (Stack a -> Stack a) -> Stack a -> (a, Stack a)
forall (a :: * -> * -> *) b c c'.
Arrow a =>
a b c -> a b c' -> a b (c, c')
&&& Stack a -> Stack a
forall a. a -> a
id) ([Stack a] -> [(a, Stack a)])
-> (GroupStack a -> [Stack a]) -> GroupStack a -> [(a, Stack a)]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. GroupStack a -> [Stack a]
forall a. Stack a -> [a]
W.integrate

-- | Arrange a stack of windows into a stack of stacks, according to (possibly
-- outdated) Groups.
toGroupStack :: (Ord a) => Groups a -> W.Stack a -> GroupStack a
toGroupStack :: Groups a -> Stack a -> GroupStack a
toGroupStack Groups a
gs st :: Stack a
st@(W.Stack a
f [a]
ls [a]
rs) =
    Stack a -> [Stack a] -> [Stack a] -> GroupStack a
forall a. a -> [a] -> [a] -> Stack a
W.Stack (Maybe (Stack a) -> Stack a
forall a. HasCallStack => Maybe a -> a
fromJust (a -> Maybe (Stack a)
lu a
f)) ((a -> Maybe (Stack a)) -> [a] -> [Stack a]
forall a b. (a -> Maybe b) -> [a] -> [b]
mapMaybe a -> Maybe (Stack a)
lu [a]
ls) ((a -> Maybe (Stack a)) -> [a] -> [Stack a]
forall a b. (a -> Maybe b) -> [a] -> [b]
mapMaybe a -> Maybe (Stack a)
lu [a]
rs)
  where
    wset :: Set a
wset = [a] -> Set a
forall a. Ord a => [a] -> Set a
S.fromList (Stack a -> [a]
forall a. Stack a -> [a]
W.integrate Stack a
st)
    dead :: Stack a -> Maybe (Stack a)
dead = (a -> Bool) -> Stack a -> Maybe (Stack a)
forall a. (a -> Bool) -> Stack a -> Maybe (Stack a)
W.filter (a -> Set a -> Bool
forall a. Ord a => a -> Set a -> Bool
`S.member` Set a
wset) -- drop dead windows or entire groups
    refocus :: Stack a -> Maybe (Stack a)
refocus Stack a
s | a
f a -> [a] -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`elem` Stack a -> [a]
forall a. Stack a -> [a]
W.integrate Stack a
s -- sync focus/order of current group
                                       = (a -> Bool) -> Stack a -> Maybe (Stack a)
forall a. (a -> Bool) -> Stack a -> Maybe (Stack a)
W.filter (a -> [a] -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`elem` Stack a -> [a]
forall a. Stack a -> [a]
W.integrate Stack a
s) Stack a
st
              | Bool
otherwise = Stack a -> Maybe (Stack a)
forall (f :: * -> *) a. Applicative f => a -> f a
pure Stack a
s
    gs' :: Groups a
gs' = (Stack a -> Maybe (Stack a)) -> Groups a -> Groups a
forall a.
Ord a =>
(Stack a -> Maybe (Stack a)) -> Groups a -> Groups a
mapGroups (Stack a -> Maybe (Stack a)
refocus (Stack a -> Maybe (Stack a))
-> (Stack a -> Maybe (Stack a)) -> Stack a -> Maybe (Stack a)
forall (m :: * -> *) b c a.
Monad m =>
(b -> m c) -> (a -> m b) -> a -> m c
<=< Stack a -> Maybe (Stack a)
dead) Groups a
gs
    gset :: Set a
gset = [a] -> Set a
forall a. Ord a => [a] -> Set a
S.fromList ([a] -> Set a) -> (Groups a -> [a]) -> Groups a -> Set a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Stack a -> [a]) -> [Stack a] -> [a]
forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
concatMap Stack a -> [a]
forall a. Stack a -> [a]
W.integrate ([Stack a] -> [a]) -> (Groups a -> [Stack a]) -> Groups a -> [a]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Groups a -> [Stack a]
forall k a. Map k a -> [a]
M.elems (Groups a -> Set a) -> Groups a -> Set a
forall a b. (a -> b) -> a -> b
$ Groups a
gs'
    -- after refocus, f is either the focused window of some group, or not in
    -- gs' at all, so `lu f` is never Nothing
    lu :: a -> Maybe (Stack a)
lu a
w | a
w a -> Set a -> Bool
forall a. Ord a => a -> Set a -> Bool
`S.member` Set a
gset = a
w a -> Groups a -> Maybe (Stack a)
forall k a. Ord k => k -> Map k a -> Maybe a
`M.lookup` Groups a
gs'
         | Bool
otherwise = Stack a -> Maybe (Stack a)
forall a. a -> Maybe a
Just (a -> [a] -> [a] -> Stack a
forall a. a -> [a] -> [a] -> Stack a
W.Stack a
w [] []) -- singleton groups for new wins

mapGroups :: (Ord a) => (W.Stack a -> Maybe (W.Stack a)) -> Groups a -> Groups a
mapGroups :: (Stack a -> Maybe (Stack a)) -> Groups a -> Groups a
mapGroups Stack a -> Maybe (Stack a)
f = [(a, Stack a)] -> Groups a
forall k a. Ord k => [(k, a)] -> Map k a
M.fromList ([(a, Stack a)] -> Groups a)
-> (Groups a -> [(a, Stack a)]) -> Groups a -> Groups a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Stack a -> (a, Stack a)) -> [Stack a] -> [(a, Stack a)]
forall a b. (a -> b) -> [a] -> [b]
map (Stack a -> a
forall a. Stack a -> a
W.focus (Stack a -> a) -> (Stack a -> Stack a) -> Stack a -> (a, Stack a)
forall (a :: * -> * -> *) b c c'.
Arrow a =>
a b c -> a b c' -> a b (c, c')
&&& Stack a -> Stack a
forall a. a -> a
id) ([Stack a] -> [(a, Stack a)])
-> (Groups a -> [Stack a]) -> Groups a -> [(a, Stack a)]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Stack a -> Maybe (Stack a)) -> [Stack a] -> [Stack a]
forall a b. (a -> Maybe b) -> [a] -> [b]
mapMaybe Stack a -> Maybe (Stack a)
f ([Stack a] -> [Stack a])
-> (Groups a -> [Stack a]) -> Groups a -> [Stack a]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Groups a -> [Stack a]
forall k a. Map k a -> [a]
M.elems

-- | focusWindow'. focus an element of a stack, is Nothing if that element is
-- absent. See also 'W.focusWindow'
focusWindow' :: (Eq a) => a -> W.Stack a -> Maybe (W.Stack a)
focusWindow' :: a -> Stack a -> Maybe (Stack a)
focusWindow' a
w Stack a
st = do
    Bool -> Maybe ()
forall (f :: * -> *). Alternative f => Bool -> f ()
guard (Bool -> Maybe ()) -> Bool -> Maybe ()
forall a b. (a -> b) -> a -> b
$ a
w a -> [a] -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`elem` Stack a -> [a]
forall a. Stack a -> [a]
W.integrate Stack a
st
    Stack a -> Maybe (Stack a)
forall (m :: * -> *) a. Monad m => a -> m a
return (Stack a -> Maybe (Stack a)) -> Stack a -> Maybe (Stack a)
forall a b. (a -> b) -> a -> b
$ (Stack a -> Bool) -> (Stack a -> Stack a) -> Stack a -> Stack a
forall a. (a -> Bool) -> (a -> a) -> a -> a
until ((a
w a -> a -> Bool
forall a. Eq a => a -> a -> Bool
==) (a -> Bool) -> (Stack a -> a) -> Stack a -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Stack a -> a
forall a. Stack a -> a
W.focus) Stack a -> Stack a
forall a. Stack a -> Stack a
W.focusDown' Stack a
st

-- update only when Just
windowsMaybe :: (WindowSet -> Maybe WindowSet) -> X ()
windowsMaybe :: (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
 -> Maybe
      (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail))
-> X ()
windowsMaybe StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
-> Maybe
     (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail)
f = do
    XState
xst <- X XState
forall s (m :: * -> *). MonadState s m => m s
get
    StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
ws <- (XState
 -> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail)
-> X (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail)
forall s (m :: * -> *) a. MonadState s m => (s -> a) -> m a
gets XState
-> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
windowset
    let up :: StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
-> m ()
up StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
fws = XState -> m ()
forall s (m :: * -> *). MonadState s m => s -> m ()
put XState
xst { windowset :: StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
windowset = StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
fws }
    X ()
-> (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
    -> X ())
-> Maybe
     (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail)
-> X ()
forall b a. b -> (a -> b) -> Maybe a -> b
maybe (() -> X ()
forall (m :: * -> *) a. Monad m => a -> m a
return ()) StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
-> X ()
forall (m :: * -> *).
MonadState XState m =>
StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
-> m ()
up (Maybe
   (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail)
 -> X ())
-> Maybe
     (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail)
-> X ()
forall a b. (a -> b) -> a -> b
$ StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
-> Maybe
     (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail)
f StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
ws

unfocused :: W.Stack a -> [a]
unfocused :: Stack a -> [a]
unfocused Stack a
x = Stack a -> [a]
forall a. Stack a -> [a]
W.up Stack a
x [a] -> [a] -> [a]
forall a. [a] -> [a] -> [a]
++ Stack a -> [a]
forall a. Stack a -> [a]
W.down Stack a
x

toGroups :: (Ord a) => [(a1, W.Stack a)] -> Map a (W.Stack a)
toGroups :: [(a1, Stack a)] -> Map a (Stack a)
toGroups [(a1, Stack a)]
ws = [(a, Stack a)] -> Map a (Stack a)
forall k a. Ord k => [(k, a)] -> Map k a
M.fromList ([(a, Stack a)] -> Map a (Stack a))
-> ([Stack a] -> [(a, Stack a)]) -> [Stack a] -> Map a (Stack a)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Stack a -> (a, Stack a)) -> [Stack a] -> [(a, Stack a)]
forall a b. (a -> b) -> [a] -> [b]
map (Stack a -> a
forall a. Stack a -> a
W.focus (Stack a -> a) -> (Stack a -> Stack a) -> Stack a -> (a, Stack a)
forall (a :: * -> * -> *) b c c'.
Arrow a =>
a b c -> a b c' -> a b (c, c')
&&& Stack a -> Stack a
forall a. a -> a
id) ([Stack a] -> [(a, Stack a)])
-> ([Stack a] -> [Stack a]) -> [Stack a] -> [(a, Stack a)]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Stack a -> Stack a -> Bool) -> [Stack a] -> [Stack a]
forall a. (a -> a -> Bool) -> [a] -> [a]
nubBy ((a -> a -> Bool) -> (Stack a -> a) -> Stack a -> Stack a -> Bool
forall b c a. (b -> b -> c) -> (a -> b) -> a -> a -> c
on a -> a -> Bool
forall a. Eq a => a -> a -> Bool
(==) Stack a -> a
forall a. Stack a -> a
W.focus)
                    ([Stack a] -> Map a (Stack a)) -> [Stack a] -> Map a (Stack a)
forall a b. (a -> b) -> a -> b
$ ((a1, Stack a) -> Stack a) -> [(a1, Stack a)] -> [Stack a]
forall a b. (a -> b) -> [a] -> [b]
map (a1, Stack a) -> Stack a
forall a b. (a, b) -> b
snd [(a1, Stack a)]
ws

-- | restore the default layout for each group. It needs the X monad to switch
-- the default layout to a specific one (handleMessage NextLayout)
fromGroups :: (LayoutClass layout a, Ord k) =>
              ([Int], layout a)
              -> Maybe (W.Stack k)
              -> Groups k
              -> [(layout a, b)]
              -> X [(Bool,(layout a, W.Stack k))]
fromGroups :: ([Int], layout a)
-> Maybe (Stack k)
-> Groups k
-> [(layout a, b)]
-> X [(Bool, (layout a, Stack k))]
fromGroups ([Int]
skips,layout a
defl) Maybe (Stack k)
st Groups k
gs [(layout a, b)]
sls = do
    [layout a]
defls <- (Int -> X (layout a)) -> [Int] -> X [layout a]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
mapM ((layout a -> X (layout a)) -> layout a -> [X (layout a)]
forall (m :: * -> *) a. Monad m => (a -> m a) -> a -> [m a]
iterateM layout a -> X (layout a)
forall (layout :: * -> *) a.
LayoutClass layout a =>
layout a -> X (layout a)
nextL layout a
defl [X (layout a)] -> Int -> X (layout a)
forall a. [a] -> Int -> a
!!) [Int]
skips
    [(Bool, (layout a, Stack k))] -> X [(Bool, (layout a, Stack k))]
forall (m :: * -> *) a. Monad m => a -> m a
return ([(Bool, (layout a, Stack k))] -> X [(Bool, (layout a, Stack k))])
-> [(Bool, (layout a, Stack k))] -> X [(Bool, (layout a, Stack k))]
forall a b. (a -> b) -> a -> b
$ layout a
-> [layout a]
-> Maybe (Stack k)
-> Groups k
-> [layout a]
-> [(Bool, (layout a, Stack k))]
forall k a.
Ord k =>
a
-> [a]
-> Maybe (Stack k)
-> Groups k
-> [a]
-> [(Bool, (a, Stack k))]
fromGroups' layout a
defl [layout a]
defls Maybe (Stack k)
st Groups k
gs (((layout a, b) -> layout a) -> [(layout a, b)] -> [layout a]
forall a b. (a -> b) -> [a] -> [b]
map (layout a, b) -> layout a
forall a b. (a, b) -> a
fst [(layout a, b)]
sls)
        where nextL :: layout a -> X (layout a)
nextL layout a
l = layout a -> Maybe (layout a) -> layout a
forall a. a -> Maybe a -> a
fromMaybe layout a
l (Maybe (layout a) -> layout a)
-> X (Maybe (layout a)) -> X (layout a)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> layout a -> SomeMessage -> X (Maybe (layout a))
forall (layout :: * -> *) a.
LayoutClass layout a =>
layout a -> SomeMessage -> X (Maybe (layout a))
handleMessage layout a
l (ChangeLayout -> SomeMessage
forall a. Message a => a -> SomeMessage
SomeMessage ChangeLayout
NextLayout)
              iterateM :: (a -> m a) -> a -> [m a]
iterateM a -> m a
f = (m a -> m a) -> m a -> [m a]
forall a. (a -> a) -> a -> [a]
iterate (m a -> (a -> m a) -> m a
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= a -> m a
f) (m a -> [m a]) -> (a -> m a) -> a -> [m a]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. a -> m a
forall (m :: * -> *) a. Monad m => a -> m a
return

fromGroups' :: (Ord k) => a -> [a] -> Maybe (W.Stack k) -> Groups k -> [a]
                    -> [(Bool,(a, W.Stack k))]
fromGroups' :: a
-> [a]
-> Maybe (Stack k)
-> Groups k
-> [a]
-> [(Bool, (a, Stack k))]
fromGroups' a
defl [a]
defls Maybe (Stack k)
st Groups k
gs [a]
sls =
    [ (Bool
isNew,(a, Stack k) -> (Maybe a, Maybe (Stack k)) -> (a, Stack k)
forall a b. (a, b) -> (Maybe a, Maybe b) -> (a, b)
fromMaybe2 (a
dl, k -> Stack k
forall a. a -> Stack a
single k
w) (Maybe a
l, k -> Groups k -> Maybe (Stack k)
forall k a. Ord k => k -> Map k a -> Maybe a
M.lookup k
w Groups k
gs))
        | Maybe a
l <- (a -> Maybe a) -> [a] -> [Maybe a]
forall a b. (a -> b) -> [a] -> [b]
map a -> Maybe a
forall a. a -> Maybe a
Just [a]
sls [Maybe a] -> [Maybe a] -> [Maybe a]
forall a. [a] -> [a] -> [a]
++ Maybe a -> [Maybe a]
forall a. a -> [a]
repeat Maybe a
forall a. Maybe a
Nothing, let isNew :: Bool
isNew = Maybe a -> Bool
forall a. Maybe a -> Bool
isNothing Maybe a
l
        | a
dl <- [a]
defls [a] -> [a] -> [a]
forall a. [a] -> [a] -> [a]
++ a -> [a]
forall a. a -> [a]
repeat a
defl
        | k
w <- Maybe (Stack k) -> [k]
forall a. Maybe (Stack a) -> [a]
W.integrate' (Maybe (Stack k) -> [k]) -> Maybe (Stack k) -> [k]
forall a b. (a -> b) -> a -> b
$ (k -> Bool) -> Stack k -> Maybe (Stack k)
forall a. (a -> Bool) -> Stack a -> Maybe (Stack a)
W.filter (k -> [k] -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`notElem` [k]
unfocs) (Stack k -> Maybe (Stack k)) -> Maybe (Stack k) -> Maybe (Stack k)
forall (m :: * -> *) a b. Monad m => (a -> m b) -> m a -> m b
=<< Maybe (Stack k)
st ]
    where unfocs :: [k]
unfocs = Stack k -> [k]
forall a. Stack a -> [a]
unfocused (Stack k -> [k]) -> [Stack k] -> [k]
forall (m :: * -> *) a b. Monad m => (a -> m b) -> m a -> m b
=<< Groups k -> [Stack k]
forall k a. Map k a -> [a]
M.elems Groups k
gs
          single :: a -> Stack a
single a
w = a -> [a] -> [a] -> Stack a
forall a. a -> [a] -> [a] -> Stack a
W.Stack a
w [] []
          fromMaybe2 :: (a, b) -> (Maybe a, Maybe b) -> (a, b)
fromMaybe2 (a
a,b
b) (Maybe a
x,Maybe b
y) = (a -> Maybe a -> a
forall a. a -> Maybe a -> a
fromMaybe a
a Maybe a
x, b -> Maybe b -> b
forall a. a -> Maybe a -> a
fromMaybe b
b Maybe b
y)


-- this would be much cleaner with some kind of data-accessor
setStack :: Maybe (W.Stack Window) -> X ()
setStack :: Maybe (Stack KeySym) -> X ()
setStack Maybe (Stack KeySym)
x = (XState -> XState) -> X ()
forall s (m :: * -> *). MonadState s m => (s -> s) -> m ()
modify (\XState
s -> XState
s { windowset :: StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
windowset = (XState
-> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
windowset XState
s)
                { current :: Screen String (Layout KeySym) KeySym ScreenId ScreenDetail
W.current = (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
-> Screen String (Layout KeySym) KeySym ScreenId ScreenDetail
forall i l a sid sd. StackSet i l a sid sd -> Screen i l a sid sd
W.current (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
 -> Screen String (Layout KeySym) KeySym ScreenId ScreenDetail)
-> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
-> Screen String (Layout KeySym) KeySym ScreenId ScreenDetail
forall a b. (a -> b) -> a -> b
$ XState
-> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
windowset XState
s)
                { workspace :: Workspace String (Layout KeySym) KeySym
W.workspace = (Screen String (Layout KeySym) KeySym ScreenId ScreenDetail
-> Workspace String (Layout KeySym) KeySym
forall i l a sid sd. Screen i l a sid sd -> Workspace i l a
W.workspace (Screen String (Layout KeySym) KeySym ScreenId ScreenDetail
 -> Workspace String (Layout KeySym) KeySym)
-> Screen String (Layout KeySym) KeySym ScreenId ScreenDetail
-> Workspace String (Layout KeySym) KeySym
forall a b. (a -> b) -> a -> b
$ StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
-> Screen String (Layout KeySym) KeySym ScreenId ScreenDetail
forall i l a sid sd. StackSet i l a sid sd -> Screen i l a sid sd
W.current (StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
 -> Screen String (Layout KeySym) KeySym ScreenId ScreenDetail)
-> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
-> Screen String (Layout KeySym) KeySym ScreenId ScreenDetail
forall a b. (a -> b) -> a -> b
$ XState
-> StackSet String (Layout KeySym) KeySym ScreenId ScreenDetail
windowset XState
s) { stack :: Maybe (Stack KeySym)
W.stack = Maybe (Stack KeySym)
x }}}})